{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7U2G25KLELYIN2BZXHAPV4NMMR","short_pith_number":"pith:7U2G25KL","schema_version":"1.0","canonical_sha256":"fd346d754b22f086e839b9c0faf1ac646d3c2c1a041c81552daa3fb2cb6cdc1a","source":{"kind":"arxiv","id":"1305.1222","version":3},"attestation_state":"computed","paper":{"title":"A Note on (Parallel) Depth- and Breadth-First Search by Arc Elimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jesper Larsson Tr\\\"aff","submitted_at":"2013-05-06T15:31:17Z","abstract_excerpt":"This note recapitulates an algorithmic observation for ordered Depth-First Search (DFS) in directed graphs that immediately leads to a parallel algorithm with linear speed-up for a range of processors for non-sparse graphs. The note extends the approach to ordered Breadth-First Search (BFS). With $p$ processors, both DFS and BFS algorithms run in $O(m/p+n)$ time steps on a shared-memory parallel machine allowing concurrent reading of locations, e.g., a CREW PRAM, and have linear speed-up for $p\\leq m/n$. Both algorithms need $n$ synchronization steps."},"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":"1305.1222","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-06T15:31:17Z","cross_cats_sorted":[],"title_canon_sha256":"620f9e738adb1eed265ae731025700c5557e4028f1c5179eb7fdb6a57c61acc9","abstract_canon_sha256":"8f12a57d54ad757280224195817285e0641429737caad880f441739ecf008a21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:23.391297Z","signature_b64":"Sw9aNBWxUFDHGOhrBQdbBRJlrt1+YHjxl2xshamxjs2JBhf7+vIatP7Gd4JYHsMxazt4Sj895cQiIt0B6OcCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd346d754b22f086e839b9c0faf1ac646d3c2c1a041c81552daa3fb2cb6cdc1a","last_reissued_at":"2026-05-18T03:07:23.390882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:23.390882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on (Parallel) Depth- and Breadth-First Search by Arc Elimination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jesper Larsson Tr\\\"aff","submitted_at":"2013-05-06T15:31:17Z","abstract_excerpt":"This note recapitulates an algorithmic observation for ordered Depth-First Search (DFS) in directed graphs that immediately leads to a parallel algorithm with linear speed-up for a range of processors for non-sparse graphs. The note extends the approach to ordered Breadth-First Search (BFS). With $p$ processors, both DFS and BFS algorithms run in $O(m/p+n)$ time steps on a shared-memory parallel machine allowing concurrent reading of locations, e.g., a CREW PRAM, and have linear speed-up for $p\\leq m/n$. Both algorithms need $n$ synchronization steps."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1222","kind":"arxiv","version":3},"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":"1305.1222","created_at":"2026-05-18T03:07:23.390950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1222v3","created_at":"2026-05-18T03:07:23.390950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1222","created_at":"2026-05-18T03:07:23.390950+00:00"},{"alias_kind":"pith_short_12","alias_value":"7U2G25KLELYI","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7U2G25KLELYIN2BZ","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7U2G25KL","created_at":"2026-05-18T12:27:36.564083+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/7U2G25KLELYIN2BZXHAPV4NMMR","json":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR.json","graph_json":"https://pith.science/api/pith-number/7U2G25KLELYIN2BZXHAPV4NMMR/graph.json","events_json":"https://pith.science/api/pith-number/7U2G25KLELYIN2BZXHAPV4NMMR/events.json","paper":"https://pith.science/paper/7U2G25KL"},"agent_actions":{"view_html":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR","download_json":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR.json","view_paper":"https://pith.science/paper/7U2G25KL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1222&json=true","fetch_graph":"https://pith.science/api/pith-number/7U2G25KLELYIN2BZXHAPV4NMMR/graph.json","fetch_events":"https://pith.science/api/pith-number/7U2G25KLELYIN2BZXHAPV4NMMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR/action/storage_attestation","attest_author":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR/action/author_attestation","sign_citation":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR/action/citation_signature","submit_replication":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR/action/replication_record"}},"created_at":"2026-05-18T03:07:23.390950+00:00","updated_at":"2026-05-18T03:07:23.390950+00:00"}