{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ANT3MMFSBZXF5U4R4F6QH3GA6W","short_pith_number":"pith:ANT3MMFS","schema_version":"1.0","canonical_sha256":"0367b630b20e6e5ed391e17d03ecc0f597d7a896bab6ed875a8068fdc35fd114","source":{"kind":"arxiv","id":"1511.02381","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.02381","created_at":"2026-05-18T01:22:46.312601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02381v3","created_at":"2026-05-18T01:22:46.312601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02381","created_at":"2026-05-18T01:22:46.312601+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANT3MMFSBZXF","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANT3MMFSBZXF5U4R","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANT3MMFS","created_at":"2026-05-18T12:29:10.953037+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/ANT3MMFSBZXF5U4R4F6QH3GA6W","json":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W.json","graph_json":"https://pith.science/api/pith-number/ANT3MMFSBZXF5U4R4F6QH3GA6W/graph.json","events_json":"https://pith.science/api/pith-number/ANT3MMFSBZXF5U4R4F6QH3GA6W/events.json","paper":"https://pith.science/paper/ANT3MMFS"},"agent_actions":{"view_html":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W","download_json":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W.json","view_paper":"https://pith.science/paper/ANT3MMFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02381&json=true","fetch_graph":"https://pith.science/api/pith-number/ANT3MMFSBZXF5U4R4F6QH3GA6W/graph.json","fetch_events":"https://pith.science/api/pith-number/ANT3MMFSBZXF5U4R4F6QH3GA6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/action/storage_attestation","attest_author":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/action/author_attestation","sign_citation":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/action/citation_signature","submit_replication":"https://pith.science/pith/ANT3MMFSBZXF5U4R4F6QH3GA6W/action/replication_record"}},"created_at":"2026-05-18T01:22:46.312601+00:00","updated_at":"2026-05-18T01:22:46.312601+00:00"}