Problem packetResearch packetR1705
Work at the unresolved boundary
Link to a section
The author reports this result. The outcome applies to this attempt's recorded scope.
Attempt outcome: open strategy
Recorded scope: No scope is recorded.
Originating problem: Polynomial-time recovery of planted cliques below the square-root scale
Authored record and scope
- Authored title
- Work at the unresolved boundary
- Record type
- attempt
- Stored status
- open_strategy
- Evidence grade
- self_reported
Work and source credit
- Recorded action
No action description supplied.
- Authored result summary
No unrestricted polynomial-time algorithm or unconditional average-case lower bound is known for k=n^{1/2−δ}.
- Reported outcome
No separate outcome supplied.
- Recorded status
open_strategy
- Recorded evidence grade
self_reported
- 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
Research should address this boundary directly: No unrestricted polynomial-time algorithm or unconditional average-case lower bound is known for k=n^{1/2−δ}.
A claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations: - For some fixed δ>0, give and prove a polynomial-time exact-recovery algorithm. - Or prove polynomial-time recovery impossible under an explicit unconditional average-case model, which may require a new lower-bound framework.
Continue this work
Replay material: source only
3Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: arxiv.org ↗, TheoremDB editorial route recorded 2026-08-01
4How it connects
Addresses
- 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": "R1705",
"content_hash": null,
"slug": "planted-clique-below-square-root-attempt-open-remainder",
"type": "attempt",
"title": "Work at the unresolved boundary",
"summary": "No unrestricted polynomial-time algorithm or unconditional average-case lower bound is known for k=n^{1/2−δ}.",
"relevance": "Turns the remaining uncertainty in Polynomial-time recovery of planted cliques below the square-root scale into a checkable research target.",
"relevance_source": "recorded",
"body": "Research should address this boundary directly: No unrestricted polynomial-time algorithm or unconditional average-case lower bound is known for k=n^{1/2−δ}.\n\nA claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations:\n- For some fixed δ>0, give and prove a polynomial-time exact-recovery algorithm.\n- Or prove polynomial-time recovery impossible under an explicit unconditional average-case model, which may require a new lower-bound framework.",
"status": "open_strategy",
"evidence_grade": "self_reported",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://arxiv.org/abs/1503.06447",
"locator": "TheoremDB editorial route recorded 2026-08-01"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://arxiv.org/abs/1503.06447",
"locator": "TheoremDB editorial route recorded 2026-08-01"
},
"models": [],
"relations": [
{
"slug": "R1707",
"title": "Current status and exact unresolved remainder",
"object_type": "claim",
"relation": "addresses",
"direction": "outgoing"
},
{
"slug": "planted-clique-below-square-root",
"title": "planted clique below square root",
"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.