{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZUZAFZ4M4P24FVW67CYXC5MCW4","short_pith_number":"pith:ZUZAFZ4M","schema_version":"1.0","canonical_sha256":"cd3202e78ce3f5c2d6def8b1717582b73d72d3938c9f20a1038de2ea5a5a3e8e","source":{"kind":"arxiv","id":"2309.12887","version":2},"attestation_state":"computed","paper":{"title":"New Approaches to Complexity via Quantum Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC","math.OA"],"primary_cat":"quant-ph","authors_text":"Arthur Mehta, Eric Culf","submitted_at":"2023-09-22T14:20:14Z","abstract_excerpt":"Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an operator system generalisation of graphs, presents several technical challenges. Consequently, the connections between quantum graphs and complexity have been underexplored.\n  In this work, we introduce and study the clique problem for quantum graphs. Our approach utilizes a well-known connection between quantum graphs and quantum channels. The inputs for ou"},"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":"2309.12887","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-22T14:20:14Z","cross_cats_sorted":["cs.CC","math.OA"],"title_canon_sha256":"2caf306020dacd9a9fe08165556e7f8bb92bedc4816bee83fd6b5d3757c9c061","abstract_canon_sha256":"5dc8a1b45d3a8931287dd777a816f65913ae8bac4dae875500c3e9424d98d6ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:37.212607Z","signature_b64":"02a6TFoLplxPYIK3UT/+oQuhPZwXTUkQAUp+um5xDc3tRHu02Ne6Lg9q7RxAlS4v30G6leqq+tDxrk2dIRIVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd3202e78ce3f5c2d6def8b1717582b73d72d3938c9f20a1038de2ea5a5a3e8e","last_reissued_at":"2026-07-05T10:04:37.212166Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:37.212166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Approaches to Complexity via Quantum Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC","math.OA"],"primary_cat":"quant-ph","authors_text":"Arthur Mehta, Eric Culf","submitted_at":"2023-09-22T14:20:14Z","abstract_excerpt":"Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an operator system generalisation of graphs, presents several technical challenges. Consequently, the connections between quantum graphs and complexity have been underexplored.\n  In this work, we introduce and study the clique problem for quantum graphs. Our approach utilizes a well-known connection between quantum graphs and quantum channels. The inputs for ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.12887","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/2309.12887/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":"2309.12887","created_at":"2026-07-05T10:04:37.212221+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.12887v2","created_at":"2026-07-05T10:04:37.212221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.12887","created_at":"2026-07-05T10:04:37.212221+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUZAFZ4M4P24","created_at":"2026-07-05T10:04:37.212221+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUZAFZ4M4P24FVW6","created_at":"2026-07-05T10:04:37.212221+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUZAFZ4M","created_at":"2026-07-05T10:04:37.212221+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.27886","citing_title":"The power of unentanglement without destructive interference","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZUZAFZ4M4P24FVW67CYXC5MCW4","json":"https://pith.science/pith/ZUZAFZ4M4P24FVW67CYXC5MCW4.json","graph_json":"https://pith.science/api/pith-number/ZUZAFZ4M4P24FVW67CYXC5MCW4/graph.json","events_json":"https://pith.science/api/pith-number/ZUZAFZ4M4P24FVW67CYXC5MCW4/events.json","paper":"https://pith.science/paper/ZUZAFZ4M"},"agent_actions":{"view_html":"https://pith.science/pith/ZUZAFZ4M4P24FVW67CYXC5MCW4","download_json":"https://pith.science/pith/ZUZAFZ4M4P24FVW67CYXC5MCW4.json","view_paper":"https://pith.science/paper/ZUZAFZ4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.12887&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUZAFZ4M4P24FVW67CYXC5MCW4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUZAFZ4M4P24FVW67CYXC5MCW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUZAFZ4M4P24FVW67CYXC5MCW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUZAFZ4M4P24FVW67CYXC5MCW4/action/storage_attestation","attest_author":"https://pith.science/pith/ZUZAFZ4M4P24FVW67CYXC5MCW4/action/author_attestation","sign_citation":"https://pith.science/pith/ZUZAFZ4M4P24FVW67CYXC5MCW4/action/citation_signature","submit_replication":"https://pith.science/pith/ZUZAFZ4M4P24FVW67CYXC5MCW4/action/replication_record"}},"created_at":"2026-07-05T10:04:37.212221+00:00","updated_at":"2026-07-05T10:04:37.212221+00:00"}