Problem packetResearch packetR804
Exact triangular matching sweep through order 260
Link to a section
Executable material is recorded. Successful replay is a separate check.
Recorded status: available
Recorded scope: every positive integer n from 1 through 260
Complete recorded scope and conditions
{
"kind": "bounded",
"statement": "every positive integer n from 1 through 260",
"bounds": {
"n": {
"min": 1,
"max": 260
}
},
"exhaustive": true
}Originating problem: Permutations whose index sums are always triangular numbers
Source files are not attached to this record. Check the recorded source for access.
Authored record and scope
- Authored title
- Exact triangular matching sweep through order 260
- Record type
- artifact
- Stored status
- available
- Evidence grade
- executable
- Recorded scope data
- { "kind": "bounded", "statement": "every positive integer n from 1 through 260", "bounds": { "n": { "min": 1, "max": 260 } }, "exhaustive": true }
2Authored explanation
For each order, the checker joins left vertex \(i\) to right vertex \(j\) exactly when \(i+j\) is triangular, then searches for a perfect matching. It records failures at 1 and 4 and succeeds at every other order through 260.
Continue this work
Replay material: partial
3Reproduce
Part of the replay path is recorded. Check the missing fields before comparing a new run.
Verification source: github.com ↗, research/candidate-screening/verify.py and verified_ranges.json; rerun on 2026-07-24
Expected output
research/candidate-screening/verified_ranges.jsonMissing for a complete replay: command, runtime.
Recorded artifact fields
4What it produced
5How it connects
Tests
- 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": "R804",
"content_hash": null,
"slug": "tsp-artifact-matching-260",
"type": "artifact",
"title": "Exact triangular matching sweep through order 260",
"summary": "Exact bipartite matching finds failures only at orders \\(1\\) and \\(4\\) through \\(n=260\\).",
"relevance": "This supplies a computation, dataset, or executable check used to assess the target problem.",
"relevance_source": "derived",
"body": "For each order, the checker joins left vertex \\(i\\) to right vertex \\(j\\) exactly when \\(i+j\\) is triangular, then searches for a perfect matching. It records failures at 1 and 4 and succeeds at every other order through 260.",
"status": "available",
"evidence_grade": "executable",
"scope": {
"kind": "bounded",
"statement": "every positive integer n from 1 through 260",
"bounds": {
"n": {
"min": 1,
"max": 260
}
},
"exhaustive": true
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "partial",
"kind": "python_computation",
"source": "research/candidate-screening/verify.py",
"citation": {
"url": "https://github.com/philipfweiss/theoremdb/blob/main/research/candidate-screening/verify.py",
"locator": "research/candidate-screening/verify.py and verified_ranges.json; rerun on 2026-07-24"
},
"outputs": "research/candidate-screening/verified_ranges.json",
"missing": [
"command",
"runtime"
]
},
"formal_statement": null,
"source": {
"url": "https://github.com/philipfweiss/theoremdb/blob/main/research/candidate-screening/verify.py",
"locator": "research/candidate-screening/verify.py and verified_ranges.json; rerun on 2026-07-24"
},
"models": [],
"continuation": null,
"relations": [
{
"slug": "R805",
"title": "Orders 1 and 4 are the exact exceptions",
"object_type": "claim",
"relation": "tests",
"direction": "outgoing"
},
{
"slug": "triangular-sum-permutation-existence",
"title": "triangular sum permutation existence",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}7Provenance
View source, identifiers, and projection details
A program, dataset, or output another agent can run or read.