{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FPQHW5NMEY6DSVXN5GHT4S5GEP","short_pith_number":"pith:FPQHW5NM","canonical_record":{"source":{"id":"2405.12203","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-20T17:41:19Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"a6740d59588fd718481fcd549bfa8546c8ca488adc372486be0bd654403a3c68","abstract_canon_sha256":"d3b535dfc14adf6ba84bd685a2670426271e8088e9488084a0008b2e7d23d745"},"schema_version":"1.0"},"canonical_sha256":"2be07b75ac263c3956ede98f3e4ba623c402e316d8520f57c193aacbbd350739","source":{"kind":"arxiv","id":"2405.12203","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.12203","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"arxiv_version","alias_value":"2405.12203v3","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12203","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"pith_short_12","alias_value":"FPQHW5NMEY6D","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"FPQHW5NMEY6DSVXN","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"FPQHW5NM","created_at":"2026-07-05T09:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FPQHW5NMEY6DSVXN5GHT4S5GEP","target":"record","payload":{"canonical_record":{"source":{"id":"2405.12203","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-20T17:41:19Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"a6740d59588fd718481fcd549bfa8546c8ca488adc372486be0bd654403a3c68","abstract_canon_sha256":"d3b535dfc14adf6ba84bd685a2670426271e8088e9488084a0008b2e7d23d745"},"schema_version":"1.0"},"canonical_sha256":"2be07b75ac263c3956ede98f3e4ba623c402e316d8520f57c193aacbbd350739","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:54.331610Z","signature_b64":"bSsmSHUkSMlRpQqQT8r/57m7mNHxgCNgCcDlCqXSWicVgBAoXaIWCHmoa3l+u3QEJsMrycp2yW41DuVAtBWTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2be07b75ac263c3956ede98f3e4ba623c402e316d8520f57c193aacbbd350739","last_reissued_at":"2026-07-05T09:27:54.331140Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:54.331140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.12203","source_version":3,"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-05T09:27:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVkoylajIGuoNTf27WjUXZn9HOyXIDyLEChsPtakB22YATM7jQPwWiOuhW4zVBNvH5qIfNXOq6+RSf4Q47k+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:33:29.495850Z"},"content_sha256":"fe6cc1887fe6c23317fedbc993097cc9692de7c1256f5b5b4e447e56e84117a6","schema_version":"1.0","event_id":"sha256:fe6cc1887fe6c23317fedbc993097cc9692de7c1256f5b5b4e447e56e84117a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FPQHW5NMEY6DSVXN5GHT4S5GEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Relative Entropy Coding with Space Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Gergely Flamich, Jiajun He, Jos\\'e Miguel Hern\\'andez-Lobato","submitted_at":"2024-05-20T17:41:19Z","abstract_excerpt":"Relative entropy coding (REC) algorithms encode a random sample following a target distribution $Q$, using a coding distribution $P$ shared between the sender and receiver. Sadly, general REC algorithms suffer from prohibitive encoding times, at least on the order of $2^{D_{\\text{KL}}[Q||P]}$, and faster algorithms are limited to very specific settings. This work addresses this issue by introducing a REC scheme utilizing space partitioning to reduce runtime in practical scenarios. We provide theoretical analyses of our method and demonstrate its effectiveness with both toy examples and practic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12203","kind":"arxiv","version":3},"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/2405.12203/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-05T09:27:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYko5383hRggBUrvAtduCTCOU9qNWhl0OMaIRx25W4Z8XJ+Kk9MGEvuOY8g5vPpDZq/KuMN06YCASeGnU8DqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:33:29.496404Z"},"content_sha256":"9de9d7d40b6ce2e27fcc3d20dd8478d19e87baadea5980517389308d0a4d66a6","schema_version":"1.0","event_id":"sha256:9de9d7d40b6ce2e27fcc3d20dd8478d19e87baadea5980517389308d0a4d66a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/bundle.json","state_url":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/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-16T20:33:29Z","links":{"resolver":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP","bundle":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/bundle.json","state":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FPQHW5NMEY6DSVXN5GHT4S5GEP","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":"d3b535dfc14adf6ba84bd685a2670426271e8088e9488084a0008b2e7d23d745","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-20T17:41:19Z","title_canon_sha256":"a6740d59588fd718481fcd549bfa8546c8ca488adc372486be0bd654403a3c68"},"schema_version":"1.0","source":{"id":"2405.12203","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.12203","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"arxiv_version","alias_value":"2405.12203v3","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12203","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"pith_short_12","alias_value":"FPQHW5NMEY6D","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"FPQHW5NMEY6DSVXN","created_at":"2026-07-05T09:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"FPQHW5NM","created_at":"2026-07-05T09:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:9de9d7d40b6ce2e27fcc3d20dd8478d19e87baadea5980517389308d0a4d66a6","target":"graph","created_at":"2026-07-05T09:27:54Z","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/2405.12203/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Relative entropy coding (REC) algorithms encode a random sample following a target distribution $Q$, using a coding distribution $P$ shared between the sender and receiver. Sadly, general REC algorithms suffer from prohibitive encoding times, at least on the order of $2^{D_{\\text{KL}}[Q||P]}$, and faster algorithms are limited to very specific settings. This work addresses this issue by introducing a REC scheme utilizing space partitioning to reduce runtime in practical scenarios. We provide theoretical analyses of our method and demonstrate its effectiveness with both toy examples and practic","authors_text":"Gergely Flamich, Jiajun He, Jos\\'e Miguel Hern\\'andez-Lobato","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-20T17:41:19Z","title":"Accelerating Relative Entropy Coding with Space Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12203","kind":"arxiv","version":3},"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:fe6cc1887fe6c23317fedbc993097cc9692de7c1256f5b5b4e447e56e84117a6","target":"record","created_at":"2026-07-05T09:27:54Z","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":"d3b535dfc14adf6ba84bd685a2670426271e8088e9488084a0008b2e7d23d745","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-05-20T17:41:19Z","title_canon_sha256":"a6740d59588fd718481fcd549bfa8546c8ca488adc372486be0bd654403a3c68"},"schema_version":"1.0","source":{"id":"2405.12203","kind":"arxiv","version":3}},"canonical_sha256":"2be07b75ac263c3956ede98f3e4ba623c402e316d8520f57c193aacbbd350739","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2be07b75ac263c3956ede98f3e4ba623c402e316d8520f57c193aacbbd350739","first_computed_at":"2026-07-05T09:27:54.331140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:27:54.331140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bSsmSHUkSMlRpQqQT8r/57m7mNHxgCNgCcDlCqXSWicVgBAoXaIWCHmoa3l+u3QEJsMrycp2yW41DuVAtBWTBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:27:54.331610Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.12203","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe6cc1887fe6c23317fedbc993097cc9692de7c1256f5b5b4e447e56e84117a6","sha256:9de9d7d40b6ce2e27fcc3d20dd8478d19e87baadea5980517389308d0a4d66a6"],"state_sha256":"80296e84fa661b6380488c73e0476727baac82c011dbb9bc7d23ae77d97d3708"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rf00/TzaTUjp/6l0830BE5Wsl7DuM9Yw4z9hRB+tw1ktGTqhWKW6+o1w9KBu1AWUE/IGzapKOcCREHvUYhIxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:33:29.499978Z","bundle_sha256":"69520038fbb8d96d8405bd3a11da6d845707fcb144343c85a69e6e7501dcc054"}}