{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M4CST6AF4ABNSDAC3IYGUY5FGT","short_pith_number":"pith:M4CST6AF","canonical_record":{"source":{"id":"1804.04766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-13T01:57:35Z","cross_cats_sorted":[],"title_canon_sha256":"1f602bbb87eb684c618bb6d14318046dd59fd9043428154ce799a67882bdeffa","abstract_canon_sha256":"9993b0355cd15ba4318ff123c5217b6b54bd01dbb662b0d0a19d952c8315998e"},"schema_version":"1.0"},"canonical_sha256":"670529f805e002d90c02da306a63a534f6f2b2234d781c8d9c15b1fb47f11f33","source":{"kind":"arxiv","id":"1804.04766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04766","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04766v1","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04766","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"pith_short_12","alias_value":"M4CST6AF4ABN","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M4CST6AF4ABNSDAC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M4CST6AF","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M4CST6AF4ABNSDAC3IYGUY5FGT","target":"record","payload":{"canonical_record":{"source":{"id":"1804.04766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-13T01:57:35Z","cross_cats_sorted":[],"title_canon_sha256":"1f602bbb87eb684c618bb6d14318046dd59fd9043428154ce799a67882bdeffa","abstract_canon_sha256":"9993b0355cd15ba4318ff123c5217b6b54bd01dbb662b0d0a19d952c8315998e"},"schema_version":"1.0"},"canonical_sha256":"670529f805e002d90c02da306a63a534f6f2b2234d781c8d9c15b1fb47f11f33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:35.050930Z","signature_b64":"2Dn394PyHkFkZrKc+Z9715nrJEjt6g1aEXe+1g1hXmnj4iUJAveFJ62SyrqGxkw6RWAR8wNdBUQR3VcAGF2SCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670529f805e002d90c02da306a63a534f6f2b2234d781c8d9c15b1fb47f11f33","last_reissued_at":"2026-05-18T00:18:35.050385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:35.050385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.04766","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:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78bIzF2HpW7wkAariMxWU9V4ful435vxur8svXz7KJko+X8zsOwE3v8WdIiXbEOW0R8k3rVyIJpWFLE/Z7+cCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:22:59.278212Z"},"content_sha256":"71b9ebac97252e28baf1705fcd7538746d37f376d44422d481d072903c5cc7f5","schema_version":"1.0","event_id":"sha256:71b9ebac97252e28baf1705fcd7538746d37f376d44422d481d072903c5cc7f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M4CST6AF4ABNSDAC3IYGUY5FGT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CUBA: Interprocedural Context-UnBounded Analysis of Concurrent Programs (Extended Manuscript)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Peizun Liu, Thomas Wahl","submitted_at":"2018-04-13T01:57:35Z","abstract_excerpt":"A classical result by Ramalingam about synchronization-sensitive interprocedural program analysis implies that reachability for concurrent threads running recursive procedures is undecidable. A technique proposed by Qadeer and Rehof, to bound the number of context switches allowed between the threads, leads to an incomplete solution that is, however, believed to catch \"most bugs\" in practice. The question whether the technique can also prove the absence of bugs at least in some cases has remained largely open.\n  In this paper we introduce a broad verification methodology for resource-parameter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04766","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:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0c9HRKg4oOMPx3ZE+5ygRggVF6w4DNYLDlRmQEgqurzUBqzrZkY+6r9Kufd5/gzK9u+y48kFUahYJFQiC+swCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:22:59.278563Z"},"content_sha256":"f2f612ae3211534a5ae4b9bf8b1e61edbed5d4692640f79140e34456d20ab347","schema_version":"1.0","event_id":"sha256:f2f612ae3211534a5ae4b9bf8b1e61edbed5d4692640f79140e34456d20ab347"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4CST6AF4ABNSDAC3IYGUY5FGT/bundle.json","state_url":"https://pith.science/pith/M4CST6AF4ABNSDAC3IYGUY5FGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4CST6AF4ABNSDAC3IYGUY5FGT/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-29T21:22:59Z","links":{"resolver":"https://pith.science/pith/M4CST6AF4ABNSDAC3IYGUY5FGT","bundle":"https://pith.science/pith/M4CST6AF4ABNSDAC3IYGUY5FGT/bundle.json","state":"https://pith.science/pith/M4CST6AF4ABNSDAC3IYGUY5FGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4CST6AF4ABNSDAC3IYGUY5FGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M4CST6AF4ABNSDAC3IYGUY5FGT","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":"9993b0355cd15ba4318ff123c5217b6b54bd01dbb662b0d0a19d952c8315998e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-13T01:57:35Z","title_canon_sha256":"1f602bbb87eb684c618bb6d14318046dd59fd9043428154ce799a67882bdeffa"},"schema_version":"1.0","source":{"id":"1804.04766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04766","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04766v1","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04766","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"pith_short_12","alias_value":"M4CST6AF4ABN","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M4CST6AF4ABNSDAC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M4CST6AF","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:f2f612ae3211534a5ae4b9bf8b1e61edbed5d4692640f79140e34456d20ab347","target":"graph","created_at":"2026-05-18T00:18:35Z","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":"A classical result by Ramalingam about synchronization-sensitive interprocedural program analysis implies that reachability for concurrent threads running recursive procedures is undecidable. A technique proposed by Qadeer and Rehof, to bound the number of context switches allowed between the threads, leads to an incomplete solution that is, however, believed to catch \"most bugs\" in practice. The question whether the technique can also prove the absence of bugs at least in some cases has remained largely open.\n  In this paper we introduce a broad verification methodology for resource-parameter","authors_text":"Peizun Liu, Thomas Wahl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-13T01:57:35Z","title":"CUBA: Interprocedural Context-UnBounded Analysis of Concurrent Programs (Extended Manuscript)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04766","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:71b9ebac97252e28baf1705fcd7538746d37f376d44422d481d072903c5cc7f5","target":"record","created_at":"2026-05-18T00:18:35Z","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":"9993b0355cd15ba4318ff123c5217b6b54bd01dbb662b0d0a19d952c8315998e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-04-13T01:57:35Z","title_canon_sha256":"1f602bbb87eb684c618bb6d14318046dd59fd9043428154ce799a67882bdeffa"},"schema_version":"1.0","source":{"id":"1804.04766","kind":"arxiv","version":1}},"canonical_sha256":"670529f805e002d90c02da306a63a534f6f2b2234d781c8d9c15b1fb47f11f33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"670529f805e002d90c02da306a63a534f6f2b2234d781c8d9c15b1fb47f11f33","first_computed_at":"2026-05-18T00:18:35.050385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:35.050385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Dn394PyHkFkZrKc+Z9715nrJEjt6g1aEXe+1g1hXmnj4iUJAveFJ62SyrqGxkw6RWAR8wNdBUQR3VcAGF2SCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:35.050930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.04766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71b9ebac97252e28baf1705fcd7538746d37f376d44422d481d072903c5cc7f5","sha256:f2f612ae3211534a5ae4b9bf8b1e61edbed5d4692640f79140e34456d20ab347"],"state_sha256":"b9da336a0734720c2f7637c6be6175e41886cbf9b6c181884427424e5743ea76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WHXCmvUg7bJIWH20GPDqf87dQINB4Z0KhGcDrClcZD7u3xCvbyezNj8lTKuwoFovW/QKGKSk5pKIv4LHKBgNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T21:22:59.280364Z","bundle_sha256":"a8d6a7bb8e2fbdfb3053b4dda0519c584825c8858344d57ff1379099da328508"}}