{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2KCAR3QSBTXX3G5XTOY7RQNLND","short_pith_number":"pith:2KCAR3QS","schema_version":"1.0","canonical_sha256":"d28408ee120cef7d9bb79bb1f8c1ab68cf477c474b1a026f13d8de4fae7f3aab","source":{"kind":"arxiv","id":"2507.15818","version":1},"attestation_state":"computed","paper":{"title":"The Capacity of Semantic Private Information Retrieval with Colluding Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.NI","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alptug Aytekin, Mohamed Nomeir, Sennur Ulukus","submitted_at":"2025-07-21T17:24:40Z","abstract_excerpt":"We study the problem of semantic private information retrieval (Sem-PIR) with $T$ colluding servers (Sem-TPIR), i.e., servers that collectively share user queries. In Sem-TPIR, the message sizes are different, and message retrieval probabilities by any user are not uniform. This is a generalization of the classical PIR problem where the message sizes are equal and message retrieval probabilities are identical. The earlier work on Sem-PIR considered the case of no collusions, i.e., the collusion parameter of $T=1$. In this paper, we consider the general problem for arbitrary $T < N$. We find an"},"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":"2507.15818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-07-21T17:24:40Z","cross_cats_sorted":["cs.CR","cs.NI","eess.SP","math.IT"],"title_canon_sha256":"cd78219aee751a48e9d8dc77d114b1e146fda7db44fd4047c4eef7eecd23f2ee","abstract_canon_sha256":"0cf5f4d2c8d672e9a68a00725b851dda65e3949e02ccf733e1513c01862a65a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:45.095626Z","signature_b64":"v0xsOPj79w2wpVka5Vu/eSNQYI+QWVSuvdc69Jt6uDj+dmT3YfCgh9bnIkwR31pZ81VAeoTh5mQfNrtPk7S6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d28408ee120cef7d9bb79bb1f8c1ab68cf477c474b1a026f13d8de4fae7f3aab","last_reissued_at":"2026-07-05T11:40:45.095073Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:45.095073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Capacity of Semantic Private Information Retrieval with Colluding Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.NI","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alptug Aytekin, Mohamed Nomeir, Sennur Ulukus","submitted_at":"2025-07-21T17:24:40Z","abstract_excerpt":"We study the problem of semantic private information retrieval (Sem-PIR) with $T$ colluding servers (Sem-TPIR), i.e., servers that collectively share user queries. In Sem-TPIR, the message sizes are different, and message retrieval probabilities by any user are not uniform. This is a generalization of the classical PIR problem where the message sizes are equal and message retrieval probabilities are identical. The earlier work on Sem-PIR considered the case of no collusions, i.e., the collusion parameter of $T=1$. In this paper, we consider the general problem for arbitrary $T < N$. We find an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15818","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.15818/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.15818","created_at":"2026-07-05T11:40:45.095133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15818v1","created_at":"2026-07-05T11:40:45.095133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15818","created_at":"2026-07-05T11:40:45.095133+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KCAR3QSBTXX","created_at":"2026-07-05T11:40:45.095133+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KCAR3QSBTXX3G5X","created_at":"2026-07-05T11:40:45.095133+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KCAR3QS","created_at":"2026-07-05T11:40:45.095133+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/2KCAR3QSBTXX3G5XTOY7RQNLND","json":"https://pith.science/pith/2KCAR3QSBTXX3G5XTOY7RQNLND.json","graph_json":"https://pith.science/api/pith-number/2KCAR3QSBTXX3G5XTOY7RQNLND/graph.json","events_json":"https://pith.science/api/pith-number/2KCAR3QSBTXX3G5XTOY7RQNLND/events.json","paper":"https://pith.science/paper/2KCAR3QS"},"agent_actions":{"view_html":"https://pith.science/pith/2KCAR3QSBTXX3G5XTOY7RQNLND","download_json":"https://pith.science/pith/2KCAR3QSBTXX3G5XTOY7RQNLND.json","view_paper":"https://pith.science/paper/2KCAR3QS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15818&json=true","fetch_graph":"https://pith.science/api/pith-number/2KCAR3QSBTXX3G5XTOY7RQNLND/graph.json","fetch_events":"https://pith.science/api/pith-number/2KCAR3QSBTXX3G5XTOY7RQNLND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KCAR3QSBTXX3G5XTOY7RQNLND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KCAR3QSBTXX3G5XTOY7RQNLND/action/storage_attestation","attest_author":"https://pith.science/pith/2KCAR3QSBTXX3G5XTOY7RQNLND/action/author_attestation","sign_citation":"https://pith.science/pith/2KCAR3QSBTXX3G5XTOY7RQNLND/action/citation_signature","submit_replication":"https://pith.science/pith/2KCAR3QSBTXX3G5XTOY7RQNLND/action/replication_record"}},"created_at":"2026-07-05T11:40:45.095133+00:00","updated_at":"2026-07-05T11:40:45.095133+00:00"}