{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:45U3BOGF2GOSFXZPXT6OQPH33H","short_pith_number":"pith:45U3BOGF","canonical_record":{"source":{"id":"1904.09283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-19T17:48:35Z","cross_cats_sorted":[],"title_canon_sha256":"aa1b88e69de8f25e983971948fd4eef9d6277d72cdd058309aa6193f4276405c","abstract_canon_sha256":"e7916354d0df027c2053c0ce21f6f3857529fbca7074b0e0983aed2c5e20b476"},"schema_version":"1.0"},"canonical_sha256":"e769b0b8c5d19d22df2fbcfce83cfbd9cc53170ea92ac9e25c8be111496c23b4","source":{"kind":"arxiv","id":"1904.09283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09283","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09283v1","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09283","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"45U3BOGF2GOS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"45U3BOGF2GOSFXZP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"45U3BOGF","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:45U3BOGF2GOSFXZPXT6OQPH33H","target":"record","payload":{"canonical_record":{"source":{"id":"1904.09283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-19T17:48:35Z","cross_cats_sorted":[],"title_canon_sha256":"aa1b88e69de8f25e983971948fd4eef9d6277d72cdd058309aa6193f4276405c","abstract_canon_sha256":"e7916354d0df027c2053c0ce21f6f3857529fbca7074b0e0983aed2c5e20b476"},"schema_version":"1.0"},"canonical_sha256":"e769b0b8c5d19d22df2fbcfce83cfbd9cc53170ea92ac9e25c8be111496c23b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:07.822766Z","signature_b64":"a5anB5SV6ztArDw+tcHtXSDAiOSYxB/CldikEEo27dQrj53xUTwmjM/9DboHddfVmS9VjDkNCdwxf3UhjbXQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e769b0b8c5d19d22df2fbcfce83cfbd9cc53170ea92ac9e25c8be111496c23b4","last_reissued_at":"2026-05-17T23:48:07.822270Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:07.822270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.09283","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:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Oxq8hndZaIYpChudRrfZVBaQu2kAFlsqd31he4VpazRNVU2c+ca1z0ASeB1rIue65luSLUwjzu+aaOAwyrIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:08:37.787881Z"},"content_sha256":"32cd281e268e2d5ae3b06d45fba8aa3b0c38f03f8842a0a62d16689ea675a8b2","schema_version":"1.0","event_id":"sha256:32cd281e268e2d5ae3b06d45fba8aa3b0c38f03f8842a0a62d16689ea675a8b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:45U3BOGF2GOSFXZPXT6OQPH33H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Esther M. Arkin, Jayson Lynch, Joseph S. B. Mitchell, Rathish Das, Rezaul Chowdhury, Sharmila Duppala, Shih-Yu Tsai, Steven Skiena","submitted_at":"2019-04-19T17:48:35Z","abstract_excerpt":"A determinacy race occurs if two or more logically parallel instructions access the same memory location and at least one of them tries to modify its content. Races often lead to nondeterministic and incorrect program behavior. A data race is a special case of a determinacy race which can be eliminated by associating a mutual-exclusion lock or allowing atomic accesses to the memory location. However, such solutions can reduce parallelism by serializing all accesses to that location. For associative and commutative updates, reducers allow parallel race-free updates at the expense of using some "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09283","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:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1pg5YMDmuo6oooqdMFTkx7DRhTnjov94Flp5YxIfH+1LMffk5A5fysmmFKMmUa3yV38UykpxBhREjAOrNqGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:08:37.788382Z"},"content_sha256":"953137c4dcdf9f7cc04ef2c7406b9afac51e6fb20093cea49bdec9a01e15c990","schema_version":"1.0","event_id":"sha256:953137c4dcdf9f7cc04ef2c7406b9afac51e6fb20093cea49bdec9a01e15c990"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45U3BOGF2GOSFXZPXT6OQPH33H/bundle.json","state_url":"https://pith.science/pith/45U3BOGF2GOSFXZPXT6OQPH33H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45U3BOGF2GOSFXZPXT6OQPH33H/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-26T11:08:37Z","links":{"resolver":"https://pith.science/pith/45U3BOGF2GOSFXZPXT6OQPH33H","bundle":"https://pith.science/pith/45U3BOGF2GOSFXZPXT6OQPH33H/bundle.json","state":"https://pith.science/pith/45U3BOGF2GOSFXZPXT6OQPH33H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45U3BOGF2GOSFXZPXT6OQPH33H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:45U3BOGF2GOSFXZPXT6OQPH33H","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":"e7916354d0df027c2053c0ce21f6f3857529fbca7074b0e0983aed2c5e20b476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-19T17:48:35Z","title_canon_sha256":"aa1b88e69de8f25e983971948fd4eef9d6277d72cdd058309aa6193f4276405c"},"schema_version":"1.0","source":{"id":"1904.09283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09283","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09283v1","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09283","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"45U3BOGF2GOS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"45U3BOGF2GOSFXZP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"45U3BOGF","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:953137c4dcdf9f7cc04ef2c7406b9afac51e6fb20093cea49bdec9a01e15c990","target":"graph","created_at":"2026-05-17T23:48:07Z","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 determinacy race occurs if two or more logically parallel instructions access the same memory location and at least one of them tries to modify its content. Races often lead to nondeterministic and incorrect program behavior. A data race is a special case of a determinacy race which can be eliminated by associating a mutual-exclusion lock or allowing atomic accesses to the memory location. However, such solutions can reduce parallelism by serializing all accesses to that location. For associative and commutative updates, reducers allow parallel race-free updates at the expense of using some ","authors_text":"Esther M. Arkin, Jayson Lynch, Joseph S. B. Mitchell, Rathish Das, Rezaul Chowdhury, Sharmila Duppala, Shih-Yu Tsai, Steven Skiena","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-19T17:48:35Z","title":"Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09283","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:32cd281e268e2d5ae3b06d45fba8aa3b0c38f03f8842a0a62d16689ea675a8b2","target":"record","created_at":"2026-05-17T23:48:07Z","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":"e7916354d0df027c2053c0ce21f6f3857529fbca7074b0e0983aed2c5e20b476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-19T17:48:35Z","title_canon_sha256":"aa1b88e69de8f25e983971948fd4eef9d6277d72cdd058309aa6193f4276405c"},"schema_version":"1.0","source":{"id":"1904.09283","kind":"arxiv","version":1}},"canonical_sha256":"e769b0b8c5d19d22df2fbcfce83cfbd9cc53170ea92ac9e25c8be111496c23b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e769b0b8c5d19d22df2fbcfce83cfbd9cc53170ea92ac9e25c8be111496c23b4","first_computed_at":"2026-05-17T23:48:07.822270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:07.822270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a5anB5SV6ztArDw+tcHtXSDAiOSYxB/CldikEEo27dQrj53xUTwmjM/9DboHddfVmS9VjDkNCdwxf3UhjbXQDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:07.822766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32cd281e268e2d5ae3b06d45fba8aa3b0c38f03f8842a0a62d16689ea675a8b2","sha256:953137c4dcdf9f7cc04ef2c7406b9afac51e6fb20093cea49bdec9a01e15c990"],"state_sha256":"64c0d8534e19f657d75b8121efdf44893219881e8cbee60cb3a0557574d3ca46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MpaSAZzo0AUykFGm4uZ6bHMm3KuQlGFkl8argwHCpxkYg5GaL1m53OOQd3L5HjksVFQirKfPFZxrcxzg91PDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:08:37.791774Z","bundle_sha256":"1230694f016082689f8788d161839b328cf48cd69c53b7ec32f78e29a21b4087"}}