{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U4XWCTCLBAS2ZGBZ5PQZD3LJQD","short_pith_number":"pith:U4XWCTCL","schema_version":"1.0","canonical_sha256":"a72f614c4b0825ac9839ebe191ed6980d08f9d0e4b3ec54e815a65a486d72908","source":{"kind":"arxiv","id":"1210.2144","version":1},"attestation_state":"computed","paper":{"title":"Network Compression: Memory-Assisted Universal Coding of Sources with Correlated Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Faramarz Fekri","submitted_at":"2012-10-08T04:19:50Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.2144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-08T04:19:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5c03a64989e4beb926e0d46a572dd32ec702900255d096f6c5a761174bd5c8ae","abstract_canon_sha256":"a50a98df04b60d50341aaefd083280facaddecc6fc1e4745aa7ecee5ad15ae19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:50.977371Z","signature_b64":"cB6QexWBvvFVtkoREtuailuaiMtnqXHBLy7sr3SkpWw3WrwO6CWkGRpMhhrUYFz37IDvsWDOpcWMcmGFYLFmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a72f614c4b0825ac9839ebe191ed6980d08f9d0e4b3ec54e815a65a486d72908","last_reissued_at":"2026-05-18T03:43:50.976890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:50.976890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Compression: Memory-Assisted Universal Coding of Sources with Correlated Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Faramarz Fekri","submitted_at":"2012-10-08T04:19:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2144","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.2144","created_at":"2026-05-18T03:43:50.976963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2144v1","created_at":"2026-05-18T03:43:50.976963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2144","created_at":"2026-05-18T03:43:50.976963+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4XWCTCLBAS2","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4XWCTCLBAS2ZGBZ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4XWCTCL","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4XWCTCLBAS2ZGBZ5PQZD3LJQD","json":"https://pith.science/pith/U4XWCTCLBAS2ZGBZ5PQZD3LJQD.json","graph_json":"https://pith.science/api/pith-number/U4XWCTCLBAS2ZGBZ5PQZD3LJQD/graph.json","events_json":"https://pith.science/api/pith-number/U4XWCTCLBAS2ZGBZ5PQZD3LJQD/events.json","paper":"https://pith.science/paper/U4XWCTCL"},"agent_actions":{"view_html":"https://pith.science/pith/U4XWCTCLBAS2ZGBZ5PQZD3LJQD","download_json":"https://pith.science/pith/U4XWCTCLBAS2ZGBZ5PQZD3LJQD.json","view_paper":"https://pith.science/paper/U4XWCTCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2144&json=true","fetch_graph":"https://pith.science/api/pith-number/U4XWCTCLBAS2ZGBZ5PQZD3LJQD/graph.json","fetch_events":"https://pith.science/api/pith-number/U4XWCTCLBAS2ZGBZ5PQZD3LJQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4XWCTCLBAS2ZGBZ5PQZD3LJQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4XWCTCLBAS2ZGBZ5PQZD3LJQD/action/storage_attestation","attest_author":"https://pith.science/pith/U4XWCTCLBAS2ZGBZ5PQZD3LJQD/action/author_attestation","sign_citation":"https://pith.science/pith/U4XWCTCLBAS2ZGBZ5PQZD3LJQD/action/citation_signature","submit_replication":"https://pith.science/pith/U4XWCTCLBAS2ZGBZ5PQZD3LJQD/action/replication_record"}},"created_at":"2026-05-18T03:43:50.976963+00:00","updated_at":"2026-05-18T03:43:50.976963+00:00"}