{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WJSIQFEL35FIB7TTRNGDAYQFF7","short_pith_number":"pith:WJSIQFEL","canonical_record":{"source":{"id":"1401.5347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:27:07Z","cross_cats_sorted":[],"title_canon_sha256":"3159c10648826817ac2622725fb8187237d9b7f20105567ef7c5afe43d5b2cbf","abstract_canon_sha256":"6c641d728c55e9808b53c8fb8521425b7606993f598571510836ac1180b853e0"},"schema_version":"1.0"},"canonical_sha256":"b26488148bdf4a80fe738b4c3062052fec94a38fa37aebec5911e4c12ce8abb6","source":{"kind":"arxiv","id":"1401.5347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5347","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5347v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5347","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"WJSIQFEL35FI","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WJSIQFEL35FIB7TT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WJSIQFEL","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WJSIQFEL35FIB7TTRNGDAYQFF7","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:27:07Z","cross_cats_sorted":[],"title_canon_sha256":"3159c10648826817ac2622725fb8187237d9b7f20105567ef7c5afe43d5b2cbf","abstract_canon_sha256":"6c641d728c55e9808b53c8fb8521425b7606993f598571510836ac1180b853e0"},"schema_version":"1.0"},"canonical_sha256":"b26488148bdf4a80fe738b4c3062052fec94a38fa37aebec5911e4c12ce8abb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.079771Z","signature_b64":"q7ynGK12cEBG19XZ4LY7dD0eQWQeZab+hBjHSaYo21fBnNvW5Xh9jtrNYBqtlTU2wC52DN0Vss+jooSIzarwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b26488148bdf4a80fe738b4c3062052fec94a38fa37aebec5911e4c12ce8abb6","last_reissued_at":"2026-05-18T03:01:34.079215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.079215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5347","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":"xSgLHq/De5c51oH4zA6ZwMmHoAat3Z84wYTdie1wrZLhECy6GCsWa10HR/gpG3uwlNYyIFktVSeCEAI0h2NHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:28:24.421968Z"},"content_sha256":"38365d2176f381267cbecd59f8b003c3984669c4eb09bc7830a1129a04712014","schema_version":"1.0","event_id":"sha256:38365d2176f381267cbecd59f8b003c3984669c4eb09bc7830a1129a04712014"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WJSIQFEL35FIB7TTRNGDAYQFF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Ranking for Linear Lasso Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Podelski, Jan Leike, Jochen Hoenicke, Matthias Heizmann","submitted_at":"2014-01-21T15:27:07Z","abstract_excerpt":"The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and an invariant. We present the---to the best of our knowledge---first method to synthesize termination arguments for lasso programs that uses linear arithmetic. We prove a completeness theorem. The completeness theorem establishes that, even though we use only linear (as opposed to non-linear) constraint solving, we are able to compute termination arguments in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5347","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":"OHl7EnTyOqauPKfoMIRpsRX2t/49evxqZWQg5CUdKRgzoEKCmUIgyuse+wY/6fYJwZeykaL9mXNw+y92l+IGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:28:24.422303Z"},"content_sha256":"b8a8edde8319ace83b6060d4a74d4ff0f38ee8490ffbb76e1436c619fa45c1a7","schema_version":"1.0","event_id":"sha256:b8a8edde8319ace83b6060d4a74d4ff0f38ee8490ffbb76e1436c619fa45c1a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/bundle.json","state_url":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/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-06-22T13:28:24Z","links":{"resolver":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7","bundle":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/bundle.json","state":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WJSIQFEL35FIB7TTRNGDAYQFF7","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":"6c641d728c55e9808b53c8fb8521425b7606993f598571510836ac1180b853e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:27:07Z","title_canon_sha256":"3159c10648826817ac2622725fb8187237d9b7f20105567ef7c5afe43d5b2cbf"},"schema_version":"1.0","source":{"id":"1401.5347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5347","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5347v1","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5347","created_at":"2026-05-18T03:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"WJSIQFEL35FI","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WJSIQFEL35FIB7TT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WJSIQFEL","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:b8a8edde8319ace83b6060d4a74d4ff0f38ee8490ffbb76e1436c619fa45c1a7","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":"The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and an invariant. We present the---to the best of our knowledge---first method to synthesize termination arguments for lasso programs that uses linear arithmetic. We prove a completeness theorem. The completeness theorem establishes that, even though we use only linear (as opposed to non-linear) constraint solving, we are able to compute termination arguments in","authors_text":"Andreas Podelski, Jan Leike, Jochen Hoenicke, Matthias Heizmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:27:07Z","title":"Linear Ranking for Linear Lasso Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5347","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:38365d2176f381267cbecd59f8b003c3984669c4eb09bc7830a1129a04712014","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":"6c641d728c55e9808b53c8fb8521425b7606993f598571510836ac1180b853e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-21T15:27:07Z","title_canon_sha256":"3159c10648826817ac2622725fb8187237d9b7f20105567ef7c5afe43d5b2cbf"},"schema_version":"1.0","source":{"id":"1401.5347","kind":"arxiv","version":1}},"canonical_sha256":"b26488148bdf4a80fe738b4c3062052fec94a38fa37aebec5911e4c12ce8abb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b26488148bdf4a80fe738b4c3062052fec94a38fa37aebec5911e4c12ce8abb6","first_computed_at":"2026-05-18T03:01:34.079215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:34.079215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q7ynGK12cEBG19XZ4LY7dD0eQWQeZab+hBjHSaYo21fBnNvW5Xh9jtrNYBqtlTU2wC52DN0Vss+jooSIzarwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:34.079771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38365d2176f381267cbecd59f8b003c3984669c4eb09bc7830a1129a04712014","sha256:b8a8edde8319ace83b6060d4a74d4ff0f38ee8490ffbb76e1436c619fa45c1a7"],"state_sha256":"56247eb01ef5239af72b007c987371f23e507173e8a26610d6e5ff266daa389b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PaWRmCFGAsPpRM0mH7jKGDaPjhSSKOH2PgrQdezUgH0EYa+JJlF9mSHWVHpPYSoEBvX5xgdKXs34g2wvohqSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:28:24.424155Z","bundle_sha256":"0b07de5ce81dd5ba35098aea99f3553e16bcebf212c548d7a5a2b94ec70621d5"}}