{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3NLT55KXFCC4UHO25ZE46UVWWF","short_pith_number":"pith:3NLT55KX","schema_version":"1.0","canonical_sha256":"db573ef5572885ca1ddaee49cf52b6b15bdf7f9010d861e97f2c8a47cc65cf20","source":{"kind":"arxiv","id":"1905.06495","version":2},"attestation_state":"computed","paper":{"title":"Loop Summarization with Rational Vector Addition Systems (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jake Silverman, Zachary Kincaid","submitted_at":"2019-05-16T02:00:42Z","abstract_excerpt":"This paper presents a technique for computing numerical loop summaries. The method synthesizes a rational vector addition system with resets (Q-VASR) that simulates the action of an input loop, and then uses the reachability relation of that Q-VASR to over-approximate the behavior of the loop. The key technical problem solved in this paper is to automatically synthesize a Q-VASR that is a best abstraction of a given loop in the sense that (1) it simulates the loop and (2) it is simulated by any other Q-VASR that simulates the loop. Since our loop summarization scheme is based on computing the "},"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":"1905.06495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-16T02:00:42Z","cross_cats_sorted":[],"title_canon_sha256":"5315a74bac5da9693a8e7818eaca380df1ea231ed6729386bc4d64acb5dabc6e","abstract_canon_sha256":"c53c25345fadddac8c37f735a358ddf31099e597ff65137e557f4b0dd6623255"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:43.250768Z","signature_b64":"RbMQoyZ8iyKYjl63YXqE22Zo6920ysRjdp+bySgeyMEEgC4qysj5yhu+n1M3vAFw4YbSkXWNRSu6nXc+tuVPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db573ef5572885ca1ddaee49cf52b6b15bdf7f9010d861e97f2c8a47cc65cf20","last_reissued_at":"2026-05-17T23:40:43.250168Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:43.250168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Loop Summarization with Rational Vector Addition Systems (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Jake Silverman, Zachary Kincaid","submitted_at":"2019-05-16T02:00:42Z","abstract_excerpt":"This paper presents a technique for computing numerical loop summaries. The method synthesizes a rational vector addition system with resets (Q-VASR) that simulates the action of an input loop, and then uses the reachability relation of that Q-VASR to over-approximate the behavior of the loop. The key technical problem solved in this paper is to automatically synthesize a Q-VASR that is a best abstraction of a given loop in the sense that (1) it simulates the loop and (2) it is simulated by any other Q-VASR that simulates the loop. Since our loop summarization scheme is based on computing the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06495","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.06495","created_at":"2026-05-17T23:40:43.250246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.06495v2","created_at":"2026-05-17T23:40:43.250246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06495","created_at":"2026-05-17T23:40:43.250246+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NLT55KXFCC4","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NLT55KXFCC4UHO2","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NLT55KX","created_at":"2026-05-18T12:33:07.085635+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/3NLT55KXFCC4UHO25ZE46UVWWF","json":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF.json","graph_json":"https://pith.science/api/pith-number/3NLT55KXFCC4UHO25ZE46UVWWF/graph.json","events_json":"https://pith.science/api/pith-number/3NLT55KXFCC4UHO25ZE46UVWWF/events.json","paper":"https://pith.science/paper/3NLT55KX"},"agent_actions":{"view_html":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF","download_json":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF.json","view_paper":"https://pith.science/paper/3NLT55KX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.06495&json=true","fetch_graph":"https://pith.science/api/pith-number/3NLT55KXFCC4UHO25ZE46UVWWF/graph.json","fetch_events":"https://pith.science/api/pith-number/3NLT55KXFCC4UHO25ZE46UVWWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF/action/storage_attestation","attest_author":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF/action/author_attestation","sign_citation":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF/action/citation_signature","submit_replication":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF/action/replication_record"}},"created_at":"2026-05-17T23:40:43.250246+00:00","updated_at":"2026-05-17T23:40:43.250246+00:00"}