{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FPQHW5NMEY6DSVXN5GHT4S5GEP","short_pith_number":"pith:FPQHW5NM","schema_version":"1.0","canonical_sha256":"2be07b75ac263c3956ede98f3e4ba623c402e316d8520f57c193aacbbd350739","source":{"kind":"arxiv","id":"2405.12203","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.12203","created_at":"2026-07-05T09:27:54.331198+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.12203v3","created_at":"2026-07-05T09:27:54.331198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12203","created_at":"2026-07-05T09:27:54.331198+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPQHW5NMEY6D","created_at":"2026-07-05T09:27:54.331198+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPQHW5NMEY6DSVXN","created_at":"2026-07-05T09:27:54.331198+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPQHW5NM","created_at":"2026-07-05T09:27:54.331198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07016","citing_title":"Multi-Terminal Remote Generation and Estimation Over a Broadcast Channel With Correlated Priors","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP","json":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP.json","graph_json":"https://pith.science/api/pith-number/FPQHW5NMEY6DSVXN5GHT4S5GEP/graph.json","events_json":"https://pith.science/api/pith-number/FPQHW5NMEY6DSVXN5GHT4S5GEP/events.json","paper":"https://pith.science/paper/FPQHW5NM"},"agent_actions":{"view_html":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP","download_json":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP.json","view_paper":"https://pith.science/paper/FPQHW5NM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.12203&json=true","fetch_graph":"https://pith.science/api/pith-number/FPQHW5NMEY6DSVXN5GHT4S5GEP/graph.json","fetch_events":"https://pith.science/api/pith-number/FPQHW5NMEY6DSVXN5GHT4S5GEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/action/storage_attestation","attest_author":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/action/author_attestation","sign_citation":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/action/citation_signature","submit_replication":"https://pith.science/pith/FPQHW5NMEY6DSVXN5GHT4S5GEP/action/replication_record"}},"created_at":"2026-07-05T09:27:54.331198+00:00","updated_at":"2026-07-05T09:27:54.331198+00:00"}