{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EMXTMIYPQWNOIOSXW4WOIDKKAG","short_pith_number":"pith:EMXTMIYP","canonical_record":{"source":{"id":"1503.04244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T23:10:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1f4de45c2182fcab4d7cee2d6e0d3a72733e692837ee2780e5b389ba8ce7ce64","abstract_canon_sha256":"2f96102b537eac6a555f2e4ca56b6e40122fd609aca9384907db070cd40ddb2c"},"schema_version":"1.0"},"canonical_sha256":"232f36230f859ae43a57b72ce40d4a01ac06bbdd81ff37fdbe96e1f4e06085a8","source":{"kind":"arxiv","id":"1503.04244","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04244","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04244v2","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04244","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"EMXTMIYPQWNO","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EMXTMIYPQWNOIOSX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EMXTMIYP","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EMXTMIYPQWNOIOSXW4WOIDKKAG","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T23:10:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1f4de45c2182fcab4d7cee2d6e0d3a72733e692837ee2780e5b389ba8ce7ce64","abstract_canon_sha256":"2f96102b537eac6a555f2e4ca56b6e40122fd609aca9384907db070cd40ddb2c"},"schema_version":"1.0"},"canonical_sha256":"232f36230f859ae43a57b72ce40d4a01ac06bbdd81ff37fdbe96e1f4e06085a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:12.720572Z","signature_b64":"xWyIUsk73gTkkuT/z5DtznPZNkQ7kVIXDvi3AI9q6JDhPeIeixacE2BiIx1XapTyJ4W6RDh1HKjgMu50rgOXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"232f36230f859ae43a57b72ce40d4a01ac06bbdd81ff37fdbe96e1f4e06085a8","last_reissued_at":"2026-05-18T01:09:12.720146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:12.720146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04244","source_version":2,"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:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/g4lG5eWhoIoQgP7L/PhQiLrdY4XkMQQ+y+v4kRAJW/WsUE1bOU4QqpyRWY4OPWQKDBj+DV0sXEXfnPXKHTfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:48:46.907673Z"},"content_sha256":"cc674c08ac173241717b0a0a620b5253372e2fcaadc89f888b6f030274246f34","schema_version":"1.0","event_id":"sha256:cc674c08ac173241717b0a0a620b5253372e2fcaadc89f888b6f030274246f34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EMXTMIYPQWNOIOSXW4WOIDKKAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Security in Locally Repairable Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Agarwal, Arya Mazumdar","submitted_at":"2015-03-13T23:10:52Z","abstract_excerpt":"In this paper we extend the notion of {\\em locally repairable} codes to {\\em secret sharing} schemes. The main problem that we consider is to find optimal ways to distribute shares of a secret among a set of storage-nodes (participants) such that the content of each node (share) can be recovered by using contents of only few other nodes, and at the same time the secret can be reconstructed by only some allowable subsets of nodes. As a special case, an eavesdropper observing some set of specific nodes (such as less than certain number of nodes) does not get any information. In other words, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04244","kind":"arxiv","version":2},"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:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TeQJUr0szFMS6414CqcC9tWsUrkz38ruIbNx+f+a35ILs7Sp+zASe47jTr/JZ2ANlIr9AETI+hIqiX3qWieAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:48:46.908031Z"},"content_sha256":"ba676a765972b28259789cdbe9113711f1d966cb29e4b109fc6963f274781e93","schema_version":"1.0","event_id":"sha256:ba676a765972b28259789cdbe9113711f1d966cb29e4b109fc6963f274781e93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMXTMIYPQWNOIOSXW4WOIDKKAG/bundle.json","state_url":"https://pith.science/pith/EMXTMIYPQWNOIOSXW4WOIDKKAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMXTMIYPQWNOIOSXW4WOIDKKAG/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-03T15:48:46Z","links":{"resolver":"https://pith.science/pith/EMXTMIYPQWNOIOSXW4WOIDKKAG","bundle":"https://pith.science/pith/EMXTMIYPQWNOIOSXW4WOIDKKAG/bundle.json","state":"https://pith.science/pith/EMXTMIYPQWNOIOSXW4WOIDKKAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMXTMIYPQWNOIOSXW4WOIDKKAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EMXTMIYPQWNOIOSXW4WOIDKKAG","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":"2f96102b537eac6a555f2e4ca56b6e40122fd609aca9384907db070cd40ddb2c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T23:10:52Z","title_canon_sha256":"1f4de45c2182fcab4d7cee2d6e0d3a72733e692837ee2780e5b389ba8ce7ce64"},"schema_version":"1.0","source":{"id":"1503.04244","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04244","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04244v2","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04244","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"EMXTMIYPQWNO","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EMXTMIYPQWNOIOSX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EMXTMIYP","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:ba676a765972b28259789cdbe9113711f1d966cb29e4b109fc6963f274781e93","target":"graph","created_at":"2026-05-18T01:09:12Z","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":"In this paper we extend the notion of {\\em locally repairable} codes to {\\em secret sharing} schemes. The main problem that we consider is to find optimal ways to distribute shares of a secret among a set of storage-nodes (participants) such that the content of each node (share) can be recovered by using contents of only few other nodes, and at the same time the secret can be reconstructed by only some allowable subsets of nodes. As a special case, an eavesdropper observing some set of specific nodes (such as less than certain number of nodes) does not get any information. In other words, we p","authors_text":"Abhishek Agarwal, Arya Mazumdar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T23:10:52Z","title":"Security in Locally Repairable Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04244","kind":"arxiv","version":2},"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:cc674c08ac173241717b0a0a620b5253372e2fcaadc89f888b6f030274246f34","target":"record","created_at":"2026-05-18T01:09:12Z","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":"2f96102b537eac6a555f2e4ca56b6e40122fd609aca9384907db070cd40ddb2c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T23:10:52Z","title_canon_sha256":"1f4de45c2182fcab4d7cee2d6e0d3a72733e692837ee2780e5b389ba8ce7ce64"},"schema_version":"1.0","source":{"id":"1503.04244","kind":"arxiv","version":2}},"canonical_sha256":"232f36230f859ae43a57b72ce40d4a01ac06bbdd81ff37fdbe96e1f4e06085a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"232f36230f859ae43a57b72ce40d4a01ac06bbdd81ff37fdbe96e1f4e06085a8","first_computed_at":"2026-05-18T01:09:12.720146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:12.720146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xWyIUsk73gTkkuT/z5DtznPZNkQ7kVIXDvi3AI9q6JDhPeIeixacE2BiIx1XapTyJ4W6RDh1HKjgMu50rgOXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:12.720572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04244","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc674c08ac173241717b0a0a620b5253372e2fcaadc89f888b6f030274246f34","sha256:ba676a765972b28259789cdbe9113711f1d966cb29e4b109fc6963f274781e93"],"state_sha256":"577fd66e4fd307dbba8fae21d0b42ec3d8f91226adcf1690e09312fa1a23ca91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kep5arxFEbFKuUQj7ff7OMeR9vhn+reKEC219AVIr+zkTaVbZewlVQn3rpGzjelQybE9MfTs5Spj/KOlIg20DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:48:46.910424Z","bundle_sha256":"b2c0b8196469a9025662f5657a042028b7b41f7e7d5286cc1cd34ba27e216d3e"}}