{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RMRMYSHBBS5YQJYB367NBMQABZ","short_pith_number":"pith:RMRMYSHB","canonical_record":{"source":{"id":"1712.02850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-07T20:10:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5bdd9e370fc9197be98030d159883e2c6a66f6f8f2d0479d2e42f54970b23ad","abstract_canon_sha256":"f41590999161e44c441bdfdf590f7291172164ffaa142fe90fe3461412933fe7"},"schema_version":"1.0"},"canonical_sha256":"8b22cc48e10cbb882701dfbed0b2000e5b94ffc1def50df1d3ca795cb7f3e040","source":{"kind":"arxiv","id":"1712.02850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02850","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02850v1","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02850","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"RMRMYSHBBS5Y","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RMRMYSHBBS5YQJYB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RMRMYSHB","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RMRMYSHBBS5YQJYB367NBMQABZ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-07T20:10:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d5bdd9e370fc9197be98030d159883e2c6a66f6f8f2d0479d2e42f54970b23ad","abstract_canon_sha256":"f41590999161e44c441bdfdf590f7291172164ffaa142fe90fe3461412933fe7"},"schema_version":"1.0"},"canonical_sha256":"8b22cc48e10cbb882701dfbed0b2000e5b94ffc1def50df1d3ca795cb7f3e040","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:29.083530Z","signature_b64":"KJcKAbM98L9b39xcwKqvOoGDU6cNS2292JUy6V1oU4+esWLVwbFYOLVk2wOU2aVwfKoncLjUNxWJ8VqOwBcLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b22cc48e10cbb882701dfbed0b2000e5b94ffc1def50df1d3ca795cb7f3e040","last_reissued_at":"2026-05-18T00:28:29.082900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:29.082900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02850","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-18T00:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSsk7vaYg9HcygB5tCBwQlku4tXHcvKcXPFMoHsiQhbMdRX3gPlqq2DkzxJTLHp9hm54Ut5ARhnmbj4/84WKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T08:13:43.459541Z"},"content_sha256":"5b5a7dd51b644ad67a7193af4b7f83fec714ed91e14f9355993edd3b0f850b2b","schema_version":"1.0","event_id":"sha256:5b5a7dd51b644ad67a7193af4b7f83fec714ed91e14f9355993edd3b0f850b2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RMRMYSHBBS5YQJYB367NBMQABZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"t-Private Information Retrieval Schemes Using Transitive Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Horlemann-Trautmann, Camilla Hollanti, David Karpuk, Ivo Kubjas, Oliver W. Gnilke, Ragnar Freij-Hollanti","submitted_at":"2017-12-07T20:10:02Z","abstract_excerpt":"This paper presents private information retrieval (PIR) schemes for coded storage with colluding servers, which are not restricted to maximum distance separable (MDS) codes. PIR schemes for general linear codes are constructed and the resulting PIR rate is calculated explicitly. It is shown that codes with transitive automorphism groups yield the highest possible rates obtainable with the proposed scheme. This rate coincides with the known asymptotic PIR capacity for MDS-coded storage systems without collusion. While many PIR schemes in the literature require field sizes that grow with the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02850","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-18T00:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t5GHZvSuGebcGymBb2mzlWh3szjoldgz5K7PQLTXmFoY1BHiCX1zJwPBTpgA4hxVyuWlxc0hnIe9umAUSgrSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T08:13:43.459895Z"},"content_sha256":"24f27a6e89db7ab9c42e55628ca31c0319d515327a9fe1a5ae620f9a9827edfc","schema_version":"1.0","event_id":"sha256:24f27a6e89db7ab9c42e55628ca31c0319d515327a9fe1a5ae620f9a9827edfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMRMYSHBBS5YQJYB367NBMQABZ/bundle.json","state_url":"https://pith.science/pith/RMRMYSHBBS5YQJYB367NBMQABZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMRMYSHBBS5YQJYB367NBMQABZ/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-21T08:13:43Z","links":{"resolver":"https://pith.science/pith/RMRMYSHBBS5YQJYB367NBMQABZ","bundle":"https://pith.science/pith/RMRMYSHBBS5YQJYB367NBMQABZ/bundle.json","state":"https://pith.science/pith/RMRMYSHBBS5YQJYB367NBMQABZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMRMYSHBBS5YQJYB367NBMQABZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RMRMYSHBBS5YQJYB367NBMQABZ","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":"f41590999161e44c441bdfdf590f7291172164ffaa142fe90fe3461412933fe7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-07T20:10:02Z","title_canon_sha256":"d5bdd9e370fc9197be98030d159883e2c6a66f6f8f2d0479d2e42f54970b23ad"},"schema_version":"1.0","source":{"id":"1712.02850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02850","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02850v1","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02850","created_at":"2026-05-18T00:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"RMRMYSHBBS5Y","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RMRMYSHBBS5YQJYB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RMRMYSHB","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:24f27a6e89db7ab9c42e55628ca31c0319d515327a9fe1a5ae620f9a9827edfc","target":"graph","created_at":"2026-05-18T00:28:29Z","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":"This paper presents private information retrieval (PIR) schemes for coded storage with colluding servers, which are not restricted to maximum distance separable (MDS) codes. PIR schemes for general linear codes are constructed and the resulting PIR rate is calculated explicitly. It is shown that codes with transitive automorphism groups yield the highest possible rates obtainable with the proposed scheme. This rate coincides with the known asymptotic PIR capacity for MDS-coded storage systems without collusion. While many PIR schemes in the literature require field sizes that grow with the num","authors_text":"Anna-Lena Horlemann-Trautmann, Camilla Hollanti, David Karpuk, Ivo Kubjas, Oliver W. Gnilke, Ragnar Freij-Hollanti","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-07T20:10:02Z","title":"t-Private Information Retrieval Schemes Using Transitive Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02850","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:5b5a7dd51b644ad67a7193af4b7f83fec714ed91e14f9355993edd3b0f850b2b","target":"record","created_at":"2026-05-18T00:28:29Z","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":"f41590999161e44c441bdfdf590f7291172164ffaa142fe90fe3461412933fe7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-07T20:10:02Z","title_canon_sha256":"d5bdd9e370fc9197be98030d159883e2c6a66f6f8f2d0479d2e42f54970b23ad"},"schema_version":"1.0","source":{"id":"1712.02850","kind":"arxiv","version":1}},"canonical_sha256":"8b22cc48e10cbb882701dfbed0b2000e5b94ffc1def50df1d3ca795cb7f3e040","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b22cc48e10cbb882701dfbed0b2000e5b94ffc1def50df1d3ca795cb7f3e040","first_computed_at":"2026-05-18T00:28:29.082900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:29.082900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KJcKAbM98L9b39xcwKqvOoGDU6cNS2292JUy6V1oU4+esWLVwbFYOLVk2wOU2aVwfKoncLjUNxWJ8VqOwBcLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:29.083530Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b5a7dd51b644ad67a7193af4b7f83fec714ed91e14f9355993edd3b0f850b2b","sha256:24f27a6e89db7ab9c42e55628ca31c0319d515327a9fe1a5ae620f9a9827edfc"],"state_sha256":"9f95e174643b5f5bbf4f71b4a20463e1afe147962abd131b68932126fd6981d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddvOoGGe65aZS5JLpy3+ij9M5eRGC/Dy747eXL2ebBTPP06PNvUVf29TvcBrrSOBSysUDKxsD0GwU3h3UDzODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T08:13:43.462027Z","bundle_sha256":"ba9fc905c42411a1656da8e7ada562f06b7ee38cd859a4696e71fbbe4aa0733d"}}