{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YCG5DUKK25WMNYPINFYM522KSK","short_pith_number":"pith:YCG5DUKK","schema_version":"1.0","canonical_sha256":"c08dd1d14ad76cc6e1e86970ceeb4a92a648998af6593082d20286b0908d7c6b","source":{"kind":"arxiv","id":"2401.16579","version":2},"attestation_state":"computed","paper":{"title":"On Channel Simulation with Causal Rejection Samplers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Goc, Gergely Flamich","submitted_at":"2024-01-29T21:29:21Z","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"},"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":"2401.16579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-29T21:29:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eead8df4dd7c522be8b3c31659072c3c0d87aa004647cd4dd30f64705b65f291","abstract_canon_sha256":"8a9cd7a78495453dca5154d5a9f5a5081bfefb24ef9318a6da449b2ec2302e13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:15:12.018991Z","signature_b64":"nHcA7oLGaZmU8wPRLxgTug1xxhjM0nSPGfvabXLcbHykp/NfsBvN+EYubFSec9yc+y5Kzz+LUxLGPvvzB3IWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c08dd1d14ad76cc6e1e86970ceeb4a92a648998af6593082d20286b0908d7c6b","last_reissued_at":"2026-07-05T08:15:12.018521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:15:12.018521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Channel Simulation with Causal Rejection Samplers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Goc, Gergely Flamich","submitted_at":"2024-01-29T21:29:21Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.16579","kind":"arxiv","version":2},"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/2401.16579/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":"2401.16579","created_at":"2026-07-05T08:15:12.018581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.16579v2","created_at":"2026-07-05T08:15:12.018581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.16579","created_at":"2026-07-05T08:15:12.018581+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCG5DUKK25WM","created_at":"2026-07-05T08:15:12.018581+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCG5DUKK25WMNYPI","created_at":"2026-07-05T08:15:12.018581+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCG5DUKK","created_at":"2026-07-05T08:15:12.018581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10935","citing_title":"Progressive Compression with Universally Quantized Diffusion Models","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YCG5DUKK25WMNYPINFYM522KSK","json":"https://pith.science/pith/YCG5DUKK25WMNYPINFYM522KSK.json","graph_json":"https://pith.science/api/pith-number/YCG5DUKK25WMNYPINFYM522KSK/graph.json","events_json":"https://pith.science/api/pith-number/YCG5DUKK25WMNYPINFYM522KSK/events.json","paper":"https://pith.science/paper/YCG5DUKK"},"agent_actions":{"view_html":"https://pith.science/pith/YCG5DUKK25WMNYPINFYM522KSK","download_json":"https://pith.science/pith/YCG5DUKK25WMNYPINFYM522KSK.json","view_paper":"https://pith.science/paper/YCG5DUKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.16579&json=true","fetch_graph":"https://pith.science/api/pith-number/YCG5DUKK25WMNYPINFYM522KSK/graph.json","fetch_events":"https://pith.science/api/pith-number/YCG5DUKK25WMNYPINFYM522KSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCG5DUKK25WMNYPINFYM522KSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCG5DUKK25WMNYPINFYM522KSK/action/storage_attestation","attest_author":"https://pith.science/pith/YCG5DUKK25WMNYPINFYM522KSK/action/author_attestation","sign_citation":"https://pith.science/pith/YCG5DUKK25WMNYPINFYM522KSK/action/citation_signature","submit_replication":"https://pith.science/pith/YCG5DUKK25WMNYPINFYM522KSK/action/replication_record"}},"created_at":"2026-07-05T08:15:12.018581+00:00","updated_at":"2026-07-05T08:15:12.018581+00:00"}