{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MJC6HTSEJBANUP4WNQ5PSWU7M7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a7d0163bd906ce886809a2a01f012a2753770aab3cb04db3d750e3f9a0763a3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-11-18T15:34:16Z","title_canon_sha256":"346b3780f5c055a25e98f07a3677aae9be0cc5b1a717088fe83cf8b6df4e2f5b"},"schema_version":"1.0","source":{"id":"1811.07340","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07340","created_at":"2026-05-17T23:56:29Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07340v2","created_at":"2026-05-17T23:56:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07340","created_at":"2026-05-17T23:56:29Z"},{"alias_kind":"pith_short_12","alias_value":"MJC6HTSEJBAN","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MJC6HTSEJBANUP4W","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MJC6HTSE","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:58bb15071961906e70d9bd472471fc9b29346f12962bf22eaf5e6a98fa8f98e5","target":"graph","created_at":"2026-05-17T23:56:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amir M. Ben-Amram, Jes\\'us J. Dom\\'enech, Samir Genaim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-11-18T15:34:16Z","title":"Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07340","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:10b1f6ca217e42f0b6e3d17fd7c65052979e5f5bda789067c34742e65d4c62be","target":"record","created_at":"2026-05-17T23:56:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a7d0163bd906ce886809a2a01f012a2753770aab3cb04db3d750e3f9a0763a3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-11-18T15:34:16Z","title_canon_sha256":"346b3780f5c055a25e98f07a3677aae9be0cc5b1a717088fe83cf8b6df4e2f5b"},"schema_version":"1.0","source":{"id":"1811.07340","kind":"arxiv","version":2}},"canonical_sha256":"6245e3ce444840da3f966c3af95a9f67e53c78e3c7273bbe95068a5528f786a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6245e3ce444840da3f966c3af95a9f67e53c78e3c7273bbe95068a5528f786a4","first_computed_at":"2026-05-17T23:56:29.179567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:29.179567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OA3uCPfnFDsu7lFaKL2rRcGZsGnRdzf6ymlb2/8lM2IRSH6oZv/qRN5SsRbkmtt7L1OjMtQ5GyqEdRfbi6eaCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:29.180095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07340","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10b1f6ca217e42f0b6e3d17fd7c65052979e5f5bda789067c34742e65d4c62be","sha256:58bb15071961906e70d9bd472471fc9b29346f12962bf22eaf5e6a98fa8f98e5"],"state_sha256":"4d09c32cfac9dee100fd9fe559b296874d0763e8da1b73af2113bea0567e0047"}