{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WYTK7SZIQOLQLPGFWB6DVMRJR7","short_pith_number":"pith:WYTK7SZI","canonical_record":{"source":{"id":"1703.07547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-03-22T07:24:15Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3dec77113df79796837d57a82d990e1cc94582cd1efcd3b7d4457bb3d18be828","abstract_canon_sha256":"d04f278b1e5be28acd4329cfef45493657db9e04cfe5dd7081cf8d03fdd0333d"},"schema_version":"1.0"},"canonical_sha256":"b626afcb28839705bcc5b07c3ab2298fca31460c41faee97830cbf61e02030da","source":{"kind":"arxiv","id":"1703.07547","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07547","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07547v2","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07547","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"WYTK7SZIQOLQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WYTK7SZIQOLQLPGF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WYTK7SZI","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WYTK7SZIQOLQLPGFWB6DVMRJR7","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-03-22T07:24:15Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3dec77113df79796837d57a82d990e1cc94582cd1efcd3b7d4457bb3d18be828","abstract_canon_sha256":"d04f278b1e5be28acd4329cfef45493657db9e04cfe5dd7081cf8d03fdd0333d"},"schema_version":"1.0"},"canonical_sha256":"b626afcb28839705bcc5b07c3ab2298fca31460c41faee97830cbf61e02030da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:04.816719Z","signature_b64":"d/+vCywlMl0cWWMjHC5HvbSFLGHBgZyhhfLK8cH+AxLKluMKm+vttFJhVKuXk+tPThGwRzS4oOUJFjG+/+KnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b626afcb28839705bcc5b07c3ab2298fca31460c41faee97830cbf61e02030da","last_reissued_at":"2026-05-18T00:48:04.816071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:04.816071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07547","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccmpPQLbQ+sr3ws5KsdZ1ASx+9xkN1Bnl6FdgExkW1pBRSmDv8RUuhzZq6en17qtjnhh/r3XQXMOXHjjG3D2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:14:44.837010Z"},"content_sha256":"373ecb99cebb9c25c3c40433f765eb69a5b43d3729b725d797a7e397c33be6cd","schema_version":"1.0","event_id":"sha256:373ecb99cebb9c25c3c40433f765eb69a5b43d3729b725d797a7e397c33be6cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WYTK7SZIQOLQLPGFWB6DVMRJR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Multiphase-Linear 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":"2017-03-22T07:24:15Z","abstract_excerpt":"Multiphase ranking functions ($\\mathit{M{\\Phi}RFs}$) were proposed as a means to prove the termination of a loop in which the computation progresses through a number of \"phases\", and the progress of each phase is described by a different linear ranking function. Our work provides new insights regarding such functions for loops described by a conjunction of linear constraints (single-path loops). We provide a complete polynomial-time solution to the problem of existence and of synthesis of $\\mathit{M{\\Phi}RF}$ of bounded depth (number of phases), when variables range over rational or real numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07547","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2n7v9tx14LDyc21gQr26AZ+dGHEtouAyv2eigrUqHLkMcUc0odI4A4zjRZBieZMaaJZ19XXN1PoqB6/NgTgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:14:44.837738Z"},"content_sha256":"63596177b12f95ed77367601d288682656323c6e47b8c857803397bb8a3e44af","schema_version":"1.0","event_id":"sha256:63596177b12f95ed77367601d288682656323c6e47b8c857803397bb8a3e44af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYTK7SZIQOLQLPGFWB6DVMRJR7/bundle.json","state_url":"https://pith.science/pith/WYTK7SZIQOLQLPGFWB6DVMRJR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYTK7SZIQOLQLPGFWB6DVMRJR7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T23:14:44Z","links":{"resolver":"https://pith.science/pith/WYTK7SZIQOLQLPGFWB6DVMRJR7","bundle":"https://pith.science/pith/WYTK7SZIQOLQLPGFWB6DVMRJR7/bundle.json","state":"https://pith.science/pith/WYTK7SZIQOLQLPGFWB6DVMRJR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYTK7SZIQOLQLPGFWB6DVMRJR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WYTK7SZIQOLQLPGFWB6DVMRJR7","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":"d04f278b1e5be28acd4329cfef45493657db9e04cfe5dd7081cf8d03fdd0333d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-03-22T07:24:15Z","title_canon_sha256":"3dec77113df79796837d57a82d990e1cc94582cd1efcd3b7d4457bb3d18be828"},"schema_version":"1.0","source":{"id":"1703.07547","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07547","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07547v2","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07547","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"WYTK7SZIQOLQ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WYTK7SZIQOLQLPGF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WYTK7SZI","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:63596177b12f95ed77367601d288682656323c6e47b8c857803397bb8a3e44af","target":"graph","created_at":"2026-05-18T00:48:04Z","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 ($\\mathit{M{\\Phi}RFs}$) were proposed as a means to prove the termination of a loop in which the computation progresses through a number of \"phases\", and the progress of each phase is described by a different linear ranking function. Our work provides new insights regarding such functions for loops described by a conjunction of linear constraints (single-path loops). We provide a complete polynomial-time solution to the problem of existence and of synthesis of $\\mathit{M{\\Phi}RF}$ of bounded depth (number of phases), when variables range over rational or real numbe","authors_text":"Amir M. Ben-Amram, Samir Genaim","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-03-22T07:24:15Z","title":"On Multiphase-Linear Ranking Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07547","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:373ecb99cebb9c25c3c40433f765eb69a5b43d3729b725d797a7e397c33be6cd","target":"record","created_at":"2026-05-18T00:48:04Z","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":"d04f278b1e5be28acd4329cfef45493657db9e04cfe5dd7081cf8d03fdd0333d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-03-22T07:24:15Z","title_canon_sha256":"3dec77113df79796837d57a82d990e1cc94582cd1efcd3b7d4457bb3d18be828"},"schema_version":"1.0","source":{"id":"1703.07547","kind":"arxiv","version":2}},"canonical_sha256":"b626afcb28839705bcc5b07c3ab2298fca31460c41faee97830cbf61e02030da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b626afcb28839705bcc5b07c3ab2298fca31460c41faee97830cbf61e02030da","first_computed_at":"2026-05-18T00:48:04.816071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:04.816071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d/+vCywlMl0cWWMjHC5HvbSFLGHBgZyhhfLK8cH+AxLKluMKm+vttFJhVKuXk+tPThGwRzS4oOUJFjG+/+KnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:04.816719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07547","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:373ecb99cebb9c25c3c40433f765eb69a5b43d3729b725d797a7e397c33be6cd","sha256:63596177b12f95ed77367601d288682656323c6e47b8c857803397bb8a3e44af"],"state_sha256":"ed5df6b54401614a32d1b969c19927fe0e19f90924790420c7232e958385ba85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zso47uZrxfPu8sEWqKDgKpJB9ryqof5/sEG1vRbZ/Z2C9DSr8q29+wLqXlw51T5rWfmUnDE0nVZaS16OjxXoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:14:44.842173Z","bundle_sha256":"7fd1460f2a3cb4b78e7ca89b9edb0cd15eea68f6dae302265db8c1c77d931a03"}}