{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FTAFGPOAFGVYM3XQSI2JFFKFK3","short_pith_number":"pith:FTAFGPOA","schema_version":"1.0","canonical_sha256":"2cc0533dc029ab866ef0923492954556ff12b3e4648488b42bf299f3f66bb2d9","source":{"kind":"arxiv","id":"2605.04551","version":2},"attestation_state":"computed","paper":{"title":"A Ceiling Continued Fraction Approach to the Erd\\H{o}s-Straus Conjecture: Heuristic finiteness of counterexamples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A ceiling continued fraction approach provides heuristic evidence that the Erdős-Straus conjecture has only finitely many counterexamples.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andres Ventas","submitted_at":"2026-05-06T06:56:14Z","abstract_excerpt":"We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erd\\H{o}s-Straus conjecture. The approach exploits divisor structures of shifted integers p+i rather than congruence-based techniques. We derive a super-polynomial upper bound on the failure probability; its convergence, together with the Borel-Cantelli lemma, provides heuristic evidence that counterexamples, if any exist, form a finite set. Computational tests on 10^9 primes in ranges around 10^17, 10^52, and 10^131, show no counterexamples with very small search d"},"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":"2605.04551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-05-06T06:56:14Z","cross_cats_sorted":[],"title_canon_sha256":"0ede7462f44f08c80062d56db5c40afdc2a6b23eca67c3b513797e31202601ca","abstract_canon_sha256":"613b401d1c043d339ecc91baf93841c2e59d74edf2c3c2c653e4157701d829ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:04:58.698137Z","signature_b64":"uUpngwxAkd48gEtd8WGfIR0p5Xhq4e0/UAhNJ4ScrFrRfjgqya3T1944OsJC6DtvZ/nShoJHqPS8PReBnsq6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc0533dc029ab866ef0923492954556ff12b3e4648488b42bf299f3f66bb2d9","last_reissued_at":"2026-05-27T01:04:58.697326Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:04:58.697326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Ceiling Continued Fraction Approach to the Erd\\H{o}s-Straus Conjecture: Heuristic finiteness of counterexamples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A ceiling continued fraction approach provides heuristic evidence that the Erdős-Straus conjecture has only finitely many counterexamples.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andres Ventas","submitted_at":"2026-05-06T06:56:14Z","abstract_excerpt":"We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erd\\H{o}s-Straus conjecture. The approach exploits divisor structures of shifted integers p+i rather than congruence-based techniques. We derive a super-polynomial upper bound on the failure probability; its convergence, together with the Borel-Cantelli lemma, provides heuristic evidence that counterexamples, if any exist, form a finite set. Computational tests on 10^9 primes in ranges around 10^17, 10^52, and 10^131, show no counterexamples with very small search d"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We derive a super-polynomial upper bound on the failure probability; its convergence, together with the Borel-Cantelli lemma, provides heuristic evidence that counterexamples, if any exist, form a finite set.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the super-polynomial upper bound on failure probability derived from the FCT framework is tight enough and that the failure events across primes satisfy the conditions needed for the Borel-Cantelli lemma to conclude finiteness.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A new ceiling continued fraction method finds no counterexamples in searches over 10^9 primes near 10^17 and 10^52 plus 10^7 near 10^131, and derives a super-polynomial failure probability bound whose convergence with the Borel-Cantelli lemma heuristically implies only finitely many counterexamples,","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A ceiling continued fraction approach provides heuristic evidence that the Erdős-Straus conjecture has only finitely many counterexamples.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7ff0940faec8ceb13ee2ffdcf0a6d1edee8c977a8cf6e624a806ac1b3534fdce"},"source":{"id":"2605.04551","kind":"arxiv","version":2},"verdict":{"id":"310e7fc7-91f3-4d0a-b923-cb1f8a0f9717","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T15:56:37.095426Z","strongest_claim":"We derive a super-polynomial upper bound on the failure probability; its convergence, together with the Borel-Cantelli lemma, provides heuristic evidence that counterexamples, if any exist, form a finite set.","one_line_summary":"A new ceiling continued fraction method finds no counterexamples in searches over 10^9 primes near 10^17 and 10^52 plus 10^7 near 10^131, and derives a super-polynomial failure probability bound whose convergence with the Borel-Cantelli lemma heuristically implies only finitely many counterexamples,","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the super-polynomial upper bound on failure probability derived from the FCT framework is tight enough and that the failure events across primes satisfy the conditions needed for the Borel-Cantelli lemma to conclude finiteness.","pith_extraction_headline":"A ceiling continued fraction approach provides heuristic evidence that the Erdős-Straus conjecture has only finitely many counterexamples."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.04551/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T11:40:16.025766Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:20.135323Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:20:24.898780Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8f673fe68a97fcb5314e0c7f4e710ba85f6d2a3b784f692b9980b69a501da77c"},"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":"2605.04551","created_at":"2026-05-27T01:04:58.697434+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.04551v2","created_at":"2026-05-27T01:04:58.697434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04551","created_at":"2026-05-27T01:04:58.697434+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTAFGPOAFGVY","created_at":"2026-05-27T01:04:58.697434+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTAFGPOAFGVYM3XQ","created_at":"2026-05-27T01:04:58.697434+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTAFGPOA","created_at":"2026-05-27T01:04:58.697434+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/FTAFGPOAFGVYM3XQSI2JFFKFK3","json":"https://pith.science/pith/FTAFGPOAFGVYM3XQSI2JFFKFK3.json","graph_json":"https://pith.science/api/pith-number/FTAFGPOAFGVYM3XQSI2JFFKFK3/graph.json","events_json":"https://pith.science/api/pith-number/FTAFGPOAFGVYM3XQSI2JFFKFK3/events.json","paper":"https://pith.science/paper/FTAFGPOA"},"agent_actions":{"view_html":"https://pith.science/pith/FTAFGPOAFGVYM3XQSI2JFFKFK3","download_json":"https://pith.science/pith/FTAFGPOAFGVYM3XQSI2JFFKFK3.json","view_paper":"https://pith.science/paper/FTAFGPOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.04551&json=true","fetch_graph":"https://pith.science/api/pith-number/FTAFGPOAFGVYM3XQSI2JFFKFK3/graph.json","fetch_events":"https://pith.science/api/pith-number/FTAFGPOAFGVYM3XQSI2JFFKFK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTAFGPOAFGVYM3XQSI2JFFKFK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTAFGPOAFGVYM3XQSI2JFFKFK3/action/storage_attestation","attest_author":"https://pith.science/pith/FTAFGPOAFGVYM3XQSI2JFFKFK3/action/author_attestation","sign_citation":"https://pith.science/pith/FTAFGPOAFGVYM3XQSI2JFFKFK3/action/citation_signature","submit_replication":"https://pith.science/pith/FTAFGPOAFGVYM3XQSI2JFFKFK3/action/replication_record"}},"created_at":"2026-05-27T01:04:58.697434+00:00","updated_at":"2026-05-27T01:04:58.697434+00:00"}