{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PK5M3VGDUPF23DTQXHQMS4PFPL","short_pith_number":"pith:PK5M3VGD","canonical_record":{"source":{"id":"1503.08696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T14:59:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83381da81633daef1a8bc2a692e5c93a1ca9ca999e9c1abef3bf4356dac3de38","abstract_canon_sha256":"1a555abfd51331742c8287be14fc9bb6b23c5ff829ef2c5b3e55d6e937bfe20d"},"schema_version":"1.0"},"canonical_sha256":"7abacdd4c3a3cbad8e70b9e0c971e57ae94ec405897fbc777626cd14dc428d0c","source":{"kind":"arxiv","id":"1503.08696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08696","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08696v1","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08696","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"PK5M3VGDUPF2","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PK5M3VGDUPF23DTQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PK5M3VGD","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PK5M3VGDUPF23DTQXHQMS4PFPL","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T14:59:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"83381da81633daef1a8bc2a692e5c93a1ca9ca999e9c1abef3bf4356dac3de38","abstract_canon_sha256":"1a555abfd51331742c8287be14fc9bb6b23c5ff829ef2c5b3e55d6e937bfe20d"},"schema_version":"1.0"},"canonical_sha256":"7abacdd4c3a3cbad8e70b9e0c971e57ae94ec405897fbc777626cd14dc428d0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:01.082445Z","signature_b64":"tRb4OQO+0PJafom9gFkOrLrjScRX3+mFO/z0ii+OaCF+e5iEC+/a0OOr52y0WJG1IPLHzvlOAlRtAOnljMxoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7abacdd4c3a3cbad8e70b9e0c971e57ae94ec405897fbc777626cd14dc428d0c","last_reissued_at":"2026-05-18T02:20:01.081715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:01.081715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08696","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-18T02:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUfNKFPw7PD3gaK2NPp3y6SLXbkp0CMaGw0ujvQG7rbMkV22z2qRfqT99LLHPYzO9Vuj25Q6BIgSt6coh+GjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:46:52.897918Z"},"content_sha256":"fa91f7abd9b05763ebd7a7d35b1727c72c38bf47c6b02908340eb75a18c0f538","schema_version":"1.0","event_id":"sha256:fa91f7abd9b05763ebd7a7d35b1727c72c38bf47c6b02908340eb75a18c0f538"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PK5M3VGDUPF23DTQXHQMS4PFPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graded quantization for multiple description coding of compressive measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Diego Valsesia, Enrico Magli, Giulio Coluccia","submitted_at":"2015-03-30T14:59:28Z","abstract_excerpt":"Compressed sensing (CS) is an emerging paradigm for acquisition of compressed representations of a sparse signal. Its low complexity is appealing for resource-constrained scenarios like sensor networks. However, such scenarios are often coupled with unreliable communication channels and providing robust transmission of the acquired data to a receiver is an issue. Multiple description coding (MDC) effectively combats channel losses for systems without feedback, thus raising the interest in developing MDC methods explicitly designed for the CS framework, and exploiting its properties. We propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08696","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-18T02:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nh53iy07rCcbctWtRL8I4u0fNur4rgZY8PpWGgDpFKahhZjLSJB6IS6GT5rPHNHvMN09bKPM6ORkFHTGIqKrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:46:52.898623Z"},"content_sha256":"3164a0e8567bdb6cbbcb7d9b77409d6d99ffa80dafba014471376848843ee84f","schema_version":"1.0","event_id":"sha256:3164a0e8567bdb6cbbcb7d9b77409d6d99ffa80dafba014471376848843ee84f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PK5M3VGDUPF23DTQXHQMS4PFPL/bundle.json","state_url":"https://pith.science/pith/PK5M3VGDUPF23DTQXHQMS4PFPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PK5M3VGDUPF23DTQXHQMS4PFPL/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-27T13:46:52Z","links":{"resolver":"https://pith.science/pith/PK5M3VGDUPF23DTQXHQMS4PFPL","bundle":"https://pith.science/pith/PK5M3VGDUPF23DTQXHQMS4PFPL/bundle.json","state":"https://pith.science/pith/PK5M3VGDUPF23DTQXHQMS4PFPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PK5M3VGDUPF23DTQXHQMS4PFPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PK5M3VGDUPF23DTQXHQMS4PFPL","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":"1a555abfd51331742c8287be14fc9bb6b23c5ff829ef2c5b3e55d6e937bfe20d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T14:59:28Z","title_canon_sha256":"83381da81633daef1a8bc2a692e5c93a1ca9ca999e9c1abef3bf4356dac3de38"},"schema_version":"1.0","source":{"id":"1503.08696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08696","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08696v1","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08696","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"PK5M3VGDUPF2","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PK5M3VGDUPF23DTQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PK5M3VGD","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:3164a0e8567bdb6cbbcb7d9b77409d6d99ffa80dafba014471376848843ee84f","target":"graph","created_at":"2026-05-18T02:20:01Z","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":"Compressed sensing (CS) is an emerging paradigm for acquisition of compressed representations of a sparse signal. Its low complexity is appealing for resource-constrained scenarios like sensor networks. However, such scenarios are often coupled with unreliable communication channels and providing robust transmission of the acquired data to a receiver is an issue. Multiple description coding (MDC) effectively combats channel losses for systems without feedback, thus raising the interest in developing MDC methods explicitly designed for the CS framework, and exploiting its properties. We propose","authors_text":"Diego Valsesia, Enrico Magli, Giulio Coluccia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T14:59:28Z","title":"Graded quantization for multiple description coding of compressive measurements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08696","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:fa91f7abd9b05763ebd7a7d35b1727c72c38bf47c6b02908340eb75a18c0f538","target":"record","created_at":"2026-05-18T02:20:01Z","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":"1a555abfd51331742c8287be14fc9bb6b23c5ff829ef2c5b3e55d6e937bfe20d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-30T14:59:28Z","title_canon_sha256":"83381da81633daef1a8bc2a692e5c93a1ca9ca999e9c1abef3bf4356dac3de38"},"schema_version":"1.0","source":{"id":"1503.08696","kind":"arxiv","version":1}},"canonical_sha256":"7abacdd4c3a3cbad8e70b9e0c971e57ae94ec405897fbc777626cd14dc428d0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7abacdd4c3a3cbad8e70b9e0c971e57ae94ec405897fbc777626cd14dc428d0c","first_computed_at":"2026-05-18T02:20:01.081715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:01.081715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tRb4OQO+0PJafom9gFkOrLrjScRX3+mFO/z0ii+OaCF+e5iEC+/a0OOr52y0WJG1IPLHzvlOAlRtAOnljMxoBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:01.082445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa91f7abd9b05763ebd7a7d35b1727c72c38bf47c6b02908340eb75a18c0f538","sha256:3164a0e8567bdb6cbbcb7d9b77409d6d99ffa80dafba014471376848843ee84f"],"state_sha256":"de6dc6f426eeab023ce2ddf68147af3285a803ba18f389bda714e80ca9fc7dba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25/dgKrt81Cn/HtooTfVGtzy5E9o5jTYRMU5UamDHEcy2sr25/GBDxwOAaDAjsrG7oZB4n+HLy5mOVEhczmXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:46:52.902333Z","bundle_sha256":"34924979da23adcbc9c0a190cce77b87fcb8e015d3f051c5c470566add4e2055"}}