{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OC2R44A7WHHPPZ7TKPQL2NJU2H","short_pith_number":"pith:OC2R44A7","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"},"canonical_sha256":"70b51e701fb1cef7e7f353e0bd3534d1c41c2effcf6129f0de908331a59508e3","source":{"kind":"arxiv","id":"1111.5220","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5220","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5220v2","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5220","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"pith_short_12","alias_value":"OC2R44A7WHHP","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OC2R44A7WHHPPZ7T","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OC2R44A7","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OC2R44A7WHHPPZ7TKPQL2NJU2H","target":"record","payload":{"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"},"canonical_sha256":"70b51e701fb1cef7e7f353e0bd3534d1c41c2effcf6129f0de908331a59508e3","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"},"source_kind":"arxiv","source_id":"1111.5220","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-05-18T04:07:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mk8r+ELWB/VdpOczAV98N6gg9A/mXs8J0yaqlaXop5BYLecE2ytbzEN+bvd/iWRFE7S066LphU/3b3ijJQVLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:07:39.217412Z"},"content_sha256":"7fcdcd68333d9e0db75ef9d0e1398b01595e45effc753bf7c060d2ddb01de2fc","schema_version":"1.0","event_id":"sha256:7fcdcd68333d9e0db75ef9d0e1398b01595e45effc753bf7c060d2ddb01de2fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OC2R44A7WHHPPZ7TKPQL2NJU2H","target":"graph","payload":{"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"},"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-18T04:07:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQ4AXk8Xm4raSO6rttlZyO5a9wFdYqBEUZRA+vBq9jeMCP0/i9tWzeapFGdWYIyK2KklLjMaSMaHcjQJRfBsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:07:39.217778Z"},"content_sha256":"f049f8f852d0e6c36a96b9dae4e27cd164e877820763cb46a2721ef506b70faf","schema_version":"1.0","event_id":"sha256:f049f8f852d0e6c36a96b9dae4e27cd164e877820763cb46a2721ef506b70faf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/bundle.json","state_url":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/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-05-24T14:07:39Z","links":{"resolver":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H","bundle":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/bundle.json","state":"https://pith.science/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OC2R44A7WHHPPZ7TKPQL2NJU2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OC2R44A7WHHPPZ7TKPQL2NJU2H","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":"fbf8874942372c29e230c03db1fda61ee6a078306f6c850e6b08573ba3c16fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T15:28:03Z","title_canon_sha256":"4d03916d3afbb473b17437823aa5d447d8315867a3e908daac5f3761cca39f8d"},"schema_version":"1.0","source":{"id":"1111.5220","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5220","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5220v2","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5220","created_at":"2026-05-18T04:07:06Z"},{"alias_kind":"pith_short_12","alias_value":"OC2R44A7WHHP","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OC2R44A7WHHPPZ7T","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OC2R44A7","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:f049f8f852d0e6c36a96b9dae4e27cd164e877820763cb46a2721ef506b70faf","target":"graph","created_at":"2026-05-18T04:07:06Z","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":"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","authors_text":"Giuseppe Ottaviano, Roberto Grossi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T15:28:03Z","title":"Fast Compressed Tries through Path Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5220","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:7fcdcd68333d9e0db75ef9d0e1398b01595e45effc753bf7c060d2ddb01de2fc","target":"record","created_at":"2026-05-18T04:07:06Z","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":"fbf8874942372c29e230c03db1fda61ee6a078306f6c850e6b08573ba3c16fb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-22T15:28:03Z","title_canon_sha256":"4d03916d3afbb473b17437823aa5d447d8315867a3e908daac5f3761cca39f8d"},"schema_version":"1.0","source":{"id":"1111.5220","kind":"arxiv","version":2}},"canonical_sha256":"70b51e701fb1cef7e7f353e0bd3534d1c41c2effcf6129f0de908331a59508e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70b51e701fb1cef7e7f353e0bd3534d1c41c2effcf6129f0de908331a59508e3","first_computed_at":"2026-05-18T04:07:06.347244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:06.347244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J214ErcqJSAyHpdspou5TANbTYhusR6HxjQhvoyg0VpH5krVKpjYoaC/ROUpRLxh11IyhUgg3UdUvVWHSuGjCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:06.347870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5220","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fcdcd68333d9e0db75ef9d0e1398b01595e45effc753bf7c060d2ddb01de2fc","sha256:f049f8f852d0e6c36a96b9dae4e27cd164e877820763cb46a2721ef506b70faf"],"state_sha256":"e71d654beacf2507f87407d921cb73b9f2dcba193ddfa8a406749308beb4c75c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QwRg74+sm/WHeWHGs0BVHlreC7/xkBg7MfSvt0p2vK/Dt/b45fjlIbnxF9kUOkyS9jCibWegbObvHz1hKG0wDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T14:07:39.220240Z","bundle_sha256":"68241596a83f5dd23e655f81d772ccdc2f32ac40ed179a9b6842c5e35b5b08f8"}}