{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q4UHGLRXXDUEPK6LNPPVK56ZBU","short_pith_number":"pith:Q4UHGLRX","canonical_record":{"source":{"id":"1808.00185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-01T06:29:17Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"d51502f5f832db9cd9654bb36c3c8260dbf20518b120d0b9e5a36357c402e974","abstract_canon_sha256":"9628293101af4f1b866d21096c5ea6a603651f39e9d112405c7f7a619471681d"},"schema_version":"1.0"},"canonical_sha256":"8728732e37b8e847abcb6bdf5577d90d17a7625d1d307a1eba19bb1b25a391e7","source":{"kind":"arxiv","id":"1808.00185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00185","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00185v1","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00185","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"Q4UHGLRXXDUE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q4UHGLRXXDUEPK6L","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q4UHGLRX","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q4UHGLRXXDUEPK6LNPPVK56ZBU","target":"record","payload":{"canonical_record":{"source":{"id":"1808.00185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-01T06:29:17Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"d51502f5f832db9cd9654bb36c3c8260dbf20518b120d0b9e5a36357c402e974","abstract_canon_sha256":"9628293101af4f1b866d21096c5ea6a603651f39e9d112405c7f7a619471681d"},"schema_version":"1.0"},"canonical_sha256":"8728732e37b8e847abcb6bdf5577d90d17a7625d1d307a1eba19bb1b25a391e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:08.484282Z","signature_b64":"9Vam/JI4rmY49FTMIqb8bgP/l9L7gfcnlTliecZvirknVeNyCBt5008Gq84vxATLXKV2JJHYaie0LLoakYZtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8728732e37b8e847abcb6bdf5577d90d17a7625d1d307a1eba19bb1b25a391e7","last_reissued_at":"2026-05-18T00:09:08.483687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:08.483687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.00185","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:09:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfwSjbMe59n8spsuJJovgWDqtBxRUXXBNBuzcx7mHMauDMmVzLUIN4qUwkwNKdYN5sOaA0L0J53DEgJdYIRHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:29:25.235948Z"},"content_sha256":"5575d16bb3771f06a2ff773931c743c92abb331650a8b47cb9faa46eb77ce448","schema_version":"1.0","event_id":"sha256:5575d16bb3771f06a2ff773931c743c92abb331650a8b47cb9faa46eb77ce448"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q4UHGLRXXDUEPK6LNPPVK56ZBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What Happens - After the First Race? Enhancing the Predictive Power of Happens - Before Based Dynamic Race Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Dileep Kini, Mahesh Viswanathan, Umang Mathur","submitted_at":"2018-08-01T06:29:17Z","abstract_excerpt":"Dynamic race detection is the problem of determining if an observed program execution reveals the presence of a data race in a program. The classical approach to solving this problem is to detect if there is a pair of conflicting memory accesses that are unordered by Lamport's happens-before (HB) relation. HB based race detection is known to not report false positives, i.e., it is sound. However, the soundness guarantee of HB only promises that the first pair of unordered, conflicting events is a schedulable data race. That is, there can be pairs of HB-unordered conflicting data accesses that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00185","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:09:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5DjgGtGmQQ8jBllTEe6CviO5s2B2ooc5aD9GViPEyDNjn9HvbGQiMWKxcGZWs3AYExdNJIK8o6X8zobduaXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:29:25.236297Z"},"content_sha256":"7fe989b1acfdf56b329fc2f277b1aa17ec1f947eb72337ad584f2c0f90f5cade","schema_version":"1.0","event_id":"sha256:7fe989b1acfdf56b329fc2f277b1aa17ec1f947eb72337ad584f2c0f90f5cade"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4UHGLRXXDUEPK6LNPPVK56ZBU/bundle.json","state_url":"https://pith.science/pith/Q4UHGLRXXDUEPK6LNPPVK56ZBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4UHGLRXXDUEPK6LNPPVK56ZBU/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-20T13:29:25Z","links":{"resolver":"https://pith.science/pith/Q4UHGLRXXDUEPK6LNPPVK56ZBU","bundle":"https://pith.science/pith/Q4UHGLRXXDUEPK6LNPPVK56ZBU/bundle.json","state":"https://pith.science/pith/Q4UHGLRXXDUEPK6LNPPVK56ZBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4UHGLRXXDUEPK6LNPPVK56ZBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q4UHGLRXXDUEPK6LNPPVK56ZBU","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":"9628293101af4f1b866d21096c5ea6a603651f39e9d112405c7f7a619471681d","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-01T06:29:17Z","title_canon_sha256":"d51502f5f832db9cd9654bb36c3c8260dbf20518b120d0b9e5a36357c402e974"},"schema_version":"1.0","source":{"id":"1808.00185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00185","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00185v1","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00185","created_at":"2026-05-18T00:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"Q4UHGLRXXDUE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q4UHGLRXXDUEPK6L","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q4UHGLRX","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:7fe989b1acfdf56b329fc2f277b1aa17ec1f947eb72337ad584f2c0f90f5cade","target":"graph","created_at":"2026-05-18T00:09:08Z","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":"Dynamic race detection is the problem of determining if an observed program execution reveals the presence of a data race in a program. The classical approach to solving this problem is to detect if there is a pair of conflicting memory accesses that are unordered by Lamport's happens-before (HB) relation. HB based race detection is known to not report false positives, i.e., it is sound. However, the soundness guarantee of HB only promises that the first pair of unordered, conflicting events is a schedulable data race. That is, there can be pairs of HB-unordered conflicting data accesses that ","authors_text":"Dileep Kini, Mahesh Viswanathan, Umang Mathur","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-01T06:29:17Z","title":"What Happens - After the First Race? Enhancing the Predictive Power of Happens - Before Based Dynamic Race Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00185","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:5575d16bb3771f06a2ff773931c743c92abb331650a8b47cb9faa46eb77ce448","target":"record","created_at":"2026-05-18T00:09:08Z","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":"9628293101af4f1b866d21096c5ea6a603651f39e9d112405c7f7a619471681d","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-01T06:29:17Z","title_canon_sha256":"d51502f5f832db9cd9654bb36c3c8260dbf20518b120d0b9e5a36357c402e974"},"schema_version":"1.0","source":{"id":"1808.00185","kind":"arxiv","version":1}},"canonical_sha256":"8728732e37b8e847abcb6bdf5577d90d17a7625d1d307a1eba19bb1b25a391e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8728732e37b8e847abcb6bdf5577d90d17a7625d1d307a1eba19bb1b25a391e7","first_computed_at":"2026-05-18T00:09:08.483687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:08.483687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Vam/JI4rmY49FTMIqb8bgP/l9L7gfcnlTliecZvirknVeNyCBt5008Gq84vxATLXKV2JJHYaie0LLoakYZtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:08.484282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.00185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5575d16bb3771f06a2ff773931c743c92abb331650a8b47cb9faa46eb77ce448","sha256:7fe989b1acfdf56b329fc2f277b1aa17ec1f947eb72337ad584f2c0f90f5cade"],"state_sha256":"854e6676896b731a9a5afc1024b2ac18180ea7da8eb1d6e7c66d864169d5c8a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yO6c0+SYinyoJULAA0W68UklKo5oHjy5O8QekFuoFoW82zijtK2vd7EzAdHDOhSbLkUwcPvf1ONCwyKO/i8CBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T13:29:25.238271Z","bundle_sha256":"dd3eea55cbc1ffbac57f413705df242f5324c08036fc8a587eb28772d0150ba0"}}