{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HBK3KFLFNZTCPBATD2E42AJ4OU","short_pith_number":"pith:HBK3KFLF","canonical_record":{"source":{"id":"1908.05021","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-08-14T08:56:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b882d8c322143937dfc7552b8c98487c92cce25f71eebb4713507a9b0180ddc5","abstract_canon_sha256":"1c9d741aef2c1151aa334d008fe9fc99caf7973eee87532fb8b97f2795e32375"},"schema_version":"1.0"},"canonical_sha256":"3855b515656e662784131e89cd013c752cff104b025c03afc64298f6c1116acb","source":{"kind":"arxiv","id":"1908.05021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05021","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05021v1","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05021","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"HBK3KFLFNZTC","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"HBK3KFLFNZTCPBAT","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"HBK3KFLF","created_at":"2026-07-04T23:55:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HBK3KFLFNZTCPBATD2E42AJ4OU","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05021","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-08-14T08:56:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b882d8c322143937dfc7552b8c98487c92cce25f71eebb4713507a9b0180ddc5","abstract_canon_sha256":"1c9d741aef2c1151aa334d008fe9fc99caf7973eee87532fb8b97f2795e32375"},"schema_version":"1.0"},"canonical_sha256":"3855b515656e662784131e89cd013c752cff104b025c03afc64298f6c1116acb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:59.239988Z","signature_b64":"IzAAQJp0/YdkxF5NgbUEBowmGsBa78/plBgZhg3KEFV0ypFMqdCEHJ5j/l8t0ROpOFgoSSuWfETrcsmA5ltEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3855b515656e662784131e89cd013c752cff104b025c03afc64298f6c1116acb","last_reissued_at":"2026-07-04T23:55:59.239546Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:59.239546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05021","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-07-04T23:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQP+CjvPkY4PRoLf2w8Xg4jOt8cR0cH5P57Z1k1QCLWYfa9J2bkGa4dXqrSx5pNA5puXwHEyMvX5YGJkwpUeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:05:39.108462Z"},"content_sha256":"9048caa07877f3973867375991df1e322e95eec9fe5bddf562d7b5ede02d1776","schema_version":"1.0","event_id":"sha256:9048caa07877f3973867375991df1e322e95eec9fe5bddf562d7b5ede02d1776"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HBK3KFLFNZTCPBATD2E42AJ4OU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of universal access structures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Laszlo Csirmaz","submitted_at":"2019-08-14T08:56:59Z","abstract_excerpt":"An important parameter in a secret sharing scheme is the number of minimal qualified sets. Given this number, the universal access structure is the richest possible structure, namely the one in which there are one or more participants in every possible Boolean combination of the minimal qualified sets. Every access structure is a substructure of the universal structure for the same number of minimal qualified subsets, thus universal access structures have the highest complexity given the number of minimal qualified sets. We show that the complexity of the universal structure with $n$ minimal q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05021","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05021/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQ1BJZzaeMx7d2pxBZth3TNQnByWyUbe2TClVwspx3PO2i5PE4QKcQwfl1qjhwrwCOPKHqHjqG4pKJeAejm8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:05:39.109133Z"},"content_sha256":"442b75655889e407fc55635305f45490cf8f0e9fcec417cb9b6fe46d21d16d70","schema_version":"1.0","event_id":"sha256:442b75655889e407fc55635305f45490cf8f0e9fcec417cb9b6fe46d21d16d70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBK3KFLFNZTCPBATD2E42AJ4OU/bundle.json","state_url":"https://pith.science/pith/HBK3KFLFNZTCPBATD2E42AJ4OU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBK3KFLFNZTCPBATD2E42AJ4OU/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-08-16T09:05:39Z","links":{"resolver":"https://pith.science/pith/HBK3KFLFNZTCPBATD2E42AJ4OU","bundle":"https://pith.science/pith/HBK3KFLFNZTCPBATD2E42AJ4OU/bundle.json","state":"https://pith.science/pith/HBK3KFLFNZTCPBATD2E42AJ4OU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBK3KFLFNZTCPBATD2E42AJ4OU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HBK3KFLFNZTCPBATD2E42AJ4OU","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":"1c9d741aef2c1151aa334d008fe9fc99caf7973eee87532fb8b97f2795e32375","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-08-14T08:56:59Z","title_canon_sha256":"b882d8c322143937dfc7552b8c98487c92cce25f71eebb4713507a9b0180ddc5"},"schema_version":"1.0","source":{"id":"1908.05021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05021","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05021v1","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05021","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"HBK3KFLFNZTC","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"HBK3KFLFNZTCPBAT","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"HBK3KFLF","created_at":"2026-07-04T23:55:59Z"}],"graph_snapshots":[{"event_id":"sha256:442b75655889e407fc55635305f45490cf8f0e9fcec417cb9b6fe46d21d16d70","target":"graph","created_at":"2026-07-04T23:55:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05021/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An important parameter in a secret sharing scheme is the number of minimal qualified sets. Given this number, the universal access structure is the richest possible structure, namely the one in which there are one or more participants in every possible Boolean combination of the minimal qualified sets. Every access structure is a substructure of the universal structure for the same number of minimal qualified subsets, thus universal access structures have the highest complexity given the number of minimal qualified sets. We show that the complexity of the universal structure with $n$ minimal q","authors_text":"Laszlo Csirmaz","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-08-14T08:56:59Z","title":"Complexity of universal access structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05021","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:9048caa07877f3973867375991df1e322e95eec9fe5bddf562d7b5ede02d1776","target":"record","created_at":"2026-07-04T23:55:59Z","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":"1c9d741aef2c1151aa334d008fe9fc99caf7973eee87532fb8b97f2795e32375","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-08-14T08:56:59Z","title_canon_sha256":"b882d8c322143937dfc7552b8c98487c92cce25f71eebb4713507a9b0180ddc5"},"schema_version":"1.0","source":{"id":"1908.05021","kind":"arxiv","version":1}},"canonical_sha256":"3855b515656e662784131e89cd013c752cff104b025c03afc64298f6c1116acb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3855b515656e662784131e89cd013c752cff104b025c03afc64298f6c1116acb","first_computed_at":"2026-07-04T23:55:59.239546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:55:59.239546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IzAAQJp0/YdkxF5NgbUEBowmGsBa78/plBgZhg3KEFV0ypFMqdCEHJ5j/l8t0ROpOFgoSSuWfETrcsmA5ltEBA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:55:59.239988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9048caa07877f3973867375991df1e322e95eec9fe5bddf562d7b5ede02d1776","sha256:442b75655889e407fc55635305f45490cf8f0e9fcec417cb9b6fe46d21d16d70"],"state_sha256":"614e4b39aedb0414c50fdd8cd9694f8a29894a213c4739f40e33b4b5428acf26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMIhOnCdWdxu2pDWx5CZmv7DFhK0b4dRX6/F0RSNrvVbqxxQToRly7Zhig5DfkLhMOqDYMFSYOqD4kTHykWoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:05:39.114480Z","bundle_sha256":"b0ae8627076f75a0c0d967bb27a9edd5643447e8a4351ba00fd23f035d02a04e"}}