{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XL3B5RKSUGD7OWJTRE3E3RPKFH","short_pith_number":"pith:XL3B5RKS","canonical_record":{"source":{"id":"1703.10023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-29T13:18:52Z","cross_cats_sorted":[],"title_canon_sha256":"e65e7de1819cd4426c8e57fd54ecff9a3d954f99692508e95a6d559f63b7965a","abstract_canon_sha256":"cd618ff74ccd00987854f97b2979a1e95b38a2a4ef71ded0876baddd45e8c717"},"schema_version":"1.0"},"canonical_sha256":"baf61ec552a187f7593389364dc5ea29f9794237c472cf272dbf141ee0631f99","source":{"kind":"arxiv","id":"1703.10023","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10023","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10023v1","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10023","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"XL3B5RKSUGD7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XL3B5RKSUGD7OWJT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XL3B5RKS","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XL3B5RKSUGD7OWJTRE3E3RPKFH","target":"record","payload":{"canonical_record":{"source":{"id":"1703.10023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-29T13:18:52Z","cross_cats_sorted":[],"title_canon_sha256":"e65e7de1819cd4426c8e57fd54ecff9a3d954f99692508e95a6d559f63b7965a","abstract_canon_sha256":"cd618ff74ccd00987854f97b2979a1e95b38a2a4ef71ded0876baddd45e8c717"},"schema_version":"1.0"},"canonical_sha256":"baf61ec552a187f7593389364dc5ea29f9794237c472cf272dbf141ee0631f99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:38.807795Z","signature_b64":"cuBL7MVVfhZuhVv/pF9xBWifBK0ZPLZRaryV8Ey+5A8W81g09eIXENS1a53JfBMlOBe3DONgiF11RStzhij1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baf61ec552a187f7593389364dc5ea29f9794237c472cf272dbf141ee0631f99","last_reissued_at":"2026-05-18T00:47:38.807279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:38.807279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.10023","source_version":1,"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-18T00:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThedwOwqKM0aux2q6jiODq302pq9lTCkLz/V2wDTR9QLn/eYKSolneJ4gj6XUei5kfVmUx6rdwt5J0sw6bB9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:25:44.106566Z"},"content_sha256":"d097922122a2b70376f04067057cfdd42908b1e78676fe3c38e91a94fb6e3897","schema_version":"1.0","event_id":"sha256:d097922122a2b70376f04067057cfdd42908b1e78676fe3c38e91a94fb6e3897"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XL3B5RKSUGD7OWJTRE3E3RPKFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Engineering DFS-Based Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Peter Sanders, Stefan N\\\"aher","submitted_at":"2017-03-29T13:18:52Z","abstract_excerpt":"Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for the efficient implementation of DFS-based graph algorithms and exemplify them on three algorithms for computing strongly connected components. The techniques lead to speed-ups by a factor of two to three compared to the implementations provided by LEDA and BOOST.\n  We have obtained similar speed-ups for biconnected components algorithms. We also compare the graph data types of LEDA and BOOST."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10023","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"},"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-18T00:47:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hgldjp8jY56oNI5g5gFJTO43gCDgjzVZZnVaZNtU9wuBMWRBBfQKnhIt4MWowsSOft7IK0fNcvMdyiWNYdBhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:25:44.107304Z"},"content_sha256":"40a7507d0f61f56911c92917bf717bfbd3e2a036bbee24752c178bc32038124a","schema_version":"1.0","event_id":"sha256:40a7507d0f61f56911c92917bf717bfbd3e2a036bbee24752c178bc32038124a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XL3B5RKSUGD7OWJTRE3E3RPKFH/bundle.json","state_url":"https://pith.science/pith/XL3B5RKSUGD7OWJTRE3E3RPKFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XL3B5RKSUGD7OWJTRE3E3RPKFH/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-07T15:25:44Z","links":{"resolver":"https://pith.science/pith/XL3B5RKSUGD7OWJTRE3E3RPKFH","bundle":"https://pith.science/pith/XL3B5RKSUGD7OWJTRE3E3RPKFH/bundle.json","state":"https://pith.science/pith/XL3B5RKSUGD7OWJTRE3E3RPKFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XL3B5RKSUGD7OWJTRE3E3RPKFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XL3B5RKSUGD7OWJTRE3E3RPKFH","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":"cd618ff74ccd00987854f97b2979a1e95b38a2a4ef71ded0876baddd45e8c717","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-29T13:18:52Z","title_canon_sha256":"e65e7de1819cd4426c8e57fd54ecff9a3d954f99692508e95a6d559f63b7965a"},"schema_version":"1.0","source":{"id":"1703.10023","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10023","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10023v1","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10023","created_at":"2026-05-18T00:47:38Z"},{"alias_kind":"pith_short_12","alias_value":"XL3B5RKSUGD7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XL3B5RKSUGD7OWJT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XL3B5RKS","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:40a7507d0f61f56911c92917bf717bfbd3e2a036bbee24752c178bc32038124a","target":"graph","created_at":"2026-05-18T00:47:38Z","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":"Depth-first search (DFS) is the basis for many efficient graph algorithms. We introduce general techniques for the efficient implementation of DFS-based graph algorithms and exemplify them on three algorithms for computing strongly connected components. The techniques lead to speed-ups by a factor of two to three compared to the implementations provided by LEDA and BOOST.\n  We have obtained similar speed-ups for biconnected components algorithms. We also compare the graph data types of LEDA and BOOST.","authors_text":"Kurt Mehlhorn, Peter Sanders, Stefan N\\\"aher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-29T13:18:52Z","title":"Engineering DFS-Based Graph Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10023","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:d097922122a2b70376f04067057cfdd42908b1e78676fe3c38e91a94fb6e3897","target":"record","created_at":"2026-05-18T00:47:38Z","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":"cd618ff74ccd00987854f97b2979a1e95b38a2a4ef71ded0876baddd45e8c717","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-29T13:18:52Z","title_canon_sha256":"e65e7de1819cd4426c8e57fd54ecff9a3d954f99692508e95a6d559f63b7965a"},"schema_version":"1.0","source":{"id":"1703.10023","kind":"arxiv","version":1}},"canonical_sha256":"baf61ec552a187f7593389364dc5ea29f9794237c472cf272dbf141ee0631f99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baf61ec552a187f7593389364dc5ea29f9794237c472cf272dbf141ee0631f99","first_computed_at":"2026-05-18T00:47:38.807279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:38.807279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cuBL7MVVfhZuhVv/pF9xBWifBK0ZPLZRaryV8Ey+5A8W81g09eIXENS1a53JfBMlOBe3DONgiF11RStzhij1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:38.807795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10023","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d097922122a2b70376f04067057cfdd42908b1e78676fe3c38e91a94fb6e3897","sha256:40a7507d0f61f56911c92917bf717bfbd3e2a036bbee24752c178bc32038124a"],"state_sha256":"86d9edc0e19c7250bb9fb1f4a796a9cdca1af46eae19c029a7f578453180bfbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqMjOGRwn21MHArbPuoF9WonQYYhm+fBoUBOlxi8mJk+YUSjKtOf5UPHwIvaV3ejbJCoMXiMUkQZSj4/8pYbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:25:44.111330Z","bundle_sha256":"026177fe5efc1b524bf32c8e0b9fec0ac9da635209468eab8a459d19e3f521c9"}}