{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HLQ3Q73V2XNNFNEYYKDI3UDQLK","short_pith_number":"pith:HLQ3Q73V","canonical_record":{"source":{"id":"1401.5338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"985835487c6845a12a6d5f73ad3099a1cf5c65feb4d495984ce7a3129f5dbb8f","abstract_canon_sha256":"036ee0a2c74308017c64a76574b7a68f57cfe49251eb012252f1a60703572b57"},"schema_version":"1.0"},"canonical_sha256":"3ae1b87f75d5dad2b498c2868dd0705a867da9163c09d399c8da1eeefe22fcee","source":{"kind":"arxiv","id":"1401.5338","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5338","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5338v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5338","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"HLQ3Q73V2XNN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HLQ3Q73V2XNNFNEY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HLQ3Q73V","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HLQ3Q73V2XNNFNEYYKDI3UDQLK","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"985835487c6845a12a6d5f73ad3099a1cf5c65feb4d495984ce7a3129f5dbb8f","abstract_canon_sha256":"036ee0a2c74308017c64a76574b7a68f57cfe49251eb012252f1a60703572b57"},"schema_version":"1.0"},"canonical_sha256":"3ae1b87f75d5dad2b498c2868dd0705a867da9163c09d399c8da1eeefe22fcee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.112262Z","signature_b64":"8TvkosqA7jaFivb7DwmJMjoz29PA9n4tHmMItZL4oWRUip6uzuGVKOZq2xHqH4uYXE/z0x2DGunlKTQloCizCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ae1b87f75d5dad2b498c2868dd0705a867da9163c09d399c8da1eeefe22fcee","last_reissued_at":"2026-05-18T03:01:34.111719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.111719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5338","source_version":1,"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-18T03:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4d+BxhT49qLzY1jvJumjE0BYS6n4sXUorbPbbKZf5ZOYF1eEuBWeO7Bxv/N5XgCwyptgIceTo9g+YxaTxuXXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T11:33:11.573947Z"},"content_sha256":"9f666b07da58b0bd5e126fe01cead0227c7df9e315d0e6cf7daf5e2c4eb1a551","schema_version":"1.0","event_id":"sha256:9f666b07da58b0bd5e126fe01cead0227c7df9e315d0e6cf7daf5e2c4eb1a551"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HLQ3Q73V2XNNFNEYYKDI3UDQLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranking Templates for Linear Loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jan Leike, Matthias Heizmann","submitted_at":"2014-01-21T15:09:14Z","abstract_excerpt":"We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parametrized, well-founded relations such that an assignment to the parameters gives rise to a ranking function. This approach generalizes existing methods and enables us to use templates for many different ranking functions with affine-linear components. We discuss templates for multiphase, piecewise, and lexicographic ranking functions. Because these ranking templates require both strict and non-strict inequalities, we us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5338","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"},"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-18T03:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cy3EbkyMcDu6o6M2vsoXLwHgqiJCx3k+9bIG5jc7Zj+b33gxSRlsYAWdNRzASRu8Y2F1Imh7Z/0UtS8xbNuXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T11:33:11.574294Z"},"content_sha256":"f16d92cd4dbca81274655c543d5f0c47eec4009baf62a9c7a27cc9168156202f","schema_version":"1.0","event_id":"sha256:f16d92cd4dbca81274655c543d5f0c47eec4009baf62a9c7a27cc9168156202f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLQ3Q73V2XNNFNEYYKDI3UDQLK/bundle.json","state_url":"https://pith.science/pith/HLQ3Q73V2XNNFNEYYKDI3UDQLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLQ3Q73V2XNNFNEYYKDI3UDQLK/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-07-02T11:33:11Z","links":{"resolver":"https://pith.science/pith/HLQ3Q73V2XNNFNEYYKDI3UDQLK","bundle":"https://pith.science/pith/HLQ3Q73V2XNNFNEYYKDI3UDQLK/bundle.json","state":"https://pith.science/pith/HLQ3Q73V2XNNFNEYYKDI3UDQLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLQ3Q73V2XNNFNEYYKDI3UDQLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HLQ3Q73V2XNNFNEYYKDI3UDQLK","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":"036ee0a2c74308017c64a76574b7a68f57cfe49251eb012252f1a60703572b57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:09:14Z","title_canon_sha256":"985835487c6845a12a6d5f73ad3099a1cf5c65feb4d495984ce7a3129f5dbb8f"},"schema_version":"1.0","source":{"id":"1401.5338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5338","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5338v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5338","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"HLQ3Q73V2XNN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HLQ3Q73V2XNNFNEY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HLQ3Q73V","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:f16d92cd4dbca81274655c543d5f0c47eec4009baf62a9c7a27cc9168156202f","target":"graph","created_at":"2026-05-18T03:01:34Z","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":"We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parametrized, well-founded relations such that an assignment to the parameters gives rise to a ranking function. This approach generalizes existing methods and enables us to use templates for many different ranking functions with affine-linear components. We discuss templates for multiphase, piecewise, and lexicographic ranking functions. Because these ranking templates require both strict and non-strict inequalities, we us","authors_text":"Jan Leike, Matthias Heizmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:09:14Z","title":"Ranking Templates for Linear Loops"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5338","kind":"arxiv","version":1},"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:9f666b07da58b0bd5e126fe01cead0227c7df9e315d0e6cf7daf5e2c4eb1a551","target":"record","created_at":"2026-05-18T03:01:34Z","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":"036ee0a2c74308017c64a76574b7a68f57cfe49251eb012252f1a60703572b57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:09:14Z","title_canon_sha256":"985835487c6845a12a6d5f73ad3099a1cf5c65feb4d495984ce7a3129f5dbb8f"},"schema_version":"1.0","source":{"id":"1401.5338","kind":"arxiv","version":1}},"canonical_sha256":"3ae1b87f75d5dad2b498c2868dd0705a867da9163c09d399c8da1eeefe22fcee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ae1b87f75d5dad2b498c2868dd0705a867da9163c09d399c8da1eeefe22fcee","first_computed_at":"2026-05-18T03:01:34.111719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:34.111719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8TvkosqA7jaFivb7DwmJMjoz29PA9n4tHmMItZL4oWRUip6uzuGVKOZq2xHqH4uYXE/z0x2DGunlKTQloCizCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:34.112262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f666b07da58b0bd5e126fe01cead0227c7df9e315d0e6cf7daf5e2c4eb1a551","sha256:f16d92cd4dbca81274655c543d5f0c47eec4009baf62a9c7a27cc9168156202f"],"state_sha256":"23dd85c7b3a5a2b5f82f7893dfbeaa84aca6c690a26d5b0bfc4defdd14e1647c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SOx4Ivfqiigl12Jw2IGrF10OrbzlI4ButI5DHUdNoTB9uEReSwEm72f5yxaBkiRWyesXcCRNRc1oEzIbKnMzDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T11:33:11.576212Z","bundle_sha256":"4dce1ff47cedfaac95e834f6741ce241ecd0adda3dfd6062ddd5ae14ffd3d31c"}}