{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KTB5GYW65QNQUMNUPJLREA3FSO","short_pith_number":"pith:KTB5GYW6","schema_version":"1.0","canonical_sha256":"54c3d362deec1b0a31b47a5712036593aa30c33840994e98e079841f7486895b","source":{"kind":"arxiv","id":"2606.04016","version":1},"attestation_state":"computed","paper":{"title":"Witness-split + window-cardinality refinement for $r_3(N)$: Architecture, empirical results, and a structural hard pocket","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mehmet Ergezer","submitted_at":"2026-05-31T17:48:17Z","abstract_excerpt":"We describe a reproducible computational framework for upper-bound searches on r_3(N), the maximum size of a 3-term-arithmetic-progression-free subset of [1,N]. The framework combines a verified lower-bound witness, endpoint forcing, depth-d witness-variable splitting, OEIS A003002 window-cardinality pruning, and recursive refinement of timed-out subproblems. Applied to the frontier case N = 212, K = 44, it found no feasible 44-set across millions of CP-SAT subproblems, supporting but not proving the conjectural value r_3(212) = 43. A 300-second recap leaves 45 resistant chunks; one-hour HiGHS"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.04016","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-31T17:48:17Z","cross_cats_sorted":[],"title_canon_sha256":"c88b9d56d031e824eeed5d8d35af034d89aff8d8f75a072cf0cbf7b9c8c33312","abstract_canon_sha256":"e1f2bf57cf7b1a26ef5b2eaa9bd10222fe6ce5db1290477790f32d95de3dfecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T00:06:44.567107Z","signature_b64":"OxkaEHNMVYKluEuTLZLUxcBOlPXcrlnMCYEvDBGPPK2kX8nOlpO+jOHlPNvENi8LfoJi+VEIWYor1UMcMZDZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54c3d362deec1b0a31b47a5712036593aa30c33840994e98e079841f7486895b","last_reissued_at":"2026-06-04T00:06:44.566700Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T00:06:44.566700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Witness-split + window-cardinality refinement for $r_3(N)$: Architecture, empirical results, and a structural hard pocket","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mehmet Ergezer","submitted_at":"2026-05-31T17:48:17Z","abstract_excerpt":"We describe a reproducible computational framework for upper-bound searches on r_3(N), the maximum size of a 3-term-arithmetic-progression-free subset of [1,N]. The framework combines a verified lower-bound witness, endpoint forcing, depth-d witness-variable splitting, OEIS A003002 window-cardinality pruning, and recursive refinement of timed-out subproblems. Applied to the frontier case N = 212, K = 44, it found no feasible 44-set across millions of CP-SAT subproblems, supporting but not proving the conjectural value r_3(212) = 43. A 300-second recap leaves 45 resistant chunks; one-hour HiGHS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04016","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.04016/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.04016","created_at":"2026-06-04T00:06:44.566755+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04016v1","created_at":"2026-06-04T00:06:44.566755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04016","created_at":"2026-06-04T00:06:44.566755+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTB5GYW65QNQ","created_at":"2026-06-04T00:06:44.566755+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTB5GYW65QNQUMNU","created_at":"2026-06-04T00:06:44.566755+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTB5GYW6","created_at":"2026-06-04T00:06:44.566755+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KTB5GYW65QNQUMNUPJLREA3FSO","json":"https://pith.science/pith/KTB5GYW65QNQUMNUPJLREA3FSO.json","graph_json":"https://pith.science/api/pith-number/KTB5GYW65QNQUMNUPJLREA3FSO/graph.json","events_json":"https://pith.science/api/pith-number/KTB5GYW65QNQUMNUPJLREA3FSO/events.json","paper":"https://pith.science/paper/KTB5GYW6"},"agent_actions":{"view_html":"https://pith.science/pith/KTB5GYW65QNQUMNUPJLREA3FSO","download_json":"https://pith.science/pith/KTB5GYW65QNQUMNUPJLREA3FSO.json","view_paper":"https://pith.science/paper/KTB5GYW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04016&json=true","fetch_graph":"https://pith.science/api/pith-number/KTB5GYW65QNQUMNUPJLREA3FSO/graph.json","fetch_events":"https://pith.science/api/pith-number/KTB5GYW65QNQUMNUPJLREA3FSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTB5GYW65QNQUMNUPJLREA3FSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTB5GYW65QNQUMNUPJLREA3FSO/action/storage_attestation","attest_author":"https://pith.science/pith/KTB5GYW65QNQUMNUPJLREA3FSO/action/author_attestation","sign_citation":"https://pith.science/pith/KTB5GYW65QNQUMNUPJLREA3FSO/action/citation_signature","submit_replication":"https://pith.science/pith/KTB5GYW65QNQUMNUPJLREA3FSO/action/replication_record"}},"created_at":"2026-06-04T00:06:44.566755+00:00","updated_at":"2026-06-04T00:06:44.566755+00:00"}