{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HWSUKMV7GGFWDW6TSFB3LK44NZ","short_pith_number":"pith:HWSUKMV7","canonical_record":{"source":{"id":"1804.06612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-18T09:11:10Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f08fe8cb9f56dcc10012c49e8048b0c6557f20cef980cb2b9372e2da858816cc","abstract_canon_sha256":"314b4c7626bcf750a5337ce0b7e085960a7f6a75ef035afd2003d0d58fe3bd61"},"schema_version":"1.0"},"canonical_sha256":"3da54532bf318b61dbd39143b5ab9c6e4056cb9e061fb5a9bf471680535ddca8","source":{"kind":"arxiv","id":"1804.06612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06612","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06612v1","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06612","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"HWSUKMV7GGFW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HWSUKMV7GGFWDW6T","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HWSUKMV7","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HWSUKMV7GGFWDW6TSFB3LK44NZ","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-18T09:11:10Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f08fe8cb9f56dcc10012c49e8048b0c6557f20cef980cb2b9372e2da858816cc","abstract_canon_sha256":"314b4c7626bcf750a5337ce0b7e085960a7f6a75ef035afd2003d0d58fe3bd61"},"schema_version":"1.0"},"canonical_sha256":"3da54532bf318b61dbd39143b5ab9c6e4056cb9e061fb5a9bf471680535ddca8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:03.612531Z","signature_b64":"OFnLtSfXSXlolR8WgH+nW4BDUIGJaJBG2oDWhuQ44aDxnfI7K03hcgc9rZRPD+7xmHQlD4wwhdQLVhq+zwl6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3da54532bf318b61dbd39143b5ab9c6e4056cb9e061fb5a9bf471680535ddca8","last_reissued_at":"2026-05-18T00:18:03.612022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:03.612022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06612","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-18T00:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39e2RgCW6ynpVdAou8Bf41D3f+e+Zk1Phl2UYYaZIUsY+L/oApUM5g3sc35n0v752YQWIIfgaIRyr0CPVmOUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:48:30.083110Z"},"content_sha256":"4e1710e222144370e9fec2d75fbdfe4abecd1921d17e05763d79b698c6d88a78","schema_version":"1.0","event_id":"sha256:4e1710e222144370e9fec2d75fbdfe4abecd1921d17e05763d79b698c6d88a78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HWSUKMV7GGFWDW6TSFB3LK44NZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Ahmed Bouajjani, Constantin Enea, Kailiang Ji, Shaz Qadeer","submitted_at":"2018-04-18T09:11:10Z","abstract_excerpt":"We address the problem of verifying message passing programs, defined as a set of parallel processes communicating through unbounded FIFO buffers. We introduce a bounded analysis that explores a special type of computations, called k-synchronous. These computations can be viewed as (unbounded) sequences of interaction phases, each phase allowing at most k send actions (by different processes), followed by a sequence of receives corresponding to sends in the same phase. We give a procedure for deciding k-synchronizability of a program, i.e., whether every computation is equivalent (has the same"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06612","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-18T00:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sZcSaQjD4bqB8p1N2t3boCJJfnyA4xtdOc0NsX7vSNvlD9OaAWjA22WWSmfLIuHweGgs0AcxVK8Z+k3iVCbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:48:30.083796Z"},"content_sha256":"8b088e82ff8b3318cfeefd5eb183fc164ae57afbee7f1b0206a1030222113fc0","schema_version":"1.0","event_id":"sha256:8b088e82ff8b3318cfeefd5eb183fc164ae57afbee7f1b0206a1030222113fc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWSUKMV7GGFWDW6TSFB3LK44NZ/bundle.json","state_url":"https://pith.science/pith/HWSUKMV7GGFWDW6TSFB3LK44NZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWSUKMV7GGFWDW6TSFB3LK44NZ/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-05-26T01:48:30Z","links":{"resolver":"https://pith.science/pith/HWSUKMV7GGFWDW6TSFB3LK44NZ","bundle":"https://pith.science/pith/HWSUKMV7GGFWDW6TSFB3LK44NZ/bundle.json","state":"https://pith.science/pith/HWSUKMV7GGFWDW6TSFB3LK44NZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWSUKMV7GGFWDW6TSFB3LK44NZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HWSUKMV7GGFWDW6TSFB3LK44NZ","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":"314b4c7626bcf750a5337ce0b7e085960a7f6a75ef035afd2003d0d58fe3bd61","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-18T09:11:10Z","title_canon_sha256":"f08fe8cb9f56dcc10012c49e8048b0c6557f20cef980cb2b9372e2da858816cc"},"schema_version":"1.0","source":{"id":"1804.06612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06612","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06612v1","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06612","created_at":"2026-05-18T00:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"HWSUKMV7GGFW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HWSUKMV7GGFWDW6T","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HWSUKMV7","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:8b088e82ff8b3318cfeefd5eb183fc164ae57afbee7f1b0206a1030222113fc0","target":"graph","created_at":"2026-05-18T00:18:03Z","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 verifying message passing programs, defined as a set of parallel processes communicating through unbounded FIFO buffers. We introduce a bounded analysis that explores a special type of computations, called k-synchronous. These computations can be viewed as (unbounded) sequences of interaction phases, each phase allowing at most k send actions (by different processes), followed by a sequence of receives corresponding to sends in the same phase. We give a procedure for deciding k-synchronizability of a program, i.e., whether every computation is equivalent (has the same","authors_text":"Ahmed Bouajjani, Constantin Enea, Kailiang Ji, Shaz Qadeer","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-18T09:11:10Z","title":"On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06612","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:4e1710e222144370e9fec2d75fbdfe4abecd1921d17e05763d79b698c6d88a78","target":"record","created_at":"2026-05-18T00:18:03Z","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":"314b4c7626bcf750a5337ce0b7e085960a7f6a75ef035afd2003d0d58fe3bd61","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-18T09:11:10Z","title_canon_sha256":"f08fe8cb9f56dcc10012c49e8048b0c6557f20cef980cb2b9372e2da858816cc"},"schema_version":"1.0","source":{"id":"1804.06612","kind":"arxiv","version":1}},"canonical_sha256":"3da54532bf318b61dbd39143b5ab9c6e4056cb9e061fb5a9bf471680535ddca8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3da54532bf318b61dbd39143b5ab9c6e4056cb9e061fb5a9bf471680535ddca8","first_computed_at":"2026-05-18T00:18:03.612022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:03.612022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OFnLtSfXSXlolR8WgH+nW4BDUIGJaJBG2oDWhuQ44aDxnfI7K03hcgc9rZRPD+7xmHQlD4wwhdQLVhq+zwl6AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:03.612531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e1710e222144370e9fec2d75fbdfe4abecd1921d17e05763d79b698c6d88a78","sha256:8b088e82ff8b3318cfeefd5eb183fc164ae57afbee7f1b0206a1030222113fc0"],"state_sha256":"c97b583e5bd27dbe0438c957b4a567ff1961bd51d467a25ac0696bd9a4752c7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZKVQbTHNV+7w5eHMfPOwvShcwH6+iz7iHVCeAUsZahJJjaKMBxkQkhgvN5EHfHghe8UAurzNI27xXdFS4zgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:48:30.087781Z","bundle_sha256":"491edca4b3966f420b7710422bcb702d8aff36c53a206966c5bc52c772412417"}}