{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NHCOW327AFF4BRMWH7S5IOM6N3","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":"a1d774e1494c09c1a51b2d665896fb803b4386aba975381f623c5f9889581336","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T02:44:03Z","title_canon_sha256":"0d3e4ccd13e54bd3bfbb2730a165160966844583ae3a05f8e4b442008b093097"},"schema_version":"1.0","source":{"id":"1711.01700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01700","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01700v1","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01700","created_at":"2026-05-18T00:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"NHCOW327AFF4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NHCOW327AFF4BRMW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NHCOW327","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:b130614e1310f5f5685686855abb2ad6a0089c054aad838835e108965188ca0f","target":"graph","created_at":"2026-05-18T00:31:17Z","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":"One of the simplest problems on directed graphs is that of identifying the set of vertices reachable from a designated source vertex. This problem can be solved easily sequentially by performing a graph search, but efficient parallel algorithms have eluded researchers for decades. For sparse high-diameter graphs in particular, there is no known work-efficient parallel algorithm with nontrivial parallelism. This amounts to one of the most fundamental open questions in parallel graph algorithms: Is there a parallel algorithm for digraph reachability with nearly linear work? This paper shows that","authors_text":"Jeremy T. Fineman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T02:44:03Z","title":"Nearly Work-Efficient Parallel Algorithm for Digraph Reachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01700","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:034915ccce2dec23af66dace89e72e2f0bf81261a627fd34baa7bfe5fa30f6a9","target":"record","created_at":"2026-05-18T00:31:17Z","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":"a1d774e1494c09c1a51b2d665896fb803b4386aba975381f623c5f9889581336","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T02:44:03Z","title_canon_sha256":"0d3e4ccd13e54bd3bfbb2730a165160966844583ae3a05f8e4b442008b093097"},"schema_version":"1.0","source":{"id":"1711.01700","kind":"arxiv","version":1}},"canonical_sha256":"69c4eb6f5f014bc0c5963fe5d4399e6ef5582aa9b310e68715a582967111b6e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69c4eb6f5f014bc0c5963fe5d4399e6ef5582aa9b310e68715a582967111b6e1","first_computed_at":"2026-05-18T00:31:17.097492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:17.097492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eO4e7ixQAncuQ9zKKojQsIwDpZp48tDCnM7yBUW3HFoRqOs2SVPDTJevbOMAEuTyqrc/X9WhhGpeQTyvt+iZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:17.098184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:034915ccce2dec23af66dace89e72e2f0bf81261a627fd34baa7bfe5fa30f6a9","sha256:b130614e1310f5f5685686855abb2ad6a0089c054aad838835e108965188ca0f"],"state_sha256":"384b7b0ea4a6c2f5e16849317c7a0785cddefdb0c07e2bf7f229944785e18faf"}