{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NID2LNJ23TVTN6A6Z4ZA2OV6XQ","short_pith_number":"pith:NID2LNJ2","schema_version":"1.0","canonical_sha256":"6a07a5b53adceb36f81ecf320d3abebc2b9ad766eb32e2943240a8cc0255cc85","source":{"kind":"arxiv","id":"1206.4245","version":1},"attestation_state":"computed","paper":{"title":"On Lossless Universal Compression of Distributed Identical Sources","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-06-19T15:52:57Z","abstract_excerpt":"Slepian-Wolf theorem is a well-known framework that targets almost lossless compression of (two) data streams with symbol-by-symbol correlation between the outputs of (two) distributed sources. However, this paper considers a different scenario which does not fit in the Slepian-Wolf framework. We consider two identical but spatially separated sources. 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. Such a scenario occurs, for example, in the u"},"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":"1206.4245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-19T15:52:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"84b025034c5ba09f90bf5a8ca42d36685a7226ed281e7ca7b8ac9c8c0592e0a0","abstract_canon_sha256":"a6e4945209de5e704c02948221e98e77c2139ea00e168abc902d6ccabab56143"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:07.639702Z","signature_b64":"KePH2tJmDy6XI0fSelEmKje+qReTPSrOeE0N4+oueeHd8EI+7/8oM/Np67APdYDU7FBNF7sDoceWPFo/9fQDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a07a5b53adceb36f81ecf320d3abebc2b9ad766eb32e2943240a8cc0255cc85","last_reissued_at":"2026-05-18T03:53:07.639022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:07.639022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Lossless Universal Compression of Distributed Identical Sources","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-06-19T15:52:57Z","abstract_excerpt":"Slepian-Wolf theorem is a well-known framework that targets almost lossless compression of (two) data streams with symbol-by-symbol correlation between the outputs of (two) distributed sources. However, this paper considers a different scenario which does not fit in the Slepian-Wolf framework. We consider two identical but spatially separated sources. 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. Such a scenario occurs, for example, in the u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4245","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":"1206.4245","created_at":"2026-05-18T03:53:07.639122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4245v1","created_at":"2026-05-18T03:53:07.639122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4245","created_at":"2026-05-18T03:53:07.639122+00:00"},{"alias_kind":"pith_short_12","alias_value":"NID2LNJ23TVT","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NID2LNJ23TVTN6A6","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NID2LNJ2","created_at":"2026-05-18T12:27:16.716162+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/NID2LNJ23TVTN6A6Z4ZA2OV6XQ","json":"https://pith.science/pith/NID2LNJ23TVTN6A6Z4ZA2OV6XQ.json","graph_json":"https://pith.science/api/pith-number/NID2LNJ23TVTN6A6Z4ZA2OV6XQ/graph.json","events_json":"https://pith.science/api/pith-number/NID2LNJ23TVTN6A6Z4ZA2OV6XQ/events.json","paper":"https://pith.science/paper/NID2LNJ2"},"agent_actions":{"view_html":"https://pith.science/pith/NID2LNJ23TVTN6A6Z4ZA2OV6XQ","download_json":"https://pith.science/pith/NID2LNJ23TVTN6A6Z4ZA2OV6XQ.json","view_paper":"https://pith.science/paper/NID2LNJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4245&json=true","fetch_graph":"https://pith.science/api/pith-number/NID2LNJ23TVTN6A6Z4ZA2OV6XQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NID2LNJ23TVTN6A6Z4ZA2OV6XQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NID2LNJ23TVTN6A6Z4ZA2OV6XQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NID2LNJ23TVTN6A6Z4ZA2OV6XQ/action/storage_attestation","attest_author":"https://pith.science/pith/NID2LNJ23TVTN6A6Z4ZA2OV6XQ/action/author_attestation","sign_citation":"https://pith.science/pith/NID2LNJ23TVTN6A6Z4ZA2OV6XQ/action/citation_signature","submit_replication":"https://pith.science/pith/NID2LNJ23TVTN6A6Z4ZA2OV6XQ/action/replication_record"}},"created_at":"2026-05-18T03:53:07.639122+00:00","updated_at":"2026-05-18T03:53:07.639122+00:00"}