Problem packetResearch packetR1488
Dated source and duplicate audit
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: No scope is recorded.
Originating problem: Is L equal to NL?
Recorded relationships: Current status and exact unresolved remainder
Authored record and scope
- Authored title
- Dated source and duplicate audit
- Record type
- attempt
- Stored status
- completed
- Evidence grade
- sourced
- Linked research record IDs
- R1491
Work and source credit
- Recorded action
No action description supplied.
- Authored result summary
Read complete authored result summary
The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: NL=coNL, undirected reachability is in L, and directed reachability has sublinear-space algorithms with larger time or other tradeoffs. Unresolved remainder: Deterministic logarithmic space for directed reachability remains unknown.
- Reported outcome
No separate outcome supplied.
- Recorded status
completed
- Recorded evidence grade
sourced
- Recorded scope
No explicit scope supplied.
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-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.
Queries included: - L versus NL open problem current - directed reachability deterministic logspace open
The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: NL=coNL, undirected reachability is in L, and directed reachability has sublinear-space algorithms with larger time or other tradeoffs. Unresolved remainder: Deterministic logarithmic space for directed reachability remains unknown.
Continue this work
Replay material: source only
3Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, N. Immerman, Nondeterministic space is closed under complementation, SIAM Journal on Computing 17 (1988). NL=coNL theorem
4How it connects
Evidence for
- 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": "R1488",
"content_hash": null,
"slug": "deterministic-logspace-versus-nondeterministic-logspace-attempt-dated-source-audit",
"type": "attempt",
"title": "Dated source and duplicate audit",
"summary": "The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: NL=coNL, undirected reachability is in L, and directed reachability has sublinear-space algorithms with larger time or other tradeoffs. Unresolved remainder: Deterministic logarithmic space for directed reachability remains unknown.",
"relevance": "Documents why Is L equal to NL? was treated as a distinct open target on 2026-08-01.",
"relevance_source": "recorded",
"body": "The audit ran on 2026-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.\n\nQueries included:\n- L versus NL open problem current\n- directed reachability deterministic logspace open\n\nThe exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: NL=coNL, undirected reachability is in L, and directed reachability has sublinear-space algorithms with larger time or other tradeoffs. Unresolved remainder: Deterministic logarithmic space for directed reachability remains unknown.",
"status": "completed",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://doi.org/10.1137/0217058",
"locator": "N. Immerman, Nondeterministic space is closed under complementation, SIAM Journal on Computing 17 (1988). NL=coNL theorem"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1137/0217058",
"locator": "N. Immerman, Nondeterministic space is closed under complementation, SIAM Journal on Computing 17 (1988). NL=coNL theorem"
},
"models": [],
"continuation": null,
"relations": [
{
"slug": "R1491",
"title": "Current status and exact unresolved remainder",
"object_type": "claim",
"relation": "evidences",
"direction": "outgoing"
},
{
"slug": "deterministic-logspace-versus-nondeterministic-logspace",
"title": "deterministic logspace versus nondeterministic logspace",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
A route someone took, recorded so the next person can reuse it or avoid it.