{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SIIEZNG4G7ZQJOSQ5MAULM7ZQD","short_pith_number":"pith:SIIEZNG4","canonical_record":{"source":{"id":"1903.12552","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-29T14:44:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fdfdedccb5ba22c8e7c066e9ea5a03ad29b75d8149fc1c68721f41b60dcc56ae","abstract_canon_sha256":"bcfc9e95a40becc98ea5d6fe16adfaacbf973c363e698d1081a3f4c088ee0d23"},"schema_version":"1.0"},"canonical_sha256":"92104cb4dc37f304ba50eb0145b3f980d87664d99064993cb67870298502867a","source":{"kind":"arxiv","id":"1903.12552","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12552","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12552v7","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12552","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"SIIEZNG4G7ZQ","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"pith_short_16","alias_value":"SIIEZNG4G7ZQJOSQ","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"pith_short_8","alias_value":"SIIEZNG4","created_at":"2026-07-05T03:20:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SIIEZNG4G7ZQJOSQ5MAULM7ZQD","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12552","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-29T14:44:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fdfdedccb5ba22c8e7c066e9ea5a03ad29b75d8149fc1c68721f41b60dcc56ae","abstract_canon_sha256":"bcfc9e95a40becc98ea5d6fe16adfaacbf973c363e698d1081a3f4c088ee0d23"},"schema_version":"1.0"},"canonical_sha256":"92104cb4dc37f304ba50eb0145b3f980d87664d99064993cb67870298502867a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:17.686069Z","signature_b64":"f+jITzA+TITsP/sO0YJs6jVmtVcLNgj9Tla3eLP2yjvJSBUPkdz6S6bFNdp8bOPhE3MzSzIMbXLnfwCnqPfIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92104cb4dc37f304ba50eb0145b3f980d87664d99064993cb67870298502867a","last_reissued_at":"2026-07-05T03:20:17.685565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:17.685565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12552","source_version":7,"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-07-05T03:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQPOBV+OU1RgSMS546yxhxPpRHL8AGa1flsTgOnAUQZKZi76yLOS2uNL2kbBeA4UakSNonzK74gVoMe9jzU2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:25:28.253139Z"},"content_sha256":"417117f329af315c42ad5745347f04df10a6fa18a7ee1e8af172e6285f05f628","schema_version":"1.0","event_id":"sha256:417117f329af315c42ad5745347f04df10a6fa18a7ee1e8af172e6285f05f628"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SIIEZNG4G7ZQJOSQ5MAULM7ZQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Jie Li, Lukas Holzbaur, Ragnar Freij-Hollanti","submitted_at":"2019-03-29T14:44:02Z","abstract_excerpt":"In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-rank is a technical, yet natural condition required to prove a converse result for a capacity expression and satisfied by almost all currently known capacity-achieving schemes, while strong linearity is a practical requirement enabling implementation over small finite fields with low subpacketization degree. Then, the capacity of MDS-coded, linear, full support-rank PIR in the presence of colluding servers is derived,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12552","kind":"arxiv","version":7},"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/1903.12552/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"},"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-07-05T03:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHxmzXyUK3pbkXoivJVIdHkokcOOaHIcpEyDnHcRKg1q7em7vxEWgrtCYmMHuYAGvQ1pmQ9lOw8TzZ5Vm0FlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:25:28.253530Z"},"content_sha256":"cf60de2a71b4497d398ca954c6386bfb5760feefb16f7b59e044dbde0f0f94d8","schema_version":"1.0","event_id":"sha256:cf60de2a71b4497d398ca954c6386bfb5760feefb16f7b59e044dbde0f0f94d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/bundle.json","state_url":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/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-07-06T20:25:28Z","links":{"resolver":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD","bundle":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/bundle.json","state":"https://pith.science/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SIIEZNG4G7ZQJOSQ5MAULM7ZQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SIIEZNG4G7ZQJOSQ5MAULM7ZQD","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":"bcfc9e95a40becc98ea5d6fe16adfaacbf973c363e698d1081a3f4c088ee0d23","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-29T14:44:02Z","title_canon_sha256":"fdfdedccb5ba22c8e7c066e9ea5a03ad29b75d8149fc1c68721f41b60dcc56ae"},"schema_version":"1.0","source":{"id":"1903.12552","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12552","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12552v7","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12552","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"SIIEZNG4G7ZQ","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"pith_short_16","alias_value":"SIIEZNG4G7ZQJOSQ","created_at":"2026-07-05T03:20:17Z"},{"alias_kind":"pith_short_8","alias_value":"SIIEZNG4","created_at":"2026-07-05T03:20:17Z"}],"graph_snapshots":[{"event_id":"sha256:cf60de2a71b4497d398ca954c6386bfb5760feefb16f7b59e044dbde0f0f94d8","target":"graph","created_at":"2026-07-05T03:20:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.12552/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-rank is a technical, yet natural condition required to prove a converse result for a capacity expression and satisfied by almost all currently known capacity-achieving schemes, while strong linearity is a practical requirement enabling implementation over small finite fields with low subpacketization degree. Then, the capacity of MDS-coded, linear, full support-rank PIR in the presence of colluding servers is derived,","authors_text":"Camilla Hollanti, Jie Li, Lukas Holzbaur, Ragnar Freij-Hollanti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-29T14:44:02Z","title":"Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12552","kind":"arxiv","version":7},"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:417117f329af315c42ad5745347f04df10a6fa18a7ee1e8af172e6285f05f628","target":"record","created_at":"2026-07-05T03:20:17Z","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":"bcfc9e95a40becc98ea5d6fe16adfaacbf973c363e698d1081a3f4c088ee0d23","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-29T14:44:02Z","title_canon_sha256":"fdfdedccb5ba22c8e7c066e9ea5a03ad29b75d8149fc1c68721f41b60dcc56ae"},"schema_version":"1.0","source":{"id":"1903.12552","kind":"arxiv","version":7}},"canonical_sha256":"92104cb4dc37f304ba50eb0145b3f980d87664d99064993cb67870298502867a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92104cb4dc37f304ba50eb0145b3f980d87664d99064993cb67870298502867a","first_computed_at":"2026-07-05T03:20:17.685565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:20:17.685565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f+jITzA+TITsP/sO0YJs6jVmtVcLNgj9Tla3eLP2yjvJSBUPkdz6S6bFNdp8bOPhE3MzSzIMbXLnfwCnqPfIBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:20:17.686069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12552","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:417117f329af315c42ad5745347f04df10a6fa18a7ee1e8af172e6285f05f628","sha256:cf60de2a71b4497d398ca954c6386bfb5760feefb16f7b59e044dbde0f0f94d8"],"state_sha256":"050d238dc7b805ea2735c367dad911d3b1d712ce596412d983be6d1103ddf023"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdok7sVL+50xsa0Q8j/4eG0TvWanMlG0zgR8T4HlWVp3QiH4eTMjmeeOaAY8jPitlvQa1loNbgj0VXLkpMq0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:25:28.255605Z","bundle_sha256":"49a67fffa6c8e987e552162ab57578b06892b22e7fbada7c4f0240e42e026a68"}}