{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YCG5DUKK25WMNYPINFYM522KSK","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":"8a9cd7a78495453dca5154d5a9f5a5081bfefb24ef9318a6da449b2ec2302e13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-29T21:29:21Z","title_canon_sha256":"eead8df4dd7c522be8b3c31659072c3c0d87aa004647cd4dd30f64705b65f291"},"schema_version":"1.0","source":{"id":"2401.16579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.16579","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"arxiv_version","alias_value":"2401.16579v2","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.16579","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"pith_short_12","alias_value":"YCG5DUKK25WM","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"pith_short_16","alias_value":"YCG5DUKK25WMNYPI","created_at":"2026-07-05T08:15:12Z"},{"alias_kind":"pith_short_8","alias_value":"YCG5DUKK","created_at":"2026-07-05T08:15:12Z"}],"graph_snapshots":[{"event_id":"sha256:cbd65a8dbe8e4e309325ab4a41a717edab9e636a725a0e69130b5ee7ac5ab219","target":"graph","created_at":"2026-07-05T08:15:12Z","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/2401.16579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One-shot channel simulation has recently emerged as a promising alternative to quantization and entropy coding in machine-learning-based lossy data compression schemes. However, while there are several potential applications of channel simulation - lossy compression with realism constraints or differential privacy, to name a few - little is known about its fundamental limitations. In this paper, we restrict our attention to a subclass of channel simulation protocols called causal rejection samplers (CRS), establish new, tighter lower bounds on their expected runtime and codelength, and demonst","authors_text":"Daniel Goc, Gergely Flamich","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-29T21:29:21Z","title":"On Channel Simulation with Causal Rejection Samplers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.16579","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:98f251b82926bd8d3e72b373b15694b29963a8928afe88ea5a6c0d2080cb6481","target":"record","created_at":"2026-07-05T08:15:12Z","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":"8a9cd7a78495453dca5154d5a9f5a5081bfefb24ef9318a6da449b2ec2302e13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-29T21:29:21Z","title_canon_sha256":"eead8df4dd7c522be8b3c31659072c3c0d87aa004647cd4dd30f64705b65f291"},"schema_version":"1.0","source":{"id":"2401.16579","kind":"arxiv","version":2}},"canonical_sha256":"c08dd1d14ad76cc6e1e86970ceeb4a92a648998af6593082d20286b0908d7c6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c08dd1d14ad76cc6e1e86970ceeb4a92a648998af6593082d20286b0908d7c6b","first_computed_at":"2026-07-05T08:15:12.018521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:15:12.018521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nHcA7oLGaZmU8wPRLxgTug1xxhjM0nSPGfvabXLcbHykp/NfsBvN+EYubFSec9yc+y5Kzz+LUxLGPvvzB3IWCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:15:12.018991Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.16579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98f251b82926bd8d3e72b373b15694b29963a8928afe88ea5a6c0d2080cb6481","sha256:cbd65a8dbe8e4e309325ab4a41a717edab9e636a725a0e69130b5ee7ac5ab219"],"state_sha256":"99a4e4551de80d1a1b6493c4a0146beb5371389a60928fe68704fad6c12fec34"}