{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PCQL6QLT7XXTJSMN3YYIWXHEPU","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":"54dc90004fea347d9cf4d446debd00f9515fa24b39619e1a6ff533fc4a9962c0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T17:31:40Z","title_canon_sha256":"79fa86cfa8c15b7331523f001c19cb2bab9337edde88e158ef904bf9ea4afc1f"},"schema_version":"1.0","source":{"id":"1109.2543","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2543","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2543v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2543","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"PCQL6QLT7XXT","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCQL6QLT7XXTJSMN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCQL6QLT","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:533e728797c3faa5a609e02309d2a6060e7cc83d3038e3e25087e05939b6622d","target":"graph","created_at":"2026-05-18T04:13:37Z","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":"We provide a method for designing an optimal index assignment for scalar K-description coding. The method stems from a construction of translated scalar lattices, which provides a performance advantage by exploiting a so-called staggered gain. Interestingly, generation of the optimal index assignment is based on a lattice in K-1 dimensional space. The use of the K-1 dimensional lattice facilitates analytic insight into the performance and eliminates the need for a greedy optimization of the index assignment. It is shown that that the optimal index assignment is not unique. This is illustrated ","authors_text":"Guoqiang Zhang, Janusz Klejsa, W. Bastiaan Kleijn","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T17:31:40Z","title":"Optimal Index Assignment for Multiple Description Scalar Quantization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2543","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:7e7682f82c7a2c4321de14a9fae4ba282e99a3bf51f0184a7b499eccacec1690","target":"record","created_at":"2026-05-18T04:13:37Z","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":"54dc90004fea347d9cf4d446debd00f9515fa24b39619e1a6ff533fc4a9962c0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T17:31:40Z","title_canon_sha256":"79fa86cfa8c15b7331523f001c19cb2bab9337edde88e158ef904bf9ea4afc1f"},"schema_version":"1.0","source":{"id":"1109.2543","kind":"arxiv","version":1}},"canonical_sha256":"78a0bf4173fdef34c98dde308b5ce47d00b6490522adeccd9a1f41df372c5dac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78a0bf4173fdef34c98dde308b5ce47d00b6490522adeccd9a1f41df372c5dac","first_computed_at":"2026-05-18T04:13:37.406726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:37.406726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/DQzUA0DZsanMixkJOvkVLSf2KjHlIyLYGIP/FQ9CF4DBSjRLBH2aH2Y02PRLXtKZF+axOeGFoqHTiJSS335Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:37.407333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2543","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e7682f82c7a2c4321de14a9fae4ba282e99a3bf51f0184a7b499eccacec1690","sha256:533e728797c3faa5a609e02309d2a6060e7cc83d3038e3e25087e05939b6622d"],"state_sha256":"9a06c127ae5337e5bcb7c092619db7337f1e3929f92cc3651195fb2f57eef502"}