{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:R2FXQJW5I7VNX53TSX47OJOCMF","short_pith_number":"pith:R2FXQJW5","schema_version":"1.0","canonical_sha256":"8e8b7826dd47eadbf77395f9f725c26155391162fc5d29b9a8e04a89c092bcc7","source":{"kind":"arxiv","id":"2008.13292","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2008.13292","created_at":"2026-07-05T01:32:47.004971+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.13292v2","created_at":"2026-07-05T01:32:47.004971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.13292","created_at":"2026-07-05T01:32:47.004971+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2FXQJW5I7VN","created_at":"2026-07-05T01:32:47.004971+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2FXQJW5I7VNX53T","created_at":"2026-07-05T01:32:47.004971+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2FXQJW5","created_at":"2026-07-05T01:32:47.004971+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF","json":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF.json","graph_json":"https://pith.science/api/pith-number/R2FXQJW5I7VNX53TSX47OJOCMF/graph.json","events_json":"https://pith.science/api/pith-number/R2FXQJW5I7VNX53TSX47OJOCMF/events.json","paper":"https://pith.science/paper/R2FXQJW5"},"agent_actions":{"view_html":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF","download_json":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF.json","view_paper":"https://pith.science/paper/R2FXQJW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.13292&json=true","fetch_graph":"https://pith.science/api/pith-number/R2FXQJW5I7VNX53TSX47OJOCMF/graph.json","fetch_events":"https://pith.science/api/pith-number/R2FXQJW5I7VNX53TSX47OJOCMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF/action/storage_attestation","attest_author":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF/action/author_attestation","sign_citation":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF/action/citation_signature","submit_replication":"https://pith.science/pith/R2FXQJW5I7VNX53TSX47OJOCMF/action/replication_record"}},"created_at":"2026-07-05T01:32:47.004971+00:00","updated_at":"2026-07-05T01:32:47.004971+00:00"}