{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:N5UCXE5ZLSG7C2HTMHJDFDKOZI","short_pith_number":"pith:N5UCXE5Z","canonical_record":{"source":{"id":"1906.07874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T01:45:10Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e0ce8329a088261b4012f241273d26e7d75354760a9ff4c05a50c3555b320192","abstract_canon_sha256":"87c9bd7ae9b9ad07019aa76e15aa4902b08bd12fd3f3414e6ada2adece2069b6"},"schema_version":"1.0"},"canonical_sha256":"6f682b93b95c8df168f361d2328d4eca3d80ce5ad2e29fc1daadd805634faa6e","source":{"kind":"arxiv","id":"1906.07874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07874","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07874v1","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07874","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"pith_short_12","alias_value":"N5UCXE5ZLSG7","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"N5UCXE5ZLSG7C2HT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"N5UCXE5Z","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:N5UCXE5ZLSG7C2HTMHJDFDKOZI","target":"record","payload":{"canonical_record":{"source":{"id":"1906.07874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T01:45:10Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e0ce8329a088261b4012f241273d26e7d75354760a9ff4c05a50c3555b320192","abstract_canon_sha256":"87c9bd7ae9b9ad07019aa76e15aa4902b08bd12fd3f3414e6ada2adece2069b6"},"schema_version":"1.0"},"canonical_sha256":"6f682b93b95c8df168f361d2328d4eca3d80ce5ad2e29fc1daadd805634faa6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:57.474343Z","signature_b64":"b/POGRlY8A7dNjnGJaITSGyp5VYMetf9pehG/W+0/He2F/CsyFvxYOpke1Olc4H/WljXh5LqEgvmBQsPz9j0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f682b93b95c8df168f361d2328d4eca3d80ce5ad2e29fc1daadd805634faa6e","last_reissued_at":"2026-05-17T23:42:57.473786Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:57.473786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.07874","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:42:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXyKUT7Dkn+SD8KwV1InRvPfwT0ZCW6vxAiO3aA+uXPLaEyzT+0PuSSz506OKx5V2gBfXMczVgX2Ta4MucedCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:53:00.712813Z"},"content_sha256":"ecbc76bbe08ec46a1d98f4e54dbc3c9682969d0a9a8055bf22ffbe48808f955c","schema_version":"1.0","event_id":"sha256:ecbc76bbe08ec46a1d98f4e54dbc3c9682969d0a9a8055bf22ffbe48808f955c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:N5UCXE5ZLSG7C2HTMHJDFDKOZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space Efficient Algorithms for Breadth-Depth Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Anish Mukherjee, Sankardeep Chakraborty, Srinivasa Rao Satti","submitted_at":"2019-06-19T01:45:10Z","abstract_excerpt":"Continuing the recent trend, in this article we design several space-efficient algorithms for two well-known graph search methods. Both these search methods share the same name {\\it breadth-depth search} (henceforth {\\sf BDS}), although they work entirely in different fashion. The classical implementation for these graph search methods takes $O(m+n)$ time and $O(n \\lg n)$ bits of space in the standard word RAM model (with word size being $\\Theta(\\lg n)$ bits), where $m$ and $n$ denotes the number of edges and vertices of the input graph respectively. Our goal here is to beat the space bound of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07874","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:42:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEDYk5IHwqvYC4OKC7WWeGwhYJcNAc6DO1xjiKJxfAMMwhshzEzHdHqN56MpIrCeS/fpGwC0bW2R/kqsLHR+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:53:00.713537Z"},"content_sha256":"88d50477af2bd2fc00bdd6284b18b8a6ff02d4675acb8e9f8d7429bb963e6bd0","schema_version":"1.0","event_id":"sha256:88d50477af2bd2fc00bdd6284b18b8a6ff02d4675acb8e9f8d7429bb963e6bd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5UCXE5ZLSG7C2HTMHJDFDKOZI/bundle.json","state_url":"https://pith.science/pith/N5UCXE5ZLSG7C2HTMHJDFDKOZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5UCXE5ZLSG7C2HTMHJDFDKOZI/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-05-29T19:53:00Z","links":{"resolver":"https://pith.science/pith/N5UCXE5ZLSG7C2HTMHJDFDKOZI","bundle":"https://pith.science/pith/N5UCXE5ZLSG7C2HTMHJDFDKOZI/bundle.json","state":"https://pith.science/pith/N5UCXE5ZLSG7C2HTMHJDFDKOZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5UCXE5ZLSG7C2HTMHJDFDKOZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N5UCXE5ZLSG7C2HTMHJDFDKOZI","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":"87c9bd7ae9b9ad07019aa76e15aa4902b08bd12fd3f3414e6ada2adece2069b6","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T01:45:10Z","title_canon_sha256":"e0ce8329a088261b4012f241273d26e7d75354760a9ff4c05a50c3555b320192"},"schema_version":"1.0","source":{"id":"1906.07874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07874","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07874v1","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07874","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"pith_short_12","alias_value":"N5UCXE5ZLSG7","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"N5UCXE5ZLSG7C2HT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"N5UCXE5Z","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:88d50477af2bd2fc00bdd6284b18b8a6ff02d4675acb8e9f8d7429bb963e6bd0","target":"graph","created_at":"2026-05-17T23:42:57Z","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":"Continuing the recent trend, in this article we design several space-efficient algorithms for two well-known graph search methods. Both these search methods share the same name {\\it breadth-depth search} (henceforth {\\sf BDS}), although they work entirely in different fashion. The classical implementation for these graph search methods takes $O(m+n)$ time and $O(n \\lg n)$ bits of space in the standard word RAM model (with word size being $\\Theta(\\lg n)$ bits), where $m$ and $n$ denotes the number of edges and vertices of the input graph respectively. Our goal here is to beat the space bound of","authors_text":"Anish Mukherjee, Sankardeep Chakraborty, Srinivasa Rao Satti","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T01:45:10Z","title":"Space Efficient Algorithms for Breadth-Depth Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07874","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:ecbc76bbe08ec46a1d98f4e54dbc3c9682969d0a9a8055bf22ffbe48808f955c","target":"record","created_at":"2026-05-17T23:42:57Z","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":"87c9bd7ae9b9ad07019aa76e15aa4902b08bd12fd3f3414e6ada2adece2069b6","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T01:45:10Z","title_canon_sha256":"e0ce8329a088261b4012f241273d26e7d75354760a9ff4c05a50c3555b320192"},"schema_version":"1.0","source":{"id":"1906.07874","kind":"arxiv","version":1}},"canonical_sha256":"6f682b93b95c8df168f361d2328d4eca3d80ce5ad2e29fc1daadd805634faa6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f682b93b95c8df168f361d2328d4eca3d80ce5ad2e29fc1daadd805634faa6e","first_computed_at":"2026-05-17T23:42:57.473786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:57.473786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b/POGRlY8A7dNjnGJaITSGyp5VYMetf9pehG/W+0/He2F/CsyFvxYOpke1Olc4H/WljXh5LqEgvmBQsPz9j0Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:57.474343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.07874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecbc76bbe08ec46a1d98f4e54dbc3c9682969d0a9a8055bf22ffbe48808f955c","sha256:88d50477af2bd2fc00bdd6284b18b8a6ff02d4675acb8e9f8d7429bb963e6bd0"],"state_sha256":"9702c21ec3a5469c5fc949bb78cfd6f3047ba81f0eab07cb2213f79c937671a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsDdW7tCYkodJDzGiKQa+LJ3/kX9y2nhwZj6oNPdNpOGxwLAE5oSyYlJzrBqhGWj+8lycg8rp1QYJI9pYUcbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:53:00.716844Z","bundle_sha256":"e34e91be02a4afa639b55e44b4578ce094010f655498f2339e7bfccbc5b39dc7"}}