{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RPIAE6Z3BY75CS3UJY2PCXYCMS","short_pith_number":"pith:RPIAE6Z3","schema_version":"1.0","canonical_sha256":"8bd0027b3b0e3fd14b744e34f15f026493f3f2c1f4b8219339830950e012795e","source":{"kind":"arxiv","id":"1504.05018","version":1},"attestation_state":"computed","paper":{"title":"Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Amir M. Ben-Amram, Samir Genaim","submitted_at":"2015-04-20T11:50:22Z","abstract_excerpt":"In this paper we turn the spotlight on a class of lexicographic ranking functions introduced by Bradley, Manna and Sipma in a seminal CAV 2005 paper, and establish for the first time the complexity of some problems involving the inference of such functions for linear-constraint loops (without precondition). We show that finding such a function, if one exists, can be done in polynomial time in a way which is sound and complete when the variables range over the rationals (or reals). We show that when variables range over the integers, the problem is harder -- deciding the existence of a ranking "},"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":"1504.05018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-04-20T11:50:22Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"2e980d66dbc997a2a2e799084f0e5161bb6f16082673f04f5ecdd3c4ea43a217","abstract_canon_sha256":"6239329025e8304877ab1b399d1ad10ddc392cbcece4483327be47ab45534cd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:22.881754Z","signature_b64":"HSt4PtpuJeTX9H9ozQlqCWtncptxYJXPH6Hs4yhaSdfswi9n1SLXuo4tKy0JKItO8v0JM0t3V0yZUZiWxJu7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bd0027b3b0e3fd14b744e34f15f026493f3f2c1f4b8219339830950e012795e","last_reissued_at":"2026-05-18T02:18:22.881024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:22.881024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Amir M. Ben-Amram, Samir Genaim","submitted_at":"2015-04-20T11:50:22Z","abstract_excerpt":"In this paper we turn the spotlight on a class of lexicographic ranking functions introduced by Bradley, Manna and Sipma in a seminal CAV 2005 paper, and establish for the first time the complexity of some problems involving the inference of such functions for linear-constraint loops (without precondition). We show that finding such a function, if one exists, can be done in polynomial time in a way which is sound and complete when the variables range over the rationals (or reals). We show that when variables range over the integers, the problem is harder -- deciding the existence of a ranking "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05018","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":"1504.05018","created_at":"2026-05-18T02:18:22.881153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05018v1","created_at":"2026-05-18T02:18:22.881153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05018","created_at":"2026-05-18T02:18:22.881153+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPIAE6Z3BY75","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPIAE6Z3BY75CS3U","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPIAE6Z3","created_at":"2026-05-18T12:29:39.896362+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/RPIAE6Z3BY75CS3UJY2PCXYCMS","json":"https://pith.science/pith/RPIAE6Z3BY75CS3UJY2PCXYCMS.json","graph_json":"https://pith.science/api/pith-number/RPIAE6Z3BY75CS3UJY2PCXYCMS/graph.json","events_json":"https://pith.science/api/pith-number/RPIAE6Z3BY75CS3UJY2PCXYCMS/events.json","paper":"https://pith.science/paper/RPIAE6Z3"},"agent_actions":{"view_html":"https://pith.science/pith/RPIAE6Z3BY75CS3UJY2PCXYCMS","download_json":"https://pith.science/pith/RPIAE6Z3BY75CS3UJY2PCXYCMS.json","view_paper":"https://pith.science/paper/RPIAE6Z3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05018&json=true","fetch_graph":"https://pith.science/api/pith-number/RPIAE6Z3BY75CS3UJY2PCXYCMS/graph.json","fetch_events":"https://pith.science/api/pith-number/RPIAE6Z3BY75CS3UJY2PCXYCMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPIAE6Z3BY75CS3UJY2PCXYCMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPIAE6Z3BY75CS3UJY2PCXYCMS/action/storage_attestation","attest_author":"https://pith.science/pith/RPIAE6Z3BY75CS3UJY2PCXYCMS/action/author_attestation","sign_citation":"https://pith.science/pith/RPIAE6Z3BY75CS3UJY2PCXYCMS/action/citation_signature","submit_replication":"https://pith.science/pith/RPIAE6Z3BY75CS3UJY2PCXYCMS/action/replication_record"}},"created_at":"2026-05-18T02:18:22.881153+00:00","updated_at":"2026-05-18T02:18:22.881153+00:00"}