{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:JVQQUTUTFDVELTM2ZCINUNSC35","short_pith_number":"pith:JVQQUTUT","schema_version":"1.0","canonical_sha256":"4d610a4e9328ea45cd9ac890da3642df6aaf946dc5ebbb5e347751d07f9c9537","source":{"kind":"arxiv","id":"cs/0610144","version":1},"attestation_state":"computed","paper":{"title":"Lossless coding for distributed streaming sources","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anant Sahai, Cheng Chang, Stark Draper","submitted_at":"2006-10-25T00:20:55Z","abstract_excerpt":"Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a streaming setting in which iid source symbol pairs are revealed to the separate encoders in real time and need to be reconstructed at the decoder with some tolerable end-to-end delay using finite rate noiseless channels. A sequential random binning argument is used to derive a lower bound on the error exponent with delay and show that both ML decoding and universal decoding achieve the same positive error exponents inside t"},"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":"cs/0610144","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-10-25T00:20:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"038ba5cdd81e136880cbcafb9a7cdb984a29ec001ca66202f3ed3820447044e2","abstract_canon_sha256":"488dc3084ec051bb7db176a1004e7d2448e4d0ee353a731efffa7fef66faffba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:53.781347Z","signature_b64":"3T9qFEX0f3mlrwko4rdGs43IB+dgLh18Wu6CKcCa/OsiIuZucFiVUkMImUdowUNV5xTwSyH3eTpHmGAmbj0VAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d610a4e9328ea45cd9ac890da3642df6aaf946dc5ebbb5e347751d07f9c9537","last_reissued_at":"2026-07-04T15:02:53.780940Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:53.780940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lossless coding for distributed streaming sources","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anant Sahai, Cheng Chang, Stark Draper","submitted_at":"2006-10-25T00:20:55Z","abstract_excerpt":"Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a streaming setting in which iid source symbol pairs are revealed to the separate encoders in real time and need to be reconstructed at the decoder with some tolerable end-to-end delay using finite rate noiseless channels. A sequential random binning argument is used to derive a lower bound on the error exponent with delay and show that both ML decoding and universal decoding achieve the same positive error exponents inside t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610144","kind":"arxiv","version":1},"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/cs/0610144/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":"cs/0610144","created_at":"2026-07-04T15:02:53.781002+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0610144v1","created_at":"2026-07-04T15:02:53.781002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610144","created_at":"2026-07-04T15:02:53.781002+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVQQUTUTFDVE","created_at":"2026-07-04T15:02:53.781002+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVQQUTUTFDVELTM2","created_at":"2026-07-04T15:02:53.781002+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVQQUTUT","created_at":"2026-07-04T15:02:53.781002+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/JVQQUTUTFDVELTM2ZCINUNSC35","json":"https://pith.science/pith/JVQQUTUTFDVELTM2ZCINUNSC35.json","graph_json":"https://pith.science/api/pith-number/JVQQUTUTFDVELTM2ZCINUNSC35/graph.json","events_json":"https://pith.science/api/pith-number/JVQQUTUTFDVELTM2ZCINUNSC35/events.json","paper":"https://pith.science/paper/JVQQUTUT"},"agent_actions":{"view_html":"https://pith.science/pith/JVQQUTUTFDVELTM2ZCINUNSC35","download_json":"https://pith.science/pith/JVQQUTUTFDVELTM2ZCINUNSC35.json","view_paper":"https://pith.science/paper/JVQQUTUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0610144&json=true","fetch_graph":"https://pith.science/api/pith-number/JVQQUTUTFDVELTM2ZCINUNSC35/graph.json","fetch_events":"https://pith.science/api/pith-number/JVQQUTUTFDVELTM2ZCINUNSC35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVQQUTUTFDVELTM2ZCINUNSC35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVQQUTUTFDVELTM2ZCINUNSC35/action/storage_attestation","attest_author":"https://pith.science/pith/JVQQUTUTFDVELTM2ZCINUNSC35/action/author_attestation","sign_citation":"https://pith.science/pith/JVQQUTUTFDVELTM2ZCINUNSC35/action/citation_signature","submit_replication":"https://pith.science/pith/JVQQUTUTFDVELTM2ZCINUNSC35/action/replication_record"}},"created_at":"2026-07-04T15:02:53.781002+00:00","updated_at":"2026-07-04T15:02:53.781002+00:00"}