{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PCQL6QLT7XXTJSMN3YYIWXHEPU","short_pith_number":"pith:PCQL6QLT","canonical_record":{"source":{"id":"1109.2543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T17:31:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79fa86cfa8c15b7331523f001c19cb2bab9337edde88e158ef904bf9ea4afc1f","abstract_canon_sha256":"54dc90004fea347d9cf4d446debd00f9515fa24b39619e1a6ff533fc4a9962c0"},"schema_version":"1.0"},"canonical_sha256":"78a0bf4173fdef34c98dde308b5ce47d00b6490522adeccd9a1f41df372c5dac","source":{"kind":"arxiv","id":"1109.2543","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PCQL6QLT7XXTJSMN3YYIWXHEPU","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-12T17:31:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79fa86cfa8c15b7331523f001c19cb2bab9337edde88e158ef904bf9ea4afc1f","abstract_canon_sha256":"54dc90004fea347d9cf4d446debd00f9515fa24b39619e1a6ff533fc4a9962c0"},"schema_version":"1.0"},"canonical_sha256":"78a0bf4173fdef34c98dde308b5ce47d00b6490522adeccd9a1f41df372c5dac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:37.407333Z","signature_b64":"/DQzUA0DZsanMixkJOvkVLSf2KjHlIyLYGIP/FQ9CF4DBSjRLBH2aH2Y02PRLXtKZF+axOeGFoqHTiJSS335Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78a0bf4173fdef34c98dde308b5ce47d00b6490522adeccd9a1f41df372c5dac","last_reissued_at":"2026-05-18T04:13:37.406726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:37.406726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2543","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHQR9MRJ7iuoVlJNdg/QZBn+p8YLZyWq20x6m1eBoUfqHYhKryhdaXhLaDD7yRSz59HFek/O0vArl/Kw8R1HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T23:38:40.849916Z"},"content_sha256":"7e7682f82c7a2c4321de14a9fae4ba282e99a3bf51f0184a7b499eccacec1690","schema_version":"1.0","event_id":"sha256:7e7682f82c7a2c4321de14a9fae4ba282e99a3bf51f0184a7b499eccacec1690"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PCQL6QLT7XXTJSMN3YYIWXHEPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Index Assignment for Multiple Description Scalar Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guoqiang Zhang, Janusz Klejsa, W. Bastiaan Kleijn","submitted_at":"2011-09-12T17:31:40Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2543","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ke5GTK1rDYOKa34JxQFGyi/Qtqkneyg0yh02GR3FBcSs++pja8NYiIyca8pT903TUYqQV7Qtr4AJE365ChaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T23:38:40.850439Z"},"content_sha256":"533e728797c3faa5a609e02309d2a6060e7cc83d3038e3e25087e05939b6622d","schema_version":"1.0","event_id":"sha256:533e728797c3faa5a609e02309d2a6060e7cc83d3038e3e25087e05939b6622d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCQL6QLT7XXTJSMN3YYIWXHEPU/bundle.json","state_url":"https://pith.science/pith/PCQL6QLT7XXTJSMN3YYIWXHEPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCQL6QLT7XXTJSMN3YYIWXHEPU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T23:38:40Z","links":{"resolver":"https://pith.science/pith/PCQL6QLT7XXTJSMN3YYIWXHEPU","bundle":"https://pith.science/pith/PCQL6QLT7XXTJSMN3YYIWXHEPU/bundle.json","state":"https://pith.science/pith/PCQL6QLT7XXTJSMN3YYIWXHEPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCQL6QLT7XXTJSMN3YYIWXHEPU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tALAc/dsUzVTRYo7s+jMfUhbilPlhgFCOv5g5dR3HTinhq1GMI5AR0/Bdr7+4oVnhNdqNzvHY8LJW3kttvasBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T23:38:40.853445Z","bundle_sha256":"e482df2e62302eb10a765b775831293867fd4b1019143306d2deb0bb3af169fd"}}