{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AR6SNPWP3X4OYVHDNJYKECB6FB","short_pith_number":"pith:AR6SNPWP","canonical_record":{"source":{"id":"2412.10655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-14T02:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"456af56fce7694039333b0d0aced9789db5dec3fa850101d65a5ccdb82a9db40","abstract_canon_sha256":"c8348690d1bb8e0205fa8f8388e5fe6bec7d1391eae837eb4305d4fdb4df2e9b"},"schema_version":"1.0"},"canonical_sha256":"047d26becfddf8ec54e36a70a2083e284887c7bb8de241be22b698a0c0ce455b","source":{"kind":"arxiv","id":"2412.10655","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.10655","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"2412.10655v2","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10655","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"AR6SNPWP3X4O","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"pith_short_16","alias_value":"AR6SNPWP3X4OYVHD","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"pith_short_8","alias_value":"AR6SNPWP","created_at":"2026-07-05T10:39:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AR6SNPWP3X4OYVHDNJYKECB6FB","target":"record","payload":{"canonical_record":{"source":{"id":"2412.10655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-14T02:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"456af56fce7694039333b0d0aced9789db5dec3fa850101d65a5ccdb82a9db40","abstract_canon_sha256":"c8348690d1bb8e0205fa8f8388e5fe6bec7d1391eae837eb4305d4fdb4df2e9b"},"schema_version":"1.0"},"canonical_sha256":"047d26becfddf8ec54e36a70a2083e284887c7bb8de241be22b698a0c0ce455b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:46.961653Z","signature_b64":"kBEIFI6mk3dT5m0tAyCLxcrtU3Jk3YKZVPum2xePf5DsYaO8MvE78or7XAbVYkRZEENKnY7sIUAa2n5ES+eNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"047d26becfddf8ec54e36a70a2083e284887c7bb8de241be22b698a0c0ce455b","last_reissued_at":"2026-07-05T10:39:46.961154Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:46.961154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.10655","source_version":2,"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-07-05T10:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfuDid8LRpEAfBwrSdo6+7d7tDDhf+sTA87dACfvH81F0jof8wo4wXBXgp98bYr7/EMCFs0kKPZETx6dXz65DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T23:10:16.870589Z"},"content_sha256":"0079b755690ffdde44a74711bc57cff748dcabf273d19e3ede7afe307556947f","schema_version":"1.0","event_id":"sha256:0079b755690ffdde44a74711bc57cff748dcabf273d19e3ede7afe307556947f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AR6SNPWP3X4OYVHDNJYKECB6FB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Static Dictionary with Worst-Case Constant Query Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huacheng Yu, Jingxun Liang, Junkai Zhang, Renfei Zhou, Yang Hu","submitted_at":"2024-12-14T02:52:30Z","abstract_excerpt":"In this paper, we design a new succinct static dictionary with worst-case constant query time. A dictionary data structure stores a set of key-value pairs with distinct keys in $[U]$ and values in $[\\sigma]$, such that given a query $x\\in [U]$, it quickly returns if $x$ is one of the input keys, and if so, also returns its associated value. The textbook solution to dictionaries is hash tables. On the other hand, the (information-theoretical) optimal space to encode such a set of key-value pairs is only $\\text{OPT} := \\log\\binom{U}{n}+n\\log \\sigma$.\n  We construct a dictionary that uses $\\text{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10655","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.10655/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfpT+BJtIMM8stqZJxKUUArswR+uJvcjwq1Me/f9dwjX1ptMos+8xI8MuzzQxGe9DztT1Uu3mpslpPdEeK5ZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T23:10:16.871537Z"},"content_sha256":"51d18fbbc0ee93da0bdbf1513a61ac838246a6d042111765028bd0d8821fecf1","schema_version":"1.0","event_id":"sha256:51d18fbbc0ee93da0bdbf1513a61ac838246a6d042111765028bd0d8821fecf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AR6SNPWP3X4OYVHDNJYKECB6FB/bundle.json","state_url":"https://pith.science/pith/AR6SNPWP3X4OYVHDNJYKECB6FB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AR6SNPWP3X4OYVHDNJYKECB6FB/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-08-14T23:10:16Z","links":{"resolver":"https://pith.science/pith/AR6SNPWP3X4OYVHDNJYKECB6FB","bundle":"https://pith.science/pith/AR6SNPWP3X4OYVHDNJYKECB6FB/bundle.json","state":"https://pith.science/pith/AR6SNPWP3X4OYVHDNJYKECB6FB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AR6SNPWP3X4OYVHDNJYKECB6FB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AR6SNPWP3X4OYVHDNJYKECB6FB","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":"c8348690d1bb8e0205fa8f8388e5fe6bec7d1391eae837eb4305d4fdb4df2e9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-14T02:52:30Z","title_canon_sha256":"456af56fce7694039333b0d0aced9789db5dec3fa850101d65a5ccdb82a9db40"},"schema_version":"1.0","source":{"id":"2412.10655","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.10655","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"2412.10655v2","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10655","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"AR6SNPWP3X4O","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"pith_short_16","alias_value":"AR6SNPWP3X4OYVHD","created_at":"2026-07-05T10:39:46Z"},{"alias_kind":"pith_short_8","alias_value":"AR6SNPWP","created_at":"2026-07-05T10:39:46Z"}],"graph_snapshots":[{"event_id":"sha256:51d18fbbc0ee93da0bdbf1513a61ac838246a6d042111765028bd0d8821fecf1","target":"graph","created_at":"2026-07-05T10:39:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.10655/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we design a new succinct static dictionary with worst-case constant query time. A dictionary data structure stores a set of key-value pairs with distinct keys in $[U]$ and values in $[\\sigma]$, such that given a query $x\\in [U]$, it quickly returns if $x$ is one of the input keys, and if so, also returns its associated value. The textbook solution to dictionaries is hash tables. On the other hand, the (information-theoretical) optimal space to encode such a set of key-value pairs is only $\\text{OPT} := \\log\\binom{U}{n}+n\\log \\sigma$.\n  We construct a dictionary that uses $\\text{","authors_text":"Huacheng Yu, Jingxun Liang, Junkai Zhang, Renfei Zhou, Yang Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-14T02:52:30Z","title":"Optimal Static Dictionary with Worst-Case Constant Query Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10655","kind":"arxiv","version":2},"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:0079b755690ffdde44a74711bc57cff748dcabf273d19e3ede7afe307556947f","target":"record","created_at":"2026-07-05T10:39:46Z","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":"c8348690d1bb8e0205fa8f8388e5fe6bec7d1391eae837eb4305d4fdb4df2e9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-14T02:52:30Z","title_canon_sha256":"456af56fce7694039333b0d0aced9789db5dec3fa850101d65a5ccdb82a9db40"},"schema_version":"1.0","source":{"id":"2412.10655","kind":"arxiv","version":2}},"canonical_sha256":"047d26becfddf8ec54e36a70a2083e284887c7bb8de241be22b698a0c0ce455b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"047d26becfddf8ec54e36a70a2083e284887c7bb8de241be22b698a0c0ce455b","first_computed_at":"2026-07-05T10:39:46.961154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:39:46.961154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kBEIFI6mk3dT5m0tAyCLxcrtU3Jk3YKZVPum2xePf5DsYaO8MvE78or7XAbVYkRZEENKnY7sIUAa2n5ES+eNCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:39:46.961653Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.10655","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0079b755690ffdde44a74711bc57cff748dcabf273d19e3ede7afe307556947f","sha256:51d18fbbc0ee93da0bdbf1513a61ac838246a6d042111765028bd0d8821fecf1"],"state_sha256":"8c047674c537cc458eac6330c0b4142b0ada89b6f1ab5aa5519f9be84b10081a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUV7ggJHKJFUdbt2ujWbS0hK2yLKgcllYaxXbxIV7PVMxL0J5FTxs6bCdn6jhvqj+mTas4ieiuXjjGIKPBrvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T23:10:16.926116Z","bundle_sha256":"33f01b1763678c4f4967f3fccdfce38e8ae6a0fde88dcccde4b528d27b151a04"}}