{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CCNV5WNJZLSNFEGP7R2PIOI5WS","short_pith_number":"pith:CCNV5WNJ","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"},"canonical_sha256":"109b5ed9a9cae4d290cffc74f4391db4b8717917c3708dc07ba64ca5188407c0","source":{"kind":"arxiv","id":"1803.11356","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11356","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11356v1","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11356","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"CCNV5WNJZLSN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CCNV5WNJZLSNFEGP","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CCNV5WNJ","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CCNV5WNJZLSNFEGP7R2PIOI5WS","target":"record","payload":{"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"},"canonical_sha256":"109b5ed9a9cae4d290cffc74f4391db4b8717917c3708dc07ba64ca5188407c0","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"},"source_kind":"arxiv","source_id":"1803.11356","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-18T00:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tRV13x5y2xYDpNioV5b8ooZ1OpFEgz6e/pI/TBq3hlSEx9yt5dllPwaeu5QmC+HdY+KBML3Equ5n6Pkk8ZxgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:27:57.145268Z"},"content_sha256":"6bf37f9eb9951af17d5307ebdbc6dd26d89fcbe4151ea286730f4a5d7d73fb93","schema_version":"1.0","event_id":"sha256:6bf37f9eb9951af17d5307ebdbc6dd26d89fcbe4151ea286730f4a5d7d73fb93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CCNV5WNJZLSNFEGP7R2PIOI5WS","target":"graph","payload":{"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"},"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-18T00:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27TF7QIkSY1DfuRI49Wge7wERSBtH7HXJ8Sy7W6vktsEo6tV4BZC6gEyhqRmfWqudTqeG5BOJhyyCs9A2Wf5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:27:57.145996Z"},"content_sha256":"a6801b424f37fec0887a5de02290c6c6218eacf5be65a43eeeb050bfbd2998da","schema_version":"1.0","event_id":"sha256:a6801b424f37fec0887a5de02290c6c6218eacf5be65a43eeeb050bfbd2998da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/bundle.json","state_url":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/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-05-26T16:27:57Z","links":{"resolver":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS","bundle":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/bundle.json","state":"https://pith.science/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCNV5WNJZLSNFEGP7R2PIOI5WS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CCNV5WNJZLSNFEGP7R2PIOI5WS","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":"5beb567d3875230f72dce5a4b477c572d9e5a83a13c540b2c0b1fe106ad7ce0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-30T06:33:01Z","title_canon_sha256":"d5075728cc25a7c7d84f98c179bd5f3051a1e168efb97ba1c0128fee69f343ed"},"schema_version":"1.0","source":{"id":"1803.11356","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11356","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11356v1","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11356","created_at":"2026-05-18T00:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"CCNV5WNJZLSN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CCNV5WNJZLSNFEGP","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CCNV5WNJ","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:a6801b424f37fec0887a5de02290c6c6218eacf5be65a43eeeb050bfbd2998da","target":"graph","created_at":"2026-05-18T00:18:10Z","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":"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","authors_text":"Jiahui Chen, Mang Feng, Qi Yu, Weng-Long Chang, Xinhua Peng, Zhaokai Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-30T06:33:01Z","title":"Quantum speed-up in solving the maximal clique problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11356","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:6bf37f9eb9951af17d5307ebdbc6dd26d89fcbe4151ea286730f4a5d7d73fb93","target":"record","created_at":"2026-05-18T00:18:10Z","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":"5beb567d3875230f72dce5a4b477c572d9e5a83a13c540b2c0b1fe106ad7ce0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-30T06:33:01Z","title_canon_sha256":"d5075728cc25a7c7d84f98c179bd5f3051a1e168efb97ba1c0128fee69f343ed"},"schema_version":"1.0","source":{"id":"1803.11356","kind":"arxiv","version":1}},"canonical_sha256":"109b5ed9a9cae4d290cffc74f4391db4b8717917c3708dc07ba64ca5188407c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"109b5ed9a9cae4d290cffc74f4391db4b8717917c3708dc07ba64ca5188407c0","first_computed_at":"2026-05-18T00:18:10.406749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:10.406749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EUxNAkfqoxmMNoQ4RfWPmz2TXpZEl51rk5cL4bCBrUpnMOJA76cIPOkKxGg/bX5A2UIw+SRtnFgpT/LNHubXAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:10.407351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.11356","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bf37f9eb9951af17d5307ebdbc6dd26d89fcbe4151ea286730f4a5d7d73fb93","sha256:a6801b424f37fec0887a5de02290c6c6218eacf5be65a43eeeb050bfbd2998da"],"state_sha256":"5e00d22a2400cf37f3d5d0bcbf3f1f67a37620066f0fee9446e639728e68a122"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VUGoKvqr/QpEYX0g6+9LRA4cq+j/LjNW+xUNzgEh3KwDh9hYZy/t/BMaWlp7iofhWMVepTkBOU7xYaOEO7l4CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:27:57.150382Z","bundle_sha256":"092ae8f097518de6c5bdefb64f9e6ba686101e8294bf76b10089f19471da72fc"}}