{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BTKL76S3QX7YLQOFSOZI63XS7Z","short_pith_number":"pith:BTKL76S3","schema_version":"1.0","canonical_sha256":"0cd4bffa5b85ff85c1c593b28f6ef2fe5ab4733e706e471852fef5195f9ebd1b","source":{"kind":"arxiv","id":"1901.03689","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.03689","created_at":"2026-05-17T23:56:30.647860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03689v1","created_at":"2026-05-17T23:56:30.647860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03689","created_at":"2026-05-17T23:56:30.647860+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTKL76S3QX7Y","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTKL76S3QX7YLQOF","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTKL76S3","created_at":"2026-05-18T12:33:12.712433+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/BTKL76S3QX7YLQOFSOZI63XS7Z","json":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z.json","graph_json":"https://pith.science/api/pith-number/BTKL76S3QX7YLQOFSOZI63XS7Z/graph.json","events_json":"https://pith.science/api/pith-number/BTKL76S3QX7YLQOFSOZI63XS7Z/events.json","paper":"https://pith.science/paper/BTKL76S3"},"agent_actions":{"view_html":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z","download_json":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z.json","view_paper":"https://pith.science/paper/BTKL76S3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03689&json=true","fetch_graph":"https://pith.science/api/pith-number/BTKL76S3QX7YLQOFSOZI63XS7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/BTKL76S3QX7YLQOFSOZI63XS7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/action/storage_attestation","attest_author":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/action/author_attestation","sign_citation":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/action/citation_signature","submit_replication":"https://pith.science/pith/BTKL76S3QX7YLQOFSOZI63XS7Z/action/replication_record"}},"created_at":"2026-05-17T23:56:30.647860+00:00","updated_at":"2026-05-17T23:56:30.647860+00:00"}