{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BTKL76S3QX7YLQOFSOZI63XS7Z","short_pith_number":"pith:BTKL76S3","canonical_record":{"source":{"id":"1901.03689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T18:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"c1eb7573d6c72413f820314401428be5838aae23c794b806b11e3fdb9925de6d","abstract_canon_sha256":"204857b7ff9286274198029d47bab442e2750dd58aca16b6ab1d829ce583e8e3"},"schema_version":"1.0"},"canonical_sha256":"0cd4bffa5b85ff85c1c593b28f6ef2fe5ab4733e706e471852fef5195f9ebd1b","source":{"kind":"arxiv","id":"1901.03689","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03689","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03689v1","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03689","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"BTKL76S3QX7Y","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BTKL76S3QX7YLQOF","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BTKL76S3","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BTKL76S3QX7YLQOFSOZI63XS7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T18:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"c1eb7573d6c72413f820314401428be5838aae23c794b806b11e3fdb9925de6d","abstract_canon_sha256":"204857b7ff9286274198029d47bab442e2750dd58aca16b6ab1d829ce583e8e3"},"schema_version":"1.0"},"canonical_sha256":"0cd4bffa5b85ff85c1c593b28f6ef2fe5ab4733e706e471852fef5195f9ebd1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.648149Z","signature_b64":"ilpzUQG2C/lbpyOeTTBPXEMX5bxCe++MX8xZMdUUcfW3KvM0j9DpupnflG8nsd2tctWG5Sg1aC1EgtxwtJziCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cd4bffa5b85ff85c1c593b28f6ef2fe5ab4733e706e471852fef5195f9ebd1b","last_reissued_at":"2026-05-17T23:56:30.647805Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.647805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03689","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-17T23:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbCgVFcF82BduopacDSoisP15P3EONlA+2LK0vLLEjTo0uqryIupUmLAE3oq+wOwEwyFUYx0biJSnSdWr8WkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:08:15.821718Z"},"content_sha256":"41f4f80d24a9c0718b36322a3b2d10aac515f3e371f3f4a6e4271a6fb1dded48","schema_version":"1.0","event_id":"sha256:41f4f80d24a9c0718b36322a3b2d10aac515f3e371f3f4a6e4271a6fb1dded48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BTKL76S3QX7YLQOFSOZI63XS7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Depth First Search in the Semi-streaming Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shahbaz Khan, Shashank K. Mehta","submitted_at":"2019-01-11T18:50:21Z","abstract_excerpt":"Depth first search (DFS) tree is a fundamental data structure for solving various graph problems. The classical DFS algorithm requires $O(m+n)$ time for a graph having $n$ vertices and $m$ edges. In the streaming model, an algorithm is allowed several passes (preferably single) over the input graph having a restriction on the size of local space used.\n  Trivially, a DFS tree can be computed using a single pass using $O(m)$ space. In the semi-streaming model allowing $O(n)$ space, it can be computed in $O(n)$ passes, where each pass adds one vertex to the DFS tree. However, it remains an open p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03689","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-17T23:56:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygu2+ybJIYFA1Ab0FwmzirumDKh6kIEXVn9cDc+OKsWbOhrtw0EtkgsixVbVtcFAG9LIBGhpR5kmKo3LBvLxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:08:15.822055Z"},"content_sha256":"21cd92292432ab3534a4a9952bdede8f0d8e0b25c77b38b097d475c27f432963","schema_version":"1.0","event_id":"sha256:21cd92292432ab3534a4a9952bdede8f0d8e0b25c77b38b097d475c27f432963"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/bundle.json","state_url":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/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-26T19:08:15Z","links":{"resolver":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z","bundle":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/bundle.json","state":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BTKL76S3QX7YLQOFSOZI63XS7Z","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":"204857b7ff9286274198029d47bab442e2750dd58aca16b6ab1d829ce583e8e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T18:50:21Z","title_canon_sha256":"c1eb7573d6c72413f820314401428be5838aae23c794b806b11e3fdb9925de6d"},"schema_version":"1.0","source":{"id":"1901.03689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03689","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03689v1","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03689","created_at":"2026-05-17T23:56:30Z"},{"alias_kind":"pith_short_12","alias_value":"BTKL76S3QX7Y","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BTKL76S3QX7YLQOF","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BTKL76S3","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:21cd92292432ab3534a4a9952bdede8f0d8e0b25c77b38b097d475c27f432963","target":"graph","created_at":"2026-05-17T23:56:30Z","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) tree is a fundamental data structure for solving various graph problems. The classical DFS algorithm requires $O(m+n)$ time for a graph having $n$ vertices and $m$ edges. In the streaming model, an algorithm is allowed several passes (preferably single) over the input graph having a restriction on the size of local space used.\n  Trivially, a DFS tree can be computed using a single pass using $O(m)$ space. In the semi-streaming model allowing $O(n)$ space, it can be computed in $O(n)$ passes, where each pass adds one vertex to the DFS tree. However, it remains an open p","authors_text":"Shahbaz Khan, Shashank K. Mehta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T18:50:21Z","title":"Depth First Search in the Semi-streaming Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03689","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:41f4f80d24a9c0718b36322a3b2d10aac515f3e371f3f4a6e4271a6fb1dded48","target":"record","created_at":"2026-05-17T23:56:30Z","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":"204857b7ff9286274198029d47bab442e2750dd58aca16b6ab1d829ce583e8e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T18:50:21Z","title_canon_sha256":"c1eb7573d6c72413f820314401428be5838aae23c794b806b11e3fdb9925de6d"},"schema_version":"1.0","source":{"id":"1901.03689","kind":"arxiv","version":1}},"canonical_sha256":"0cd4bffa5b85ff85c1c593b28f6ef2fe5ab4733e706e471852fef5195f9ebd1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cd4bffa5b85ff85c1c593b28f6ef2fe5ab4733e706e471852fef5195f9ebd1b","first_computed_at":"2026-05-17T23:56:30.647805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:30.647805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ilpzUQG2C/lbpyOeTTBPXEMX5bxCe++MX8xZMdUUcfW3KvM0j9DpupnflG8nsd2tctWG5Sg1aC1EgtxwtJziCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:30.648149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41f4f80d24a9c0718b36322a3b2d10aac515f3e371f3f4a6e4271a6fb1dded48","sha256:21cd92292432ab3534a4a9952bdede8f0d8e0b25c77b38b097d475c27f432963"],"state_sha256":"946a404b5c0be3968cbedc1a3fe6f0cf0c62fef028bc82fb1b8eb7817646b63c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ptkNaZL//9eSJiLcvdtOeAK1xtD/THQ/xXiIkGxY9iVkP+V3qrzb5Ljdv+uFh/IAlll5hX7c3fTHpHgWr9VFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T19:08:15.823923Z","bundle_sha256":"676b413b6bb78a2830c3e5568099035a4e39fe40939321918404866f887cfdb9"}}