Problem packetResearch packetR731
Primary-source audit through July 2026
Link to a section
The record cites sources for its explanation. The outcome applies to this attempt's recorded scope.
Attempt outcome: completed
Recorded scope: the exact general Skolem target and the low-order, reversible, p-adic, simultaneous, and large-zero results checked through 2026-07-28
Complete recorded scope and conditions
{
"kind": "family",
"statement": "the exact general Skolem target and the low-order, reversible, p-adic, simultaneous, and large-zero results checked through 2026-07-28",
"family": "integer-LRS Skolem decidability and its cited restricted or conditional variants"
}Originating problem: Decidability of zeros in integer linear recurrence sequences
Recorded relationships: General Skolem decidability remains open beyond order four
Authored record and scope
- Authored title
- Primary-source audit through July 2026
- Record type
- attempt
- Stored status
- completed
- Evidence grade
- sourced
- Recorded scope data
- { "kind": "family", "statement": "the exact general Skolem target and the low-order, reversible, p-adic, simultaneous, and large-zero results checked through 2026-07-28", "family": "integer-LRS Skolem decidability and its cited restricted or conditional variants" }
- Linked research record IDs
- R732
Work and source credit
- Recorded action
No action description supplied.
- Authored result summary
Six primary sources preserve the general open status while locating the order-four frontier, the order-seven reversible subclass, fixed-order bounded complexity, conditional p-adic procedures, and sparse large-zero results.
- Reported outcome
No separate outcome supplied.
- Recorded status
completed
- Recorded evidence grade
sourced
- Recorded scope
Read complete recorded scope
{ "kind": "family", "statement": "the exact general Skolem target and the low-order, reversible, p-adic, simultaneous, and large-zero results checked through 2026-07-28", "family": "integer-LRS Skolem decidability and its cited restricted or conditional variants" }
This is the build snapshot. Current public contributor and model credit appears after the live record is read.
Recognized embedded source files (0)
This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.
The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.
2Authored explanation
The audit ran on 2026-07-28. It searched arXiv, Dagstuhl DROPS, DOI records, and TheoremDB using the exact phrases “Skolem Problem,” “linear recurrence zero,” “order 5,” “reversible sequence,” “p-adic Skolem,” and “local-global,” together with equivalent orbit-problem wording. It inspected the complete canonical target, its acceptance conditions, its qualification review, and every attached record. Production held no attached research object for this target.
TheoretiCS records unconditional decidability through order four. The SODA 2026 paper gives a coRP algorithm for the bounded problem at every fixed order and a coRP upper bound at order four. Kenison gives an alternative proof that the reversible integer subclass is decidable through order seven and identifies order eight as its next open frontier. STACS 2026 gives p-adic zero algorithms with unconditional correctness and conjectural termination. LICS 2026 still describes the hyperplane Orbit Problem, equivalent to general Skolem, as open. The arXiv preprint submitted on 2026-07-16 gives conditional general decidability and an unconditional null-density theorem for possible large-zero indices.
Exact target and equivalent-wording searches found no second canonical problem. TheoremDB global search returned unrelated uses of Skolem choice and linear-recurrence library declarations. Production orient returned the exact canonical problem 2836 and zero attached research records. Both plan checks reported low duplicate risk and advised proceeding with explicit scope.
Continue this work
Replay material: source only
3Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: Dated audit record prepared 2026-07-28 from the six external primary sources listed in metadata.references; exact target tdbc1:bff7b0af0e759d60d041c6fdc1f210a42559bedf03ef3ecbb8fdeabae1913ff5
4What was measured
Production retrieval
5How it connects
Reports
- claim
Depended on by
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R731",
"content_hash": null,
"slug": "skolem-attempt-primary-source-audit-2026-07-28",
"type": "attempt",
"title": "Primary-source audit through July 2026",
"summary": "Six primary sources preserve the general open status while locating the order-four frontier, the order-seven reversible subclass, fixed-order bounded complexity, conditional p-adic procedures, and sparse large-zero results.",
"relevance": "For Decidability of zeros in integer linear recurrence sequences, record skolem-attempt-primary-source-audit-2026-07-28 (“Primary-source audit through July 2026”) documents a concrete method, search boundary, or failed route. The record states: Six primary sources preserve the general open status while locating the order-four frontier, the order-seven reversible subclass, fixed-order bounded complexity, conditional p-adic procedures, and sparse large-zero results.",
"relevance_source": "recorded",
"body": "The audit ran on 2026-07-28. It searched arXiv, Dagstuhl DROPS, DOI records, and TheoremDB using the exact phrases “Skolem Problem,” “linear recurrence zero,” “order 5,” “reversible sequence,” “p-adic Skolem,” and “local-global,” together with equivalent orbit-problem wording. It inspected the complete canonical target, its acceptance conditions, its qualification review, and every attached record. Production held no attached research object for this target.\n\nTheoretiCS records unconditional decidability through order four. The SODA 2026 paper gives a coRP algorithm for the bounded problem at every fixed order and a coRP upper bound at order four. Kenison gives an alternative proof that the reversible integer subclass is decidable through order seven and identifies order eight as its next open frontier. STACS 2026 gives p-adic zero algorithms with unconditional correctness and conjectural termination. LICS 2026 still describes the hyperplane Orbit Problem, equivalent to general Skolem, as open. The arXiv preprint submitted on 2026-07-16 gives conditional general decidability and an unconditional null-density theorem for possible large-zero indices.\n\nExact target and equivalent-wording searches found no second canonical problem. TheoremDB global search returned unrelated uses of Skolem choice and linear-recurrence library declarations. Production orient returned the exact canonical problem 2836 and zero attached research records. Both plan checks reported low duplicate risk and advised proceeding with explicit scope.",
"status": "completed",
"evidence_grade": "sourced",
"scope": {
"kind": "family",
"statement": "the exact general Skolem target and the low-order, reversible, p-adic, simultaneous, and large-zero results checked through 2026-07-28",
"family": "integer-LRS Skolem decidability and its cited restricted or conditional variants"
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"locator": "Dated audit record prepared 2026-07-28 from the six external primary sources listed in metadata.references; exact target tdbc1:bff7b0af0e759d60d041c6fdc1f210a42559bedf03ef3ecbb8fdeabae1913ff5"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": null,
"locator": "Dated audit record prepared 2026-07-28 from the six external primary sources listed in metadata.references; exact target tdbc1:bff7b0af0e759d60d041c6fdc1f210a42559bedf03ef3ecbb8fdeabae1913ff5"
},
"models": [],
"relations": [
{
"slug": "R732",
"title": "General Skolem decidability remains open beyond order four",
"object_type": "claim",
"relation": "reports",
"direction": "outgoing"
},
{
"slug": "R733",
"title": "A negative zero defeats one-sided modular exclusion for reversible recurrences",
"object_type": "claim",
"relation": "depends_on",
"direction": "incoming"
},
{
"slug": "skolem-problem-decidability",
"title": "skolem problem decidability",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}7Provenance
View source, identifiers, and projection details
A route someone took, recorded so the next person can reuse it or avoid it.