{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:X6EYK22KPG7GRKT54PLKLNDIVM","short_pith_number":"pith:X6EYK22K","canonical_record":{"source":{"id":"1308.2338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-10T19:55:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4706cff43d1492ba4abff89b400f3d39dca8871852f0323a2c4d9fc321633af6","abstract_canon_sha256":"0e80f428d58e7bc008d0114ccc60383345af969c4127786d331846beddbf6583"},"schema_version":"1.0"},"canonical_sha256":"bf89856b4a79be68aa7de3d6a5b468ab37c873ec0132e304b194251fd1a06b46","source":{"kind":"arxiv","id":"1308.2338","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2338","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2338v1","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2338","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"X6EYK22KPG7G","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X6EYK22KPG7GRKT5","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X6EYK22K","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:X6EYK22KPG7GRKT54PLKLNDIVM","target":"record","payload":{"canonical_record":{"source":{"id":"1308.2338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-10T19:55:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4706cff43d1492ba4abff89b400f3d39dca8871852f0323a2c4d9fc321633af6","abstract_canon_sha256":"0e80f428d58e7bc008d0114ccc60383345af969c4127786d331846beddbf6583"},"schema_version":"1.0"},"canonical_sha256":"bf89856b4a79be68aa7de3d6a5b468ab37c873ec0132e304b194251fd1a06b46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:07.764907Z","signature_b64":"5jN5wdhf6bgsW8NkfB2OOJF0ZSiBR9YOLooKQ4gsL42YuRQofJVUdT5aBFdAZP1Sr8NykISrLV8TwUn1ZqbYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf89856b4a79be68aa7de3d6a5b468ab37c873ec0132e304b194251fd1a06b46","last_reissued_at":"2026-05-18T03:16:07.764020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:07.764020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.2338","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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbyI8syHocv+YWwjWdXhQypiAVPhs4E5M/1b8rPODkv6FwwYNBvMwEtyqLtV60aa+fHJVHVGmuh2NpSP6aPDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:06:52.058647Z"},"content_sha256":"f46403a41c4641a9117ccc3e145c2e258bd44b400674714087982f78d04a0dd0","schema_version":"1.0","event_id":"sha256:f46403a41c4641a9117ccc3e145c2e258bd44b400674714087982f78d04a0dd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:X6EYK22KPG7GRKT54PLKLNDIVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lossy Compression of Exponential and Laplacian Sources using Expansion Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongbo Si, O. Ozan Koyluoglu, Sriram Vishwanath","submitted_at":"2013-08-10T19:55:23Z","abstract_excerpt":"A general method of source coding over expansion is proposed in this paper, which enables one to reduce the problem of compressing an analog (continuous-valued source) to a set of much simpler problems, compressing discrete sources. Specifically, the focus is on lossy compression of exponential and Laplacian sources, which is subsequently expanded using a finite alphabet prior to being quantized. Due to decomposability property of such sources, the resulting random variables post expansion are independent and discrete. Thus, each of the expanded levels corresponds to an independent discrete so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2338","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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWmYjjS0dOSlOuFYVTrGsGce56sgYdIVvp3AKuiuFNqiUpMVGVLpHiqWtThHi5sOASzurwvtUNYAxOQvuIyEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:06:52.058998Z"},"content_sha256":"5ac0afa2dac3c34bf7b027fcdb091808da039f17b24b208e6a757ce4f9087d80","schema_version":"1.0","event_id":"sha256:5ac0afa2dac3c34bf7b027fcdb091808da039f17b24b208e6a757ce4f9087d80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6EYK22KPG7GRKT54PLKLNDIVM/bundle.json","state_url":"https://pith.science/pith/X6EYK22KPG7GRKT54PLKLNDIVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6EYK22KPG7GRKT54PLKLNDIVM/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-02T23:06:52Z","links":{"resolver":"https://pith.science/pith/X6EYK22KPG7GRKT54PLKLNDIVM","bundle":"https://pith.science/pith/X6EYK22KPG7GRKT54PLKLNDIVM/bundle.json","state":"https://pith.science/pith/X6EYK22KPG7GRKT54PLKLNDIVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6EYK22KPG7GRKT54PLKLNDIVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:X6EYK22KPG7GRKT54PLKLNDIVM","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":"0e80f428d58e7bc008d0114ccc60383345af969c4127786d331846beddbf6583","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-10T19:55:23Z","title_canon_sha256":"4706cff43d1492ba4abff89b400f3d39dca8871852f0323a2c4d9fc321633af6"},"schema_version":"1.0","source":{"id":"1308.2338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2338","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2338v1","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2338","created_at":"2026-05-18T03:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"X6EYK22KPG7G","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X6EYK22KPG7GRKT5","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X6EYK22K","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:5ac0afa2dac3c34bf7b027fcdb091808da039f17b24b208e6a757ce4f9087d80","target":"graph","created_at":"2026-05-18T03:16:07Z","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":"A general method of source coding over expansion is proposed in this paper, which enables one to reduce the problem of compressing an analog (continuous-valued source) to a set of much simpler problems, compressing discrete sources. Specifically, the focus is on lossy compression of exponential and Laplacian sources, which is subsequently expanded using a finite alphabet prior to being quantized. Due to decomposability property of such sources, the resulting random variables post expansion are independent and discrete. Thus, each of the expanded levels corresponds to an independent discrete so","authors_text":"Hongbo Si, O. Ozan Koyluoglu, Sriram Vishwanath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-10T19:55:23Z","title":"Lossy Compression of Exponential and Laplacian Sources using Expansion Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2338","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:f46403a41c4641a9117ccc3e145c2e258bd44b400674714087982f78d04a0dd0","target":"record","created_at":"2026-05-18T03:16:07Z","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":"0e80f428d58e7bc008d0114ccc60383345af969c4127786d331846beddbf6583","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-10T19:55:23Z","title_canon_sha256":"4706cff43d1492ba4abff89b400f3d39dca8871852f0323a2c4d9fc321633af6"},"schema_version":"1.0","source":{"id":"1308.2338","kind":"arxiv","version":1}},"canonical_sha256":"bf89856b4a79be68aa7de3d6a5b468ab37c873ec0132e304b194251fd1a06b46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf89856b4a79be68aa7de3d6a5b468ab37c873ec0132e304b194251fd1a06b46","first_computed_at":"2026-05-18T03:16:07.764020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:07.764020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5jN5wdhf6bgsW8NkfB2OOJF0ZSiBR9YOLooKQ4gsL42YuRQofJVUdT5aBFdAZP1Sr8NykISrLV8TwUn1ZqbYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:07.764907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f46403a41c4641a9117ccc3e145c2e258bd44b400674714087982f78d04a0dd0","sha256:5ac0afa2dac3c34bf7b027fcdb091808da039f17b24b208e6a757ce4f9087d80"],"state_sha256":"acbc6932cb14045a72068b369be7243fea6c1ce2d4eb95e911d04bf8cad73a49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njuU2QchywT0y8YCoXCxKGm5aBLHtPRyHdvSmPIvO6anUmrGA0AMRUmA4dY1yRGhoCCkHoT8FnNRnkRmDSfUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:06:52.060930Z","bundle_sha256":"06e472f99665a73d365e163777759e6282c10be2e3c89c309e87d27f106a831a"}}