{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5RVNZ6FO3OQKFQ7GU7CEQOGEWO","short_pith_number":"pith:5RVNZ6FO","canonical_record":{"source":{"id":"1311.4634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T07:13:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98ee6fcbfe34544cc849c6fa2ec5bb2a009458881fd7545f777376b3a359d8a2","abstract_canon_sha256":"d43f00c097e2715d1e0c231a020f5b72f1b64e30a13660087952b539c6baaab7"},"schema_version":"1.0"},"canonical_sha256":"ec6adcf8aedba0a2c3e6a7c44838c4b39eb9dcffbe5645b8816fde57d90171d5","source":{"kind":"arxiv","id":"1311.4634","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4634","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4634v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4634","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"5RVNZ6FO3OQK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5RVNZ6FO3OQKFQ7G","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5RVNZ6FO","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5RVNZ6FO3OQKFQ7GU7CEQOGEWO","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T07:13:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98ee6fcbfe34544cc849c6fa2ec5bb2a009458881fd7545f777376b3a359d8a2","abstract_canon_sha256":"d43f00c097e2715d1e0c231a020f5b72f1b64e30a13660087952b539c6baaab7"},"schema_version":"1.0"},"canonical_sha256":"ec6adcf8aedba0a2c3e6a7c44838c4b39eb9dcffbe5645b8816fde57d90171d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.813017Z","signature_b64":"Pib2IaD2mTqNUhKMBWNnkKkt0ckNbhPTPFqLEkTna5bFVBeFZlzm7GHkNbVSQMmRGRQCa9lghLPav27L4+ytDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec6adcf8aedba0a2c3e6a7c44838c4b39eb9dcffbe5645b8816fde57d90171d5","last_reissued_at":"2026-05-18T03:06:43.812647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.812647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4634","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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2SN2SWuP3DQ5lL5f5xWuvpdRZrw/hvpUgtXaxmT3X3O0U0ZOLmGWKK2P7qgK6dbGw2wulpoczQKdoNRKRysAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:46:45.949461Z"},"content_sha256":"b66613adb49b39218131a1ce6a7981c0e61f1581eb618962967619b1dc809975","schema_version":"1.0","event_id":"sha256:b66613adb49b39218131a1ce6a7981c0e61f1581eb618962967619b1dc809975"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5RVNZ6FO3OQKFQ7GU7CEQOGEWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling versus Random Binning for Multiple Descriptions of a Bandlimited Source","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adam Mashiach, Jan Ostergaard, Ram Zamir","submitted_at":"2013-11-19T07:13:13Z","abstract_excerpt":"Random binning is an efficient, yet complex, coding technique for the symmetric L-description source coding problem. We propose an alternative approach, that uses the quantized samples of a bandlimited source as \"descriptions\". By the Nyquist condition, the source can be reconstructed if enough samples are received. We examine a coding scheme that combines sampling and noise-shaped quantization for a scenario in which only K < L descriptions or all L descriptions are received. Some of the received K-sets of descriptions correspond to uniform sampling while others to non-uniform sampling. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4634","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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/SS0Wx+1+lQGDajOzx87JeStsDOtu47OW7n2pWLT3Ku1695CzBIuXsGJ/EjsUFs/qUIAXYni6QC9pse9UUOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:46:45.949811Z"},"content_sha256":"70ba648b1708130e2d7271875b99ad964ff5e519e774446503164d690b06db8c","schema_version":"1.0","event_id":"sha256:70ba648b1708130e2d7271875b99ad964ff5e519e774446503164d690b06db8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RVNZ6FO3OQKFQ7GU7CEQOGEWO/bundle.json","state_url":"https://pith.science/pith/5RVNZ6FO3OQKFQ7GU7CEQOGEWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RVNZ6FO3OQKFQ7GU7CEQOGEWO/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-06-22T11:46:45Z","links":{"resolver":"https://pith.science/pith/5RVNZ6FO3OQKFQ7GU7CEQOGEWO","bundle":"https://pith.science/pith/5RVNZ6FO3OQKFQ7GU7CEQOGEWO/bundle.json","state":"https://pith.science/pith/5RVNZ6FO3OQKFQ7GU7CEQOGEWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RVNZ6FO3OQKFQ7GU7CEQOGEWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5RVNZ6FO3OQKFQ7GU7CEQOGEWO","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":"d43f00c097e2715d1e0c231a020f5b72f1b64e30a13660087952b539c6baaab7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T07:13:13Z","title_canon_sha256":"98ee6fcbfe34544cc849c6fa2ec5bb2a009458881fd7545f777376b3a359d8a2"},"schema_version":"1.0","source":{"id":"1311.4634","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4634","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4634v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4634","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"5RVNZ6FO3OQK","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5RVNZ6FO3OQKFQ7G","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5RVNZ6FO","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:70ba648b1708130e2d7271875b99ad964ff5e519e774446503164d690b06db8c","target":"graph","created_at":"2026-05-18T03:06:43Z","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":"Random binning is an efficient, yet complex, coding technique for the symmetric L-description source coding problem. We propose an alternative approach, that uses the quantized samples of a bandlimited source as \"descriptions\". By the Nyquist condition, the source can be reconstructed if enough samples are received. We examine a coding scheme that combines sampling and noise-shaped quantization for a scenario in which only K < L descriptions or all L descriptions are received. Some of the received K-sets of descriptions correspond to uniform sampling while others to non-uniform sampling. This ","authors_text":"Adam Mashiach, Jan Ostergaard, Ram Zamir","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T07:13:13Z","title":"Sampling versus Random Binning for Multiple Descriptions of a Bandlimited Source"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4634","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:b66613adb49b39218131a1ce6a7981c0e61f1581eb618962967619b1dc809975","target":"record","created_at":"2026-05-18T03:06:43Z","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":"d43f00c097e2715d1e0c231a020f5b72f1b64e30a13660087952b539c6baaab7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T07:13:13Z","title_canon_sha256":"98ee6fcbfe34544cc849c6fa2ec5bb2a009458881fd7545f777376b3a359d8a2"},"schema_version":"1.0","source":{"id":"1311.4634","kind":"arxiv","version":1}},"canonical_sha256":"ec6adcf8aedba0a2c3e6a7c44838c4b39eb9dcffbe5645b8816fde57d90171d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec6adcf8aedba0a2c3e6a7c44838c4b39eb9dcffbe5645b8816fde57d90171d5","first_computed_at":"2026-05-18T03:06:43.812647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:43.812647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pib2IaD2mTqNUhKMBWNnkKkt0ckNbhPTPFqLEkTna5bFVBeFZlzm7GHkNbVSQMmRGRQCa9lghLPav27L4+ytDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:43.813017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4634","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b66613adb49b39218131a1ce6a7981c0e61f1581eb618962967619b1dc809975","sha256:70ba648b1708130e2d7271875b99ad964ff5e519e774446503164d690b06db8c"],"state_sha256":"5d3c38f182eec8908a8b867409c35528aa64f13d0dc7f8f9b5c69831bddf4ab4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzOgEXBcv25HCTKv2quSDSccvDeRtZ7D2MEHLGG8EceoSWSi+XZUtV6Te5q5nVP13prjTYPLtaH2mqh+dzGFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:46:45.951769Z","bundle_sha256":"949ab89f2c5e45891c6e9f3253849a28494ecdbc6750668b12083618cdf2e1c9"}}