{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4F2ZMI4EE2EF36LJ3YXMAJFEBI","short_pith_number":"pith:4F2ZMI4E","schema_version":"1.0","canonical_sha256":"e17596238426885df969de2ec024a40a2e84b0446de0fefc489d7520f5f12e21","source":{"kind":"arxiv","id":"1705.03042","version":1},"attestation_state":"computed","paper":{"title":"Polar codes for secret sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Mohsen Moradi","submitted_at":"2017-05-08T18:35:20Z","abstract_excerpt":"A secret can be an encrypted message or a private key to decrypt the ciphertext. One of the main issues in cryptography is keeping this secret safe. Entrusting secret to one person or saving it in a computer can conclude betrayal of the person or destruction of that device. For solving this issue, secret sharing can be used between some individuals which a coalition of a specific number of them can only get access to the secret. In practical issues, some of the members have more power and by a coalition of fewer of them, they should know about the secret. In a bank, for example, president and "},"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":"1705.03042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-05-08T18:35:20Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6281d03dff48d4fea2a29afceefb819ec75c950eb2a4c431f2d8fe25d3c41692","abstract_canon_sha256":"30976fb44914e442e436dde62a3ef736b25d739b0d97bca830a93f553cdbb823"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:50.860944Z","signature_b64":"wuvDfayinm5pboBL5nBq832LsaPGOY+e+p9CM/D9C9SkMq6naOuiK4P82CW4CfWvE1yrguDzltSv0Tqh5JJzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e17596238426885df969de2ec024a40a2e84b0446de0fefc489d7520f5f12e21","last_reissued_at":"2026-05-18T00:44:50.860281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:50.860281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar codes for secret sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Mohsen Moradi","submitted_at":"2017-05-08T18:35:20Z","abstract_excerpt":"A secret can be an encrypted message or a private key to decrypt the ciphertext. One of the main issues in cryptography is keeping this secret safe. Entrusting secret to one person or saving it in a computer can conclude betrayal of the person or destruction of that device. For solving this issue, secret sharing can be used between some individuals which a coalition of a specific number of them can only get access to the secret. In practical issues, some of the members have more power and by a coalition of fewer of them, they should know about the secret. In a bank, for example, president and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03042","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":"1705.03042","created_at":"2026-05-18T00:44:50.860407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03042v1","created_at":"2026-05-18T00:44:50.860407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03042","created_at":"2026-05-18T00:44:50.860407+00:00"},{"alias_kind":"pith_short_12","alias_value":"4F2ZMI4EE2EF","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4F2ZMI4EE2EF36LJ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4F2ZMI4E","created_at":"2026-05-18T12:30:58.224056+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/4F2ZMI4EE2EF36LJ3YXMAJFEBI","json":"https://pith.science/pith/4F2ZMI4EE2EF36LJ3YXMAJFEBI.json","graph_json":"https://pith.science/api/pith-number/4F2ZMI4EE2EF36LJ3YXMAJFEBI/graph.json","events_json":"https://pith.science/api/pith-number/4F2ZMI4EE2EF36LJ3YXMAJFEBI/events.json","paper":"https://pith.science/paper/4F2ZMI4E"},"agent_actions":{"view_html":"https://pith.science/pith/4F2ZMI4EE2EF36LJ3YXMAJFEBI","download_json":"https://pith.science/pith/4F2ZMI4EE2EF36LJ3YXMAJFEBI.json","view_paper":"https://pith.science/paper/4F2ZMI4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03042&json=true","fetch_graph":"https://pith.science/api/pith-number/4F2ZMI4EE2EF36LJ3YXMAJFEBI/graph.json","fetch_events":"https://pith.science/api/pith-number/4F2ZMI4EE2EF36LJ3YXMAJFEBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4F2ZMI4EE2EF36LJ3YXMAJFEBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4F2ZMI4EE2EF36LJ3YXMAJFEBI/action/storage_attestation","attest_author":"https://pith.science/pith/4F2ZMI4EE2EF36LJ3YXMAJFEBI/action/author_attestation","sign_citation":"https://pith.science/pith/4F2ZMI4EE2EF36LJ3YXMAJFEBI/action/citation_signature","submit_replication":"https://pith.science/pith/4F2ZMI4EE2EF36LJ3YXMAJFEBI/action/replication_record"}},"created_at":"2026-05-18T00:44:50.860407+00:00","updated_at":"2026-05-18T00:44:50.860407+00:00"}