{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZTKLOX7RF4ICYLHKO7U24RZ6VF","short_pith_number":"pith:ZTKLOX7R","schema_version":"1.0","canonical_sha256":"ccd4b75ff12f102c2cea77e9ae473ea965da0f58a84da639c00bb7f11c6d8bc7","source":{"kind":"arxiv","id":"1811.01766","version":1},"attestation_state":"computed","paper":{"title":"A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.CO","authors_text":"Bailey Kacsmar, Douglas R. Stinson","submitted_at":"2018-11-05T14:59:01Z","abstract_excerpt":"A repairable threshold scheme (which we abbreviate to RTS) is a $(\\tau,n)$-threshold scheme in which a subset of players can \"repair\" another player's share in the event that their share has been lost or corrupted. This will take place without the participation of the dealer who set up the scheme. The repairing protocol should not compromise the (unconditional) security of the threshold scheme. Combinatorial repairable threshold schemes (or combinatorial RTS) were recently introduced by Stinson and Wei. In these schemes, \"multiple shares\" are distributed to each player, as defined by a suitabl"},"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":"1811.01766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-05T14:59:01Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"f7f65345d353c7234fceef39c8304273ebf72261de342440ca52d13e53eb8b94","abstract_canon_sha256":"31cfbd750273aef9e328ff314059ae7bbf333041e5fdfeb2e927e5df11915e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:33.321324Z","signature_b64":"AbAfZCOeV9CsUM8/eC1bczzWmIWnrgLVZbXUCN8xWyeMOCTf6XH3EOoAcuKpLWxlUgrSdN3XU7vY2CXRez1CBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccd4b75ff12f102c2cea77e9ae473ea965da0f58a84da639c00bb7f11c6d8bc7","last_reissued_at":"2026-05-18T00:01:33.320766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:33.320766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.CO","authors_text":"Bailey Kacsmar, Douglas R. Stinson","submitted_at":"2018-11-05T14:59:01Z","abstract_excerpt":"A repairable threshold scheme (which we abbreviate to RTS) is a $(\\tau,n)$-threshold scheme in which a subset of players can \"repair\" another player's share in the event that their share has been lost or corrupted. This will take place without the participation of the dealer who set up the scheme. The repairing protocol should not compromise the (unconditional) security of the threshold scheme. Combinatorial repairable threshold schemes (or combinatorial RTS) were recently introduced by Stinson and Wei. In these schemes, \"multiple shares\" are distributed to each player, as defined by a suitabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01766","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":"1811.01766","created_at":"2026-05-18T00:01:33.320842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01766v1","created_at":"2026-05-18T00:01:33.320842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01766","created_at":"2026-05-18T00:01:33.320842+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTKLOX7RF4IC","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTKLOX7RF4ICYLHK","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTKLOX7R","created_at":"2026-05-18T12:33:07.085635+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/ZTKLOX7RF4ICYLHKO7U24RZ6VF","json":"https://pith.science/pith/ZTKLOX7RF4ICYLHKO7U24RZ6VF.json","graph_json":"https://pith.science/api/pith-number/ZTKLOX7RF4ICYLHKO7U24RZ6VF/graph.json","events_json":"https://pith.science/api/pith-number/ZTKLOX7RF4ICYLHKO7U24RZ6VF/events.json","paper":"https://pith.science/paper/ZTKLOX7R"},"agent_actions":{"view_html":"https://pith.science/pith/ZTKLOX7RF4ICYLHKO7U24RZ6VF","download_json":"https://pith.science/pith/ZTKLOX7RF4ICYLHKO7U24RZ6VF.json","view_paper":"https://pith.science/paper/ZTKLOX7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01766&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTKLOX7RF4ICYLHKO7U24RZ6VF/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTKLOX7RF4ICYLHKO7U24RZ6VF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTKLOX7RF4ICYLHKO7U24RZ6VF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTKLOX7RF4ICYLHKO7U24RZ6VF/action/storage_attestation","attest_author":"https://pith.science/pith/ZTKLOX7RF4ICYLHKO7U24RZ6VF/action/author_attestation","sign_citation":"https://pith.science/pith/ZTKLOX7RF4ICYLHKO7U24RZ6VF/action/citation_signature","submit_replication":"https://pith.science/pith/ZTKLOX7RF4ICYLHKO7U24RZ6VF/action/replication_record"}},"created_at":"2026-05-18T00:01:33.320842+00:00","updated_at":"2026-05-18T00:01:33.320842+00:00"}