{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Z3QPDT3BZ6JKYSD5JICC3P56NJ","short_pith_number":"pith:Z3QPDT3B","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"},"canonical_sha256":"cee0f1cf61cf92ac487d4a042dbfbe6a7927bea68b47095d11022807d029e0c5","source":{"kind":"arxiv","id":"1008.2008","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2008","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2008v2","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2008","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"Z3QPDT3BZ6JK","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Z3QPDT3BZ6JKYSD5","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Z3QPDT3B","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Z3QPDT3BZ6JKYSD5JICC3P56NJ","target":"record","payload":{"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"},"canonical_sha256":"cee0f1cf61cf92ac487d4a042dbfbe6a7927bea68b47095d11022807d029e0c5","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"},"source_kind":"arxiv","source_id":"1008.2008","source_version":2,"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-05-18T04:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8FLFPkK2DifBPISGzzQU3MQtEIWaoZFq8TsVtQEXLylOntpDkumGlpM/gXySOB3eqMtD1+EeNaCR/vwfFfNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:58:19.466783Z"},"content_sha256":"b809fa6f0905c25ddd12c864bc115dabd0b65f2f9a885b3ece9256cf0bc8ea37","schema_version":"1.0","event_id":"sha256:b809fa6f0905c25ddd12c864bc115dabd0b65f2f9a885b3ece9256cf0bc8ea37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Z3QPDT3BZ6JKYSD5JICC3P56NJ","target":"graph","payload":{"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"},"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-05-18T04:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvJxb4WVeClIqQ6/gRCJCUwyDkciOvFhOCry0ltBbiYU1r/weNsbcoEQoRsnq0ngbYOIa7pgRC3hPs4RLE4JBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:58:19.467528Z"},"content_sha256":"d068ffec269b9cf4a87dc9f50d0cdd8f2d2016043eb342aa7f457c9e162ba5cc","schema_version":"1.0","event_id":"sha256:d068ffec269b9cf4a87dc9f50d0cdd8f2d2016043eb342aa7f457c9e162ba5cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/bundle.json","state_url":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/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-06-08T15:58:19Z","links":{"resolver":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ","bundle":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/bundle.json","state":"https://pith.science/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3QPDT3BZ6JKYSD5JICC3P56NJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Z3QPDT3BZ6JKYSD5JICC3P56NJ","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":"ea390ef72e310706e116db2b99603ce8ec8af62f9a62242e938b4bdcdb0c367c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-11T20:53:31Z","title_canon_sha256":"70803e61edb173450f766bbe6be68120449938cdaf61c17cb61d19f7c42b33e3"},"schema_version":"1.0","source":{"id":"1008.2008","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2008","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2008v2","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2008","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"Z3QPDT3BZ6JK","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"Z3QPDT3BZ6JKYSD5","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"Z3QPDT3B","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:d068ffec269b9cf4a87dc9f50d0cdd8f2d2016043eb342aa7f457c9e162ba5cc","target":"graph","created_at":"2026-05-18T04:28:08Z","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"},"paper":{"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 ","authors_text":"Mark Z. Mao, Robert M. Gray, Tamas Linder","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-11T20:53:31Z","title":"Rate-Constrained Simulation and Source Coding IID Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2008","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:b809fa6f0905c25ddd12c864bc115dabd0b65f2f9a885b3ece9256cf0bc8ea37","target":"record","created_at":"2026-05-18T04:28:08Z","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":"ea390ef72e310706e116db2b99603ce8ec8af62f9a62242e938b4bdcdb0c367c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-11T20:53:31Z","title_canon_sha256":"70803e61edb173450f766bbe6be68120449938cdaf61c17cb61d19f7c42b33e3"},"schema_version":"1.0","source":{"id":"1008.2008","kind":"arxiv","version":2}},"canonical_sha256":"cee0f1cf61cf92ac487d4a042dbfbe6a7927bea68b47095d11022807d029e0c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cee0f1cf61cf92ac487d4a042dbfbe6a7927bea68b47095d11022807d029e0c5","first_computed_at":"2026-05-18T04:28:08.136000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:08.136000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0zSFwFoSuA1QOU+yJWvWVTj0ey8ZznhLGw8hT5G7eRUXvkzVqYKTP71S//7Fg5xKsieyEczOTKD3gerkswI7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:08.136791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2008","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b809fa6f0905c25ddd12c864bc115dabd0b65f2f9a885b3ece9256cf0bc8ea37","sha256:d068ffec269b9cf4a87dc9f50d0cdd8f2d2016043eb342aa7f457c9e162ba5cc"],"state_sha256":"e33e686bc84550331e24502846cb4bea16ac2dd4f9006e5783ffbd22aa794e1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XLYv1J71H+adCASX05G9JM9X/FWpZcrOCP+QBlBVaS4TWTWgYeTklHdS5ulmXax1MmaXkNK8aMvlvzXVTMhmBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:58:19.471594Z","bundle_sha256":"9782e53564a07966b9ed0405a0e2f157f9c8d327a201c80e89e73ad2bfb68977"}}