{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FYPV24FSF3J3G5MXX4ZSV73IEI","short_pith_number":"pith:FYPV24FS","schema_version":"1.0","canonical_sha256":"2e1f5d70b22ed3b37597bf332aff68220a1ae78a17d9aa1ce368bae21582688a","source":{"kind":"arxiv","id":"2104.01189","version":1},"attestation_state":"computed","paper":{"title":"Proving Non-termination by Program Reversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"{\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Ehsan Kafshdar Goharshady, Krishnendu Chatterjee, Petr Novotn\\'y","submitted_at":"2021-04-02T18:13:30Z","abstract_excerpt":"We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a constraint-based invariant synthesis with constraints coming from both the original and the reversed transition system. The latter task is performed by a simple call to an off-the-shelf SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover, our method offers a combination of features not present (as a whole) in previous approaches: it hand"},"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":"2104.01189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-04-02T18:13:30Z","cross_cats_sorted":[],"title_canon_sha256":"5e87074207a0b2c326d9afe57dce5f7c7f81c1f744bb66ce3b2f409133958096","abstract_canon_sha256":"96d37d5952a75fc071bafb3e28a96c20f582121102991a336c9691ea5dc22e1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:57.499933Z","signature_b64":"MjlsAALIhSbqpxRhACYA/yqOxvbjQ5/kGjZdmh+UXKp6BEls7eQw5r/smmS279YCzHAF7S0nlatBrQJtqnlXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e1f5d70b22ed3b37597bf332aff68220a1ae78a17d9aa1ce368bae21582688a","last_reissued_at":"2026-07-05T02:28:57.499461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:57.499461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving Non-termination by Program Reversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"{\\DJ}or{\\dj}e \\v{Z}ikeli\\'c, Ehsan Kafshdar Goharshady, Krishnendu Chatterjee, Petr Novotn\\'y","submitted_at":"2021-04-02T18:13:30Z","abstract_excerpt":"We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a constraint-based invariant synthesis with constraints coming from both the original and the reversed transition system. The latter task is performed by a simple call to an off-the-shelf SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover, our method offers a combination of features not present (as a whole) in previous approaches: it hand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.01189","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/2104.01189/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":"2104.01189","created_at":"2026-07-05T02:28:57.499525+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.01189v1","created_at":"2026-07-05T02:28:57.499525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.01189","created_at":"2026-07-05T02:28:57.499525+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYPV24FSF3J3","created_at":"2026-07-05T02:28:57.499525+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYPV24FSF3J3G5MX","created_at":"2026-07-05T02:28:57.499525+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYPV24FS","created_at":"2026-07-05T02:28:57.499525+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/FYPV24FSF3J3G5MXX4ZSV73IEI","json":"https://pith.science/pith/FYPV24FSF3J3G5MXX4ZSV73IEI.json","graph_json":"https://pith.science/api/pith-number/FYPV24FSF3J3G5MXX4ZSV73IEI/graph.json","events_json":"https://pith.science/api/pith-number/FYPV24FSF3J3G5MXX4ZSV73IEI/events.json","paper":"https://pith.science/paper/FYPV24FS"},"agent_actions":{"view_html":"https://pith.science/pith/FYPV24FSF3J3G5MXX4ZSV73IEI","download_json":"https://pith.science/pith/FYPV24FSF3J3G5MXX4ZSV73IEI.json","view_paper":"https://pith.science/paper/FYPV24FS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.01189&json=true","fetch_graph":"https://pith.science/api/pith-number/FYPV24FSF3J3G5MXX4ZSV73IEI/graph.json","fetch_events":"https://pith.science/api/pith-number/FYPV24FSF3J3G5MXX4ZSV73IEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYPV24FSF3J3G5MXX4ZSV73IEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYPV24FSF3J3G5MXX4ZSV73IEI/action/storage_attestation","attest_author":"https://pith.science/pith/FYPV24FSF3J3G5MXX4ZSV73IEI/action/author_attestation","sign_citation":"https://pith.science/pith/FYPV24FSF3J3G5MXX4ZSV73IEI/action/citation_signature","submit_replication":"https://pith.science/pith/FYPV24FSF3J3G5MXX4ZSV73IEI/action/replication_record"}},"created_at":"2026-07-05T02:28:57.499525+00:00","updated_at":"2026-07-05T02:28:57.499525+00:00"}