{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WJSIQFEL35FIB7TTRNGDAYQFF7","short_pith_number":"pith:WJSIQFEL","schema_version":"1.0","canonical_sha256":"b26488148bdf4a80fe738b4c3062052fec94a38fa37aebec5911e4c12ce8abb6","source":{"kind":"arxiv","id":"1401.5347","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.5347","created_at":"2026-05-18T03:01:34.079300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5347v1","created_at":"2026-05-18T03:01:34.079300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5347","created_at":"2026-05-18T03:01:34.079300+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJSIQFEL35FI","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJSIQFEL35FIB7TT","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJSIQFEL","created_at":"2026-05-18T12:28:54.890064+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/WJSIQFEL35FIB7TTRNGDAYQFF7","json":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7.json","graph_json":"https://pith.science/api/pith-number/WJSIQFEL35FIB7TTRNGDAYQFF7/graph.json","events_json":"https://pith.science/api/pith-number/WJSIQFEL35FIB7TTRNGDAYQFF7/events.json","paper":"https://pith.science/paper/WJSIQFEL"},"agent_actions":{"view_html":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7","download_json":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7.json","view_paper":"https://pith.science/paper/WJSIQFEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5347&json=true","fetch_graph":"https://pith.science/api/pith-number/WJSIQFEL35FIB7TTRNGDAYQFF7/graph.json","fetch_events":"https://pith.science/api/pith-number/WJSIQFEL35FIB7TTRNGDAYQFF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/action/storage_attestation","attest_author":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/action/author_attestation","sign_citation":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/action/citation_signature","submit_replication":"https://pith.science/pith/WJSIQFEL35FIB7TTRNGDAYQFF7/action/replication_record"}},"created_at":"2026-05-18T03:01:34.079300+00:00","updated_at":"2026-05-18T03:01:34.079300+00:00"}