{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OYRWVYI6FOOHAGKIINYAIEMZLH","short_pith_number":"pith:OYRWVYI6","canonical_record":{"source":{"id":"1401.6136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T19:22:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74348c5f0b75f6129e7a486a19951552a62b520f63d83a346651a046841c8509","abstract_canon_sha256":"9b8481c884a8aaee23f4d8e966d20935551fcb04373a7ccf42ed9b117527a21d"},"schema_version":"1.0"},"canonical_sha256":"76236ae11e2b9c701948437004119959c7cd372449a7bb7da3c8ec81ac4a4135","source":{"kind":"arxiv","id":"1401.6136","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6136","created_at":"2026-05-18T02:50:31Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6136v2","created_at":"2026-05-18T02:50:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6136","created_at":"2026-05-18T02:50:31Z"},{"alias_kind":"pith_short_12","alias_value":"OYRWVYI6FOOH","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYRWVYI6FOOHAGKI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYRWVYI6","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OYRWVYI6FOOHAGKIINYAIEMZLH","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T19:22:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74348c5f0b75f6129e7a486a19951552a62b520f63d83a346651a046841c8509","abstract_canon_sha256":"9b8481c884a8aaee23f4d8e966d20935551fcb04373a7ccf42ed9b117527a21d"},"schema_version":"1.0"},"canonical_sha256":"76236ae11e2b9c701948437004119959c7cd372449a7bb7da3c8ec81ac4a4135","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:31.156820Z","signature_b64":"PBQjnS+0CQppauUpk8B01SjNeZdFZaIVV+sQlpzGbiIpEEGXBAsPFuiCoYqrm28q1wd3hJ2BPq/M7DEGf2O6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76236ae11e2b9c701948437004119959c7cd372449a7bb7da3c8ec81ac4a4135","last_reissued_at":"2026-05-18T02:50:31.156170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:31.156170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6136","source_version":2,"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:50:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePuqJawMjyOqjyDbXOAOFOaIss4aUY+8myPzHvWXHQRLsrtp5UBi/3HzyxSp2e4MuoxwXt93OnVPr013asdBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:10:21.911503Z"},"content_sha256":"42294a1fc1d0b97488d12f9507ef0774c2fd03f83129846a295a4a543ded3fc9","schema_version":"1.0","event_id":"sha256:42294a1fc1d0b97488d12f9507ef0774c2fd03f83129846a295a4a543ded3fc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OYRWVYI6FOOHAGKIINYAIEMZLH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Remote Vector Gaussian Source Coding with Covariance Distortion Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adel Zahedi, Jan Ostergaard, Patrick Naylor, Soren Bech, Soren Holdt Jensen","submitted_at":"2014-01-23T19:22:23Z","abstract_excerpt":"In this paper, we consider a distributed remote source coding problem, where a sequence of observations of source vectors is available at the encoder. The problem is to specify the optimal rate for encoding the observations subject to a covariance matrix distortion constraint and in the presence of side information at the decoder. For this problem, we derive lower and upper bounds on the rate-distortion function (RDF) for the Gaussian case, which in general do not coincide. We then provide some cases, where the RDF can be derived exactly. We also show that previous results on specific instance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6136","kind":"arxiv","version":2},"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:50:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2TqwqcOZzqA3KQ/xpvWfI2+22kxdUjl3+cuZapHq1oFTjjd/hIqYrlvBbSNTfwCqwRio9UPvdGOO//9Pm+zCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:10:21.912125Z"},"content_sha256":"0812c3ff3bb0c2e075d2a952e6880487353a7a4442ff8f91748591e8795d5133","schema_version":"1.0","event_id":"sha256:0812c3ff3bb0c2e075d2a952e6880487353a7a4442ff8f91748591e8795d5133"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYRWVYI6FOOHAGKIINYAIEMZLH/bundle.json","state_url":"https://pith.science/pith/OYRWVYI6FOOHAGKIINYAIEMZLH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYRWVYI6FOOHAGKIINYAIEMZLH/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-08T03:10:21Z","links":{"resolver":"https://pith.science/pith/OYRWVYI6FOOHAGKIINYAIEMZLH","bundle":"https://pith.science/pith/OYRWVYI6FOOHAGKIINYAIEMZLH/bundle.json","state":"https://pith.science/pith/OYRWVYI6FOOHAGKIINYAIEMZLH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYRWVYI6FOOHAGKIINYAIEMZLH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OYRWVYI6FOOHAGKIINYAIEMZLH","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":"9b8481c884a8aaee23f4d8e966d20935551fcb04373a7ccf42ed9b117527a21d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T19:22:23Z","title_canon_sha256":"74348c5f0b75f6129e7a486a19951552a62b520f63d83a346651a046841c8509"},"schema_version":"1.0","source":{"id":"1401.6136","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6136","created_at":"2026-05-18T02:50:31Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6136v2","created_at":"2026-05-18T02:50:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6136","created_at":"2026-05-18T02:50:31Z"},{"alias_kind":"pith_short_12","alias_value":"OYRWVYI6FOOH","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYRWVYI6FOOHAGKI","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYRWVYI6","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:0812c3ff3bb0c2e075d2a952e6880487353a7a4442ff8f91748591e8795d5133","target":"graph","created_at":"2026-05-18T02:50:31Z","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":"In this paper, we consider a distributed remote source coding problem, where a sequence of observations of source vectors is available at the encoder. The problem is to specify the optimal rate for encoding the observations subject to a covariance matrix distortion constraint and in the presence of side information at the decoder. For this problem, we derive lower and upper bounds on the rate-distortion function (RDF) for the Gaussian case, which in general do not coincide. We then provide some cases, where the RDF can be derived exactly. We also show that previous results on specific instance","authors_text":"Adel Zahedi, Jan Ostergaard, Patrick Naylor, Soren Bech, Soren Holdt Jensen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T19:22:23Z","title":"Distributed Remote Vector Gaussian Source Coding with Covariance Distortion Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6136","kind":"arxiv","version":2},"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:42294a1fc1d0b97488d12f9507ef0774c2fd03f83129846a295a4a543ded3fc9","target":"record","created_at":"2026-05-18T02:50:31Z","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":"9b8481c884a8aaee23f4d8e966d20935551fcb04373a7ccf42ed9b117527a21d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-23T19:22:23Z","title_canon_sha256":"74348c5f0b75f6129e7a486a19951552a62b520f63d83a346651a046841c8509"},"schema_version":"1.0","source":{"id":"1401.6136","kind":"arxiv","version":2}},"canonical_sha256":"76236ae11e2b9c701948437004119959c7cd372449a7bb7da3c8ec81ac4a4135","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76236ae11e2b9c701948437004119959c7cd372449a7bb7da3c8ec81ac4a4135","first_computed_at":"2026-05-18T02:50:31.156170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:31.156170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PBQjnS+0CQppauUpk8B01SjNeZdFZaIVV+sQlpzGbiIpEEGXBAsPFuiCoYqrm28q1wd3hJ2BPq/M7DEGf2O6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:31.156820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6136","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42294a1fc1d0b97488d12f9507ef0774c2fd03f83129846a295a4a543ded3fc9","sha256:0812c3ff3bb0c2e075d2a952e6880487353a7a4442ff8f91748591e8795d5133"],"state_sha256":"8e1a3050dddf5bbfc6712a7923920aaaaf508690c37d26277677984517065389"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1fPvRKQWJsDYSqPYzTLd+ZPwGqOGeVOwKBrpmG0WrY9fceOnoa2VU+TdtR16XBfSyDqXTsSIo57hVFXXL3SBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:10:21.915404Z","bundle_sha256":"3107e77b8bfbc510d7ab01bc21f3f17cb804e66f982b0d29e95422a55fbe4998"}}