{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:R2FXQJW5I7VNX53TSX47OJOCMF","short_pith_number":"pith:R2FXQJW5","canonical_record":{"source":{"id":"2008.13292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-30T22:56:59Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"78208840c29625a7267f5277e4d3161e199dde86ce3ab3cbd952b62d372f3674","abstract_canon_sha256":"03ff583325e3b935e14a947961e84a2ff5b91386ca51dfa5cb5d550fb117c237"},"schema_version":"1.0"},"canonical_sha256":"8e8b7826dd47eadbf77395f9f725c26155391162fc5d29b9a8e04a89c092bcc7","source":{"kind":"arxiv","id":"2008.13292","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.13292","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"2008.13292v2","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.13292","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"R2FXQJW5I7VN","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"pith_short_16","alias_value":"R2FXQJW5I7VNX53T","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"pith_short_8","alias_value":"R2FXQJW5","created_at":"2026-07-05T01:32:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:R2FXQJW5I7VNX53TSX47OJOCMF","target":"record","payload":{"canonical_record":{"source":{"id":"2008.13292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-30T22:56:59Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"78208840c29625a7267f5277e4d3161e199dde86ce3ab3cbd952b62d372f3674","abstract_canon_sha256":"03ff583325e3b935e14a947961e84a2ff5b91386ca51dfa5cb5d550fb117c237"},"schema_version":"1.0"},"canonical_sha256":"8e8b7826dd47eadbf77395f9f725c26155391162fc5d29b9a8e04a89c092bcc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:32:47.005331Z","signature_b64":"T0SqBUJHwsbmbxUS2MhvrqKm2oEXb/zWlzW79rIiiNp+Km9qnncnxBccmDrhPPW8MlGBLTTficXfNn829rBwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e8b7826dd47eadbf77395f9f725c26155391162fc5d29b9a8e04a89c092bcc7","last_reissued_at":"2026-07-05T01:32:47.004906Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:32:47.004906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.13292","source_version":2,"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-05T01:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUdUJqYIwjH8ThgZtkAEuLLpDnWepUODDK1t4+HzYEBrIDY8DIYIrIkHTTQ9+lpiUK3+JYzmVfpDlLU8d+a/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:14:54.148265Z"},"content_sha256":"3f7adff9cf3021af208bc90f976db835ff17663df42c9991393aafacce862e1a","schema_version":"1.0","event_id":"sha256:3f7adff9cf3021af208bc90f976db835ff17663df42c9991393aafacce862e1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:R2FXQJW5I7VNX53TSX47OJOCMF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Aaron Gregory, Mohammad Mahdi Javanmard, Pramod Ganapathi, Rathish Das, Rezaul Chowdhury, Zafar Ahmad","submitted_at":"2020-08-30T22:56:59Z","abstract_excerpt":"The binary-forking model is a parallel computation model, formally defined by Blelloch et al. very recently, in which a thread can fork a concurrent child thread, recursively and asynchronously. The model incurs a cost of $\\Theta(\\log n)$ to spawn or synchronize $n$ tasks or threads. The binary-forking model realistically captures the performance of parallel algorithms implemented using modern multithreaded programming languages on multicore shared-memory machines. In contrast, the widely studied theoretical PRAM model does not consider the cost of spawning and synchronizing threads, and as a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.13292","kind":"arxiv","version":2},"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/2008.13292/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-05T01:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MX12+mKZQn+iig4fSB1CDCbnXx6PrmbxJKi8zUH3RxHLcZqgQvtAbHcyKzAa4APUNB7A6cX9pBtiTFhpq3lsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:14:54.148924Z"},"content_sha256":"ef7bd5fe177090e77ea6bb1e73f5825e5b02bfb39903ae57b81793c347f18657","schema_version":"1.0","event_id":"sha256:ef7bd5fe177090e77ea6bb1e73f5825e5b02bfb39903ae57b81793c347f18657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF/bundle.json","state_url":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2FXQJW5I7VNX53TSX47OJOCMF/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-22T13:14:54Z","links":{"resolver":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF","bundle":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF/bundle.json","state":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2FXQJW5I7VNX53TSX47OJOCMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:R2FXQJW5I7VNX53TSX47OJOCMF","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":"03ff583325e3b935e14a947961e84a2ff5b91386ca51dfa5cb5d550fb117c237","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-30T22:56:59Z","title_canon_sha256":"78208840c29625a7267f5277e4d3161e199dde86ce3ab3cbd952b62d372f3674"},"schema_version":"1.0","source":{"id":"2008.13292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.13292","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"2008.13292v2","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.13292","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"R2FXQJW5I7VN","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"pith_short_16","alias_value":"R2FXQJW5I7VNX53T","created_at":"2026-07-05T01:32:47Z"},{"alias_kind":"pith_short_8","alias_value":"R2FXQJW5","created_at":"2026-07-05T01:32:47Z"}],"graph_snapshots":[{"event_id":"sha256:ef7bd5fe177090e77ea6bb1e73f5825e5b02bfb39903ae57b81793c347f18657","target":"graph","created_at":"2026-07-05T01:32:47Z","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/2008.13292/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The binary-forking model is a parallel computation model, formally defined by Blelloch et al. very recently, in which a thread can fork a concurrent child thread, recursively and asynchronously. The model incurs a cost of $\\Theta(\\log n)$ to spawn or synchronize $n$ tasks or threads. The binary-forking model realistically captures the performance of parallel algorithms implemented using modern multithreaded programming languages on multicore shared-memory machines. In contrast, the widely studied theoretical PRAM model does not consider the cost of spawning and synchronizing threads, and as a ","authors_text":"Aaron Gregory, Mohammad Mahdi Javanmard, Pramod Ganapathi, Rathish Das, Rezaul Chowdhury, Zafar Ahmad","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-30T22:56:59Z","title":"Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.13292","kind":"arxiv","version":2},"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:3f7adff9cf3021af208bc90f976db835ff17663df42c9991393aafacce862e1a","target":"record","created_at":"2026-07-05T01:32:47Z","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":"03ff583325e3b935e14a947961e84a2ff5b91386ca51dfa5cb5d550fb117c237","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-30T22:56:59Z","title_canon_sha256":"78208840c29625a7267f5277e4d3161e199dde86ce3ab3cbd952b62d372f3674"},"schema_version":"1.0","source":{"id":"2008.13292","kind":"arxiv","version":2}},"canonical_sha256":"8e8b7826dd47eadbf77395f9f725c26155391162fc5d29b9a8e04a89c092bcc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e8b7826dd47eadbf77395f9f725c26155391162fc5d29b9a8e04a89c092bcc7","first_computed_at":"2026-07-05T01:32:47.004906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:32:47.004906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T0SqBUJHwsbmbxUS2MhvrqKm2oEXb/zWlzW79rIiiNp+Km9qnncnxBccmDrhPPW8MlGBLTTficXfNn829rBwAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:32:47.005331Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.13292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f7adff9cf3021af208bc90f976db835ff17663df42c9991393aafacce862e1a","sha256:ef7bd5fe177090e77ea6bb1e73f5825e5b02bfb39903ae57b81793c347f18657"],"state_sha256":"eeaccf856e988d17d1bd42cbbf546e2b162e6d344f078f235ec16949f2f59067"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WiyRc3aIdRzm9WA6T8jeUzCWmeEyjbqEenXfz3aFzfNAZT5gxQwtzTSd2hcwFEdI78xW+dzbNzt+m9xBwySXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:14:54.153799Z","bundle_sha256":"8f9a6f006c528dcb7bc7417bd7e765bb604d9d06cdafd9efbfbd64e1127f1701"}}