{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CFLC6LQEFGB3OEUTAZVQWJTLC5","short_pith_number":"pith:CFLC6LQE","schema_version":"1.0","canonical_sha256":"11562f2e042983b71293066b0b266b17474e9fbaf6310a458b672db2406b9f2a","source":{"kind":"arxiv","id":"1009.2077","version":1},"attestation_state":"computed","paper":{"title":"A new sufficient condition for sum-rate tightness in quadratic Gaussian multiterminal source coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yang Yang, Yifu Zhang, Zixiang Xiong","submitted_at":"2010-09-10T19:08:16Z","abstract_excerpt":"This work considers the quadratic Gaussian multiterminal (MT) source coding problem and provides a new sufficient condition for the Berger-Tung sum-rate bound to be tight. The converse proof utilizes a set of virtual remote sources given which the MT sources are block independent with a maximum block size of two. The given MT source coding problem is then related to a set of two-terminal problems with matrix-distortion constraints, for which a new lower bound on the sum-rate is given. Finally, a convex optimization problem is formulated and a sufficient condition derived for the optimal BT sch"},"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":"1009.2077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-10T19:08:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab155a12e2823f79e34841ab4b567104fd6062629651f356d758ea9f4a1a7bd2","abstract_canon_sha256":"0006c7867f97f0336840c2ab89a0b74d329e51afdbe55ec55824282c4e9710ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:05.499883Z","signature_b64":"doJlE0vroINLDwfIfe+E0vBlumAq1sxJgkQqTdQYqolG/xUKuSSnOqNWjC8hazpeD62jbavaRKGQlrlQDhEMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11562f2e042983b71293066b0b266b17474e9fbaf6310a458b672db2406b9f2a","last_reissued_at":"2026-05-18T04:41:05.499409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:05.499409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new sufficient condition for sum-rate tightness in quadratic Gaussian multiterminal source coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yang Yang, Yifu Zhang, Zixiang Xiong","submitted_at":"2010-09-10T19:08:16Z","abstract_excerpt":"This work considers the quadratic Gaussian multiterminal (MT) source coding problem and provides a new sufficient condition for the Berger-Tung sum-rate bound to be tight. The converse proof utilizes a set of virtual remote sources given which the MT sources are block independent with a maximum block size of two. The given MT source coding problem is then related to a set of two-terminal problems with matrix-distortion constraints, for which a new lower bound on the sum-rate is given. Finally, a convex optimization problem is formulated and a sufficient condition derived for the optimal BT sch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2077","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":"1009.2077","created_at":"2026-05-18T04:41:05.499496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2077v1","created_at":"2026-05-18T04:41:05.499496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2077","created_at":"2026-05-18T04:41:05.499496+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFLC6LQEFGB3","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFLC6LQEFGB3OEUT","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFLC6LQE","created_at":"2026-05-18T12:26:05.355336+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/CFLC6LQEFGB3OEUTAZVQWJTLC5","json":"https://pith.science/pith/CFLC6LQEFGB3OEUTAZVQWJTLC5.json","graph_json":"https://pith.science/api/pith-number/CFLC6LQEFGB3OEUTAZVQWJTLC5/graph.json","events_json":"https://pith.science/api/pith-number/CFLC6LQEFGB3OEUTAZVQWJTLC5/events.json","paper":"https://pith.science/paper/CFLC6LQE"},"agent_actions":{"view_html":"https://pith.science/pith/CFLC6LQEFGB3OEUTAZVQWJTLC5","download_json":"https://pith.science/pith/CFLC6LQEFGB3OEUTAZVQWJTLC5.json","view_paper":"https://pith.science/paper/CFLC6LQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2077&json=true","fetch_graph":"https://pith.science/api/pith-number/CFLC6LQEFGB3OEUTAZVQWJTLC5/graph.json","fetch_events":"https://pith.science/api/pith-number/CFLC6LQEFGB3OEUTAZVQWJTLC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFLC6LQEFGB3OEUTAZVQWJTLC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFLC6LQEFGB3OEUTAZVQWJTLC5/action/storage_attestation","attest_author":"https://pith.science/pith/CFLC6LQEFGB3OEUTAZVQWJTLC5/action/author_attestation","sign_citation":"https://pith.science/pith/CFLC6LQEFGB3OEUTAZVQWJTLC5/action/citation_signature","submit_replication":"https://pith.science/pith/CFLC6LQEFGB3OEUTAZVQWJTLC5/action/replication_record"}},"created_at":"2026-05-18T04:41:05.499496+00:00","updated_at":"2026-05-18T04:41:05.499496+00:00"}