{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Z26Q3AQL3M22ZAQ45YKC3MWSSA","short_pith_number":"pith:Z26Q3AQL","canonical_record":{"source":{"id":"1304.7105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-26T09:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"cec132487fa217715d78d547de4153758e2aa4c52f7f84249a7260ac21877d82","abstract_canon_sha256":"eabfeb4be6afcf774985b32713155e8cfeb7e993d9f76c37aba95981f6837fe3"},"schema_version":"1.0"},"canonical_sha256":"cebd0d820bdb35ac821cee142db2d290035960470fd49c4a638cf06bf36549bd","source":{"kind":"arxiv","id":"1304.7105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7105","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7105v1","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7105","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"Z26Q3AQL3M22","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z26Q3AQL3M22ZAQ4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z26Q3AQL","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Z26Q3AQL3M22ZAQ45YKC3MWSSA","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-26T09:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"cec132487fa217715d78d547de4153758e2aa4c52f7f84249a7260ac21877d82","abstract_canon_sha256":"eabfeb4be6afcf774985b32713155e8cfeb7e993d9f76c37aba95981f6837fe3"},"schema_version":"1.0"},"canonical_sha256":"cebd0d820bdb35ac821cee142db2d290035960470fd49c4a638cf06bf36549bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:57.311383Z","signature_b64":"wLSz/lkTLaELVwgCeb+tpkau3LInGH81Qb3RUwvSAzUxXFi+YA0DvpBm6h09HL4j3YUmPXzp9065NrkPp62oCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cebd0d820bdb35ac821cee142db2d290035960470fd49c4a638cf06bf36549bd","last_reissued_at":"2026-05-18T01:02:57.310685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:57.310685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7105","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-18T01:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yABM/rqQSR1jxI3Bc8ozwzIdXk2UZhfSB18kAogZ9OdbJgudz65/WxgJoPA682JUEITjo6rW/UW/qxN5NlCBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:51:09.163626Z"},"content_sha256":"e94fa036de949b565b2c13cde0822b1648c791796f618a5bb48665f1730e5792","schema_version":"1.0","event_id":"sha256:e94fa036de949b565b2c13cde0822b1648c791796f618a5bb48665f1730e5792"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Z26Q3AQL3M22ZAQ45YKC3MWSSA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Access structure in graphs in high dimension and application to secret sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anne Marin, Damian Markham, Simon Perdrix","submitted_at":"2013-04-26T09:45:32Z","abstract_excerpt":"We give graphical characterisation of the access structure to both classical and quantum information encoded onto a multigraph defined for prime dimension $q$, as well as explicit decoding operations for quantum secret sharing based on graph state protocols. We give a lower bound on $k$ for the existence of a $((k,n))_q$ scheme and prove, using probabilistic methods, that there exists $\\alpha$ such that a random multigraph has an accessing parameter $k\\leq \\alpha n$ with high probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7105","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-18T01:02:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNTjlca+O7VZdc5c6q2jbzzjTOhwJzbRsveXmfELuU2IAnhelCxy1BQ4GXf0DzE1NYopUzZBkL75kzJXwUhvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:51:09.163966Z"},"content_sha256":"0829c76414a738c6e30be4afc4055cdc42f2a4d3e127803bc4ee3bc847f878a9","schema_version":"1.0","event_id":"sha256:0829c76414a738c6e30be4afc4055cdc42f2a4d3e127803bc4ee3bc847f878a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/bundle.json","state_url":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/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-30T21:51:09Z","links":{"resolver":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA","bundle":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/bundle.json","state":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Z26Q3AQL3M22ZAQ45YKC3MWSSA","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":"eabfeb4be6afcf774985b32713155e8cfeb7e993d9f76c37aba95981f6837fe3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-26T09:45:32Z","title_canon_sha256":"cec132487fa217715d78d547de4153758e2aa4c52f7f84249a7260ac21877d82"},"schema_version":"1.0","source":{"id":"1304.7105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7105","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7105v1","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7105","created_at":"2026-05-18T01:02:57Z"},{"alias_kind":"pith_short_12","alias_value":"Z26Q3AQL3M22","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z26Q3AQL3M22ZAQ4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z26Q3AQL","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:0829c76414a738c6e30be4afc4055cdc42f2a4d3e127803bc4ee3bc847f878a9","target":"graph","created_at":"2026-05-18T01:02:57Z","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":"We give graphical characterisation of the access structure to both classical and quantum information encoded onto a multigraph defined for prime dimension $q$, as well as explicit decoding operations for quantum secret sharing based on graph state protocols. We give a lower bound on $k$ for the existence of a $((k,n))_q$ scheme and prove, using probabilistic methods, that there exists $\\alpha$ such that a random multigraph has an accessing parameter $k\\leq \\alpha n$ with high probability.","authors_text":"Anne Marin, Damian Markham, Simon Perdrix","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-26T09:45:32Z","title":"Access structure in graphs in high dimension and application to secret sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7105","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:e94fa036de949b565b2c13cde0822b1648c791796f618a5bb48665f1730e5792","target":"record","created_at":"2026-05-18T01:02:57Z","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":"eabfeb4be6afcf774985b32713155e8cfeb7e993d9f76c37aba95981f6837fe3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-26T09:45:32Z","title_canon_sha256":"cec132487fa217715d78d547de4153758e2aa4c52f7f84249a7260ac21877d82"},"schema_version":"1.0","source":{"id":"1304.7105","kind":"arxiv","version":1}},"canonical_sha256":"cebd0d820bdb35ac821cee142db2d290035960470fd49c4a638cf06bf36549bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cebd0d820bdb35ac821cee142db2d290035960470fd49c4a638cf06bf36549bd","first_computed_at":"2026-05-18T01:02:57.310685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:57.310685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wLSz/lkTLaELVwgCeb+tpkau3LInGH81Qb3RUwvSAzUxXFi+YA0DvpBm6h09HL4j3YUmPXzp9065NrkPp62oCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:57.311383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e94fa036de949b565b2c13cde0822b1648c791796f618a5bb48665f1730e5792","sha256:0829c76414a738c6e30be4afc4055cdc42f2a4d3e127803bc4ee3bc847f878a9"],"state_sha256":"d9dfb23beb2872ca312706121e118bc6d7d915689e6dfa8bafe9ac77169a7be7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rO53XJ43c+Ds11FwLtkADmn8XAQFvtIJxdFI3b/UgTG93i33n1sQruKzukgPLvc/gJLwBq4NPJUWfnEO9bD9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T21:51:09.165950Z","bundle_sha256":"8e77a88025d7a170b73ddb2edeeb1616179cc42c2f4cfc91acd61ba78aed22d6"}}