{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:AMZ3KMHXPK3ZF5G46QGPHWUMZ2","short_pith_number":"pith:AMZ3KMHX","canonical_record":{"source":{"id":"2101.10233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-01-25T16:49:17Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"8f6d7cb717914e22e52b89d820f3db9b679112f924e684119ab50c396ba11d31","abstract_canon_sha256":"b84159603a7d3b9129c6e50779863853ab0f106a8b988d9b08853cfe77bf25d2"},"schema_version":"1.0"},"canonical_sha256":"0333b530f77ab792f4dcf40cf3da8cce9fd6ff1fc37a4ac39dee6b3b16e935fb","source":{"kind":"arxiv","id":"2101.10233","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.10233","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"arxiv_version","alias_value":"2101.10233v1","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.10233","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"pith_short_12","alias_value":"AMZ3KMHXPK3Z","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"pith_short_16","alias_value":"AMZ3KMHXPK3ZF5G4","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"pith_short_8","alias_value":"AMZ3KMHX","created_at":"2026-07-05T02:09:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:AMZ3KMHXPK3ZF5G46QGPHWUMZ2","target":"record","payload":{"canonical_record":{"source":{"id":"2101.10233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-01-25T16:49:17Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"8f6d7cb717914e22e52b89d820f3db9b679112f924e684119ab50c396ba11d31","abstract_canon_sha256":"b84159603a7d3b9129c6e50779863853ab0f106a8b988d9b08853cfe77bf25d2"},"schema_version":"1.0"},"canonical_sha256":"0333b530f77ab792f4dcf40cf3da8cce9fd6ff1fc37a4ac39dee6b3b16e935fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:27.067770Z","signature_b64":"4egF3SDGxY0i9I2ueI5RUYf0+72eE486+PRN832p0lhKtjxTS05hteqHbT1pftR2kzW1+n08dUEjK3COXoDgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0333b530f77ab792f4dcf40cf3da8cce9fd6ff1fc37a4ac39dee6b3b16e935fb","last_reissued_at":"2026-07-05T02:09:27.067359Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:27.067359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.10233","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-07-05T02:09:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POnVflyjIXMBcJz/u3baKE44p9+ap0G3E0ng85xHNtGqOJbzSDt4q63WRnw/OgG22RrAv345gejcP9gjsIjTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:56:49.921763Z"},"content_sha256":"8fba26f0a5791e1522545cfcf4fc7b4b07935422ce1db109ff04810740f7071d","schema_version":"1.0","event_id":"sha256:8fba26f0a5791e1522545cfcf4fc7b4b07935422ce1db109ff04810740f7071d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:AMZ3KMHXPK3ZF5G46QGPHWUMZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"K Narayan Kumar, Raghavan Komondoor, Snigdha Athaiya","submitted_at":"2021-01-25T16:49:17Z","abstract_excerpt":"Asynchronous message-passing systems are employed frequently to implement distributed mechanisms, protocols, and processes. This paper addresses the problem of precise data flow analysis for such systems. To obtain good precision, data flow analysis needs to somehow skip execution paths that read more messages than the number of messages sent so far in the path, as such paths are infeasible at run time. Existing data flow analysis techniques do elide a subset of such infeasible paths, but have the restriction that they admit only finite abstract analysis domains. In this paper we propose a gen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.10233","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.10233/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:09:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3wXY2snBDC+gLRYLrw7OcJXk69BxCgxtrQGOdpc6Y2IfB+AB783xf0UUUpc9z/LA0zbuIljuVvQ3OSjBChXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:56:49.922598Z"},"content_sha256":"7ef52948454cd094ab767d6c5992ae5d3f050ea3d44a4161fb6060e40c953a35","schema_version":"1.0","event_id":"sha256:7ef52948454cd094ab767d6c5992ae5d3f050ea3d44a4161fb6060e40c953a35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMZ3KMHXPK3ZF5G46QGPHWUMZ2/bundle.json","state_url":"https://pith.science/pith/AMZ3KMHXPK3ZF5G46QGPHWUMZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMZ3KMHXPK3ZF5G46QGPHWUMZ2/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-08-03T21:56:49Z","links":{"resolver":"https://pith.science/pith/AMZ3KMHXPK3ZF5G46QGPHWUMZ2","bundle":"https://pith.science/pith/AMZ3KMHXPK3ZF5G46QGPHWUMZ2/bundle.json","state":"https://pith.science/pith/AMZ3KMHXPK3ZF5G46QGPHWUMZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMZ3KMHXPK3ZF5G46QGPHWUMZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:AMZ3KMHXPK3ZF5G46QGPHWUMZ2","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":"b84159603a7d3b9129c6e50779863853ab0f106a8b988d9b08853cfe77bf25d2","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-01-25T16:49:17Z","title_canon_sha256":"8f6d7cb717914e22e52b89d820f3db9b679112f924e684119ab50c396ba11d31"},"schema_version":"1.0","source":{"id":"2101.10233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.10233","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"arxiv_version","alias_value":"2101.10233v1","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.10233","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"pith_short_12","alias_value":"AMZ3KMHXPK3Z","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"pith_short_16","alias_value":"AMZ3KMHXPK3ZF5G4","created_at":"2026-07-05T02:09:27Z"},{"alias_kind":"pith_short_8","alias_value":"AMZ3KMHX","created_at":"2026-07-05T02:09:27Z"}],"graph_snapshots":[{"event_id":"sha256:7ef52948454cd094ab767d6c5992ae5d3f050ea3d44a4161fb6060e40c953a35","target":"graph","created_at":"2026-07-05T02:09:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.10233/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Asynchronous message-passing systems are employed frequently to implement distributed mechanisms, protocols, and processes. This paper addresses the problem of precise data flow analysis for such systems. To obtain good precision, data flow analysis needs to somehow skip execution paths that read more messages than the number of messages sent so far in the path, as such paths are infeasible at run time. Existing data flow analysis techniques do elide a subset of such infeasible paths, but have the restriction that they admit only finite abstract analysis domains. In this paper we propose a gen","authors_text":"K Narayan Kumar, Raghavan Komondoor, Snigdha Athaiya","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-01-25T16:49:17Z","title":"Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.10233","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:8fba26f0a5791e1522545cfcf4fc7b4b07935422ce1db109ff04810740f7071d","target":"record","created_at":"2026-07-05T02:09:27Z","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":"b84159603a7d3b9129c6e50779863853ab0f106a8b988d9b08853cfe77bf25d2","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-01-25T16:49:17Z","title_canon_sha256":"8f6d7cb717914e22e52b89d820f3db9b679112f924e684119ab50c396ba11d31"},"schema_version":"1.0","source":{"id":"2101.10233","kind":"arxiv","version":1}},"canonical_sha256":"0333b530f77ab792f4dcf40cf3da8cce9fd6ff1fc37a4ac39dee6b3b16e935fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0333b530f77ab792f4dcf40cf3da8cce9fd6ff1fc37a4ac39dee6b3b16e935fb","first_computed_at":"2026-07-05T02:09:27.067359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:09:27.067359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4egF3SDGxY0i9I2ueI5RUYf0+72eE486+PRN832p0lhKtjxTS05hteqHbT1pftR2kzW1+n08dUEjK3COXoDgBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:09:27.067770Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.10233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fba26f0a5791e1522545cfcf4fc7b4b07935422ce1db109ff04810740f7071d","sha256:7ef52948454cd094ab767d6c5992ae5d3f050ea3d44a4161fb6060e40c953a35"],"state_sha256":"37d3b4a86f935cad450185939533a67f02bbb66ee6339a3c36038c0bd4380c25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfA7/q3MPtCZI55PHFsajERNz5zsG1xYrocV6YmLVM0mqkYNl+RTLdvBgsYex/udomLywoBqt8v/PexxVcp4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T21:56:49.928450Z","bundle_sha256":"23c78bd31dd0b18f13e14fdcb46b7b6ff29ec6601d6a784aa7de3eb865205616"}}