{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3NLT55KXFCC4UHO25ZE46UVWWF","short_pith_number":"pith:3NLT55KX","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"},"canonical_sha256":"db573ef5572885ca1ddaee49cf52b6b15bdf7f9010d861e97f2c8a47cc65cf20","source":{"kind":"arxiv","id":"1905.06495","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06495","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06495v2","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06495","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"3NLT55KXFCC4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3NLT55KXFCC4UHO2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3NLT55KX","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3NLT55KXFCC4UHO25ZE46UVWWF","target":"record","payload":{"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"},"canonical_sha256":"db573ef5572885ca1ddaee49cf52b6b15bdf7f9010d861e97f2c8a47cc65cf20","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"},"source_kind":"arxiv","source_id":"1905.06495","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-17T23:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVFVR0Xf9mjTwH/rFdo362Svd982jO6Pq/tmHeIRxsDiXC+oP/fvw7+xQwPrxtvuoB2YXAvV0Nt1xiM8ZSGGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:53:34.126633Z"},"content_sha256":"5d2ba5e62e3e4a008a31d4cd568d37b38cfc97bad5546812acce23f9c1d6ab51","schema_version":"1.0","event_id":"sha256:5d2ba5e62e3e4a008a31d4cd568d37b38cfc97bad5546812acce23f9c1d6ab51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3NLT55KXFCC4UHO25ZE46UVWWF","target":"graph","payload":{"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"},"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-17T23:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPgsJOP1SsSR0LJnxrFwwvGAcA3ajfBBhbgd28hLLMUfpVsgMcwZ7JWTFdvlgZiPcPLjRjMffFHOcPM/qTvABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:53:34.126975Z"},"content_sha256":"54c21b2a05c8cd2bfe097d5dd75058193ceeffe76ee0862b7884c0367a48babd","schema_version":"1.0","event_id":"sha256:54c21b2a05c8cd2bfe097d5dd75058193ceeffe76ee0862b7884c0367a48babd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF/bundle.json","state_url":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NLT55KXFCC4UHO25ZE46UVWWF/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-25T12:53:34Z","links":{"resolver":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF","bundle":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF/bundle.json","state":"https://pith.science/pith/3NLT55KXFCC4UHO25ZE46UVWWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NLT55KXFCC4UHO25ZE46UVWWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3NLT55KXFCC4UHO25ZE46UVWWF","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":"c53c25345fadddac8c37f735a358ddf31099e597ff65137e557f4b0dd6623255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-16T02:00:42Z","title_canon_sha256":"5315a74bac5da9693a8e7818eaca380df1ea231ed6729386bc4d64acb5dabc6e"},"schema_version":"1.0","source":{"id":"1905.06495","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06495","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06495v2","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06495","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"3NLT55KXFCC4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3NLT55KXFCC4UHO2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3NLT55KX","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:54c21b2a05c8cd2bfe097d5dd75058193ceeffe76ee0862b7884c0367a48babd","target":"graph","created_at":"2026-05-17T23:40:43Z","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":"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 ","authors_text":"Jake Silverman, Zachary Kincaid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-16T02:00:42Z","title":"Loop Summarization with Rational Vector Addition Systems (extended version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06495","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:5d2ba5e62e3e4a008a31d4cd568d37b38cfc97bad5546812acce23f9c1d6ab51","target":"record","created_at":"2026-05-17T23:40:43Z","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":"c53c25345fadddac8c37f735a358ddf31099e597ff65137e557f4b0dd6623255","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-16T02:00:42Z","title_canon_sha256":"5315a74bac5da9693a8e7818eaca380df1ea231ed6729386bc4d64acb5dabc6e"},"schema_version":"1.0","source":{"id":"1905.06495","kind":"arxiv","version":2}},"canonical_sha256":"db573ef5572885ca1ddaee49cf52b6b15bdf7f9010d861e97f2c8a47cc65cf20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db573ef5572885ca1ddaee49cf52b6b15bdf7f9010d861e97f2c8a47cc65cf20","first_computed_at":"2026-05-17T23:40:43.250168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:43.250168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RbMQoyZ8iyKYjl63YXqE22Zo6920ysRjdp+bySgeyMEEgC4qysj5yhu+n1M3vAFw4YbSkXWNRSu6nXc+tuVPBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:43.250768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.06495","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d2ba5e62e3e4a008a31d4cd568d37b38cfc97bad5546812acce23f9c1d6ab51","sha256:54c21b2a05c8cd2bfe097d5dd75058193ceeffe76ee0862b7884c0367a48babd"],"state_sha256":"b57cac419948155d26b31d68d055f4b6b1a373ca53e29ae8da43dd6b8fa7958c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FSGrcpPM0yjN2d8Zdpa7blTnyjaR8cYH1C94ZU8w3Fq1d9t5TVfN8+Z9nEk9mIswBaOtJf1wKZG+kAmGoHlTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:53:34.128891Z","bundle_sha256":"0eb58ee81fdb2b432c9f6ae8d04a90e1be11cc700db129d350ab92bf52be9a64"}}