{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3IS2Z2N6F6W4UANZLBIW2ZNBS4","short_pith_number":"pith:3IS2Z2N6","canonical_record":{"source":{"id":"1403.5698","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-03-22T19:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"057d15aeb109025dd43c6250e774a644f61b4d1d19ea8136994c710adddc3984","abstract_canon_sha256":"ad357f27627367b00e823f62e5b343a98e3c29eac40c80bbdb59445faa9e004d"},"schema_version":"1.0"},"canonical_sha256":"da25ace9be2fadca01b958516d65a197306b29076edfc1ba826f3099a34d9e0f","source":{"kind":"arxiv","id":"1403.5698","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5698","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5698v3","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5698","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"3IS2Z2N6F6W4","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3IS2Z2N6F6W4UANZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3IS2Z2N6","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3IS2Z2N6F6W4UANZLBIW2ZNBS4","target":"record","payload":{"canonical_record":{"source":{"id":"1403.5698","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-03-22T19:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"057d15aeb109025dd43c6250e774a644f61b4d1d19ea8136994c710adddc3984","abstract_canon_sha256":"ad357f27627367b00e823f62e5b343a98e3c29eac40c80bbdb59445faa9e004d"},"schema_version":"1.0"},"canonical_sha256":"da25ace9be2fadca01b958516d65a197306b29076edfc1ba826f3099a34d9e0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:58.732429Z","signature_b64":"4RxqGSoH59cMTdlEuiPUohMi9ACqVe2b0mlFeWCwUIAhirA7Q4w1eDil29oJ4wu2zg8AyImzO37Oop6lo9Y4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da25ace9be2fadca01b958516d65a197306b29076edfc1ba826f3099a34d9e0f","last_reissued_at":"2026-05-18T01:59:58.731884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:58.731884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.5698","source_version":3,"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:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOw1RLeQWscMUmWZcBmh3frGJ1P/vwM0s3ysLd6xCyAs3wnZbdaKNu/qWImZGNBvMpFGF/VXG7t8xU6OIy/cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:14:31.639709Z"},"content_sha256":"1ee6db062137f0f46c99c8323d3e22a8f979a5501666d5bd73f99b9bfcdcdd4b","schema_version":"1.0","event_id":"sha256:1ee6db062137f0f46c99c8323d3e22a8f979a5501666d5bd73f99b9bfcdcdd4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3IS2Z2N6F6W4UANZLBIW2ZNBS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secret-Sharing for NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Eylon Yogev, Ilan Komargodski, Moni Naor","submitted_at":"2014-03-22T19:11:09Z","abstract_excerpt":"A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a \"qualified\" subset of parties can efficiently reconstruct the secret while any \"unqualified\" subset of parties cannot efficiently learn anything about the secret. The collection of \"qualified\" subsets is defined by a Boolean function.\n  It has been a major open problem to understand which (monotone) functions can be realized by a computational secret-sharing schemes. Yao suggested a method for secret-sharing for any function that has a polynom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5698","kind":"arxiv","version":3},"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:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNXdVKj+7j4PrbFg4zYIaOVxE4ZxThwLx7/xgBQz6j816HbSO9CFcucSPQ9bUBdRSyQ+Ip4UtxIuMc7eKhR3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:14:31.640403Z"},"content_sha256":"64e06b244cabc39740d703553a55f4e43838396996be495694de4ecb4740892c","schema_version":"1.0","event_id":"sha256:64e06b244cabc39740d703553a55f4e43838396996be495694de4ecb4740892c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/bundle.json","state_url":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/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-05-30T00:14:31Z","links":{"resolver":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4","bundle":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/bundle.json","state":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3IS2Z2N6F6W4UANZLBIW2ZNBS4","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":"ad357f27627367b00e823f62e5b343a98e3c29eac40c80bbdb59445faa9e004d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-03-22T19:11:09Z","title_canon_sha256":"057d15aeb109025dd43c6250e774a644f61b4d1d19ea8136994c710adddc3984"},"schema_version":"1.0","source":{"id":"1403.5698","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5698","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5698v3","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5698","created_at":"2026-05-18T01:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"3IS2Z2N6F6W4","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3IS2Z2N6F6W4UANZ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3IS2Z2N6","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:64e06b244cabc39740d703553a55f4e43838396996be495694de4ecb4740892c","target":"graph","created_at":"2026-05-18T01:59:58Z","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 computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a \"qualified\" subset of parties can efficiently reconstruct the secret while any \"unqualified\" subset of parties cannot efficiently learn anything about the secret. The collection of \"qualified\" subsets is defined by a Boolean function.\n  It has been a major open problem to understand which (monotone) functions can be realized by a computational secret-sharing schemes. Yao suggested a method for secret-sharing for any function that has a polynom","authors_text":"Eylon Yogev, Ilan Komargodski, Moni Naor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-03-22T19:11:09Z","title":"Secret-Sharing for NP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5698","kind":"arxiv","version":3},"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:1ee6db062137f0f46c99c8323d3e22a8f979a5501666d5bd73f99b9bfcdcdd4b","target":"record","created_at":"2026-05-18T01:59:58Z","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":"ad357f27627367b00e823f62e5b343a98e3c29eac40c80bbdb59445faa9e004d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-03-22T19:11:09Z","title_canon_sha256":"057d15aeb109025dd43c6250e774a644f61b4d1d19ea8136994c710adddc3984"},"schema_version":"1.0","source":{"id":"1403.5698","kind":"arxiv","version":3}},"canonical_sha256":"da25ace9be2fadca01b958516d65a197306b29076edfc1ba826f3099a34d9e0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da25ace9be2fadca01b958516d65a197306b29076edfc1ba826f3099a34d9e0f","first_computed_at":"2026-05-18T01:59:58.731884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:58.731884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4RxqGSoH59cMTdlEuiPUohMi9ACqVe2b0mlFeWCwUIAhirA7Q4w1eDil29oJ4wu2zg8AyImzO37Oop6lo9Y4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:58.732429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5698","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ee6db062137f0f46c99c8323d3e22a8f979a5501666d5bd73f99b9bfcdcdd4b","sha256:64e06b244cabc39740d703553a55f4e43838396996be495694de4ecb4740892c"],"state_sha256":"ee4d7df3ac07c2833b1ece2870bf349e373d0f5bdf460fdf9b4dcdac48c2e9d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+W/a2n2n+ooVfZVhgwBiuilF5G081eIfEIKaKZNQSyC9Z8qBvu4oSDXBtOov6A++G+Yjcy61e5dYdk1nNNscCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:14:31.643914Z","bundle_sha256":"07eb43fdbf98a13c64ff13ed22ab61a938d848fb0e5080bcd1df31f7dc7da3af"}}