{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7U2G25KLELYIN2BZXHAPV4NMMR","short_pith_number":"pith:7U2G25KL","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"},"canonical_sha256":"fd346d754b22f086e839b9c0faf1ac646d3c2c1a041c81552daa3fb2cb6cdc1a","source":{"kind":"arxiv","id":"1305.1222","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1222","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1222v3","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1222","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"pith_short_12","alias_value":"7U2G25KLELYI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7U2G25KLELYIN2BZ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7U2G25KL","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7U2G25KLELYIN2BZXHAPV4NMMR","target":"record","payload":{"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"},"canonical_sha256":"fd346d754b22f086e839b9c0faf1ac646d3c2c1a041c81552daa3fb2cb6cdc1a","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"},"source_kind":"arxiv","source_id":"1305.1222","source_version":3,"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-05-18T03:07:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UtmNIYL+vi39lbetkszykZllklrTjO6ew4et/tYRrunvbWukB/3nStHjA+PrBKR1BX2cyJ8HFpnqRlEpc5cLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:43:20.449920Z"},"content_sha256":"affe1896e244aadcb901e634152d66c880f79cf44ff426d1b4391bc5042a0c68","schema_version":"1.0","event_id":"sha256:affe1896e244aadcb901e634152d66c880f79cf44ff426d1b4391bc5042a0c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7U2G25KLELYIN2BZXHAPV4NMMR","target":"graph","payload":{"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"},"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-05-18T03:07:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQumxFT5FoEAPPENSzawXdihvjnpRca5vqr0G+RMRMNeiomjSbEhDZv6T0xXnWEBCYaUgGOgViiZZDyZ/W4XDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:43:20.450264Z"},"content_sha256":"aaf082659ce7420bb023cc3e7d0fa5954eab23854878b009d4a9915779653ae1","schema_version":"1.0","event_id":"sha256:aaf082659ce7420bb023cc3e7d0fa5954eab23854878b009d4a9915779653ae1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR/bundle.json","state_url":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7U2G25KLELYIN2BZXHAPV4NMMR/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-06-24T05:43:20Z","links":{"resolver":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR","bundle":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR/bundle.json","state":"https://pith.science/pith/7U2G25KLELYIN2BZXHAPV4NMMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7U2G25KLELYIN2BZXHAPV4NMMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7U2G25KLELYIN2BZXHAPV4NMMR","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":"8f12a57d54ad757280224195817285e0641429737caad880f441739ecf008a21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-06T15:31:17Z","title_canon_sha256":"620f9e738adb1eed265ae731025700c5557e4028f1c5179eb7fdb6a57c61acc9"},"schema_version":"1.0","source":{"id":"1305.1222","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1222","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1222v3","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1222","created_at":"2026-05-18T03:07:23Z"},{"alias_kind":"pith_short_12","alias_value":"7U2G25KLELYI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7U2G25KLELYIN2BZ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7U2G25KL","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:aaf082659ce7420bb023cc3e7d0fa5954eab23854878b009d4a9915779653ae1","target":"graph","created_at":"2026-05-18T03:07:23Z","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":"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.","authors_text":"Jesper Larsson Tr\\\"aff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-06T15:31:17Z","title":"A Note on (Parallel) Depth- and Breadth-First Search by Arc Elimination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1222","kind":"arxiv","version":3},"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:affe1896e244aadcb901e634152d66c880f79cf44ff426d1b4391bc5042a0c68","target":"record","created_at":"2026-05-18T03:07:23Z","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":"8f12a57d54ad757280224195817285e0641429737caad880f441739ecf008a21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-06T15:31:17Z","title_canon_sha256":"620f9e738adb1eed265ae731025700c5557e4028f1c5179eb7fdb6a57c61acc9"},"schema_version":"1.0","source":{"id":"1305.1222","kind":"arxiv","version":3}},"canonical_sha256":"fd346d754b22f086e839b9c0faf1ac646d3c2c1a041c81552daa3fb2cb6cdc1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd346d754b22f086e839b9c0faf1ac646d3c2c1a041c81552daa3fb2cb6cdc1a","first_computed_at":"2026-05-18T03:07:23.390882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:23.390882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sw9aNBWxUFDHGOhrBQdbBRJlrt1+YHjxl2xshamxjs2JBhf7+vIatP7Gd4JYHsMxazt4Sj895cQiIt0B6OcCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:23.391297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1222","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:affe1896e244aadcb901e634152d66c880f79cf44ff426d1b4391bc5042a0c68","sha256:aaf082659ce7420bb023cc3e7d0fa5954eab23854878b009d4a9915779653ae1"],"state_sha256":"bb79d663aeb52111cc54306e01fea8ac6cca6c3305db0c0a6d4fd1053b0d4902"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z0cITKNri/KVJ03W+akn7sooiM5sSZICdriRuVtjTLIW9mvvezXOjG//H4jYYJSwJ8TccTyRFNVuvGLw/cctBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:43:20.452226Z","bundle_sha256":"361934dc5809df033b9683bec4edf553b21dbac696f3535cc7c708163fb8713b"}}