{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2T6N6L32UQZFKI7QCIITDSBAVC","short_pith_number":"pith:2T6N6L32","schema_version":"1.0","canonical_sha256":"d4fcdf2f7aa4325523f0121131c820a8b3f6f290964f7c25d9f3b3558569257e","source":{"kind":"arxiv","id":"1010.3519","version":1},"attestation_state":"computed","paper":{"title":"Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guillermo Barrenetxea, Martin Vetterli, Zichong Chen","submitted_at":"2010-10-18T08:35:41Z","abstract_excerpt":"Traditional distributed source coding rarely considers the possible link between separate encoders. However, the broadcast nature of wireless communication in sensor networks provides a free gossip mechanism which can be used to simplify encoding/decoding and reduce transmission power. Using this broadcast advantage, we present a new two-encoder scheme which imitates the ping-pong game and has a successive approximation structure. For the quadratic Gaussian case, we prove that this scheme is successively refinable on the {sum-rate, distortion pair} surface, which is characterized by the rate-d"},"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":"1010.3519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-18T08:35:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d230a7883ab3bd0b640aebb39adb68db3365d616246447bf954fb12b37e2a7b2","abstract_canon_sha256":"9182944e2e4f88f552b80b82c1a4d4960443696070a61a91668c823e6764bd24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:08.916384Z","signature_b64":"t2qJmXFJmorJOAo9xRPZ8t2sJoweJINFJA2xXweMBovMU9fopz5VHQcP1eJU9gdVQXYt/TF6roZOKKT5vVxgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4fcdf2f7aa4325523f0121131c820a8b3f6f290964f7c25d9f3b3558569257e","last_reissued_at":"2026-05-18T04:39:08.915914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:08.915914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guillermo Barrenetxea, Martin Vetterli, Zichong Chen","submitted_at":"2010-10-18T08:35:41Z","abstract_excerpt":"Traditional distributed source coding rarely considers the possible link between separate encoders. However, the broadcast nature of wireless communication in sensor networks provides a free gossip mechanism which can be used to simplify encoding/decoding and reduce transmission power. Using this broadcast advantage, we present a new two-encoder scheme which imitates the ping-pong game and has a successive approximation structure. For the quadratic Gaussian case, we prove that this scheme is successively refinable on the {sum-rate, distortion pair} surface, which is characterized by the rate-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3519","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":"1010.3519","created_at":"2026-05-18T04:39:08.915985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.3519v1","created_at":"2026-05-18T04:39:08.915985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3519","created_at":"2026-05-18T04:39:08.915985+00:00"},{"alias_kind":"pith_short_12","alias_value":"2T6N6L32UQZF","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2T6N6L32UQZFKI7Q","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2T6N6L32","created_at":"2026-05-18T12:26:03.138858+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/2T6N6L32UQZFKI7QCIITDSBAVC","json":"https://pith.science/pith/2T6N6L32UQZFKI7QCIITDSBAVC.json","graph_json":"https://pith.science/api/pith-number/2T6N6L32UQZFKI7QCIITDSBAVC/graph.json","events_json":"https://pith.science/api/pith-number/2T6N6L32UQZFKI7QCIITDSBAVC/events.json","paper":"https://pith.science/paper/2T6N6L32"},"agent_actions":{"view_html":"https://pith.science/pith/2T6N6L32UQZFKI7QCIITDSBAVC","download_json":"https://pith.science/pith/2T6N6L32UQZFKI7QCIITDSBAVC.json","view_paper":"https://pith.science/paper/2T6N6L32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.3519&json=true","fetch_graph":"https://pith.science/api/pith-number/2T6N6L32UQZFKI7QCIITDSBAVC/graph.json","fetch_events":"https://pith.science/api/pith-number/2T6N6L32UQZFKI7QCIITDSBAVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2T6N6L32UQZFKI7QCIITDSBAVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2T6N6L32UQZFKI7QCIITDSBAVC/action/storage_attestation","attest_author":"https://pith.science/pith/2T6N6L32UQZFKI7QCIITDSBAVC/action/author_attestation","sign_citation":"https://pith.science/pith/2T6N6L32UQZFKI7QCIITDSBAVC/action/citation_signature","submit_replication":"https://pith.science/pith/2T6N6L32UQZFKI7QCIITDSBAVC/action/replication_record"}},"created_at":"2026-05-18T04:39:08.915985+00:00","updated_at":"2026-05-18T04:39:08.915985+00:00"}