{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3BNN3PEKLIZSSGDHHMBFUVPGDN","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":"79c1db0913d0a8f4209038e6a657f705c53b691afbe97b288d80d6fc9e745964","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T00:12:03Z","title_canon_sha256":"242cc2156c99f753f1beae93727fa8ce83c6a02c5dfd61f05376406cf3bd65b4"},"schema_version":"1.0","source":{"id":"1505.07515","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07515","created_at":"2026-05-18T01:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07515v2","created_at":"2026-05-18T01:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07515","created_at":"2026-05-18T01:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"3BNN3PEKLIZS","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3BNN3PEKLIZSSGDH","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3BNN3PEK","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:e68613e9d15b830291cd22de3ea83b6469417c46079b9a6333cfb8bce3c4d97f","target":"graph","created_at":"2026-05-18T01:17:55Z","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":"A secret sharing scheme is a method to store information securely and reliably. Particularly, in a threshold secret sharing scheme, a secret is encoded into $n$ shares, such that any set of at least $t_1$ shares suffice to decode the secret, and any set of at most $t_2 < t_1$ shares reveal no information about the secret. Assuming that each party holds a share and a user wishes to decode the secret by receiving information from a set of parties; the question we study is how to minimize the amount of communication between the user and the parties. We show that the necessary amount of communicat","authors_text":"Jehoshua Bruck, Joerg Kliewer, Michael Langberg, Wentao Huang","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T00:12:03Z","title":"Communication Efficient Secret Sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07515","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:15a42eb0e372106c5c01fbdbd41519c37ed3f41528992dffb4edfa52e887649b","target":"record","created_at":"2026-05-18T01:17:55Z","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":"79c1db0913d0a8f4209038e6a657f705c53b691afbe97b288d80d6fc9e745964","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T00:12:03Z","title_canon_sha256":"242cc2156c99f753f1beae93727fa8ce83c6a02c5dfd61f05376406cf3bd65b4"},"schema_version":"1.0","source":{"id":"1505.07515","kind":"arxiv","version":2}},"canonical_sha256":"d85addbc8a5a332918673b025a55e61b722b308fd26e8b46768ac15f45a8b740","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d85addbc8a5a332918673b025a55e61b722b308fd26e8b46768ac15f45a8b740","first_computed_at":"2026-05-18T01:17:55.522940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:55.522940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8GZ+puv0NDlzkE4/xXnu+j0T6gkGNrDSgpt3uyujWmk4ESjdl6mrFtHIjoKJK30hlvFapeSo2/vWYYy55bNgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:55.523640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07515","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15a42eb0e372106c5c01fbdbd41519c37ed3f41528992dffb4edfa52e887649b","sha256:e68613e9d15b830291cd22de3ea83b6469417c46079b9a6333cfb8bce3c4d97f"],"state_sha256":"729a0ff53d6b31649ebb8888d88ed8c7f974f4783167d673f5acf19e06fb04ec"}