{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3BNN3PEKLIZSSGDHHMBFUVPGDN","short_pith_number":"pith:3BNN3PEK","canonical_record":{"source":{"id":"1505.07515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T00:12:03Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"242cc2156c99f753f1beae93727fa8ce83c6a02c5dfd61f05376406cf3bd65b4","abstract_canon_sha256":"79c1db0913d0a8f4209038e6a657f705c53b691afbe97b288d80d6fc9e745964"},"schema_version":"1.0"},"canonical_sha256":"d85addbc8a5a332918673b025a55e61b722b308fd26e8b46768ac15f45a8b740","source":{"kind":"arxiv","id":"1505.07515","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3BNN3PEKLIZSSGDHHMBFUVPGDN","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T00:12:03Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"242cc2156c99f753f1beae93727fa8ce83c6a02c5dfd61f05376406cf3bd65b4","abstract_canon_sha256":"79c1db0913d0a8f4209038e6a657f705c53b691afbe97b288d80d6fc9e745964"},"schema_version":"1.0"},"canonical_sha256":"d85addbc8a5a332918673b025a55e61b722b308fd26e8b46768ac15f45a8b740","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:55.523640Z","signature_b64":"8GZ+puv0NDlzkE4/xXnu+j0T6gkGNrDSgpt3uyujWmk4ESjdl6mrFtHIjoKJK30hlvFapeSo2/vWYYy55bNgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d85addbc8a5a332918673b025a55e61b722b308fd26e8b46768ac15f45a8b740","last_reissued_at":"2026-05-18T01:17:55.522940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:55.522940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07515","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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qtfjIJtIjW6o2I4xY1hhRU8W8hMK60B8luCYHZKge+4jM0bxeZq+CLV6YQKLr58w3tK+ybTBbfnmJ1t4l18jCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:34:34.130538Z"},"content_sha256":"15a42eb0e372106c5c01fbdbd41519c37ed3f41528992dffb4edfa52e887649b","schema_version":"1.0","event_id":"sha256:15a42eb0e372106c5c01fbdbd41519c37ed3f41528992dffb4edfa52e887649b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3BNN3PEKLIZSSGDHHMBFUVPGDN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Efficient Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Jehoshua Bruck, Joerg Kliewer, Michael Langberg, Wentao Huang","submitted_at":"2015-05-28T00:12:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07515","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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IlnURMsNVP5TmRA7YrSPZ1aFPjXncXfujAqiH6LFio6fe+5GsohoNlAL3Qa3C7mP07Uah4MiFbSQZSF9KlHcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:34:34.130924Z"},"content_sha256":"e68613e9d15b830291cd22de3ea83b6469417c46079b9a6333cfb8bce3c4d97f","schema_version":"1.0","event_id":"sha256:e68613e9d15b830291cd22de3ea83b6469417c46079b9a6333cfb8bce3c4d97f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/bundle.json","state_url":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/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-22T10:34:34Z","links":{"resolver":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN","bundle":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/bundle.json","state":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IgwyUIwvwykYzbNtVKojybL9unBrKMCBG+9bHlzWRFuSfGZXqD1lGW/GA8IaP58+eOuSSBs23LevjKneexFrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:34:34.133123Z","bundle_sha256":"7a3b85caf9e6579e2108e301910eb28d15b707c45a8eabd6a7490bc91be039d0"}}