{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:IZRSIIVOXW732NP7BRHJJER6SW","short_pith_number":"pith:IZRSIIVO","schema_version":"1.0","canonical_sha256":"46632422aebdbfbd35ff0c4e94923e959b77769d8b8c0606ccd1128307364a1d","source":{"kind":"arxiv","id":"cs/0610079","version":1},"attestation_state":"computed","paper":{"title":"An Enhanced Covering Lemma for Multiterminal Source Coding","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Peiliang Qiu, Shengtian Yang","submitted_at":"2006-10-13T00:22:50Z","abstract_excerpt":"An enhanced covering lemma for a Markov chain is proved in this paper, and then the distributed source coding problem of correlated general sources with one average distortion criterion under fixed-length coding is investigated. Based on the enhanced lemma, a sufficient and necessary condition for determining the achievability of rate-distortion triples is given."},"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/0610079","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-10-13T00:22:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c62e004e0988166854e0ffd3b5cb49e2830689b427bc1dbb3302f3648fc56475","abstract_canon_sha256":"a0243d6418cb23fd87431ff782b8e6d935124d4385833dc50da9300f51c6b7f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:08.767605Z","signature_b64":"YXKnKLF3/lELlyViav2g989WRZiCG/P5DE6Gkuf8fQsCrN+rQC6nidOjd2aHjL71rSUqjorlNNfnbsbDcmYjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46632422aebdbfbd35ff0c4e94923e959b77769d8b8c0606ccd1128307364a1d","last_reissued_at":"2026-05-18T00:58:08.766963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:08.766963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Enhanced Covering Lemma for Multiterminal Source Coding","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Peiliang Qiu, Shengtian Yang","submitted_at":"2006-10-13T00:22:50Z","abstract_excerpt":"An enhanced covering lemma for a Markov chain is proved in this paper, and then the distributed source coding problem of correlated general sources with one average distortion criterion under fixed-length coding is investigated. Based on the enhanced lemma, a sufficient and necessary condition for determining the achievability of rate-distortion triples is given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610079","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":""},"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/0610079","created_at":"2026-05-18T00:58:08.767065+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0610079v1","created_at":"2026-05-18T00:58:08.767065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610079","created_at":"2026-05-18T00:58:08.767065+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZRSIIVOXW73","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZRSIIVOXW732NP7","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZRSIIVO","created_at":"2026-05-18T12:25:54.717736+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/IZRSIIVOXW732NP7BRHJJER6SW","json":"https://pith.science/pith/IZRSIIVOXW732NP7BRHJJER6SW.json","graph_json":"https://pith.science/api/pith-number/IZRSIIVOXW732NP7BRHJJER6SW/graph.json","events_json":"https://pith.science/api/pith-number/IZRSIIVOXW732NP7BRHJJER6SW/events.json","paper":"https://pith.science/paper/IZRSIIVO"},"agent_actions":{"view_html":"https://pith.science/pith/IZRSIIVOXW732NP7BRHJJER6SW","download_json":"https://pith.science/pith/IZRSIIVOXW732NP7BRHJJER6SW.json","view_paper":"https://pith.science/paper/IZRSIIVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0610079&json=true","fetch_graph":"https://pith.science/api/pith-number/IZRSIIVOXW732NP7BRHJJER6SW/graph.json","fetch_events":"https://pith.science/api/pith-number/IZRSIIVOXW732NP7BRHJJER6SW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZRSIIVOXW732NP7BRHJJER6SW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZRSIIVOXW732NP7BRHJJER6SW/action/storage_attestation","attest_author":"https://pith.science/pith/IZRSIIVOXW732NP7BRHJJER6SW/action/author_attestation","sign_citation":"https://pith.science/pith/IZRSIIVOXW732NP7BRHJJER6SW/action/citation_signature","submit_replication":"https://pith.science/pith/IZRSIIVOXW732NP7BRHJJER6SW/action/replication_record"}},"created_at":"2026-05-18T00:58:08.767065+00:00","updated_at":"2026-05-18T00:58:08.767065+00:00"}