{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HWL6IPB3K2BVHTGCRXQPQOJQ5E","short_pith_number":"pith:HWL6IPB3","canonical_record":{"source":{"id":"1604.03877","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-13T17:26:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3fef75fc7f57aa561c7192d941f6bb40614c9d5c78edb10f5d7b8146e7e6cfc","abstract_canon_sha256":"6c7fd4971eddcb3c6eced72c2654472be87b2c710d9714a9d02869bffe0a01b8"},"schema_version":"1.0"},"canonical_sha256":"3d97e43c3b568353ccc28de0f83930e92a1030f9e9207bbee49db0d111a904b2","source":{"kind":"arxiv","id":"1604.03877","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03877","created_at":"2026-05-18T01:17:07Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03877v2","created_at":"2026-05-18T01:17:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03877","created_at":"2026-05-18T01:17:07Z"},{"alias_kind":"pith_short_12","alias_value":"HWL6IPB3K2BV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HWL6IPB3K2BVHTGC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HWL6IPB3","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HWL6IPB3K2BVHTGCRXQPQOJQ5E","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03877","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-13T17:26:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3fef75fc7f57aa561c7192d941f6bb40614c9d5c78edb10f5d7b8146e7e6cfc","abstract_canon_sha256":"6c7fd4971eddcb3c6eced72c2654472be87b2c710d9714a9d02869bffe0a01b8"},"schema_version":"1.0"},"canonical_sha256":"3d97e43c3b568353ccc28de0f83930e92a1030f9e9207bbee49db0d111a904b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:07.185030Z","signature_b64":"2AkdJpX892o92Df2ryjjSPUBKUen0rkoHXcJH4sC7ZKagksFB2/jJtTFLczxkNvBn2tzSAcEhToCMG4HUrTLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d97e43c3b568353ccc28de0f83930e92a1030f9e9207bbee49db0d111a904b2","last_reissued_at":"2026-05-18T01:17:07.184061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:07.184061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03877","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-18T01:17:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26LcaXaCPr1FL/fOYWqIhhRWAzcVqsvNDs4sArhzZMKk74BkAgW7BeJLhNSVE0M9/1IXCCoe9fnuSIDfO5oUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:53:16.721597Z"},"content_sha256":"af8d77ca1a75af4ef43a1865471d6229577a9a5bff97da756e7d4bae8d945499","schema_version":"1.0","event_id":"sha256:af8d77ca1a75af4ef43a1865471d6229577a9a5bff97da756e7d4bae8d945499"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HWL6IPB3K2BVHTGCRXQPQOJQ5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Entropy Functions: Approximate Gacs-Korner for Distributed Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Muriel M\\'edard, Salman Salamatian","submitted_at":"2016-04-13T17:26:45Z","abstract_excerpt":"Consider two correlated sources $X$ and $Y$ generated from a joint distribution $p_{X,Y}$. Their G\\'acs-K\\\"orner Common Information, a measure of common information that exploits the combinatorial structure of the distribution $p_{X,Y}$, leads to a source decomposition that exhibits the latent common parts in $X$ and $Y$. Using this source decomposition we construct an efficient distributed compression scheme, which can be efficiently used in the network setting as well. Then, we relax the combinatorial conditions on the source distribution, which results in an efficient scheme with a helper n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03877","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-18T01:17:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/mOB02tf3lMMaOqDkrApd2ZuNLCqFraVxDlV8TjbWG+4G3GkHHIL6ASnOGL+rt1GXKgHG3FSrrkwD3MLKiCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:53:16.722032Z"},"content_sha256":"54dc92a33b8e4670b27bf31f06b3a1ac72e64450c88afa8cf1c96a89b9fa6ed9","schema_version":"1.0","event_id":"sha256:54dc92a33b8e4670b27bf31f06b3a1ac72e64450c88afa8cf1c96a89b9fa6ed9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWL6IPB3K2BVHTGCRXQPQOJQ5E/bundle.json","state_url":"https://pith.science/pith/HWL6IPB3K2BVHTGCRXQPQOJQ5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWL6IPB3K2BVHTGCRXQPQOJQ5E/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-27T02:53:16Z","links":{"resolver":"https://pith.science/pith/HWL6IPB3K2BVHTGCRXQPQOJQ5E","bundle":"https://pith.science/pith/HWL6IPB3K2BVHTGCRXQPQOJQ5E/bundle.json","state":"https://pith.science/pith/HWL6IPB3K2BVHTGCRXQPQOJQ5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWL6IPB3K2BVHTGCRXQPQOJQ5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HWL6IPB3K2BVHTGCRXQPQOJQ5E","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":"6c7fd4971eddcb3c6eced72c2654472be87b2c710d9714a9d02869bffe0a01b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-13T17:26:45Z","title_canon_sha256":"e3fef75fc7f57aa561c7192d941f6bb40614c9d5c78edb10f5d7b8146e7e6cfc"},"schema_version":"1.0","source":{"id":"1604.03877","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03877","created_at":"2026-05-18T01:17:07Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03877v2","created_at":"2026-05-18T01:17:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03877","created_at":"2026-05-18T01:17:07Z"},{"alias_kind":"pith_short_12","alias_value":"HWL6IPB3K2BV","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HWL6IPB3K2BVHTGC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HWL6IPB3","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:54dc92a33b8e4670b27bf31f06b3a1ac72e64450c88afa8cf1c96a89b9fa6ed9","target":"graph","created_at":"2026-05-18T01:17:07Z","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":"Consider two correlated sources $X$ and $Y$ generated from a joint distribution $p_{X,Y}$. Their G\\'acs-K\\\"orner Common Information, a measure of common information that exploits the combinatorial structure of the distribution $p_{X,Y}$, leads to a source decomposition that exhibits the latent common parts in $X$ and $Y$. Using this source decomposition we construct an efficient distributed compression scheme, which can be efficiently used in the network setting as well. Then, we relax the combinatorial conditions on the source distribution, which results in an efficient scheme with a helper n","authors_text":"Asaf Cohen, Muriel M\\'edard, Salman Salamatian","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-13T17:26:45Z","title":"Maximum Entropy Functions: Approximate Gacs-Korner for Distributed Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03877","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:af8d77ca1a75af4ef43a1865471d6229577a9a5bff97da756e7d4bae8d945499","target":"record","created_at":"2026-05-18T01:17:07Z","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":"6c7fd4971eddcb3c6eced72c2654472be87b2c710d9714a9d02869bffe0a01b8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-13T17:26:45Z","title_canon_sha256":"e3fef75fc7f57aa561c7192d941f6bb40614c9d5c78edb10f5d7b8146e7e6cfc"},"schema_version":"1.0","source":{"id":"1604.03877","kind":"arxiv","version":2}},"canonical_sha256":"3d97e43c3b568353ccc28de0f83930e92a1030f9e9207bbee49db0d111a904b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d97e43c3b568353ccc28de0f83930e92a1030f9e9207bbee49db0d111a904b2","first_computed_at":"2026-05-18T01:17:07.184061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:07.184061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2AkdJpX892o92Df2ryjjSPUBKUen0rkoHXcJH4sC7ZKagksFB2/jJtTFLczxkNvBn2tzSAcEhToCMG4HUrTLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:07.185030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03877","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af8d77ca1a75af4ef43a1865471d6229577a9a5bff97da756e7d4bae8d945499","sha256:54dc92a33b8e4670b27bf31f06b3a1ac72e64450c88afa8cf1c96a89b9fa6ed9"],"state_sha256":"015e79c84608728a30a35a2051a1b01ca05566d3cd7afc24f64a0ff7834bb462"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZwMo/0uWvJLu2y8ONH0ZyJR1u3eLjCdelNANrMitYt9TPkZvZHYCQAebbWbYrRnpMsXaTKJUaSITeiOYLvMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:53:16.725524Z","bundle_sha256":"f8d790f3065169b227665c53840d8fd55f54da9a59fcfd02cbbded5fca368abc"}}