{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:M2VJOAHY7KNNEBDESI5NZYNMAB","short_pith_number":"pith:M2VJOAHY","schema_version":"1.0","canonical_sha256":"66aa9700f8fa9ad20464923adce1ac0077344cbc6e755229bb7ae322d23cdafb","source":{"kind":"arxiv","id":"0708.3531","version":1},"attestation_state":"computed","paper":{"title":"Networked Multiple Description Estimation and Compression with Resource Scalability","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xiaohan Wang, Xiaolin Wu, Zhe Wang","submitted_at":"2007-08-27T03:11:22Z","abstract_excerpt":"We present a joint source-channel multiple description (JSC-MD) framework for resource-constrained network communications (e.g., sensor networks), in which one or many deprived encoders communicate a Markov source against bit errors and erasure errors to many heterogeneous decoders, some powerful and some deprived. To keep the encoder complexity at minimum, the source is coded into K descriptions by a simple multiple description quantizer (MDQ) with neither entropy nor channel coding. The code diversity of MDQ and the path diversity of the network are exploited by decoders to correct transmiss"},"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":"0708.3531","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-08-27T03:11:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"255960938e92dc43b964dc061a3dfde86388f0defc00333664df13fdaf472d06","abstract_canon_sha256":"960fbbb18f010cd2a2f14c600e53f26794106d392802688b51678682066ee483"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:03:50.369023Z","signature_b64":"lzNv8S1Tin6zmru7g82nr2PmqbUyqh4u0kiWfQEhf0Q8sTFofJXdZaQQe/g1hTR4gHgyt47iE9kyl0Bi8kZIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66aa9700f8fa9ad20464923adce1ac0077344cbc6e755229bb7ae322d23cdafb","last_reissued_at":"2026-07-04T15:03:50.368673Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:03:50.368673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Networked Multiple Description Estimation and Compression with Resource Scalability","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xiaohan Wang, Xiaolin Wu, Zhe Wang","submitted_at":"2007-08-27T03:11:22Z","abstract_excerpt":"We present a joint source-channel multiple description (JSC-MD) framework for resource-constrained network communications (e.g., sensor networks), in which one or many deprived encoders communicate a Markov source against bit errors and erasure errors to many heterogeneous decoders, some powerful and some deprived. To keep the encoder complexity at minimum, the source is coded into K descriptions by a simple multiple description quantizer (MDQ) with neither entropy nor channel coding. The code diversity of MDQ and the path diversity of the network are exploited by decoders to correct transmiss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.3531","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/0708.3531/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":"0708.3531","created_at":"2026-07-04T15:03:50.368737+00:00"},{"alias_kind":"arxiv_version","alias_value":"0708.3531v1","created_at":"2026-07-04T15:03:50.368737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.3531","created_at":"2026-07-04T15:03:50.368737+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2VJOAHY7KNN","created_at":"2026-07-04T15:03:50.368737+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2VJOAHY7KNNEBDE","created_at":"2026-07-04T15:03:50.368737+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2VJOAHY","created_at":"2026-07-04T15:03:50.368737+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/M2VJOAHY7KNNEBDESI5NZYNMAB","json":"https://pith.science/pith/M2VJOAHY7KNNEBDESI5NZYNMAB.json","graph_json":"https://pith.science/api/pith-number/M2VJOAHY7KNNEBDESI5NZYNMAB/graph.json","events_json":"https://pith.science/api/pith-number/M2VJOAHY7KNNEBDESI5NZYNMAB/events.json","paper":"https://pith.science/paper/M2VJOAHY"},"agent_actions":{"view_html":"https://pith.science/pith/M2VJOAHY7KNNEBDESI5NZYNMAB","download_json":"https://pith.science/pith/M2VJOAHY7KNNEBDESI5NZYNMAB.json","view_paper":"https://pith.science/paper/M2VJOAHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0708.3531&json=true","fetch_graph":"https://pith.science/api/pith-number/M2VJOAHY7KNNEBDESI5NZYNMAB/graph.json","fetch_events":"https://pith.science/api/pith-number/M2VJOAHY7KNNEBDESI5NZYNMAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2VJOAHY7KNNEBDESI5NZYNMAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2VJOAHY7KNNEBDESI5NZYNMAB/action/storage_attestation","attest_author":"https://pith.science/pith/M2VJOAHY7KNNEBDESI5NZYNMAB/action/author_attestation","sign_citation":"https://pith.science/pith/M2VJOAHY7KNNEBDESI5NZYNMAB/action/citation_signature","submit_replication":"https://pith.science/pith/M2VJOAHY7KNNEBDESI5NZYNMAB/action/replication_record"}},"created_at":"2026-07-04T15:03:50.368737+00:00","updated_at":"2026-07-04T15:03:50.368737+00:00"}