{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MCNBHAHZZ6HDMSOXXQB6RZDX6O","short_pith_number":"pith:MCNBHAHZ","schema_version":"1.0","canonical_sha256":"609a1380f9cf8e3649d7bc03e8e477f3861af2b9a90dd361f01bb73c51a537b3","source":{"kind":"arxiv","id":"1412.3271","version":1},"attestation_state":"computed","paper":{"title":"A Second-Order Formulation of Non-Termination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Etienne Payet, Fred Mesnard","submitted_at":"2014-12-10T11:58:18Z","abstract_excerpt":"We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is generally undecidable. However, by restricting the language to known decidable cases, we exhibit new classes of loops, the non-termination of which is decidable. We present a bunch of examples."},"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":"1412.3271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-10T11:58:18Z","cross_cats_sorted":[],"title_canon_sha256":"31beeae8b497ea54c5f23c82a93501117e8bc24b91dbda14ff4432a85649e6a0","abstract_canon_sha256":"eac7a6e10c155853657a09ba1b6e673411ab84ca38ffb9580992841baba40d4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:37.124517Z","signature_b64":"5reCEaHVCUmcH3sKChCgiSiDWdMZZRSyKKyQq0S+U7tlMAC+UOpS48g9TNtrGV3vfeiM/Q/qeHNGv0l/greICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"609a1380f9cf8e3649d7bc03e8e477f3861af2b9a90dd361f01bb73c51a537b3","last_reissued_at":"2026-05-18T02:31:37.123867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:37.123867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Second-Order Formulation of Non-Termination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Etienne Payet, Fred Mesnard","submitted_at":"2014-12-10T11:58:18Z","abstract_excerpt":"We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is generally undecidable. However, by restricting the language to known decidable cases, we exhibit new classes of loops, the non-termination of which is decidable. We present a bunch of examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3271","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":""},"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":"1412.3271","created_at":"2026-05-18T02:31:37.123965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3271v1","created_at":"2026-05-18T02:31:37.123965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3271","created_at":"2026-05-18T02:31:37.123965+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCNBHAHZZ6HD","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCNBHAHZZ6HDMSOX","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCNBHAHZ","created_at":"2026-05-18T12:28:38.356838+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/MCNBHAHZZ6HDMSOXXQB6RZDX6O","json":"https://pith.science/pith/MCNBHAHZZ6HDMSOXXQB6RZDX6O.json","graph_json":"https://pith.science/api/pith-number/MCNBHAHZZ6HDMSOXXQB6RZDX6O/graph.json","events_json":"https://pith.science/api/pith-number/MCNBHAHZZ6HDMSOXXQB6RZDX6O/events.json","paper":"https://pith.science/paper/MCNBHAHZ"},"agent_actions":{"view_html":"https://pith.science/pith/MCNBHAHZZ6HDMSOXXQB6RZDX6O","download_json":"https://pith.science/pith/MCNBHAHZZ6HDMSOXXQB6RZDX6O.json","view_paper":"https://pith.science/paper/MCNBHAHZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3271&json=true","fetch_graph":"https://pith.science/api/pith-number/MCNBHAHZZ6HDMSOXXQB6RZDX6O/graph.json","fetch_events":"https://pith.science/api/pith-number/MCNBHAHZZ6HDMSOXXQB6RZDX6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCNBHAHZZ6HDMSOXXQB6RZDX6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCNBHAHZZ6HDMSOXXQB6RZDX6O/action/storage_attestation","attest_author":"https://pith.science/pith/MCNBHAHZZ6HDMSOXXQB6RZDX6O/action/author_attestation","sign_citation":"https://pith.science/pith/MCNBHAHZZ6HDMSOXXQB6RZDX6O/action/citation_signature","submit_replication":"https://pith.science/pith/MCNBHAHZZ6HDMSOXXQB6RZDX6O/action/replication_record"}},"created_at":"2026-05-18T02:31:37.123965+00:00","updated_at":"2026-05-18T02:31:37.123965+00:00"}