{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MJC6HTSEJBANUP4WNQ5PSWU7M7","short_pith_number":"pith:MJC6HTSE","schema_version":"1.0","canonical_sha256":"6245e3ce444840da3f966c3af95a9f67e53c78e3c7273bbe95068a5528f786a4","source":{"kind":"arxiv","id":"1811.07340","version":2},"attestation_state":"computed","paper":{"title":"Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Amir M. Ben-Amram, Jes\\'us J. Dom\\'enech, Samir Genaim","submitted_at":"2018-11-18T15:34:16Z","abstract_excerpt":"Multiphase ranking functions (M$\\Phi$RFs) are tuples $\\langle f_1,\\ldots,f_d \\rangle$ of linear functions that are often used to prove termination of loops in which the computation progresses through a number of \"phases\". Our work provides new insights regarding such functions for loops described by a conjunction of linear constraints (Single-Path Constraint loops). The decision problem existence of a M$\\Phi$RF asks to determine whether a given SLC loop admits a M$\\Phi$RF, and the corresponding bounded decision problem restricts the search to M$\\Phi$RFs of depth $d$, where the parameter $d$ is"},"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":"1811.07340","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-11-18T15:34:16Z","cross_cats_sorted":[],"title_canon_sha256":"346b3780f5c055a25e98f07a3677aae9be0cc5b1a717088fe83cf8b6df4e2f5b","abstract_canon_sha256":"a7d0163bd906ce886809a2a01f012a2753770aab3cb04db3d750e3f9a0763a3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:29.180095Z","signature_b64":"OA3uCPfnFDsu7lFaKL2rRcGZsGnRdzf6ymlb2/8lM2IRSH6oZv/qRN5SsRbkmtt7L1OjMtQ5GyqEdRfbi6eaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6245e3ce444840da3f966c3af95a9f67e53c78e3c7273bbe95068a5528f786a4","last_reissued_at":"2026-05-17T23:56:29.179567Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:29.179567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Amir M. Ben-Amram, Jes\\'us J. Dom\\'enech, Samir Genaim","submitted_at":"2018-11-18T15:34:16Z","abstract_excerpt":"Multiphase ranking functions (M$\\Phi$RFs) are tuples $\\langle f_1,\\ldots,f_d \\rangle$ of linear functions that are often used to prove termination of loops in which the computation progresses through a number of \"phases\". Our work provides new insights regarding such functions for loops described by a conjunction of linear constraints (Single-Path Constraint loops). The decision problem existence of a M$\\Phi$RF asks to determine whether a given SLC loop admits a M$\\Phi$RF, and the corresponding bounded decision problem restricts the search to M$\\Phi$RFs of depth $d$, where the parameter $d$ is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07340","kind":"arxiv","version":2},"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":"1811.07340","created_at":"2026-05-17T23:56:29.179639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07340v2","created_at":"2026-05-17T23:56:29.179639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07340","created_at":"2026-05-17T23:56:29.179639+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJC6HTSEJBAN","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJC6HTSEJBANUP4W","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJC6HTSE","created_at":"2026-05-18T12:32:37.024351+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/MJC6HTSEJBANUP4WNQ5PSWU7M7","json":"https://pith.science/pith/MJC6HTSEJBANUP4WNQ5PSWU7M7.json","graph_json":"https://pith.science/api/pith-number/MJC6HTSEJBANUP4WNQ5PSWU7M7/graph.json","events_json":"https://pith.science/api/pith-number/MJC6HTSEJBANUP4WNQ5PSWU7M7/events.json","paper":"https://pith.science/paper/MJC6HTSE"},"agent_actions":{"view_html":"https://pith.science/pith/MJC6HTSEJBANUP4WNQ5PSWU7M7","download_json":"https://pith.science/pith/MJC6HTSEJBANUP4WNQ5PSWU7M7.json","view_paper":"https://pith.science/paper/MJC6HTSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07340&json=true","fetch_graph":"https://pith.science/api/pith-number/MJC6HTSEJBANUP4WNQ5PSWU7M7/graph.json","fetch_events":"https://pith.science/api/pith-number/MJC6HTSEJBANUP4WNQ5PSWU7M7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJC6HTSEJBANUP4WNQ5PSWU7M7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJC6HTSEJBANUP4WNQ5PSWU7M7/action/storage_attestation","attest_author":"https://pith.science/pith/MJC6HTSEJBANUP4WNQ5PSWU7M7/action/author_attestation","sign_citation":"https://pith.science/pith/MJC6HTSEJBANUP4WNQ5PSWU7M7/action/citation_signature","submit_replication":"https://pith.science/pith/MJC6HTSEJBANUP4WNQ5PSWU7M7/action/replication_record"}},"created_at":"2026-05-17T23:56:29.179639+00:00","updated_at":"2026-05-17T23:56:29.179639+00:00"}