{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5SBD23B44FXZY66MTJRB53HEPR","short_pith_number":"pith:5SBD23B4","schema_version":"1.0","canonical_sha256":"ec823d6c3ce16f9c7bcc9a621eece47c4394ac6db28cce4c34e77ac4d9210231","source":{"kind":"arxiv","id":"1906.07871","version":1},"attestation_state":"computed","paper":{"title":"Indexing Graph Search Trees and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.SI"],"primary_cat":"cs.DS","authors_text":"Kunihiko Sadakane, Sankardeep Chakraborty","submitted_at":"2019-06-19T01:34:47Z","abstract_excerpt":"We consider the problem of compactly representing the Depth First Search (DFS) tree of a given undirected or directed graph having $n$ vertices and $m$ edges while supporting various DFS related queries efficiently in the RAM with logarithmic word size. We study this problem in two well-known models: {\\it indexing} and {\\it encoding} models. While most of these queries can be supported easily in constant time using $O(n \\lg n)$ bits\\footnote{We use $\\lg$ to denote logarithm to the base $2$.} of extra space, our goal here is, more specifically, to beat this trivial $O(n \\lg n)$ bit space bound,"},"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":"1906.07871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T01:34:47Z","cross_cats_sorted":["cs.IR","cs.SI"],"title_canon_sha256":"f91ade5c8117d690598967100edae42ae59b8790e4f9c5ced46dbe52b5f2be79","abstract_canon_sha256":"02a04b94e25d3e23c45c1b2d0387341732c031a1f17ae5ac63973114e1ec6732"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:57.492350Z","signature_b64":"fyz5BLsmJEgY9fOzpYCcfVahj/9f5TDUoXAKToaMgpZQOOvhxdLUeYuG97JFRo8hmkaslUYDmg9Czhql+1tlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec823d6c3ce16f9c7bcc9a621eece47c4394ac6db28cce4c34e77ac4d9210231","last_reissued_at":"2026-05-17T23:42:57.491651Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:57.491651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indexing Graph Search Trees and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.SI"],"primary_cat":"cs.DS","authors_text":"Kunihiko Sadakane, Sankardeep Chakraborty","submitted_at":"2019-06-19T01:34:47Z","abstract_excerpt":"We consider the problem of compactly representing the Depth First Search (DFS) tree of a given undirected or directed graph having $n$ vertices and $m$ edges while supporting various DFS related queries efficiently in the RAM with logarithmic word size. We study this problem in two well-known models: {\\it indexing} and {\\it encoding} models. While most of these queries can be supported easily in constant time using $O(n \\lg n)$ bits\\footnote{We use $\\lg$ to denote logarithm to the base $2$.} of extra space, our goal here is, more specifically, to beat this trivial $O(n \\lg n)$ bit space bound,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07871","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":"1906.07871","created_at":"2026-05-17T23:42:57.491749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.07871v1","created_at":"2026-05-17T23:42:57.491749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07871","created_at":"2026-05-17T23:42:57.491749+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SBD23B44FXZ","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SBD23B44FXZY66M","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SBD23B4","created_at":"2026-05-18T12:33:10.108867+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/5SBD23B44FXZY66MTJRB53HEPR","json":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR.json","graph_json":"https://pith.science/api/pith-number/5SBD23B44FXZY66MTJRB53HEPR/graph.json","events_json":"https://pith.science/api/pith-number/5SBD23B44FXZY66MTJRB53HEPR/events.json","paper":"https://pith.science/paper/5SBD23B4"},"agent_actions":{"view_html":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR","download_json":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR.json","view_paper":"https://pith.science/paper/5SBD23B4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.07871&json=true","fetch_graph":"https://pith.science/api/pith-number/5SBD23B44FXZY66MTJRB53HEPR/graph.json","fetch_events":"https://pith.science/api/pith-number/5SBD23B44FXZY66MTJRB53HEPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR/action/storage_attestation","attest_author":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR/action/author_attestation","sign_citation":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR/action/citation_signature","submit_replication":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR/action/replication_record"}},"created_at":"2026-05-17T23:42:57.491749+00:00","updated_at":"2026-05-17T23:42:57.491749+00:00"}