{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BOVVE7V2WRAHEB5VR3ZRC5MVKQ","short_pith_number":"pith:BOVVE7V2","schema_version":"1.0","canonical_sha256":"0bab527ebab4407207b58ef311759554381230289a97c4345b35b825387dd645","source":{"kind":"arxiv","id":"1510.05201","version":3},"attestation_state":"computed","paper":{"title":"On Termination of Polynomial Programs with Equality Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.PL","authors_text":"Guohua Wu, Hui Lu, Joost-Pieter Katoen, Mingshuai Chen, Naijun Zhan, Yangjia Li","submitted_at":"2015-10-18T06:21:35Z","abstract_excerpt":"We investigate the termination problem of a family of multi-path polynomial programs (MPPs), in which all assignments to program variables are polynomials, and test conditions of loops and conditional statements are polynomial equalities. We show that the set of non-terminating inputs (NTI) of such a program is algorithmically computable, thus leading to the decidability of its termination. To the best of our knowledge, the considered family of MPPs is hitherto the largest one for which termination is decidable. We present an explicit recursive function which is essentially Ackermannian, to co"},"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":"1510.05201","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-10-18T06:21:35Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"d0cedd1c2df8cc0e0d673dd67fcc0ff966d3b2df39e4444b232a97ca54bed99c","abstract_canon_sha256":"294f911117b17e9954aada632190694664ee5528f6727dae93fb26ce1948cd1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:46.833248Z","signature_b64":"2v+jrF2VfhnmGECmY/4cfk/WpEQQKERgLmshjFq/vKkf515VuhhrBhifB68KHOq4nf2PcUdptBzJvNcbXi0RAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bab527ebab4407207b58ef311759554381230289a97c4345b35b825387dd645","last_reissued_at":"2026-07-05T01:31:46.832889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:46.832889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Termination of Polynomial Programs with Equality Conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.PL","authors_text":"Guohua Wu, Hui Lu, Joost-Pieter Katoen, Mingshuai Chen, Naijun Zhan, Yangjia Li","submitted_at":"2015-10-18T06:21:35Z","abstract_excerpt":"We investigate the termination problem of a family of multi-path polynomial programs (MPPs), in which all assignments to program variables are polynomials, and test conditions of loops and conditional statements are polynomial equalities. We show that the set of non-terminating inputs (NTI) of such a program is algorithmically computable, thus leading to the decidability of its termination. To the best of our knowledge, the considered family of MPPs is hitherto the largest one for which termination is decidable. We present an explicit recursive function which is essentially Ackermannian, to co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.05201","kind":"arxiv","version":3},"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/1510.05201/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":"1510.05201","created_at":"2026-07-05T01:31:46.832952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.05201v3","created_at":"2026-07-05T01:31:46.832952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.05201","created_at":"2026-07-05T01:31:46.832952+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOVVE7V2WRAH","created_at":"2026-07-05T01:31:46.832952+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOVVE7V2WRAHEB5V","created_at":"2026-07-05T01:31:46.832952+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOVVE7V2","created_at":"2026-07-05T01:31:46.832952+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/BOVVE7V2WRAHEB5VR3ZRC5MVKQ","json":"https://pith.science/pith/BOVVE7V2WRAHEB5VR3ZRC5MVKQ.json","graph_json":"https://pith.science/api/pith-number/BOVVE7V2WRAHEB5VR3ZRC5MVKQ/graph.json","events_json":"https://pith.science/api/pith-number/BOVVE7V2WRAHEB5VR3ZRC5MVKQ/events.json","paper":"https://pith.science/paper/BOVVE7V2"},"agent_actions":{"view_html":"https://pith.science/pith/BOVVE7V2WRAHEB5VR3ZRC5MVKQ","download_json":"https://pith.science/pith/BOVVE7V2WRAHEB5VR3ZRC5MVKQ.json","view_paper":"https://pith.science/paper/BOVVE7V2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.05201&json=true","fetch_graph":"https://pith.science/api/pith-number/BOVVE7V2WRAHEB5VR3ZRC5MVKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BOVVE7V2WRAHEB5VR3ZRC5MVKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOVVE7V2WRAHEB5VR3ZRC5MVKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOVVE7V2WRAHEB5VR3ZRC5MVKQ/action/storage_attestation","attest_author":"https://pith.science/pith/BOVVE7V2WRAHEB5VR3ZRC5MVKQ/action/author_attestation","sign_citation":"https://pith.science/pith/BOVVE7V2WRAHEB5VR3ZRC5MVKQ/action/citation_signature","submit_replication":"https://pith.science/pith/BOVVE7V2WRAHEB5VR3ZRC5MVKQ/action/replication_record"}},"created_at":"2026-07-05T01:31:46.832952+00:00","updated_at":"2026-07-05T01:31:46.832952+00:00"}