{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:55RRY4N3VACF6UQFIWDBG5M7EK","short_pith_number":"pith:55RRY4N3","canonical_record":{"source":{"id":"1802.09580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-26T20:05:50Z","cross_cats_sorted":[],"title_canon_sha256":"9e1fc3a823ef7a99799a7019ceca71be6ae84414636515480348af22ed44172f","abstract_canon_sha256":"fa2311361e6862facb38652ee352ebe65330cfb3a38e8c3c64639d0db934767c"},"schema_version":"1.0"},"canonical_sha256":"ef631c71bba8045f5205458613759f229044b3f1895a3e2591198a7ff7c3abfd","source":{"kind":"arxiv","id":"1802.09580","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09580","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09580v1","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09580","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"55RRY4N3VACF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"55RRY4N3VACF6UQF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"55RRY4N3","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:55RRY4N3VACF6UQFIWDBG5M7EK","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-26T20:05:50Z","cross_cats_sorted":[],"title_canon_sha256":"9e1fc3a823ef7a99799a7019ceca71be6ae84414636515480348af22ed44172f","abstract_canon_sha256":"fa2311361e6862facb38652ee352ebe65330cfb3a38e8c3c64639d0db934767c"},"schema_version":"1.0"},"canonical_sha256":"ef631c71bba8045f5205458613759f229044b3f1895a3e2591198a7ff7c3abfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:30.722900Z","signature_b64":"w9lOh7h7SuCcexYOalnb73SMjmB1FAz2ujdcBPD4YShDCH3LcWCdPjOi8MJVMtgAsC/ugnMbybRjDS27V4cgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef631c71bba8045f5205458613759f229044b3f1895a3e2591198a7ff7c3abfd","last_reissued_at":"2026-05-18T00:22:30.722240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:30.722240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09580","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-18T00:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdeJgT9qxPyT7POtisdilxHkxEUlDhhPUqmx7/5qreS6JENLfFvNLBAspbcU5+StiCaqY+o26aCpn8JDUyfJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:18:45.603485Z"},"content_sha256":"39afb56258e2497946c6286ba5e945691c841d85b4abf5fe3afb1fbf22884ee4","schema_version":"1.0","event_id":"sha256:39afb56258e2497946c6286ba5e945691c841d85b4abf5fe3afb1fbf22884ee4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:55RRY4N3VACF6UQFIWDBG5M7EK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lossy Compression of Decimated Gaussian Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alon Kipnis, Andrea J. Goldsmith, Georgia Murray","submitted_at":"2018-02-26T20:05:50Z","abstract_excerpt":"We consider the problem of estimating a Gaussian random walk from a lossy compression of its decimated version. Hence, the encoder operates on the decimated random walk, and the decoder estimates the original random walk from its encoded version under a mean squared error (MSE) criterion. It is well-known that the minimal distortion in this problem is attained by an estimate-and-compress (EC) source coding strategy, in which the encoder first estimates the original random walk and then compresses this estimate subject to the bit constraint. In this work, we derive a closed-form expression for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09580","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-18T00:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hsSqOt3WGTVOxavN0y1wfI5c3JjScbZe+kfmftwxlvoTMq1rVzoLKdcidi6oLpQRd7xtyQT6+XPATCGOxMXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:18:45.603837Z"},"content_sha256":"31e364b8b788c189b2cb2951537668e248994025b89b2d16e1029055a3795f57","schema_version":"1.0","event_id":"sha256:31e364b8b788c189b2cb2951537668e248994025b89b2d16e1029055a3795f57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55RRY4N3VACF6UQFIWDBG5M7EK/bundle.json","state_url":"https://pith.science/pith/55RRY4N3VACF6UQFIWDBG5M7EK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55RRY4N3VACF6UQFIWDBG5M7EK/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-21T23:18:45Z","links":{"resolver":"https://pith.science/pith/55RRY4N3VACF6UQFIWDBG5M7EK","bundle":"https://pith.science/pith/55RRY4N3VACF6UQFIWDBG5M7EK/bundle.json","state":"https://pith.science/pith/55RRY4N3VACF6UQFIWDBG5M7EK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55RRY4N3VACF6UQFIWDBG5M7EK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:55RRY4N3VACF6UQFIWDBG5M7EK","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":"fa2311361e6862facb38652ee352ebe65330cfb3a38e8c3c64639d0db934767c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-26T20:05:50Z","title_canon_sha256":"9e1fc3a823ef7a99799a7019ceca71be6ae84414636515480348af22ed44172f"},"schema_version":"1.0","source":{"id":"1802.09580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09580","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09580v1","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09580","created_at":"2026-05-18T00:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"55RRY4N3VACF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"55RRY4N3VACF6UQF","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"55RRY4N3","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:31e364b8b788c189b2cb2951537668e248994025b89b2d16e1029055a3795f57","target":"graph","created_at":"2026-05-18T00:22:30Z","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 consider the problem of estimating a Gaussian random walk from a lossy compression of its decimated version. Hence, the encoder operates on the decimated random walk, and the decoder estimates the original random walk from its encoded version under a mean squared error (MSE) criterion. It is well-known that the minimal distortion in this problem is attained by an estimate-and-compress (EC) source coding strategy, in which the encoder first estimates the original random walk and then compresses this estimate subject to the bit constraint. In this work, we derive a closed-form expression for ","authors_text":"Alon Kipnis, Andrea J. Goldsmith, Georgia Murray","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-26T20:05:50Z","title":"Lossy Compression of Decimated Gaussian Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09580","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:39afb56258e2497946c6286ba5e945691c841d85b4abf5fe3afb1fbf22884ee4","target":"record","created_at":"2026-05-18T00:22:30Z","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":"fa2311361e6862facb38652ee352ebe65330cfb3a38e8c3c64639d0db934767c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-02-26T20:05:50Z","title_canon_sha256":"9e1fc3a823ef7a99799a7019ceca71be6ae84414636515480348af22ed44172f"},"schema_version":"1.0","source":{"id":"1802.09580","kind":"arxiv","version":1}},"canonical_sha256":"ef631c71bba8045f5205458613759f229044b3f1895a3e2591198a7ff7c3abfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef631c71bba8045f5205458613759f229044b3f1895a3e2591198a7ff7c3abfd","first_computed_at":"2026-05-18T00:22:30.722240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:30.722240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w9lOh7h7SuCcexYOalnb73SMjmB1FAz2ujdcBPD4YShDCH3LcWCdPjOi8MJVMtgAsC/ugnMbybRjDS27V4cgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:30.722900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39afb56258e2497946c6286ba5e945691c841d85b4abf5fe3afb1fbf22884ee4","sha256:31e364b8b788c189b2cb2951537668e248994025b89b2d16e1029055a3795f57"],"state_sha256":"547d46dd44c7f6f92a10a2f0f1a2695689a09e4e7553048565f724b1a8b6698e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lO1atj78LCn6kH7kXg0ifbxN83HUWv+IwEgiG/8h2XfwJSEMeQHAqyp/q1SNxZYOqQXpltkFDgBn6N4m7D+BAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:18:45.606235Z","bundle_sha256":"aafde2a06291f82ad2cbc834dac9ce6883aa71e920be8ab2d592c5c39e23800a"}}