{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:RVXOS7DJIWHEGYK6BSN44APIO2","short_pith_number":"pith:RVXOS7DJ","canonical_record":{"source":{"id":"0908.3512","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-25T01:54:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5cd5e676d362d22183d5e27e7eb9ac052f78b2554226a7660e4f188ac6221fe5","abstract_canon_sha256":"f2655b4ac27454c5a9c9cc95bd6bce377afe118b0e7cddf2c84880bbe9dacb56"},"schema_version":"1.0"},"canonical_sha256":"8d6ee97c69458e43615e0c9bce01e876a9a4f6f3fa6a782eec746c2a6edd225b","source":{"kind":"arxiv","id":"0908.3512","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.3512","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"0908.3512v4","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3512","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"RVXOS7DJIWHE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RVXOS7DJIWHEGYK6","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RVXOS7DJ","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:RVXOS7DJIWHEGYK6BSN44APIO2","target":"record","payload":{"canonical_record":{"source":{"id":"0908.3512","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-25T01:54:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5cd5e676d362d22183d5e27e7eb9ac052f78b2554226a7660e4f188ac6221fe5","abstract_canon_sha256":"f2655b4ac27454c5a9c9cc95bd6bce377afe118b0e7cddf2c84880bbe9dacb56"},"schema_version":"1.0"},"canonical_sha256":"8d6ee97c69458e43615e0c9bce01e876a9a4f6f3fa6a782eec746c2a6edd225b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:33.096004Z","signature_b64":"vn7FSs63/beakzbzB1e8ts/za1y7rdw8p0yv5ePS6ae1tvrHeKTxYKcOSIjVsHDXQ/tsutnwuXF1pjAUBcIqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d6ee97c69458e43615e0c9bce01e876a9a4f6f3fa6a782eec746c2a6edd225b","last_reissued_at":"2026-05-18T03:49:33.095390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:33.095390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.3512","source_version":4,"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-18T03:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3anndMu7rb3WbKJcflbP+WNNBQitjXw1QHv7QrdsVGJ00BfuIMp1ps8hcNW9JmiOHp2Mo1Zi7qquhlZC+y6PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:14:15.060382Z"},"content_sha256":"ec6c5cff4ac8e383b874f2bb38748da7c1a7b135b97d3083112a6274c41ddb30","schema_version":"1.0","event_id":"sha256:ec6c5cff4ac8e383b874f2bb38748da7c1a7b135b97d3083112a6274c41ddb30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:RVXOS7DJIWHEGYK6BSN44APIO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Infinite-message Limit of Two-terminal Interactive Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nan Ma, Prakash Ishwar","submitted_at":"2009-08-25T01:54:37Z","abstract_excerpt":"A two-terminal interactive function computation problem with alternating messages is studied within the framework of distributed block source coding theory. For any finite number of messages, a single-letter characterization of the sum-rate-distortion function was established in previous works using standard information-theoretic techniques. This, however, does not provide a satisfactory characterization of the infinite-message limit, which is a new, unexplored dimension for asymptotic-analysis in distributed block source coding involving potentially an infinite number of infinitesimal-rate me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3512","kind":"arxiv","version":4},"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-18T03:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUbqOrDKKbUgSCmDLA6WJBLt1ECvItbXvpIqKHWx+gZ1betZhRVkOCsjUtrcB3BGlR+LIJjnwaZj+yDpfcB7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:14:15.060736Z"},"content_sha256":"22e2c08ab128843838b8f92aebe58e016aa8f317d0ac3fae98acf718ad6db03a","schema_version":"1.0","event_id":"sha256:22e2c08ab128843838b8f92aebe58e016aa8f317d0ac3fae98acf718ad6db03a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVXOS7DJIWHEGYK6BSN44APIO2/bundle.json","state_url":"https://pith.science/pith/RVXOS7DJIWHEGYK6BSN44APIO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVXOS7DJIWHEGYK6BSN44APIO2/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-03T09:14:15Z","links":{"resolver":"https://pith.science/pith/RVXOS7DJIWHEGYK6BSN44APIO2","bundle":"https://pith.science/pith/RVXOS7DJIWHEGYK6BSN44APIO2/bundle.json","state":"https://pith.science/pith/RVXOS7DJIWHEGYK6BSN44APIO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVXOS7DJIWHEGYK6BSN44APIO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:RVXOS7DJIWHEGYK6BSN44APIO2","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":"f2655b4ac27454c5a9c9cc95bd6bce377afe118b0e7cddf2c84880bbe9dacb56","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-25T01:54:37Z","title_canon_sha256":"5cd5e676d362d22183d5e27e7eb9ac052f78b2554226a7660e4f188ac6221fe5"},"schema_version":"1.0","source":{"id":"0908.3512","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.3512","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"0908.3512v4","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3512","created_at":"2026-05-18T03:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"RVXOS7DJIWHE","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RVXOS7DJIWHEGYK6","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RVXOS7DJ","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:22e2c08ab128843838b8f92aebe58e016aa8f317d0ac3fae98acf718ad6db03a","target":"graph","created_at":"2026-05-18T03:49:33Z","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":"A two-terminal interactive function computation problem with alternating messages is studied within the framework of distributed block source coding theory. For any finite number of messages, a single-letter characterization of the sum-rate-distortion function was established in previous works using standard information-theoretic techniques. This, however, does not provide a satisfactory characterization of the infinite-message limit, which is a new, unexplored dimension for asymptotic-analysis in distributed block source coding involving potentially an infinite number of infinitesimal-rate me","authors_text":"Nan Ma, Prakash Ishwar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-25T01:54:37Z","title":"The Infinite-message Limit of Two-terminal Interactive Source Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3512","kind":"arxiv","version":4},"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:ec6c5cff4ac8e383b874f2bb38748da7c1a7b135b97d3083112a6274c41ddb30","target":"record","created_at":"2026-05-18T03:49:33Z","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":"f2655b4ac27454c5a9c9cc95bd6bce377afe118b0e7cddf2c84880bbe9dacb56","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-08-25T01:54:37Z","title_canon_sha256":"5cd5e676d362d22183d5e27e7eb9ac052f78b2554226a7660e4f188ac6221fe5"},"schema_version":"1.0","source":{"id":"0908.3512","kind":"arxiv","version":4}},"canonical_sha256":"8d6ee97c69458e43615e0c9bce01e876a9a4f6f3fa6a782eec746c2a6edd225b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d6ee97c69458e43615e0c9bce01e876a9a4f6f3fa6a782eec746c2a6edd225b","first_computed_at":"2026-05-18T03:49:33.095390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:33.095390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vn7FSs63/beakzbzB1e8ts/za1y7rdw8p0yv5ePS6ae1tvrHeKTxYKcOSIjVsHDXQ/tsutnwuXF1pjAUBcIqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:33.096004Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.3512","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec6c5cff4ac8e383b874f2bb38748da7c1a7b135b97d3083112a6274c41ddb30","sha256:22e2c08ab128843838b8f92aebe58e016aa8f317d0ac3fae98acf718ad6db03a"],"state_sha256":"d108ff80e5d8535499722d896815a97f4c38adea289f553519a892544ad91704"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pr1hdl89+1ZLSegDdpmGlI2hElvUjSeoqxnfdq3yGYZMlIijrTS2tTzVJoQWUW68waMOb3bs8ra5rcYjLzyVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:14:15.062716Z","bundle_sha256":"66f5367533e48ea90a37b7dd816de0ed20059d69b6577bd9ad213c2a442c9f1f"}}