{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Z26Q3AQL3M22ZAQ45YKC3MWSSA","short_pith_number":"pith:Z26Q3AQL","schema_version":"1.0","canonical_sha256":"cebd0d820bdb35ac821cee142db2d290035960470fd49c4a638cf06bf36549bd","source":{"kind":"arxiv","id":"1304.7105","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.7105","created_at":"2026-05-18T01:02:57.310793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7105v1","created_at":"2026-05-18T01:02:57.310793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7105","created_at":"2026-05-18T01:02:57.310793+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z26Q3AQL3M22","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z26Q3AQL3M22ZAQ4","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z26Q3AQL","created_at":"2026-05-18T12:28:09.283467+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/Z26Q3AQL3M22ZAQ45YKC3MWSSA","json":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA.json","graph_json":"https://pith.science/api/pith-number/Z26Q3AQL3M22ZAQ45YKC3MWSSA/graph.json","events_json":"https://pith.science/api/pith-number/Z26Q3AQL3M22ZAQ45YKC3MWSSA/events.json","paper":"https://pith.science/paper/Z26Q3AQL"},"agent_actions":{"view_html":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA","download_json":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA.json","view_paper":"https://pith.science/paper/Z26Q3AQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7105&json=true","fetch_graph":"https://pith.science/api/pith-number/Z26Q3AQL3M22ZAQ45YKC3MWSSA/graph.json","fetch_events":"https://pith.science/api/pith-number/Z26Q3AQL3M22ZAQ45YKC3MWSSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/action/storage_attestation","attest_author":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/action/author_attestation","sign_citation":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/action/citation_signature","submit_replication":"https://pith.science/pith/Z26Q3AQL3M22ZAQ45YKC3MWSSA/action/replication_record"}},"created_at":"2026-05-18T01:02:57.310793+00:00","updated_at":"2026-05-18T01:02:57.310793+00:00"}