{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NHCOW327AFF4BRMWH7S5IOM6N3","short_pith_number":"pith:NHCOW327","schema_version":"1.0","canonical_sha256":"69c4eb6f5f014bc0c5963fe5d4399e6ef5582aa9b310e68715a582967111b6e1","source":{"kind":"arxiv","id":"1711.01700","version":1},"attestation_state":"computed","paper":{"title":"Nearly Work-Efficient Parallel Algorithm for Digraph Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman","submitted_at":"2017-11-06T02:44:03Z","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"},"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":"1711.01700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-06T02:44:03Z","cross_cats_sorted":[],"title_canon_sha256":"0d3e4ccd13e54bd3bfbb2730a165160966844583ae3a05f8e4b442008b093097","abstract_canon_sha256":"a1d774e1494c09c1a51b2d665896fb803b4386aba975381f623c5f9889581336"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:17.098184Z","signature_b64":"eO4e7ixQAncuQ9zKKojQsIwDpZp48tDCnM7yBUW3HFoRqOs2SVPDTJevbOMAEuTyqrc/X9WhhGpeQTyvt+iZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c4eb6f5f014bc0c5963fe5d4399e6ef5582aa9b310e68715a582967111b6e1","last_reissued_at":"2026-05-18T00:31:17.097492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:17.097492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Work-Efficient Parallel Algorithm for Digraph Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman","submitted_at":"2017-11-06T02:44:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01700","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01700","created_at":"2026-05-18T00:31:17.097610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01700v1","created_at":"2026-05-18T00:31:17.097610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01700","created_at":"2026-05-18T00:31:17.097610+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHCOW327AFF4","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHCOW327AFF4BRMW","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHCOW327","created_at":"2026-05-18T12:31:31.346846+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/NHCOW327AFF4BRMWH7S5IOM6N3","json":"https://pith.science/pith/NHCOW327AFF4BRMWH7S5IOM6N3.json","graph_json":"https://pith.science/api/pith-number/NHCOW327AFF4BRMWH7S5IOM6N3/graph.json","events_json":"https://pith.science/api/pith-number/NHCOW327AFF4BRMWH7S5IOM6N3/events.json","paper":"https://pith.science/paper/NHCOW327"},"agent_actions":{"view_html":"https://pith.science/pith/NHCOW327AFF4BRMWH7S5IOM6N3","download_json":"https://pith.science/pith/NHCOW327AFF4BRMWH7S5IOM6N3.json","view_paper":"https://pith.science/paper/NHCOW327","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01700&json=true","fetch_graph":"https://pith.science/api/pith-number/NHCOW327AFF4BRMWH7S5IOM6N3/graph.json","fetch_events":"https://pith.science/api/pith-number/NHCOW327AFF4BRMWH7S5IOM6N3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHCOW327AFF4BRMWH7S5IOM6N3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHCOW327AFF4BRMWH7S5IOM6N3/action/storage_attestation","attest_author":"https://pith.science/pith/NHCOW327AFF4BRMWH7S5IOM6N3/action/author_attestation","sign_citation":"https://pith.science/pith/NHCOW327AFF4BRMWH7S5IOM6N3/action/citation_signature","submit_replication":"https://pith.science/pith/NHCOW327AFF4BRMWH7S5IOM6N3/action/replication_record"}},"created_at":"2026-05-18T00:31:17.097610+00:00","updated_at":"2026-05-18T00:31:17.097610+00:00"}