{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:U4XWCTCLBAS2ZGBZ5PQZD3LJQD","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":"a50a98df04b60d50341aaefd083280facaddecc6fc1e4745aa7ecee5ad15ae19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-08T04:19:50Z","title_canon_sha256":"5c03a64989e4beb926e0d46a572dd32ec702900255d096f6c5a761174bd5c8ae"},"schema_version":"1.0","source":{"id":"1210.2144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2144","created_at":"2026-05-18T03:43:50Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2144v1","created_at":"2026-05-18T03:43:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2144","created_at":"2026-05-18T03:43:50Z"},{"alias_kind":"pith_short_12","alias_value":"U4XWCTCLBAS2","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U4XWCTCLBAS2ZGBZ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U4XWCTCL","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:de59f0afadd568864782fedeabb810298f8e762180930473c6aa92cc2d87c70c","target":"graph","created_at":"2026-05-18T03:43:50Z","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 propose {\\em distributed network compression via memory}. We consider two spatially separated sources with correlated unknown source parameters. We wish to study the universal compression of a sequence of length $n$ from one of the sources provided that the decoder has access to (i.e., memorized) a sequence of length $m$ from the other source. In this setup, the correlation does not arise from symbol-by-symbol dependency of two outputs from the two sources (as in Slepian-Wolf setup). Instead, the two sequences are correlated because they are originated from the two sources wi","authors_text":"Ahmad Beirami, Faramarz Fekri","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-08T04:19:50Z","title":"Network Compression: Memory-Assisted Universal Coding of Sources with Correlated Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2144","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:33f44c5b3b904ee53386eab75d0552632f91350adb10923cc98b5bd67f6e7fdd","target":"record","created_at":"2026-05-18T03:43:50Z","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":"a50a98df04b60d50341aaefd083280facaddecc6fc1e4745aa7ecee5ad15ae19","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-08T04:19:50Z","title_canon_sha256":"5c03a64989e4beb926e0d46a572dd32ec702900255d096f6c5a761174bd5c8ae"},"schema_version":"1.0","source":{"id":"1210.2144","kind":"arxiv","version":1}},"canonical_sha256":"a72f614c4b0825ac9839ebe191ed6980d08f9d0e4b3ec54e815a65a486d72908","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a72f614c4b0825ac9839ebe191ed6980d08f9d0e4b3ec54e815a65a486d72908","first_computed_at":"2026-05-18T03:43:50.976890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:50.976890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cB6QexWBvvFVtkoREtuailuaiMtnqXHBLy7sr3SkpWw3WrwO6CWkGRpMhhrUYFz37IDvsWDOpcWMcmGFYLFmBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:50.977371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33f44c5b3b904ee53386eab75d0552632f91350adb10923cc98b5bd67f6e7fdd","sha256:de59f0afadd568864782fedeabb810298f8e762180930473c6aa92cc2d87c70c"],"state_sha256":"46cc7cdf2abd4c2180dcfb8c51cafd1274e0d8c749c61f5b657da90458d51ffb"}