{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RACHRVSRYEY4HIZRHBBKWPPDBT","short_pith_number":"pith:RACHRVSR","schema_version":"1.0","canonical_sha256":"880478d651c131c3a3313842ab3de30ced29322b2601bc52f9701ef4a51c710e","source":{"kind":"arxiv","id":"1310.4640","version":1},"attestation_state":"computed","paper":{"title":"Secret sharing on the $d$-dimensional cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CR","authors_text":"Laszlo Csirmaz","submitted_at":"2013-10-17T09:55:26Z","abstract_excerpt":"We prove that for $d>1$ the best information ratio of the perfect secret sharing scheme based on the edge set of the $d$-dimensional cube is exactly $d/2$. Using the technique developed, we also prove that the information ratio of the infinite $d$-dimensional lattice is $d$."},"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":"1310.4640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-10-17T09:55:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ddb66a34f728c5dd15106232b41a933aaef32f65becf441a11d0efb0921adf94","abstract_canon_sha256":"8ad52ae836d1b59c6300a5ea6a5949c3aa8cb2f9e35221bbc4911aa8324c0978"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:13.487817Z","signature_b64":"Qh2YL8em3l4L11eMmIyEo1usfMlUZGg6p0fS1REwa75jK7f7fpugImXt+B8+ICuLaGOj6pMCpcnQ3Ilm/VfEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"880478d651c131c3a3313842ab3de30ced29322b2601bc52f9701ef4a51c710e","last_reissued_at":"2026-05-18T03:10:13.487272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:13.487272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secret sharing on the $d$-dimensional cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CR","authors_text":"Laszlo Csirmaz","submitted_at":"2013-10-17T09:55:26Z","abstract_excerpt":"We prove that for $d>1$ the best information ratio of the perfect secret sharing scheme based on the edge set of the $d$-dimensional cube is exactly $d/2$. Using the technique developed, we also prove that the information ratio of the infinite $d$-dimensional lattice is $d$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4640","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":"1310.4640","created_at":"2026-05-18T03:10:13.487349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4640v1","created_at":"2026-05-18T03:10:13.487349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4640","created_at":"2026-05-18T03:10:13.487349+00:00"},{"alias_kind":"pith_short_12","alias_value":"RACHRVSRYEY4","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RACHRVSRYEY4HIZR","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RACHRVSR","created_at":"2026-05-18T12:27:57.521954+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/RACHRVSRYEY4HIZRHBBKWPPDBT","json":"https://pith.science/pith/RACHRVSRYEY4HIZRHBBKWPPDBT.json","graph_json":"https://pith.science/api/pith-number/RACHRVSRYEY4HIZRHBBKWPPDBT/graph.json","events_json":"https://pith.science/api/pith-number/RACHRVSRYEY4HIZRHBBKWPPDBT/events.json","paper":"https://pith.science/paper/RACHRVSR"},"agent_actions":{"view_html":"https://pith.science/pith/RACHRVSRYEY4HIZRHBBKWPPDBT","download_json":"https://pith.science/pith/RACHRVSRYEY4HIZRHBBKWPPDBT.json","view_paper":"https://pith.science/paper/RACHRVSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4640&json=true","fetch_graph":"https://pith.science/api/pith-number/RACHRVSRYEY4HIZRHBBKWPPDBT/graph.json","fetch_events":"https://pith.science/api/pith-number/RACHRVSRYEY4HIZRHBBKWPPDBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RACHRVSRYEY4HIZRHBBKWPPDBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RACHRVSRYEY4HIZRHBBKWPPDBT/action/storage_attestation","attest_author":"https://pith.science/pith/RACHRVSRYEY4HIZRHBBKWPPDBT/action/author_attestation","sign_citation":"https://pith.science/pith/RACHRVSRYEY4HIZRHBBKWPPDBT/action/citation_signature","submit_replication":"https://pith.science/pith/RACHRVSRYEY4HIZRHBBKWPPDBT/action/replication_record"}},"created_at":"2026-05-18T03:10:13.487349+00:00","updated_at":"2026-05-18T03:10:13.487349+00:00"}