{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CCNV5WNJZLSNFEGP7R2PIOI5WS","short_pith_number":"pith:CCNV5WNJ","schema_version":"1.0","canonical_sha256":"109b5ed9a9cae4d290cffc74f4391db4b8717917c3708dc07ba64ca5188407c0","source":{"kind":"arxiv","id":"1803.11356","version":1},"attestation_state":"computed","paper":{"title":"Quantum speed-up in solving the maximal clique problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jiahui Chen, Mang Feng, Qi Yu, Weng-Long Chang, Xinhua Peng, Zhaokai Li","submitted_at":"2018-03-30T06:33:01Z","abstract_excerpt":"The maximal clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry, bioinformatics to social networks. Here we develop a quantum algorithm to solve the maximal clique problem for any graph $G$ with $n$ vertices with quadratic speed-up over its classical counterparts, where the time and spatial complexities are reduced to, respectively, $O(\\sqrt{2^{n}})$ and $O(n^{2})$. With respect to oracle-related quantum algorithms for the NP-comple"},"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":"1803.11356","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-30T06:33:01Z","cross_cats_sorted":[],"title_canon_sha256":"d5075728cc25a7c7d84f98c179bd5f3051a1e168efb97ba1c0128fee69f343ed","abstract_canon_sha256":"5beb567d3875230f72dce5a4b477c572d9e5a83a13c540b2c0b1fe106ad7ce0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:10.407351Z","signature_b64":"EUxNAkfqoxmMNoQ4RfWPmz2TXpZEl51rk5cL4bCBrUpnMOJA76cIPOkKxGg/bX5A2UIw+SRtnFgpT/LNHubXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"109b5ed9a9cae4d290cffc74f4391db4b8717917c3708dc07ba64ca5188407c0","last_reissued_at":"2026-05-18T00:18:10.406749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:10.406749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum speed-up in solving the maximal clique problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jiahui Chen, Mang Feng, Qi Yu, Weng-Long Chang, Xinhua Peng, Zhaokai Li","submitted_at":"2018-03-30T06:33:01Z","abstract_excerpt":"The maximal clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry, bioinformatics to social networks. Here we develop a quantum algorithm to solve the maximal clique problem for any graph $G$ with $n$ vertices with quadratic speed-up over its classical counterparts, where the time and spatial complexities are reduced to, respectively, $O(\\sqrt{2^{n}})$ and $O(n^{2})$. With respect to oracle-related quantum algorithms for the NP-comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11356","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":"1803.11356","created_at":"2026-05-18T00:18:10.406845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.11356v1","created_at":"2026-05-18T00:18:10.406845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11356","created_at":"2026-05-18T00:18:10.406845+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCNV5WNJZLSN","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCNV5WNJZLSNFEGP","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCNV5WNJ","created_at":"2026-05-18T12:32:16.446611+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/CCNV5WNJZLSNFEGP7R2PIOI5WS","json":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS.json","graph_json":"https://pith.science/api/pith-number/CCNV5WNJZLSNFEGP7R2PIOI5WS/graph.json","events_json":"https://pith.science/api/pith-number/CCNV5WNJZLSNFEGP7R2PIOI5WS/events.json","paper":"https://pith.science/paper/CCNV5WNJ"},"agent_actions":{"view_html":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS","download_json":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS.json","view_paper":"https://pith.science/paper/CCNV5WNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.11356&json=true","fetch_graph":"https://pith.science/api/pith-number/CCNV5WNJZLSNFEGP7R2PIOI5WS/graph.json","fetch_events":"https://pith.science/api/pith-number/CCNV5WNJZLSNFEGP7R2PIOI5WS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/action/storage_attestation","attest_author":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/action/author_attestation","sign_citation":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/action/citation_signature","submit_replication":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/action/replication_record"}},"created_at":"2026-05-18T00:18:10.406845+00:00","updated_at":"2026-05-18T00:18:10.406845+00:00"}