{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YVBMECK4OP4BRAUBEVPJGOVH6M","short_pith_number":"pith:YVBMECK4","schema_version":"1.0","canonical_sha256":"c542c2095c73f8188281255e933aa7f30c3667041de09c6d1480a8050fefb0b8","source":{"kind":"arxiv","id":"1306.3772","version":1},"attestation_state":"computed","paper":{"title":"Minimal Indices for Successor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amos Fiat, Haim Kaplan, Moshik Hershcovitch, Sarel Cohen","submitted_at":"2013-06-17T08:47:05Z","abstract_excerpt":"We give a new successor data structure which improves upon the index size of the P\\v{a}tra\\c{s}cu-Thorup data structures, reducing the index size from $O(n w^{4/5})$ bits to $O(n \\log w)$ bits, with optimal probe complexity. Alternatively, our new data structure can be viewed as matching the space complexity of the (probe-suboptimal) $z$-fast trie of Belazzougui et al. Thus, we get the best of both approaches with respect to both probe count and index size. The penalty we pay is an extra $O(\\log w)$ inter-register operations. Our data structure can also be used to solve the weak prefix search "},"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":"1306.3772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-17T08:47:05Z","cross_cats_sorted":[],"title_canon_sha256":"455b2c194db24eec144e4243d1b9a5bd27a47c0b04348db65c2e742b960ac5cd","abstract_canon_sha256":"90d920b598c1fd0980055e2eb4af4e5f4ec53b5791fcea5cdb346834c0a84f91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:46.500416Z","signature_b64":"fn0yVBnqpF33YjF/o7AvqCxGwPZFhbl6zVLmUz2QsbciR1A2sLw/UcXH7yffmUBJC/bavDvfZcj5epRstnLFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c542c2095c73f8188281255e933aa7f30c3667041de09c6d1480a8050fefb0b8","last_reissued_at":"2026-05-18T03:20:46.499754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:46.499754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Indices for Successor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amos Fiat, Haim Kaplan, Moshik Hershcovitch, Sarel Cohen","submitted_at":"2013-06-17T08:47:05Z","abstract_excerpt":"We give a new successor data structure which improves upon the index size of the P\\v{a}tra\\c{s}cu-Thorup data structures, reducing the index size from $O(n w^{4/5})$ bits to $O(n \\log w)$ bits, with optimal probe complexity. Alternatively, our new data structure can be viewed as matching the space complexity of the (probe-suboptimal) $z$-fast trie of Belazzougui et al. Thus, we get the best of both approaches with respect to both probe count and index size. The penalty we pay is an extra $O(\\log w)$ inter-register operations. Our data structure can also be used to solve the weak prefix search "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3772","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":"1306.3772","created_at":"2026-05-18T03:20:46.499851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3772v1","created_at":"2026-05-18T03:20:46.499851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3772","created_at":"2026-05-18T03:20:46.499851+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVBMECK4OP4B","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVBMECK4OP4BRAUB","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVBMECK4","created_at":"2026-05-18T12:28:09.283467+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/YVBMECK4OP4BRAUBEVPJGOVH6M","json":"https://pith.science/pith/YVBMECK4OP4BRAUBEVPJGOVH6M.json","graph_json":"https://pith.science/api/pith-number/YVBMECK4OP4BRAUBEVPJGOVH6M/graph.json","events_json":"https://pith.science/api/pith-number/YVBMECK4OP4BRAUBEVPJGOVH6M/events.json","paper":"https://pith.science/paper/YVBMECK4"},"agent_actions":{"view_html":"https://pith.science/pith/YVBMECK4OP4BRAUBEVPJGOVH6M","download_json":"https://pith.science/pith/YVBMECK4OP4BRAUBEVPJGOVH6M.json","view_paper":"https://pith.science/paper/YVBMECK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3772&json=true","fetch_graph":"https://pith.science/api/pith-number/YVBMECK4OP4BRAUBEVPJGOVH6M/graph.json","fetch_events":"https://pith.science/api/pith-number/YVBMECK4OP4BRAUBEVPJGOVH6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVBMECK4OP4BRAUBEVPJGOVH6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVBMECK4OP4BRAUBEVPJGOVH6M/action/storage_attestation","attest_author":"https://pith.science/pith/YVBMECK4OP4BRAUBEVPJGOVH6M/action/author_attestation","sign_citation":"https://pith.science/pith/YVBMECK4OP4BRAUBEVPJGOVH6M/action/citation_signature","submit_replication":"https://pith.science/pith/YVBMECK4OP4BRAUBEVPJGOVH6M/action/replication_record"}},"created_at":"2026-05-18T03:20:46.499851+00:00","updated_at":"2026-05-18T03:20:46.499851+00:00"}