{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FXUWO2ZWEJ7OV26PMGLT7E2B32","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0146bff97c62b0364e5576b6cc25951639d7d361bfb0fb723357848b6c42a67d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T23:50:21Z","title_canon_sha256":"3f0d41d512a101d851df7820293e944d2de2408df7c752905dc481259d4560e1"},"schema_version":"1.0","source":{"id":"1510.00450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.00450","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1510.00450v1","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00450","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"FXUWO2ZWEJ7O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FXUWO2ZWEJ7OV26P","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FXUWO2ZW","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:e8a5f576dd014dad657e112a51ee7b221f2f4fd7ff4b7829acb53109a0a8a3a3","target":"graph","created_at":"2026-05-18T01:31:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper extends the well-known source coding problem of multiple descriptions, in its general and basic setting, to analog source-channel coding scenarios. Encoding-decoding functions that optimally map between the (possibly continuous valued) source and the channel spaces are numerically derived. The main technical tool is a non-convex optimization method, namely, deterministic annealing, which has recently been successfully used in other mapping optimization problems. The obtained functions exhibit several interesting structural properties, map multiple source intervals to the same interv","authors_text":"Emrah Akyol, Kenneth Rose, Mustafa Said Mehmetoglu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T23:50:21Z","title":"Analog Multiple Descriptions: A Zero-Delay Source-Channel Coding Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00450","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d5b6f770c6504745e330c14bb0913cd0d65a968325e8ae3b5315ab354f8cab7","target":"record","created_at":"2026-05-18T01:31:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0146bff97c62b0364e5576b6cc25951639d7d361bfb0fb723357848b6c42a67d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-01T23:50:21Z","title_canon_sha256":"3f0d41d512a101d851df7820293e944d2de2408df7c752905dc481259d4560e1"},"schema_version":"1.0","source":{"id":"1510.00450","kind":"arxiv","version":1}},"canonical_sha256":"2de9676b36227eeaebcf61973f9341de962ed1732cd5e020964bbe2121d4b049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2de9676b36227eeaebcf61973f9341de962ed1732cd5e020964bbe2121d4b049","first_computed_at":"2026-05-18T01:31:13.032350Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:13.032350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z8Fr8m6t3ASVQScREJN2cbfyT6QAcK5m9Ibkp249ffjfFTk2mtVUn6d26RLzr5jiQ7BEFKkh0REYQeKPImMFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:13.033263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.00450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d5b6f770c6504745e330c14bb0913cd0d65a968325e8ae3b5315ab354f8cab7","sha256:e8a5f576dd014dad657e112a51ee7b221f2f4fd7ff4b7829acb53109a0a8a3a3"],"state_sha256":"4bd70547aa1b81d7bb5bc851481534681bcc16c732518f05539fb7588ba9a50f"}