{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:Z3QPDT3BZ6JKYSD5JICC3P56NJ","short_pith_number":"pith:Z3QPDT3B","schema_version":"1.0","canonical_sha256":"cee0f1cf61cf92ac487d4a042dbfbe6a7927bea68b47095d11022807d029e0c5","source":{"kind":"arxiv","id":"1008.2008","version":2},"attestation_state":"computed","paper":{"title":"Rate-Constrained Simulation and Source Coding IID Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mark Z. Mao, Robert M. Gray, Tamas Linder","submitted_at":"2010-08-11T20:53:31Z","abstract_excerpt":"Necessary conditions for asymptotically optimal sliding-block or stationary codes for source coding and rate-constrained simulation of memoryless sources are presented and used to motivate a design technique for trellis-encoded source coding and rate-constrained simulation. The code structure has intuitive similarities to classic random coding arguments as well as to ``fake process'' methods and alphabet-constrained methods. Experimental evidence shows that the approach provides comparable or superior performance in comparison with previously published methods on common examples, sometimes by "},"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":"1008.2008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-11T20:53:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"70803e61edb173450f766bbe6be68120449938cdaf61c17cb61d19f7c42b33e3","abstract_canon_sha256":"ea390ef72e310706e116db2b99603ce8ec8af62f9a62242e938b4bdcdb0c367c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:08.136791Z","signature_b64":"0zSFwFoSuA1QOU+yJWvWVTj0ey8ZznhLGw8hT5G7eRUXvkzVqYKTP71S//7Fg5xKsieyEczOTKD3gerkswI7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cee0f1cf61cf92ac487d4a042dbfbe6a7927bea68b47095d11022807d029e0c5","last_reissued_at":"2026-05-18T04:28:08.136000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:08.136000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Constrained Simulation and Source Coding IID Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mark Z. Mao, Robert M. Gray, Tamas Linder","submitted_at":"2010-08-11T20:53:31Z","abstract_excerpt":"Necessary conditions for asymptotically optimal sliding-block or stationary codes for source coding and rate-constrained simulation of memoryless sources are presented and used to motivate a design technique for trellis-encoded source coding and rate-constrained simulation. The code structure has intuitive similarities to classic random coding arguments as well as to ``fake process'' methods and alphabet-constrained methods. Experimental evidence shows that the approach provides comparable or superior performance in comparison with previously published methods on common examples, sometimes by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2008","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":""},"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":"1008.2008","created_at":"2026-05-18T04:28:08.136143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.2008v2","created_at":"2026-05-18T04:28:08.136143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2008","created_at":"2026-05-18T04:28:08.136143+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3QPDT3BZ6JK","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3QPDT3BZ6JKYSD5","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3QPDT3B","created_at":"2026-05-18T12:26:17.028572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ","json":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ.json","graph_json":"https://pith.science/api/pith-number/Z3QPDT3BZ6JKYSD5JICC3P56NJ/graph.json","events_json":"https://pith.science/api/pith-number/Z3QPDT3BZ6JKYSD5JICC3P56NJ/events.json","paper":"https://pith.science/paper/Z3QPDT3B"},"agent_actions":{"view_html":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ","download_json":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ.json","view_paper":"https://pith.science/paper/Z3QPDT3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.2008&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3QPDT3BZ6JKYSD5JICC3P56NJ/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3QPDT3BZ6JKYSD5JICC3P56NJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/action/storage_attestation","attest_author":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/action/author_attestation","sign_citation":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/action/citation_signature","submit_replication":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/action/replication_record"}},"created_at":"2026-05-18T04:28:08.136143+00:00","updated_at":"2026-05-18T04:28:08.136143+00:00"}