{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VQ3F6R7CVT3R2C3GBNAYOYKXXW","short_pith_number":"pith:VQ3F6R7C","schema_version":"1.0","canonical_sha256":"ac365f47e2acf71d0b660b41876157bdbc218430b82b329465d8295b4394f2e7","source":{"kind":"arxiv","id":"1706.00500","version":1},"attestation_state":"computed","paper":{"title":"Generic Secure Repair for Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Jehoshua Bruck, Wentao Huang","submitted_at":"2017-06-01T21:31:36Z","abstract_excerpt":"This paper studies the problem of repairing secret sharing schemes, i.e., schemes that encode a message into $n$ shares, assigned to $n$ nodes, so that any $n-r$ nodes can decode the message but any colluding $z$ nodes cannot infer any information about the message. In the event of node failures so that shares held by the failed nodes are lost, the system needs to be repaired by reconstructing and reassigning the lost shares to the failed (or replacement) nodes. This can be achieved trivially by a trustworthy third-party that receives the shares of the available nodes, recompute and reassign t"},"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":"1706.00500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-01T21:31:36Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"55a2b115bae99da84af9ba9af7a89baf847de49a5326d725d8da1b401bfbda97","abstract_canon_sha256":"61c4cf0e889f332d8271ab13065db6ba0eaba04bdc3d737687ed23550103e38d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:12.832662Z","signature_b64":"CdLltfEi/IC803U5n5GlC4HiXxQeaY5KAzWSa56YjFSJiYkK4eh37IJnnrg524wufX5vcS60ip6vzCr36SHdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac365f47e2acf71d0b660b41876157bdbc218430b82b329465d8295b4394f2e7","last_reissued_at":"2026-05-18T00:43:12.831958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:12.831958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generic Secure Repair for Distributed Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Jehoshua Bruck, Wentao Huang","submitted_at":"2017-06-01T21:31:36Z","abstract_excerpt":"This paper studies the problem of repairing secret sharing schemes, i.e., schemes that encode a message into $n$ shares, assigned to $n$ nodes, so that any $n-r$ nodes can decode the message but any colluding $z$ nodes cannot infer any information about the message. In the event of node failures so that shares held by the failed nodes are lost, the system needs to be repaired by reconstructing and reassigning the lost shares to the failed (or replacement) nodes. This can be achieved trivially by a trustworthy third-party that receives the shares of the available nodes, recompute and reassign t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00500","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.00500","created_at":"2026-05-18T00:43:12.832078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00500v1","created_at":"2026-05-18T00:43:12.832078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00500","created_at":"2026-05-18T00:43:12.832078+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQ3F6R7CVT3R","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQ3F6R7CVT3R2C3G","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQ3F6R7C","created_at":"2026-05-18T12:31:49.984773+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/VQ3F6R7CVT3R2C3GBNAYOYKXXW","json":"https://pith.science/pith/VQ3F6R7CVT3R2C3GBNAYOYKXXW.json","graph_json":"https://pith.science/api/pith-number/VQ3F6R7CVT3R2C3GBNAYOYKXXW/graph.json","events_json":"https://pith.science/api/pith-number/VQ3F6R7CVT3R2C3GBNAYOYKXXW/events.json","paper":"https://pith.science/paper/VQ3F6R7C"},"agent_actions":{"view_html":"https://pith.science/pith/VQ3F6R7CVT3R2C3GBNAYOYKXXW","download_json":"https://pith.science/pith/VQ3F6R7CVT3R2C3GBNAYOYKXXW.json","view_paper":"https://pith.science/paper/VQ3F6R7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00500&json=true","fetch_graph":"https://pith.science/api/pith-number/VQ3F6R7CVT3R2C3GBNAYOYKXXW/graph.json","fetch_events":"https://pith.science/api/pith-number/VQ3F6R7CVT3R2C3GBNAYOYKXXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQ3F6R7CVT3R2C3GBNAYOYKXXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQ3F6R7CVT3R2C3GBNAYOYKXXW/action/storage_attestation","attest_author":"https://pith.science/pith/VQ3F6R7CVT3R2C3GBNAYOYKXXW/action/author_attestation","sign_citation":"https://pith.science/pith/VQ3F6R7CVT3R2C3GBNAYOYKXXW/action/citation_signature","submit_replication":"https://pith.science/pith/VQ3F6R7CVT3R2C3GBNAYOYKXXW/action/replication_record"}},"created_at":"2026-05-18T00:43:12.832078+00:00","updated_at":"2026-05-18T00:43:12.832078+00:00"}