{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5SBD23B44FXZY66MTJRB53HEPR","short_pith_number":"pith:5SBD23B4","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"},"canonical_sha256":"ec823d6c3ce16f9c7bcc9a621eece47c4394ac6db28cce4c34e77ac4d9210231","source":{"kind":"arxiv","id":"1906.07871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07871","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07871v1","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07871","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"pith_short_12","alias_value":"5SBD23B44FXZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5SBD23B44FXZY66M","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5SBD23B4","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5SBD23B44FXZY66MTJRB53HEPR","target":"record","payload":{"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"},"canonical_sha256":"ec823d6c3ce16f9c7bcc9a621eece47c4394ac6db28cce4c34e77ac4d9210231","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"},"source_kind":"arxiv","source_id":"1906.07871","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":"UtoyqYdU07zBRaQah0m7GD1dcGSquGGqu8G1g7NAl7P8BaclhyAtaKpnbLaAThrJsDw7pP+aFbvvzIBYefPtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:06:42.686954Z"},"content_sha256":"e3c897b338895c5a6f4995f1d175d8ebc8460235f7b26d86b68f1fe4bd19517e","schema_version":"1.0","event_id":"sha256:e3c897b338895c5a6f4995f1d175d8ebc8460235f7b26d86b68f1fe4bd19517e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5SBD23B44FXZY66MTJRB53HEPR","target":"graph","payload":{"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"},"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":"3RuyKuq4DV7b6gwodkcT+Jp2cfo8/eZxo8iU9fmWX2vyKf64GZwG+GPYNtQori8sFMGMpF7L4MWYuKn0rVGOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:06:42.687636Z"},"content_sha256":"fadbc50dc35b2c72a80b5c43f59047dd037e39e9fc35b8a382f0f51264325136","schema_version":"1.0","event_id":"sha256:fadbc50dc35b2c72a80b5c43f59047dd037e39e9fc35b8a382f0f51264325136"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR/bundle.json","state_url":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SBD23B44FXZY66MTJRB53HEPR/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-08T03:06:42Z","links":{"resolver":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR","bundle":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR/bundle.json","state":"https://pith.science/pith/5SBD23B44FXZY66MTJRB53HEPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SBD23B44FXZY66MTJRB53HEPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5SBD23B44FXZY66MTJRB53HEPR","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":"02a04b94e25d3e23c45c1b2d0387341732c031a1f17ae5ac63973114e1ec6732","cross_cats_sorted":["cs.IR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T01:34:47Z","title_canon_sha256":"f91ade5c8117d690598967100edae42ae59b8790e4f9c5ced46dbe52b5f2be79"},"schema_version":"1.0","source":{"id":"1906.07871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.07871","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"arxiv_version","alias_value":"1906.07871v1","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07871","created_at":"2026-05-17T23:42:57Z"},{"alias_kind":"pith_short_12","alias_value":"5SBD23B44FXZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5SBD23B44FXZY66M","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5SBD23B4","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:fadbc50dc35b2c72a80b5c43f59047dd037e39e9fc35b8a382f0f51264325136","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":"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,","authors_text":"Kunihiko Sadakane, Sankardeep Chakraborty","cross_cats":["cs.IR","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T01:34:47Z","title":"Indexing Graph Search Trees and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07871","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:e3c897b338895c5a6f4995f1d175d8ebc8460235f7b26d86b68f1fe4bd19517e","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":"02a04b94e25d3e23c45c1b2d0387341732c031a1f17ae5ac63973114e1ec6732","cross_cats_sorted":["cs.IR","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T01:34:47Z","title_canon_sha256":"f91ade5c8117d690598967100edae42ae59b8790e4f9c5ced46dbe52b5f2be79"},"schema_version":"1.0","source":{"id":"1906.07871","kind":"arxiv","version":1}},"canonical_sha256":"ec823d6c3ce16f9c7bcc9a621eece47c4394ac6db28cce4c34e77ac4d9210231","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec823d6c3ce16f9c7bcc9a621eece47c4394ac6db28cce4c34e77ac4d9210231","first_computed_at":"2026-05-17T23:42:57.491651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:57.491651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fyz5BLsmJEgY9fOzpYCcfVahj/9f5TDUoXAKToaMgpZQOOvhxdLUeYuG97JFRo8hmkaslUYDmg9Czhql+1tlBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:57.492350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.07871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3c897b338895c5a6f4995f1d175d8ebc8460235f7b26d86b68f1fe4bd19517e","sha256:fadbc50dc35b2c72a80b5c43f59047dd037e39e9fc35b8a382f0f51264325136"],"state_sha256":"c2a83ab2fae0451877535c388deeec34dc421480e690a519ca9c808c62c556ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZtGsGmBRUra+w44UcQEYhqUf6azCuoAN59okNxGpms18ZAjxgV7b82CFfEUY78QMHMjit71jwgX4yh7qlO2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:06:42.691291Z","bundle_sha256":"b5cf193682bd6b71b80e7fe6196107e883029a8a1a611016fff746cffe79b3a3"}}