{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SQY23X6PZC4WL4LXPY26PERB6B","short_pith_number":"pith:SQY23X6P","schema_version":"1.0","canonical_sha256":"9431addfcfc8b965f1777e35e79221f051bb4ac8aad3fa211e2ec4fa828e63b1","source":{"kind":"arxiv","id":"2206.03599","version":2},"attestation_state":"computed","paper":{"title":"Multi-qubit doilies: enumeration for all ranks and classification for ranks four and five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"quant-ph","authors_text":"Alain Giorgetti, Axel Muller, Fr\\'ed\\'eric Holweck, Henri de Boutray, Metod Saniga","submitted_at":"2022-06-07T21:35:57Z","abstract_excerpt":"For $N \\geq 2$, an $N$-qubit doily is a doily living in the $N$-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of Saniga et al. (Mathematics 9 (2021) 2272) that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the number of both linear and quadratic doilies for any $N > 2$. Then we present an effective algorithm for the generation of all $N$-qubit doilies. Using this algorithm for $N=4$ and $N=5$, we provide a classification of $N$-qubit doilies in terms of t"},"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":"2206.03599","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-06-07T21:35:57Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"1ddd9f9970b0fd7a960c68ef5ff615a9b91d2448c04ec4d9bfd9287dd4494346","abstract_canon_sha256":"445a6904af06d30d8d965337e8241017f9bb5954f6af57f63e812d3052c6cad1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:16.648342Z","signature_b64":"CvJx8FED8n6Z5tCieRJM4zYrXwp/zxRF2cgw/lToW4yZVC2GW1cfvCKM+iFSo/hmVeXupRanAf9VMW2iDWt9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9431addfcfc8b965f1777e35e79221f051bb4ac8aad3fa211e2ec4fa828e63b1","last_reissued_at":"2026-07-05T05:19:16.647935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:16.647935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-qubit doilies: enumeration for all ranks and classification for ranks four and five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"quant-ph","authors_text":"Alain Giorgetti, Axel Muller, Fr\\'ed\\'eric Holweck, Henri de Boutray, Metod Saniga","submitted_at":"2022-06-07T21:35:57Z","abstract_excerpt":"For $N \\geq 2$, an $N$-qubit doily is a doily living in the $N$-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of Saniga et al. (Mathematics 9 (2021) 2272) that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the number of both linear and quadratic doilies for any $N > 2$. Then we present an effective algorithm for the generation of all $N$-qubit doilies. Using this algorithm for $N=4$ and $N=5$, we provide a classification of $N$-qubit doilies in terms of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03599","kind":"arxiv","version":2},"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/2206.03599/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.03599","created_at":"2026-07-05T05:19:16.647994+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.03599v2","created_at":"2026-07-05T05:19:16.647994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03599","created_at":"2026-07-05T05:19:16.647994+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQY23X6PZC4W","created_at":"2026-07-05T05:19:16.647994+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQY23X6PZC4WL4LX","created_at":"2026-07-05T05:19:16.647994+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQY23X6P","created_at":"2026-07-05T05:19:16.647994+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21243","citing_title":"Empirical Demonstration of Quantum Contextuality on NISQ Computers","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SQY23X6PZC4WL4LXPY26PERB6B","json":"https://pith.science/pith/SQY23X6PZC4WL4LXPY26PERB6B.json","graph_json":"https://pith.science/api/pith-number/SQY23X6PZC4WL4LXPY26PERB6B/graph.json","events_json":"https://pith.science/api/pith-number/SQY23X6PZC4WL4LXPY26PERB6B/events.json","paper":"https://pith.science/paper/SQY23X6P"},"agent_actions":{"view_html":"https://pith.science/pith/SQY23X6PZC4WL4LXPY26PERB6B","download_json":"https://pith.science/pith/SQY23X6PZC4WL4LXPY26PERB6B.json","view_paper":"https://pith.science/paper/SQY23X6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.03599&json=true","fetch_graph":"https://pith.science/api/pith-number/SQY23X6PZC4WL4LXPY26PERB6B/graph.json","fetch_events":"https://pith.science/api/pith-number/SQY23X6PZC4WL4LXPY26PERB6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQY23X6PZC4WL4LXPY26PERB6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQY23X6PZC4WL4LXPY26PERB6B/action/storage_attestation","attest_author":"https://pith.science/pith/SQY23X6PZC4WL4LXPY26PERB6B/action/author_attestation","sign_citation":"https://pith.science/pith/SQY23X6PZC4WL4LXPY26PERB6B/action/citation_signature","submit_replication":"https://pith.science/pith/SQY23X6PZC4WL4LXPY26PERB6B/action/replication_record"}},"created_at":"2026-07-05T05:19:16.647994+00:00","updated_at":"2026-07-05T05:19:16.647994+00:00"}