{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LRT33GFXLTT6YJYZTLSXG2SJJC","short_pith_number":"pith:LRT33GFX","canonical_record":{"source":{"id":"1211.5718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T02:28:22Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"ceb3122bbd48dd3224dc53bd362276e827d6ab7c4076b81073d9ae949e007631","abstract_canon_sha256":"797ac1209ddb979cbeec594d81e6ac60b3ec69a3935fca0ea11c2531e20b9ad3"},"schema_version":"1.0"},"canonical_sha256":"5c67bd98b75ce7ec27199ae5736a4948a664cc569b413e93df37948dde350086","source":{"kind":"arxiv","id":"1211.5718","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5718","created_at":"2026-05-18T03:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5718v1","created_at":"2026-05-18T03:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5718","created_at":"2026-05-18T03:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"LRT33GFXLTT6","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LRT33GFXLTT6YJYZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LRT33GFX","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LRT33GFXLTT6YJYZTLSXG2SJJC","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T02:28:22Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"ceb3122bbd48dd3224dc53bd362276e827d6ab7c4076b81073d9ae949e007631","abstract_canon_sha256":"797ac1209ddb979cbeec594d81e6ac60b3ec69a3935fca0ea11c2531e20b9ad3"},"schema_version":"1.0"},"canonical_sha256":"5c67bd98b75ce7ec27199ae5736a4948a664cc569b413e93df37948dde350086","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:02.180875Z","signature_b64":"vzLIlmtFtibJ/9ioWg78S6e52UMQJDHZkB03sQT2x+OnozhYD5evQd/vvRO1hBlIGeMoG4/dCKlQeLvXuFttCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c67bd98b75ce7ec27199ae5736a4948a664cc569b413e93df37948dde350086","last_reissued_at":"2026-05-18T03:40:02.180011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:02.180011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5718","source_version":1,"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-18T03:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHcyzpnySum09uup6qNq2uq9uPF+ZF9ZeP8UTOBYkWd/Z9JgPIm12rgsolDawHse2CGbqZdkNGdc3Bwu84r4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:39:32.572329Z"},"content_sha256":"b8cbf6205bf06ed6f1bdf7ac39695546960a0f4d5b0a8f724091b1dccb9b45e4","schema_version":"1.0","event_id":"sha256:b8cbf6205bf06ed6f1bdf7ac39695546960a0f4d5b0a8f724091b1dccb9b45e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LRT33GFXLTT6YJYZTLSXG2SJJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Compression with Uncertain Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Elad Haramaty, Madhu Sudan","submitted_at":"2012-11-25T02:28:22Z","abstract_excerpt":"We consider the task of compression of information when the source of the information and the destination do not agree on the prior, i.e., the distribution from which the information is being generated. This setting was considered previously by Kalai et al. (ICS 2011) who suggested that this was a natural model for human communication, and efficient schemes for compression here could give insights into the behavior of natural languages. Kalai et al. gave a compression scheme with nearly optimal performance, assuming the source and destination share some uniform randomness. In this work we expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5718","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"},"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-18T03:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVq8d/EQER9xCrCYGlESqioxWa4aUVAlg3WD8vGssdWxoSxCzTlMjjHc7uN6Tv2Lb0iMV4bMrBbHV3XPAuSPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:39:32.572821Z"},"content_sha256":"bbe5e9bf357f45c908eff2d9f7c12099dcb0a76a59dc03b251ac3b8e98984652","schema_version":"1.0","event_id":"sha256:bbe5e9bf357f45c908eff2d9f7c12099dcb0a76a59dc03b251ac3b8e98984652"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LRT33GFXLTT6YJYZTLSXG2SJJC/bundle.json","state_url":"https://pith.science/pith/LRT33GFXLTT6YJYZTLSXG2SJJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LRT33GFXLTT6YJYZTLSXG2SJJC/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-27T20:39:32Z","links":{"resolver":"https://pith.science/pith/LRT33GFXLTT6YJYZTLSXG2SJJC","bundle":"https://pith.science/pith/LRT33GFXLTT6YJYZTLSXG2SJJC/bundle.json","state":"https://pith.science/pith/LRT33GFXLTT6YJYZTLSXG2SJJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LRT33GFXLTT6YJYZTLSXG2SJJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LRT33GFXLTT6YJYZTLSXG2SJJC","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":"797ac1209ddb979cbeec594d81e6ac60b3ec69a3935fca0ea11c2531e20b9ad3","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T02:28:22Z","title_canon_sha256":"ceb3122bbd48dd3224dc53bd362276e827d6ab7c4076b81073d9ae949e007631"},"schema_version":"1.0","source":{"id":"1211.5718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5718","created_at":"2026-05-18T03:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5718v1","created_at":"2026-05-18T03:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5718","created_at":"2026-05-18T03:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"LRT33GFXLTT6","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LRT33GFXLTT6YJYZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LRT33GFX","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:bbe5e9bf357f45c908eff2d9f7c12099dcb0a76a59dc03b251ac3b8e98984652","target":"graph","created_at":"2026-05-18T03:40:02Z","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":"We consider the task of compression of information when the source of the information and the destination do not agree on the prior, i.e., the distribution from which the information is being generated. This setting was considered previously by Kalai et al. (ICS 2011) who suggested that this was a natural model for human communication, and efficient schemes for compression here could give insights into the behavior of natural languages. Kalai et al. gave a compression scheme with nearly optimal performance, assuming the source and destination share some uniform randomness. In this work we expl","authors_text":"Elad Haramaty, Madhu Sudan","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T02:28:22Z","title":"Deterministic Compression with Uncertain Priors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5718","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:b8cbf6205bf06ed6f1bdf7ac39695546960a0f4d5b0a8f724091b1dccb9b45e4","target":"record","created_at":"2026-05-18T03:40:02Z","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":"797ac1209ddb979cbeec594d81e6ac60b3ec69a3935fca0ea11c2531e20b9ad3","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T02:28:22Z","title_canon_sha256":"ceb3122bbd48dd3224dc53bd362276e827d6ab7c4076b81073d9ae949e007631"},"schema_version":"1.0","source":{"id":"1211.5718","kind":"arxiv","version":1}},"canonical_sha256":"5c67bd98b75ce7ec27199ae5736a4948a664cc569b413e93df37948dde350086","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c67bd98b75ce7ec27199ae5736a4948a664cc569b413e93df37948dde350086","first_computed_at":"2026-05-18T03:40:02.180011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:02.180011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vzLIlmtFtibJ/9ioWg78S6e52UMQJDHZkB03sQT2x+OnozhYD5evQd/vvRO1hBlIGeMoG4/dCKlQeLvXuFttCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:02.180875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8cbf6205bf06ed6f1bdf7ac39695546960a0f4d5b0a8f724091b1dccb9b45e4","sha256:bbe5e9bf357f45c908eff2d9f7c12099dcb0a76a59dc03b251ac3b8e98984652"],"state_sha256":"b3186cb3f56084bc00f84ead7a9197b3fcb1058e95d786820007590f4df80118"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/OO8sdLYD2RABVB+l7uiTJNDJS+JkHbas5ofZ42NVeac/gROwEER5gIBrIxUmCBjl59Js4D4oHh3s9sdvjnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:39:32.576123Z","bundle_sha256":"19a562a063e8d3a18166f7ab3ed7d899521017e0f83a74e7de1b30ba42de84da"}}