{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ANT3MMFSBZXF5U4R4F6QH3GA6W","short_pith_number":"pith:ANT3MMFS","canonical_record":{"source":{"id":"1511.02381","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-07T17:27:44Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"2fa3b5f185d6b5ac8c80beaa7f6b7abbda4c884adbfe01d9fde58898e00c86f6","abstract_canon_sha256":"e5cd3e962d0a7bcde05315135c1fff9a6e3caf0876a0766bbf8c119bca51e39b"},"schema_version":"1.0"},"canonical_sha256":"0367b630b20e6e5ed391e17d03ecc0f597d7a896bab6ed875a8068fdc35fd114","source":{"kind":"arxiv","id":"1511.02381","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02381","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02381v3","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02381","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"pith_short_12","alias_value":"ANT3MMFSBZXF","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ANT3MMFSBZXF5U4R","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ANT3MMFS","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ANT3MMFSBZXF5U4R4F6QH3GA6W","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02381","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-07T17:27:44Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"2fa3b5f185d6b5ac8c80beaa7f6b7abbda4c884adbfe01d9fde58898e00c86f6","abstract_canon_sha256":"e5cd3e962d0a7bcde05315135c1fff9a6e3caf0876a0766bbf8c119bca51e39b"},"schema_version":"1.0"},"canonical_sha256":"0367b630b20e6e5ed391e17d03ecc0f597d7a896bab6ed875a8068fdc35fd114","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:46.312987Z","signature_b64":"znt15jqFdMKBCeu4VChjUx5I6GixpuFy45uqIvPzGS6pyrB9fztDjMTfT2lieT4GKgACS5B7ZCbd1DUprIGeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0367b630b20e6e5ed391e17d03ecc0f597d7a896bab6ed875a8068fdc35fd114","last_reissued_at":"2026-05-18T01:22:46.312528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:46.312528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02381","source_version":3,"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:22:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+6m6RMhIVjA3LbEM6IsLyUW4uUmbdHNp90fp4AJTYh96n2b3IC/HftD/E+cg2cPOfMGMcCSnm2pxS0MSLfXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:14:03.085907Z"},"content_sha256":"063218b7d624ca2583811f63a76ae1dda59a0e247e71add212664a9bcaa0b5e1","schema_version":"1.0","event_id":"sha256:063218b7d624ca2583811f63a76ae1dda59a0e247e71add212664a9bcaa0b5e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ANT3MMFSBZXF5U4R4F6QH3GA6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Extraction Under Privacy Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Fady Alajaji, Mario Diaz, Shahab Asoodeh, Tam\\'as Linder","submitted_at":"2015-11-07T17:27:44Z","abstract_excerpt":"A privacy-constrained information extraction problem is considered where for a pair of correlated discrete random variables $(X,Y)$ governed by a given joint distribution, an agent observes $Y$ and wants to convey to a potentially public user as much information about $Y$ as possible without compromising the amount of information revealed about $X$. To this end, the so-called {\\em rate-privacy function} is introduced to quantify the maximal amount of information (measured in terms of mutual information) that can be extracted from $Y$ under a privacy constraint between $X$ and the extracted inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02381","kind":"arxiv","version":3},"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:22:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9SRG0sMBijKirBjY52LkZKeURtc9jQfxjJQ71QfGhgsnKoQt1sH4bpgMS/TTcTAetmDdLLFIPFQmMVSpYMrVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:14:03.086626Z"},"content_sha256":"f20a142980609438af1c2cbcce7ad4fff9b22494eb163bf87875de2d65b6c252","schema_version":"1.0","event_id":"sha256:f20a142980609438af1c2cbcce7ad4fff9b22494eb163bf87875de2d65b6c252"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/bundle.json","state_url":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/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-06-07T16:14:03Z","links":{"resolver":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W","bundle":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/bundle.json","state":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ANT3MMFSBZXF5U4R4F6QH3GA6W","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":"e5cd3e962d0a7bcde05315135c1fff9a6e3caf0876a0766bbf8c119bca51e39b","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-07T17:27:44Z","title_canon_sha256":"2fa3b5f185d6b5ac8c80beaa7f6b7abbda4c884adbfe01d9fde58898e00c86f6"},"schema_version":"1.0","source":{"id":"1511.02381","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02381","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02381v3","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02381","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"pith_short_12","alias_value":"ANT3MMFSBZXF","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ANT3MMFSBZXF5U4R","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ANT3MMFS","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:f20a142980609438af1c2cbcce7ad4fff9b22494eb163bf87875de2d65b6c252","target":"graph","created_at":"2026-05-18T01:22:46Z","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":"A privacy-constrained information extraction problem is considered where for a pair of correlated discrete random variables $(X,Y)$ governed by a given joint distribution, an agent observes $Y$ and wants to convey to a potentially public user as much information about $Y$ as possible without compromising the amount of information revealed about $X$. To this end, the so-called {\\em rate-privacy function} is introduced to quantify the maximal amount of information (measured in terms of mutual information) that can be extracted from $Y$ under a privacy constraint between $X$ and the extracted inf","authors_text":"Fady Alajaji, Mario Diaz, Shahab Asoodeh, Tam\\'as Linder","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-07T17:27:44Z","title":"Information Extraction Under Privacy Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02381","kind":"arxiv","version":3},"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:063218b7d624ca2583811f63a76ae1dda59a0e247e71add212664a9bcaa0b5e1","target":"record","created_at":"2026-05-18T01:22:46Z","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":"e5cd3e962d0a7bcde05315135c1fff9a6e3caf0876a0766bbf8c119bca51e39b","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-07T17:27:44Z","title_canon_sha256":"2fa3b5f185d6b5ac8c80beaa7f6b7abbda4c884adbfe01d9fde58898e00c86f6"},"schema_version":"1.0","source":{"id":"1511.02381","kind":"arxiv","version":3}},"canonical_sha256":"0367b630b20e6e5ed391e17d03ecc0f597d7a896bab6ed875a8068fdc35fd114","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0367b630b20e6e5ed391e17d03ecc0f597d7a896bab6ed875a8068fdc35fd114","first_computed_at":"2026-05-18T01:22:46.312528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:46.312528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"znt15jqFdMKBCeu4VChjUx5I6GixpuFy45uqIvPzGS6pyrB9fztDjMTfT2lieT4GKgACS5B7ZCbd1DUprIGeBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:46.312987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02381","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:063218b7d624ca2583811f63a76ae1dda59a0e247e71add212664a9bcaa0b5e1","sha256:f20a142980609438af1c2cbcce7ad4fff9b22494eb163bf87875de2d65b6c252"],"state_sha256":"3bdb55e6dfee15a0cf0e4b5ce422c095fe0a67b3d60cd55ad6d8deae29e99bb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SwY1Z7oed/yalfU6mAMcWdW7Ncft41wm8Tp/KHCXOBNOvRQEdAIW6S99hK8CYGjW58WdMUPOIC6MV671TKoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:14:03.090656Z","bundle_sha256":"e9144af96356b7a24f5496e6ab7f3c3a032fcc53e71ef2a735f337d588cbd522"}}