{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AIIANBRPSK5GZE4I25XXEJE2XM","short_pith_number":"pith:AIIANBRP","schema_version":"1.0","canonical_sha256":"021006862f92ba6c9388d76f72249abb01360b31ece42ec0fdb14f95f55abcb6","source":{"kind":"arxiv","id":"1906.11598","version":1},"attestation_state":"computed","paper":{"title":"Smallest graphs achieving the Stinson bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CR","authors_text":"Mate Gyarmati, Peter Ligeti","submitted_at":"2019-06-27T13:01:57Z","abstract_excerpt":"Perfect secret sharing scheme is a method of distribute a secret information $s$ among participants such that only predefined coalitions, called qualified subsets of the participants can recover the secret, whereas any other coalitions, the unqualified subsets cannot determine anything about the secret. The most important property is the efficiency of the system, which is measured by the information ratio. It can be shown that for graphs the information ratio is at most $(\\delta+1)/2$ where $\\delta$ is the maximal degree of the graph. Blundo et al. constructed a family of $\\delta$-regular grap"},"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":"1906.11598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-06-27T13:01:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"430560e364ae8db765fe0a7f0f54aa9c4c7158d7f90983cb7564dab9d5fe9fa7","abstract_canon_sha256":"bca8f75a76542db1b15518e98c554c9ebe0eecf8dc000b89b5c22dbdcf780c9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:04.362216Z","signature_b64":"WlsKiq4RRdTFrYyMPX1NezKtXvrXo7+flLbq5Rc/y2K3jTR08/6yybWdVU5bIvf5EPg3bRz9n23OHIDiVpl5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"021006862f92ba6c9388d76f72249abb01360b31ece42ec0fdb14f95f55abcb6","last_reissued_at":"2026-05-17T23:42:04.361764Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:04.361764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smallest graphs achieving the Stinson bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CR","authors_text":"Mate Gyarmati, Peter Ligeti","submitted_at":"2019-06-27T13:01:57Z","abstract_excerpt":"Perfect secret sharing scheme is a method of distribute a secret information $s$ among participants such that only predefined coalitions, called qualified subsets of the participants can recover the secret, whereas any other coalitions, the unqualified subsets cannot determine anything about the secret. The most important property is the efficiency of the system, which is measured by the information ratio. It can be shown that for graphs the information ratio is at most $(\\delta+1)/2$ where $\\delta$ is the maximal degree of the graph. Blundo et al. constructed a family of $\\delta$-regular grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11598","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":"1906.11598","created_at":"2026-05-17T23:42:04.361834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11598v1","created_at":"2026-05-17T23:42:04.361834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11598","created_at":"2026-05-17T23:42:04.361834+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIIANBRPSK5G","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIIANBRPSK5GZE4I","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIIANBRP","created_at":"2026-05-18T12:33:12.712433+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/AIIANBRPSK5GZE4I25XXEJE2XM","json":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM.json","graph_json":"https://pith.science/api/pith-number/AIIANBRPSK5GZE4I25XXEJE2XM/graph.json","events_json":"https://pith.science/api/pith-number/AIIANBRPSK5GZE4I25XXEJE2XM/events.json","paper":"https://pith.science/paper/AIIANBRP"},"agent_actions":{"view_html":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM","download_json":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM.json","view_paper":"https://pith.science/paper/AIIANBRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11598&json=true","fetch_graph":"https://pith.science/api/pith-number/AIIANBRPSK5GZE4I25XXEJE2XM/graph.json","fetch_events":"https://pith.science/api/pith-number/AIIANBRPSK5GZE4I25XXEJE2XM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM/action/storage_attestation","attest_author":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM/action/author_attestation","sign_citation":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM/action/citation_signature","submit_replication":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM/action/replication_record"}},"created_at":"2026-05-17T23:42:04.361834+00:00","updated_at":"2026-05-17T23:42:04.361834+00:00"}