{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6OFFGYC6DFSQHNXZTOWEC7DOKB","short_pith_number":"pith:6OFFGYC6","schema_version":"1.0","canonical_sha256":"f38a53605e196503b6f99bac417c6e50404d149e7c32145e26e3c2dc0bbff123","source":{"kind":"arxiv","id":"2504.10703","version":1},"attestation_state":"computed","paper":{"title":"The Trie Measure, Revisited","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bojana Kodric, Davide Cenzato, Jarno N. Alanko, Nicola Prezza, Ruben Becker, Sung-Hwan Kim, Travis Gagie","submitted_at":"2025-04-14T20:52:13Z","abstract_excerpt":"In this paper, we study the following problem: given $n$ subsets $S_1, \\dots, S_n$ of an integer universe $U = \\{0,\\dots, u-1\\}$, having total cardinality $N = \\sum_{i=1}^n |S_i|$, find a prefix-free encoding $enc : U \\rightarrow \\{0,1\\}^+$ minimizing the so-called trie measure, i.e., the total number of edges in the $n$ binary tries $\\mathcal T_1, \\dots, \\mathcal T_n$, where $\\mathcal T_i$ is the trie packing the encoded integers $\\{enc(x):x\\in S_i\\}$. We first observe that this problem is equivalent to that of merging $u$ sets with the cheapest sequence of binary unions, a problem which in ["},"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":"2504.10703","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-14T20:52:13Z","cross_cats_sorted":[],"title_canon_sha256":"e1826808628597e6f923a432ffbe27230ec6ac43ed1982eea5261b07fb9badc9","abstract_canon_sha256":"bbfd4761b526083cfe7fd67b8f0ae8743a5aa91ecbcf46a973fbddc8c23e9c38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:22.745102Z","signature_b64":"i8/5c/z8jomDlzU/v+hoBIAXygNqxXN+PjC4oF1qyDaO7j2jHvKybG5Kg4e6kOeACdkqnveDS+hBgsfOHdpfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f38a53605e196503b6f99bac417c6e50404d149e7c32145e26e3c2dc0bbff123","last_reissued_at":"2026-07-05T10:49:22.744613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:22.744613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Trie Measure, Revisited","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bojana Kodric, Davide Cenzato, Jarno N. Alanko, Nicola Prezza, Ruben Becker, Sung-Hwan Kim, Travis Gagie","submitted_at":"2025-04-14T20:52:13Z","abstract_excerpt":"In this paper, we study the following problem: given $n$ subsets $S_1, \\dots, S_n$ of an integer universe $U = \\{0,\\dots, u-1\\}$, having total cardinality $N = \\sum_{i=1}^n |S_i|$, find a prefix-free encoding $enc : U \\rightarrow \\{0,1\\}^+$ minimizing the so-called trie measure, i.e., the total number of edges in the $n$ binary tries $\\mathcal T_1, \\dots, \\mathcal T_n$, where $\\mathcal T_i$ is the trie packing the encoded integers $\\{enc(x):x\\in S_i\\}$. We first observe that this problem is equivalent to that of merging $u$ sets with the cheapest sequence of binary unions, a problem which in ["},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10703","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.10703/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.10703","created_at":"2026-07-05T10:49:22.744667+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.10703v1","created_at":"2026-07-05T10:49:22.744667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10703","created_at":"2026-07-05T10:49:22.744667+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OFFGYC6DFSQ","created_at":"2026-07-05T10:49:22.744667+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OFFGYC6DFSQHNXZ","created_at":"2026-07-05T10:49:22.744667+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OFFGYC6","created_at":"2026-07-05T10:49:22.744667+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/6OFFGYC6DFSQHNXZTOWEC7DOKB","json":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB.json","graph_json":"https://pith.science/api/pith-number/6OFFGYC6DFSQHNXZTOWEC7DOKB/graph.json","events_json":"https://pith.science/api/pith-number/6OFFGYC6DFSQHNXZTOWEC7DOKB/events.json","paper":"https://pith.science/paper/6OFFGYC6"},"agent_actions":{"view_html":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB","download_json":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB.json","view_paper":"https://pith.science/paper/6OFFGYC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.10703&json=true","fetch_graph":"https://pith.science/api/pith-number/6OFFGYC6DFSQHNXZTOWEC7DOKB/graph.json","fetch_events":"https://pith.science/api/pith-number/6OFFGYC6DFSQHNXZTOWEC7DOKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/action/storage_attestation","attest_author":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/action/author_attestation","sign_citation":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/action/citation_signature","submit_replication":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/action/replication_record"}},"created_at":"2026-07-05T10:49:22.744667+00:00","updated_at":"2026-07-05T10:49:22.744667+00:00"}