{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZNPCUCCSOUCBJOWBNQJB2JESSA","short_pith_number":"pith:ZNPCUCCS","schema_version":"1.0","canonical_sha256":"cb5e2a0852750414bac16c121d249290238f5e65361c781cca0828676e60d469","source":{"kind":"arxiv","id":"1606.04718","version":3},"attestation_state":"computed","paper":{"title":"Improved Space efficient linear time algorithms for BFS, DFS and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Niranka Banerjee, Sankardeep Chakraborty, Srinivasa Rao Satti, Venkatesh Raman","submitted_at":"2016-06-15T10:51:14Z","abstract_excerpt":"Recent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014), reconsidered classical fundamental graph algorithms focusing on improving the space complexity. We continue this line of work focusing on space. Our first result is a simple data structure that can maintain any subset $S$ of a universe of $n$ elements using $n+o(n)$ bits and support in constant time, apart from the standard insert, delete and membership queries, the operation {\\it findany} that finds and returns any element of the set (or outputs that the set is empty). Using this we give a BFS implementation that takes "},"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":"1606.04718","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T10:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"81d2e5dcabab31178173ab356fca6ba30f3703e695033c81cadb246de99f5d90","abstract_canon_sha256":"14e1e1d75a899b959469be5ae30299b4e9a7fc7ca2c4b6fff8f7a4cfa1847636"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:23.136446Z","signature_b64":"3IiJZdji/JxsaLAy7XCGYwbXjAH+Zc6E5OsnbKBm/K3QJ2tatHQwqqPf1OU5KwLSqvoZhDz4/bNKpuIYckx6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb5e2a0852750414bac16c121d249290238f5e65361c781cca0828676e60d469","last_reissued_at":"2026-05-18T00:39:23.135738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:23.135738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Space efficient linear time algorithms for BFS, DFS and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Niranka Banerjee, Sankardeep Chakraborty, Srinivasa Rao Satti, Venkatesh Raman","submitted_at":"2016-06-15T10:51:14Z","abstract_excerpt":"Recent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014), reconsidered classical fundamental graph algorithms focusing on improving the space complexity. We continue this line of work focusing on space. Our first result is a simple data structure that can maintain any subset $S$ of a universe of $n$ elements using $n+o(n)$ bits and support in constant time, apart from the standard insert, delete and membership queries, the operation {\\it findany} that finds and returns any element of the set (or outputs that the set is empty). Using this we give a BFS implementation that takes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04718","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.04718","created_at":"2026-05-18T00:39:23.135853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04718v3","created_at":"2026-05-18T00:39:23.135853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04718","created_at":"2026-05-18T00:39:23.135853+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNPCUCCSOUCB","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNPCUCCSOUCBJOWB","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNPCUCCS","created_at":"2026-05-18T12:30:55.937587+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/ZNPCUCCSOUCBJOWBNQJB2JESSA","json":"https://pith.science/pith/ZNPCUCCSOUCBJOWBNQJB2JESSA.json","graph_json":"https://pith.science/api/pith-number/ZNPCUCCSOUCBJOWBNQJB2JESSA/graph.json","events_json":"https://pith.science/api/pith-number/ZNPCUCCSOUCBJOWBNQJB2JESSA/events.json","paper":"https://pith.science/paper/ZNPCUCCS"},"agent_actions":{"view_html":"https://pith.science/pith/ZNPCUCCSOUCBJOWBNQJB2JESSA","download_json":"https://pith.science/pith/ZNPCUCCSOUCBJOWBNQJB2JESSA.json","view_paper":"https://pith.science/paper/ZNPCUCCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04718&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNPCUCCSOUCBJOWBNQJB2JESSA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNPCUCCSOUCBJOWBNQJB2JESSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNPCUCCSOUCBJOWBNQJB2JESSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNPCUCCSOUCBJOWBNQJB2JESSA/action/storage_attestation","attest_author":"https://pith.science/pith/ZNPCUCCSOUCBJOWBNQJB2JESSA/action/author_attestation","sign_citation":"https://pith.science/pith/ZNPCUCCSOUCBJOWBNQJB2JESSA/action/citation_signature","submit_replication":"https://pith.science/pith/ZNPCUCCSOUCBJOWBNQJB2JESSA/action/replication_record"}},"created_at":"2026-05-18T00:39:23.135853+00:00","updated_at":"2026-05-18T00:39:23.135853+00:00"}