{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AIIANBRPSK5GZE4I25XXEJE2XM","short_pith_number":"pith:AIIANBRP","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"},"canonical_sha256":"021006862f92ba6c9388d76f72249abb01360b31ece42ec0fdb14f95f55abcb6","source":{"kind":"arxiv","id":"1906.11598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11598","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11598v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11598","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"AIIANBRPSK5G","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AIIANBRPSK5GZE4I","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AIIANBRP","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AIIANBRPSK5GZE4I25XXEJE2XM","target":"record","payload":{"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"},"canonical_sha256":"021006862f92ba6c9388d76f72249abb01360b31ece42ec0fdb14f95f55abcb6","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"},"source_kind":"arxiv","source_id":"1906.11598","source_version":1,"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-17T23:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yXX0VnXIOhuDEGFeQXaTfd0B74gShvugoelTVlKSNJJL0a8IvBsIEzzBZF7btrLicWT8+j745mmBhfRl+PqZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:15:59.355219Z"},"content_sha256":"6d7486dcd49cf380cb1d25c319e375120eb885901e4786f573fc0ab5328cdf68","schema_version":"1.0","event_id":"sha256:6d7486dcd49cf380cb1d25c319e375120eb885901e4786f573fc0ab5328cdf68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AIIANBRPSK5GZE4I25XXEJE2XM","target":"graph","payload":{"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"},"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-17T23:42:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xu86CmO3pi85auTEG9MLHN5hWLxiE4gAYGm614YnK9PNvrdVxbo2wNHy9MfAvrPUWYfbETv7GLT5tZSLwwqGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:15:59.355575Z"},"content_sha256":"c71755996a7ac42c8034fc632e1c2527d2ff994889cf698b2df749e72c7c489c","schema_version":"1.0","event_id":"sha256:c71755996a7ac42c8034fc632e1c2527d2ff994889cf698b2df749e72c7c489c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM/bundle.json","state_url":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIIANBRPSK5GZE4I25XXEJE2XM/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-28T11:15:59Z","links":{"resolver":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM","bundle":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM/bundle.json","state":"https://pith.science/pith/AIIANBRPSK5GZE4I25XXEJE2XM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIIANBRPSK5GZE4I25XXEJE2XM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AIIANBRPSK5GZE4I25XXEJE2XM","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":"bca8f75a76542db1b15518e98c554c9ebe0eecf8dc000b89b5c22dbdcf780c9a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-06-27T13:01:57Z","title_canon_sha256":"430560e364ae8db765fe0a7f0f54aa9c4c7158d7f90983cb7564dab9d5fe9fa7"},"schema_version":"1.0","source":{"id":"1906.11598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11598","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11598v1","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11598","created_at":"2026-05-17T23:42:04Z"},{"alias_kind":"pith_short_12","alias_value":"AIIANBRPSK5G","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AIIANBRPSK5GZE4I","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AIIANBRP","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:c71755996a7ac42c8034fc632e1c2527d2ff994889cf698b2df749e72c7c489c","target":"graph","created_at":"2026-05-17T23:42:04Z","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":"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","authors_text":"Mate Gyarmati, Peter Ligeti","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-06-27T13:01:57Z","title":"Smallest graphs achieving the Stinson bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11598","kind":"arxiv","version":1},"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:6d7486dcd49cf380cb1d25c319e375120eb885901e4786f573fc0ab5328cdf68","target":"record","created_at":"2026-05-17T23:42:04Z","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":"bca8f75a76542db1b15518e98c554c9ebe0eecf8dc000b89b5c22dbdcf780c9a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-06-27T13:01:57Z","title_canon_sha256":"430560e364ae8db765fe0a7f0f54aa9c4c7158d7f90983cb7564dab9d5fe9fa7"},"schema_version":"1.0","source":{"id":"1906.11598","kind":"arxiv","version":1}},"canonical_sha256":"021006862f92ba6c9388d76f72249abb01360b31ece42ec0fdb14f95f55abcb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"021006862f92ba6c9388d76f72249abb01360b31ece42ec0fdb14f95f55abcb6","first_computed_at":"2026-05-17T23:42:04.361764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:04.361764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WlsKiq4RRdTFrYyMPX1NezKtXvrXo7+flLbq5Rc/y2K3jTR08/6yybWdVU5bIvf5EPg3bRz9n23OHIDiVpl5Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:04.362216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d7486dcd49cf380cb1d25c319e375120eb885901e4786f573fc0ab5328cdf68","sha256:c71755996a7ac42c8034fc632e1c2527d2ff994889cf698b2df749e72c7c489c"],"state_sha256":"44c6efbb67558126bed124d291fefe51b9021bf7e0de2f0275224656c4cd0e97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZpM7ll50MtwMlxFw9H/E9XyCthV7oL3CN0wnQGbxJUXOHEmM8cNsAg1+1AvDzqwZJ0VOVADn8CD+KriDHieJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:15:59.358107Z","bundle_sha256":"272981f81b23d78b4e125d5d2ab9b242e109fac2180b96ccd57e3d4b6940036d"}}