{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3FUVJTMU7AX7JS5N7NSQFCVXR7","short_pith_number":"pith:3FUVJTMU","canonical_record":{"source":{"id":"1905.09996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-24T01:48:26Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"03c53a61eb9b5dab60ae91ad3e06b526c00e2594e62f82f7e1db892ba167a5ea","abstract_canon_sha256":"3ef9d44378f2338f9c577f95ad5e9b1359db0c78ec509e8886feef64f05a9bed"},"schema_version":"1.0"},"canonical_sha256":"d96954cd94f82ff4cbadfb65028ab78fda66c04b1ffa039944241a4a0927d358","source":{"kind":"arxiv","id":"1905.09996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09996","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09996v1","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09996","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"3FUVJTMU7AX7","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3FUVJTMU7AX7JS5N","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3FUVJTMU","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3FUVJTMU7AX7JS5N7NSQFCVXR7","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-24T01:48:26Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"03c53a61eb9b5dab60ae91ad3e06b526c00e2594e62f82f7e1db892ba167a5ea","abstract_canon_sha256":"3ef9d44378f2338f9c577f95ad5e9b1359db0c78ec509e8886feef64f05a9bed"},"schema_version":"1.0"},"canonical_sha256":"d96954cd94f82ff4cbadfb65028ab78fda66c04b1ffa039944241a4a0927d358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:13.814853Z","signature_b64":"/GRXqWFqCpGNdV/q4sWD6H0OvWYXZpbCNY87Vm10wd9F40sHDoYAz8soNXhgYKYNKX7xXah//HEGpKfa5ALLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d96954cd94f82ff4cbadfb65028ab78fda66c04b1ffa039944241a4a0927d358","last_reissued_at":"2026-05-17T23:45:13.814160Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:13.814160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09996","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-17T23:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFNcttwgYbCQ5VhtEWz50rVKLEv6b0bccLpeTFxicPOXArtC1q+3OsqNkl+EKJB+4AAl5j1nf2Tqs/dSKOe/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:56:23.405214Z"},"content_sha256":"36fcfd06855500305e3b19dc4d23c54859de118545f7a37d90438da24938753f","schema_version":"1.0","event_id":"sha256:36fcfd06855500305e3b19dc4d23c54859de118545f7a37d90438da24938753f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3FUVJTMU7AX7JS5N7NSQFCVXR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers (Extended Manuscript)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.PL","authors_text":"Akash Lal, Peizun Liu, Thomas Wahl","submitted_at":"2019-05-24T01:48:26Z","abstract_excerpt":"We address the problem of analyzing asynchronous event-driven programs, in which concurrent agents communicate via unbounded message queues. The safety verification problem for such programs is undecidable. We present in this paper a technique that combines queue-bounded exploration with a convergence test: if the sequence of certain abstractions of the reachable states, for increasing queue bounds k, converges, we can prove any property of the program that is preserved by the abstraction. If the abstract state space is finite, convergence is guaranteed; the challenge is to catch the point k_m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09996","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-17T23:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G//sQ/uypVAvwJB540exQWgBRTwmhiUXCNpgJqV1W0oJiZOgPZtDXuAe61IMHFNgEL0ClL/6GQfhYEn5Qf7MCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:56:23.405583Z"},"content_sha256":"0399b1393ee7ff3aed0f8e297616676bddee6a453958fffeabba80a107b34785","schema_version":"1.0","event_id":"sha256:0399b1393ee7ff3aed0f8e297616676bddee6a453958fffeabba80a107b34785"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FUVJTMU7AX7JS5N7NSQFCVXR7/bundle.json","state_url":"https://pith.science/pith/3FUVJTMU7AX7JS5N7NSQFCVXR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FUVJTMU7AX7JS5N7NSQFCVXR7/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-29T19:56:23Z","links":{"resolver":"https://pith.science/pith/3FUVJTMU7AX7JS5N7NSQFCVXR7","bundle":"https://pith.science/pith/3FUVJTMU7AX7JS5N7NSQFCVXR7/bundle.json","state":"https://pith.science/pith/3FUVJTMU7AX7JS5N7NSQFCVXR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FUVJTMU7AX7JS5N7NSQFCVXR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3FUVJTMU7AX7JS5N7NSQFCVXR7","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":"3ef9d44378f2338f9c577f95ad5e9b1359db0c78ec509e8886feef64f05a9bed","cross_cats_sorted":["cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-24T01:48:26Z","title_canon_sha256":"03c53a61eb9b5dab60ae91ad3e06b526c00e2594e62f82f7e1db892ba167a5ea"},"schema_version":"1.0","source":{"id":"1905.09996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09996","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09996v1","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09996","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"3FUVJTMU7AX7","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3FUVJTMU7AX7JS5N","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3FUVJTMU","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:0399b1393ee7ff3aed0f8e297616676bddee6a453958fffeabba80a107b34785","target":"graph","created_at":"2026-05-17T23:45:13Z","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 address the problem of analyzing asynchronous event-driven programs, in which concurrent agents communicate via unbounded message queues. The safety verification problem for such programs is undecidable. We present in this paper a technique that combines queue-bounded exploration with a convergence test: if the sequence of certain abstractions of the reachable states, for increasing queue bounds k, converges, we can prove any property of the program that is preserved by the abstraction. If the abstract state space is finite, convergence is guaranteed; the challenge is to catch the point k_m","authors_text":"Akash Lal, Peizun Liu, Thomas Wahl","cross_cats":["cs.FL","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-24T01:48:26Z","title":"Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers (Extended Manuscript)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09996","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:36fcfd06855500305e3b19dc4d23c54859de118545f7a37d90438da24938753f","target":"record","created_at":"2026-05-17T23:45:13Z","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":"3ef9d44378f2338f9c577f95ad5e9b1359db0c78ec509e8886feef64f05a9bed","cross_cats_sorted":["cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-24T01:48:26Z","title_canon_sha256":"03c53a61eb9b5dab60ae91ad3e06b526c00e2594e62f82f7e1db892ba167a5ea"},"schema_version":"1.0","source":{"id":"1905.09996","kind":"arxiv","version":1}},"canonical_sha256":"d96954cd94f82ff4cbadfb65028ab78fda66c04b1ffa039944241a4a0927d358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d96954cd94f82ff4cbadfb65028ab78fda66c04b1ffa039944241a4a0927d358","first_computed_at":"2026-05-17T23:45:13.814160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:13.814160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/GRXqWFqCpGNdV/q4sWD6H0OvWYXZpbCNY87Vm10wd9F40sHDoYAz8soNXhgYKYNKX7xXah//HEGpKfa5ALLDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:13.814853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36fcfd06855500305e3b19dc4d23c54859de118545f7a37d90438da24938753f","sha256:0399b1393ee7ff3aed0f8e297616676bddee6a453958fffeabba80a107b34785"],"state_sha256":"4aae159c6fc73bd72dfa75cd0f43e8fadc06c80c7906d5939a5ab07cc1b21895"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qy4bOr0tclgWKggDrso5EagEaUlavWpub8W3g4+5CF5C6D0xkugh2ZXt5wAaCJsSmw1hiRhOlcQciHt24s6xAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:56:23.407519Z","bundle_sha256":"f57dcbe6cc3aa7c8389bfa4a74099c5a8c4877c2c703b2f94d5627b20e5cf847"}}