{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:34GPWJKURQ35JB3PXSVNRTAMCE","short_pith_number":"pith:34GPWJKU","schema_version":"1.0","canonical_sha256":"df0cfb25548c37d4876fbcaad8cc0c1109b2860f386d21d1209ba20092422fd2","source":{"kind":"arxiv","id":"1810.01647","version":1},"attestation_state":"computed","paper":{"title":"Graph comparison via nonlinear quantum search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. H. Yu, J. B. Wang, K. de Lacy, M. Chiew, S. Marsh","submitted_at":"2018-10-03T09:14:29Z","abstract_excerpt":"In this paper we present an efficiently scaling quantum algorithm which finds the size of the maximum common edge subgraph for a pair of arbitrary graphs and thus provides a meaningful measure of graph similarity. The algorithm makes use of a two-part quantum dynamic process: in the first part we obtain information crucial for the comparison of two graphs through linear quantum computation. However, this information is hidden in the quantum system with vanishingly small amplitude that even quantum algorithms such as Grover's search are not fast enough to distill the information efficiently. In"},"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":"1810.01647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-03T09:14:29Z","cross_cats_sorted":[],"title_canon_sha256":"1797da16b78f9c35824b5598f5e3fc3c333bb4ed0fa990c2bd54375f2fa25b4e","abstract_canon_sha256":"3ec4dd08291e73e4dda0164b8f69ea83e7bd70a8ae64fa7e973d9d0bbb419bc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:11.364286Z","signature_b64":"J5dZRWhW4ui5knXNho2K2poHvAiOoKUsyDnOxyoIpTot5CSrcTj/DvqONzLEUKaasAydtbbJRZXHKI5zJfYkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df0cfb25548c37d4876fbcaad8cc0c1109b2860f386d21d1209ba20092422fd2","last_reissued_at":"2026-05-18T00:04:11.363708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:11.363708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph comparison via nonlinear quantum search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. H. Yu, J. B. Wang, K. de Lacy, M. Chiew, S. Marsh","submitted_at":"2018-10-03T09:14:29Z","abstract_excerpt":"In this paper we present an efficiently scaling quantum algorithm which finds the size of the maximum common edge subgraph for a pair of arbitrary graphs and thus provides a meaningful measure of graph similarity. The algorithm makes use of a two-part quantum dynamic process: in the first part we obtain information crucial for the comparison of two graphs through linear quantum computation. However, this information is hidden in the quantum system with vanishingly small amplitude that even quantum algorithms such as Grover's search are not fast enough to distill the information efficiently. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01647","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":"1810.01647","created_at":"2026-05-18T00:04:11.363790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01647v1","created_at":"2026-05-18T00:04:11.363790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01647","created_at":"2026-05-18T00:04:11.363790+00:00"},{"alias_kind":"pith_short_12","alias_value":"34GPWJKURQ35","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"34GPWJKURQ35JB3P","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"34GPWJKU","created_at":"2026-05-18T12:32:02.567920+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/34GPWJKURQ35JB3PXSVNRTAMCE","json":"https://pith.science/pith/34GPWJKURQ35JB3PXSVNRTAMCE.json","graph_json":"https://pith.science/api/pith-number/34GPWJKURQ35JB3PXSVNRTAMCE/graph.json","events_json":"https://pith.science/api/pith-number/34GPWJKURQ35JB3PXSVNRTAMCE/events.json","paper":"https://pith.science/paper/34GPWJKU"},"agent_actions":{"view_html":"https://pith.science/pith/34GPWJKURQ35JB3PXSVNRTAMCE","download_json":"https://pith.science/pith/34GPWJKURQ35JB3PXSVNRTAMCE.json","view_paper":"https://pith.science/paper/34GPWJKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01647&json=true","fetch_graph":"https://pith.science/api/pith-number/34GPWJKURQ35JB3PXSVNRTAMCE/graph.json","fetch_events":"https://pith.science/api/pith-number/34GPWJKURQ35JB3PXSVNRTAMCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34GPWJKURQ35JB3PXSVNRTAMCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34GPWJKURQ35JB3PXSVNRTAMCE/action/storage_attestation","attest_author":"https://pith.science/pith/34GPWJKURQ35JB3PXSVNRTAMCE/action/author_attestation","sign_citation":"https://pith.science/pith/34GPWJKURQ35JB3PXSVNRTAMCE/action/citation_signature","submit_replication":"https://pith.science/pith/34GPWJKURQ35JB3PXSVNRTAMCE/action/replication_record"}},"created_at":"2026-05-18T00:04:11.363790+00:00","updated_at":"2026-05-18T00:04:11.363790+00:00"}