{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OC2R44A7WHHPPZ7TKPQL2NJU2H","short_pith_number":"pith:OC2R44A7","schema_version":"1.0","canonical_sha256":"70b51e701fb1cef7e7f353e0bd3534d1c41c2effcf6129f0de908331a59508e3","source":{"kind":"arxiv","id":"1111.5220","version":2},"attestation_state":"computed","paper":{"title":"Fast Compressed Tries through Path Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe Ottaviano, Roberto Grossi","submitted_at":"2011-11-22T15:28:03Z","abstract_excerpt":"Tries are popular data structures for storing a set of strings, where common prefixes are represented by common root-to-node paths. Over fifty years of usage have produced many variants and implementations to overcome some of their limitations. We explore new succinct representations of path-decomposed tries and experimentally evaluate the corresponding reduction in space usage and memory latency, comparing with the state of the art. We study two cases of applications: (1) a compressed dictionary for (compressed) strings, and (2) a monotone minimal perfect hash for strings that preserves their"},"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":"1111.5220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T15:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"4d03916d3afbb473b17437823aa5d447d8315867a3e908daac5f3761cca39f8d","abstract_canon_sha256":"fbf8874942372c29e230c03db1fda61ee6a078306f6c850e6b08573ba3c16fb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:06.347870Z","signature_b64":"J214ErcqJSAyHpdspou5TANbTYhusR6HxjQhvoyg0VpH5krVKpjYoaC/ROUpRLxh11IyhUgg3UdUvVWHSuGjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70b51e701fb1cef7e7f353e0bd3534d1c41c2effcf6129f0de908331a59508e3","last_reissued_at":"2026-05-18T04:07:06.347244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:06.347244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Compressed Tries through Path Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe Ottaviano, Roberto Grossi","submitted_at":"2011-11-22T15:28:03Z","abstract_excerpt":"Tries are popular data structures for storing a set of strings, where common prefixes are represented by common root-to-node paths. Over fifty years of usage have produced many variants and implementations to overcome some of their limitations. We explore new succinct representations of path-decomposed tries and experimentally evaluate the corresponding reduction in space usage and memory latency, comparing with the state of the art. We study two cases of applications: (1) a compressed dictionary for (compressed) strings, and (2) a monotone minimal perfect hash for strings that preserves their"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5220","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":""},"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":"1111.5220","created_at":"2026-05-18T04:07:06.347344+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5220v2","created_at":"2026-05-18T04:07:06.347344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5220","created_at":"2026-05-18T04:07:06.347344+00:00"},{"alias_kind":"pith_short_12","alias_value":"OC2R44A7WHHP","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OC2R44A7WHHPPZ7T","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OC2R44A7","created_at":"2026-05-18T12:26:37.096874+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/OC2R44A7WHHPPZ7TKPQL2NJU2H","json":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H.json","graph_json":"https://pith.science/api/pith-number/OC2R44A7WHHPPZ7TKPQL2NJU2H/graph.json","events_json":"https://pith.science/api/pith-number/OC2R44A7WHHPPZ7TKPQL2NJU2H/events.json","paper":"https://pith.science/paper/OC2R44A7"},"agent_actions":{"view_html":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H","download_json":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H.json","view_paper":"https://pith.science/paper/OC2R44A7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5220&json=true","fetch_graph":"https://pith.science/api/pith-number/OC2R44A7WHHPPZ7TKPQL2NJU2H/graph.json","fetch_events":"https://pith.science/api/pith-number/OC2R44A7WHHPPZ7TKPQL2NJU2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/action/storage_attestation","attest_author":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/action/author_attestation","sign_citation":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/action/citation_signature","submit_replication":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/action/replication_record"}},"created_at":"2026-05-18T04:07:06.347344+00:00","updated_at":"2026-05-18T04:07:06.347344+00:00"}