{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6OFFGYC6DFSQHNXZTOWEC7DOKB","short_pith_number":"pith:6OFFGYC6","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"},"canonical_sha256":"f38a53605e196503b6f99bac417c6e50404d149e7c32145e26e3c2dc0bbff123","source":{"kind":"arxiv","id":"2504.10703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.10703","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"2504.10703v1","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10703","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"6OFFGYC6DFSQ","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"pith_short_16","alias_value":"6OFFGYC6DFSQHNXZ","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"pith_short_8","alias_value":"6OFFGYC6","created_at":"2026-07-05T10:49:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6OFFGYC6DFSQHNXZTOWEC7DOKB","target":"record","payload":{"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"},"canonical_sha256":"f38a53605e196503b6f99bac417c6e50404d149e7c32145e26e3c2dc0bbff123","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"},"source_kind":"arxiv","source_id":"2504.10703","source_version":1,"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:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+27zii5vT6O9D1PDp396eSilJFBQTQEqQ0+IJV+VYiwQ6JNAIfTPjn0bc3mJnPS1moGZRcn+THgEBcDlTpkYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T07:31:04.323358Z"},"content_sha256":"c8946eea9ea99525fac46d4632e390b401c67f1d1b701ae9de644afbfc7dd320","schema_version":"1.0","event_id":"sha256:c8946eea9ea99525fac46d4632e390b401c67f1d1b701ae9de644afbfc7dd320"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6OFFGYC6DFSQHNXZTOWEC7DOKB","target":"graph","payload":{"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"},"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:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tU4g+yCKMuZB0CjMhHS4vBpVkVtspbH9G7sMR6SlzoIBPxvZDYaCF9oCbX9T3raUbfLNEBuUJ7HQp1EpppKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T07:31:04.323731Z"},"content_sha256":"925637e8a39352252262bca9e238bbc74e6ebf9e94fba40f9d2e7a4fdbd341f9","schema_version":"1.0","event_id":"sha256:925637e8a39352252262bca9e238bbc74e6ebf9e94fba40f9d2e7a4fdbd341f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/bundle.json","state_url":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/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-07-06T07:31:04Z","links":{"resolver":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB","bundle":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/bundle.json","state":"https://pith.science/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OFFGYC6DFSQHNXZTOWEC7DOKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6OFFGYC6DFSQHNXZTOWEC7DOKB","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":"bbfd4761b526083cfe7fd67b8f0ae8743a5aa91ecbcf46a973fbddc8c23e9c38","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-14T20:52:13Z","title_canon_sha256":"e1826808628597e6f923a432ffbe27230ec6ac43ed1982eea5261b07fb9badc9"},"schema_version":"1.0","source":{"id":"2504.10703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.10703","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"2504.10703v1","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10703","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"6OFFGYC6DFSQ","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"pith_short_16","alias_value":"6OFFGYC6DFSQHNXZ","created_at":"2026-07-05T10:49:22Z"},{"alias_kind":"pith_short_8","alias_value":"6OFFGYC6","created_at":"2026-07-05T10:49:22Z"}],"graph_snapshots":[{"event_id":"sha256:925637e8a39352252262bca9e238bbc74e6ebf9e94fba40f9d2e7a4fdbd341f9","target":"graph","created_at":"2026-07-05T10:49:22Z","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/2504.10703/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 [","authors_text":"Bojana Kodric, Davide Cenzato, Jarno N. Alanko, Nicola Prezza, Ruben Becker, Sung-Hwan Kim, Travis Gagie","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-14T20:52:13Z","title":"The Trie Measure, Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10703","kind":"arxiv","version":1},"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:c8946eea9ea99525fac46d4632e390b401c67f1d1b701ae9de644afbfc7dd320","target":"record","created_at":"2026-07-05T10:49:22Z","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":"bbfd4761b526083cfe7fd67b8f0ae8743a5aa91ecbcf46a973fbddc8c23e9c38","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-14T20:52:13Z","title_canon_sha256":"e1826808628597e6f923a432ffbe27230ec6ac43ed1982eea5261b07fb9badc9"},"schema_version":"1.0","source":{"id":"2504.10703","kind":"arxiv","version":1}},"canonical_sha256":"f38a53605e196503b6f99bac417c6e50404d149e7c32145e26e3c2dc0bbff123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f38a53605e196503b6f99bac417c6e50404d149e7c32145e26e3c2dc0bbff123","first_computed_at":"2026-07-05T10:49:22.744613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:22.744613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i8/5c/z8jomDlzU/v+hoBIAXygNqxXN+PjC4oF1qyDaO7j2jHvKybG5Kg4e6kOeACdkqnveDS+hBgsfOHdpfCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:22.745102Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.10703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8946eea9ea99525fac46d4632e390b401c67f1d1b701ae9de644afbfc7dd320","sha256:925637e8a39352252262bca9e238bbc74e6ebf9e94fba40f9d2e7a4fdbd341f9"],"state_sha256":"dbd2fabeaa7f8db0b31743f21900fb7792532207f6ef1663c892f4fb68dda568"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAEdHoJHTV2e6YCucZPrwCa5noTg93GQYG5Nb20vpi6mT1buGtsHkT9kdaOHRcL8HGBUczgPqPKaJWXhyi+HCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T07:31:04.325698Z","bundle_sha256":"243c6d6b7cc7c79fa1262cb4743d5f87ea6600d5e9526f60ef77839cd3844986"}}