{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WLEEEU3I7KVNTRPI3G4IZ6J3AP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4883c91e48db23b8277841695657eefbdb645aa2cf574e0ba72b56fe764a67d1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T17:13:03Z","title_canon_sha256":"fc78590c1bf69d9cb367b1ae4a5482c7436cf0f0071d8059d4b72b872d08ac35"},"schema_version":"1.0","source":{"id":"2605.15094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15094","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15094v1","created_at":"2026-05-17T21:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"WLEEEU3I7KVN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WLEEEU3I7KVNTRPI","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WLEEEU3I","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e2f3d9b96db1bf74a67348712242096e722fe7690d5db6d670850154582f0209","target":"graph","created_at":"2026-05-17T21:57:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that termination of one-variable linear-constraint loops is decidable in polynomial time, provided a long-standing conjecture about generalized Collatz sequences holds."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The long-standing conjecture about generalized Collatz sequences holds."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Termination of one-variable linear-constraint loops over integers is decidable in polynomial time if the generalized Collatz conjecture holds, with any such procedure also settling specific instances of the conjecture."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Termination of one-variable linear-constraint loops is decidable in polynomial time if a conjecture on generalized Collatz sequences holds."}],"snapshot_sha256":"124e0d6ba7610f66155055f5986636a3b7d91ae2933746b03e3731edb717649c"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"324fd1351e4ad91c8c6cf1c778cf313efcefbaf485ddfdae474871bef7bcef21"},"paper":{"abstract_excerpt":"Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open for linear-constraint loops over integers, rationals, and reals. We focus on loops over integers and show that they are tightly connected to generalized Collatz sequences - integer sequences generated by maps that are linear on each residue class modulo a fixed natural number. We prove that termination of one-variable linear-constraint loops is decidable in ","authors_text":"Mishel Carelli","cross_cats":[],"headline":"Termination of one-variable linear-constraint loops is decidable in polynomial time if a conjecture on generalized Collatz sequences holds.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T17:13:03Z","title":"Loop Termination and Generalized Collatz Sequences"},"references":{"count":12,"internal_anchors":0,"resolved_work":12,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"1 Amir M. Ben-Amram. Mortality of Iterated Piecewise Affine Functions over the Integers: Decid- ability and Complexity. In Natacha Portier and Thomas Wilke, editors,30th International Sym- posium on T","work_id":"e7202e57-6ac0-478a-8a52-81e9870cab56","year":2013},{"cited_arxiv_id":"","doi":"10.4230/lipics.stacs.2013.514","is_internal_anchor":false,"ref_index":2,"title":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik. URL:https://drops.dagstuhl.de/entities/ document/10.4230/LIPIcs.STACS.2013.514,doi:10.4230/LIPIcs.STACS.2013.514. 2 Amir M. Ben-Amram, Samir Genaim, ","work_id":"96a5edcc-4487-4bf5-ae00-97d8a84888e7","year":2013},{"cited_arxiv_id":"","doi":"10.1145/2400676","is_internal_anchor":false,"ref_index":3,"title":"doi:10.1145/2400676. 2400679. 3 Amir M. Ben-Amram, Samir Genaim, Joël Ouaknine, and James Worrell. Termination analysis of linear-constraint programs,","work_id":"d9dde632-b7f9-4546-9847-3fc8192c3e5f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"4 Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars.Computational Geometry: Algorithms and Applications","work_id":"2bdb1388-6c89-494d-8f95-a66d1c2aa46d","year":null},{"cited_arxiv_id":"","doi":"10.1016/s0304-3975(00)00399-6","is_internal_anchor":false,"ref_index":5,"title":"Springer Berlin Heidelberg. 6 Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, and John N. Tsitsiklis. Deciding stability and mortality of piecewise affine dynamical syst","work_id":"a5ab2758-ef09-4898-824f-b63f51a059c8","year":2001}],"snapshot_sha256":"e32dae3c9916109469a9d69624fc464fff7c8c4e6fa088826d5d4214e4530bc8"},"source":{"id":"2605.15094","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:09:47.102227Z","id":"b8172661-6b63-4160-9ffa-43552cb7406c","model_set":{"reader":"grok-4.3"},"one_line_summary":"Termination of one-variable linear-constraint loops over integers is decidable in polynomial time if the generalized Collatz conjecture holds, with any such procedure also settling specific instances of the conjecture.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Termination of one-variable linear-constraint loops is decidable in polynomial time if a conjecture on generalized Collatz sequences holds.","strongest_claim":"We prove that termination of one-variable linear-constraint loops is decidable in polynomial time, provided a long-standing conjecture about generalized Collatz sequences holds.","weakest_assumption":"The long-standing conjecture about generalized Collatz sequences holds."}},"verdict_id":"b8172661-6b63-4160-9ffa-43552cb7406c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1eb69e2f51b48a3bdff8b4434eb6f5effbc46a02b4c5edd79d7b6db17d35b275","target":"record","created_at":"2026-05-17T21:18:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4883c91e48db23b8277841695657eefbdb645aa2cf574e0ba72b56fe764a67d1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T17:13:03Z","title_canon_sha256":"fc78590c1bf69d9cb367b1ae4a5482c7436cf0f0071d8059d4b72b872d08ac35"},"schema_version":"1.0","source":{"id":"2605.15094","kind":"arxiv","version":1}},"canonical_sha256":"b2c8425368faaad9c5e8d9b88cf93b03d18c2f6943848f97f69e3095eabc1eba","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2c8425368faaad9c5e8d9b88cf93b03d18c2f6943848f97f69e3095eabc1eba","first_computed_at":"2026-05-17T21:40:25.878409Z","kind":"pith_receipt","last_reissued_at":"2026-05-17T21:57:19.204744Z","receipt_version":"0.2","signature_status":"unsigned_v0"},"source_id":"2605.15094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1eb69e2f51b48a3bdff8b4434eb6f5effbc46a02b4c5edd79d7b6db17d35b275","sha256:e2f3d9b96db1bf74a67348712242096e722fe7690d5db6d670850154582f0209"],"state_sha256":"da4b5fd35706d23383109323b7ff6d56684f20f6bf6aca6d703f7e02b1cf0cfb"}