{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QJWOSRSWDYBBSVPEBJKLWPMB5A","short_pith_number":"pith:QJWOSRSW","canonical_record":{"source":{"id":"1805.11864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-30T08:56:47Z","cross_cats_sorted":[],"title_canon_sha256":"8b3a293a9602cca580ca71136ee333da982b818a2347443235c2b73a9f144d0b","abstract_canon_sha256":"0f8b21a63d7b6d3794ac4a175c8ef69dbb726fee6b8ebe3152f71aed57df4f15"},"schema_version":"1.0"},"canonical_sha256":"826ce946561e021955e40a54bb3d81e831077282ef433a7efaade9efa6789bbf","source":{"kind":"arxiv","id":"1805.11864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11864","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11864v1","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11864","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"QJWOSRSWDYBB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJWOSRSWDYBBSVPE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJWOSRSW","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QJWOSRSWDYBBSVPEBJKLWPMB5A","target":"record","payload":{"canonical_record":{"source":{"id":"1805.11864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-30T08:56:47Z","cross_cats_sorted":[],"title_canon_sha256":"8b3a293a9602cca580ca71136ee333da982b818a2347443235c2b73a9f144d0b","abstract_canon_sha256":"0f8b21a63d7b6d3794ac4a175c8ef69dbb726fee6b8ebe3152f71aed57df4f15"},"schema_version":"1.0"},"canonical_sha256":"826ce946561e021955e40a54bb3d81e831077282ef433a7efaade9efa6789bbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:36.062743Z","signature_b64":"56xVS+BCBS4Py1x37SF8LnoEN2ne8s5CUWyRBD7yZ5zzZ2Xp2nqNYYMtbVBWz9uIaln+FScOxZEYepgMubfLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"826ce946561e021955e40a54bb3d81e831077282ef433a7efaade9efa6789bbf","last_reissued_at":"2026-05-18T00:14:36.062167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:36.062167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.11864","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:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0sZtGLSe7GDBq9Z7OHsrgCTwOPwfyJNZ6fy1W61iA1Jpt9jkzOJt5OaX+7IxJ8/6dXjH+OFI6xTu1mRqYtLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:46:21.213812Z"},"content_sha256":"e7897735c1abc3c643bffa71c00d3f7a21fdad2d78e0e077830cd172be1157f9","schema_version":"1.0","event_id":"sha256:e7897735c1abc3c643bffa71c00d3f7a21fdad2d78e0e077830cd172be1157f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QJWOSRSWDYBBSVPEBJKLWPMB5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Efficient DFS and Applications: Simpler, Leaner, Faster","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Torben Hagerup","submitted_at":"2018-05-30T08:56:47Z","abstract_excerpt":"The problem of space-efficient depth-first search (DFS) is reconsidered. A particularly simple and fast algorithm is presented that, on a directed or undirected input graph $G=(V,E)$ with $n$ vertices and $m$ edges, carries out a DFS in $O(n+m)$ time with $n+\\sum_{v\\in V_{\\ge 3}}\\lceil{\\log_2(d_v-1)}\\rceil\n  +O(\\log n)\\le n+m+O(\\log n)$ bits of working memory, where $d_v$ is the (total) degree of $v$, for each $v\\in V$, and $V_{\\ge 3}=\\{v\\in V\\mid d_v\\ge 3\\}$. A slightly more complicated variant of the algorithm works in the same time with at most $n+({4/5})m+O(\\log n)$ bits. It is also shown "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11864","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:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qGW/W5Yld4fc4GK6C0koim9WciLhxVoNlJPeR5cVHEPvfFXJHwuFahGDcsp/GooE32ARPZGqyOnpu1lzEC2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:46:21.214383Z"},"content_sha256":"9bf0326da22bd2af0249feb9a621b96a3623c6ae8aa6316fa64ee2f7f024522a","schema_version":"1.0","event_id":"sha256:9bf0326da22bd2af0249feb9a621b96a3623c6ae8aa6316fa64ee2f7f024522a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJWOSRSWDYBBSVPEBJKLWPMB5A/bundle.json","state_url":"https://pith.science/pith/QJWOSRSWDYBBSVPEBJKLWPMB5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJWOSRSWDYBBSVPEBJKLWPMB5A/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-07T08:46:21Z","links":{"resolver":"https://pith.science/pith/QJWOSRSWDYBBSVPEBJKLWPMB5A","bundle":"https://pith.science/pith/QJWOSRSWDYBBSVPEBJKLWPMB5A/bundle.json","state":"https://pith.science/pith/QJWOSRSWDYBBSVPEBJKLWPMB5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJWOSRSWDYBBSVPEBJKLWPMB5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QJWOSRSWDYBBSVPEBJKLWPMB5A","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":"0f8b21a63d7b6d3794ac4a175c8ef69dbb726fee6b8ebe3152f71aed57df4f15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-30T08:56:47Z","title_canon_sha256":"8b3a293a9602cca580ca71136ee333da982b818a2347443235c2b73a9f144d0b"},"schema_version":"1.0","source":{"id":"1805.11864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11864","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11864v1","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11864","created_at":"2026-05-18T00:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"QJWOSRSWDYBB","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QJWOSRSWDYBBSVPE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QJWOSRSW","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:9bf0326da22bd2af0249feb9a621b96a3623c6ae8aa6316fa64ee2f7f024522a","target":"graph","created_at":"2026-05-18T00:14:36Z","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":"The problem of space-efficient depth-first search (DFS) is reconsidered. A particularly simple and fast algorithm is presented that, on a directed or undirected input graph $G=(V,E)$ with $n$ vertices and $m$ edges, carries out a DFS in $O(n+m)$ time with $n+\\sum_{v\\in V_{\\ge 3}}\\lceil{\\log_2(d_v-1)}\\rceil\n  +O(\\log n)\\le n+m+O(\\log n)$ bits of working memory, where $d_v$ is the (total) degree of $v$, for each $v\\in V$, and $V_{\\ge 3}=\\{v\\in V\\mid d_v\\ge 3\\}$. A slightly more complicated variant of the algorithm works in the same time with at most $n+({4/5})m+O(\\log n)$ bits. It is also shown ","authors_text":"Torben Hagerup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-30T08:56:47Z","title":"Space-Efficient DFS and Applications: Simpler, Leaner, Faster"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11864","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:e7897735c1abc3c643bffa71c00d3f7a21fdad2d78e0e077830cd172be1157f9","target":"record","created_at":"2026-05-18T00:14:36Z","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":"0f8b21a63d7b6d3794ac4a175c8ef69dbb726fee6b8ebe3152f71aed57df4f15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-30T08:56:47Z","title_canon_sha256":"8b3a293a9602cca580ca71136ee333da982b818a2347443235c2b73a9f144d0b"},"schema_version":"1.0","source":{"id":"1805.11864","kind":"arxiv","version":1}},"canonical_sha256":"826ce946561e021955e40a54bb3d81e831077282ef433a7efaade9efa6789bbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"826ce946561e021955e40a54bb3d81e831077282ef433a7efaade9efa6789bbf","first_computed_at":"2026-05-18T00:14:36.062167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:36.062167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"56xVS+BCBS4Py1x37SF8LnoEN2ne8s5CUWyRBD7yZ5zzZ2Xp2nqNYYMtbVBWz9uIaln+FScOxZEYepgMubfLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:36.062743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7897735c1abc3c643bffa71c00d3f7a21fdad2d78e0e077830cd172be1157f9","sha256:9bf0326da22bd2af0249feb9a621b96a3623c6ae8aa6316fa64ee2f7f024522a"],"state_sha256":"cbc093c7307e300c05906fca0e75f98f1fc430f75093e6c9014baec5a4675d42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75vhDeNTOw4zM6Vvim63LFB8r6+Ml0kgl7GCnGlqSCOIlmW5JV3degZzPh3rEx2jDtW1PZbtYjrjFQwjWUvfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:46:21.217485Z","bundle_sha256":"9138c6062b2c84066e3ffabaa8f91418e48f29997b4f31e0dac37a4f8acd098e"}}