{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EOHEY2VRHWKM6UCH3KVE4RCYKT","short_pith_number":"pith:EOHEY2VR","schema_version":"1.0","canonical_sha256":"238e4c6ab13d94cf5047daaa4e445854ff2844d7c2b71bbb0f0e76c1c573649b","source":{"kind":"arxiv","id":"2509.10811","version":1},"attestation_state":"computed","paper":{"title":"Quantum-Assisted Recursive Algorithm for Solving the Exact Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bing-Jie Xu, Fei Gao, Jia-Cheng Fan, Ling-Xiao Li, Su-Juan Qin, Wei-Huang, Xiao-Hui Ni, Zi-Wen Huang","submitted_at":"2025-09-13T13:03:28Z","abstract_excerpt":"The exact cover problem is an NP-complete problem with broad applications. Studies show that although applying the Quantum Approximate Optimization Algorithm (QAOA) to this problem can yield improved solution quality with deeper circuit depth, it can limit the algorithm's applicability on noisy intermediate-scale quantum devices. To improve solution quality at shallow depth, we propose a Quantum-Assisted Recursive Algorithm (QARA) for solving the exact cover problem. QARA addresses the problem by alternately applying classical and quantum pruning. Classical pruning is a repeatable pre-processi"},"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":"2509.10811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-09-13T13:03:28Z","cross_cats_sorted":[],"title_canon_sha256":"7924ee3a0994730f391230950424c8a1f395926e16c11e41ee814b265ca105f9","abstract_canon_sha256":"9505f58dd7a44db87290ba0a5b4601f2b2f718445894271a6e9b6939a3c78cc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:28.513498Z","signature_b64":"I0he10hUyfOo7n7aLgcOtgE0XMbsafevqqi+AbN4bXvcojl1c3Rtn2hTIQxjqxyWFSpzImaXEzA0shkMq/IlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"238e4c6ab13d94cf5047daaa4e445854ff2844d7c2b71bbb0f0e76c1c573649b","last_reissued_at":"2026-07-05T12:11:28.513002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:28.513002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Assisted Recursive Algorithm for Solving the Exact Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bing-Jie Xu, Fei Gao, Jia-Cheng Fan, Ling-Xiao Li, Su-Juan Qin, Wei-Huang, Xiao-Hui Ni, Zi-Wen Huang","submitted_at":"2025-09-13T13:03:28Z","abstract_excerpt":"The exact cover problem is an NP-complete problem with broad applications. Studies show that although applying the Quantum Approximate Optimization Algorithm (QAOA) to this problem can yield improved solution quality with deeper circuit depth, it can limit the algorithm's applicability on noisy intermediate-scale quantum devices. To improve solution quality at shallow depth, we propose a Quantum-Assisted Recursive Algorithm (QARA) for solving the exact cover problem. QARA addresses the problem by alternately applying classical and quantum pruning. Classical pruning is a repeatable pre-processi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.10811","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.10811/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":"2509.10811","created_at":"2026-07-05T12:11:28.513055+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.10811v1","created_at":"2026-07-05T12:11:28.513055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.10811","created_at":"2026-07-05T12:11:28.513055+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOHEY2VRHWKM","created_at":"2026-07-05T12:11:28.513055+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOHEY2VRHWKM6UCH","created_at":"2026-07-05T12:11:28.513055+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOHEY2VR","created_at":"2026-07-05T12:11:28.513055+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/EOHEY2VRHWKM6UCH3KVE4RCYKT","json":"https://pith.science/pith/EOHEY2VRHWKM6UCH3KVE4RCYKT.json","graph_json":"https://pith.science/api/pith-number/EOHEY2VRHWKM6UCH3KVE4RCYKT/graph.json","events_json":"https://pith.science/api/pith-number/EOHEY2VRHWKM6UCH3KVE4RCYKT/events.json","paper":"https://pith.science/paper/EOHEY2VR"},"agent_actions":{"view_html":"https://pith.science/pith/EOHEY2VRHWKM6UCH3KVE4RCYKT","download_json":"https://pith.science/pith/EOHEY2VRHWKM6UCH3KVE4RCYKT.json","view_paper":"https://pith.science/paper/EOHEY2VR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.10811&json=true","fetch_graph":"https://pith.science/api/pith-number/EOHEY2VRHWKM6UCH3KVE4RCYKT/graph.json","fetch_events":"https://pith.science/api/pith-number/EOHEY2VRHWKM6UCH3KVE4RCYKT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOHEY2VRHWKM6UCH3KVE4RCYKT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOHEY2VRHWKM6UCH3KVE4RCYKT/action/storage_attestation","attest_author":"https://pith.science/pith/EOHEY2VRHWKM6UCH3KVE4RCYKT/action/author_attestation","sign_citation":"https://pith.science/pith/EOHEY2VRHWKM6UCH3KVE4RCYKT/action/citation_signature","submit_replication":"https://pith.science/pith/EOHEY2VRHWKM6UCH3KVE4RCYKT/action/replication_record"}},"created_at":"2026-07-05T12:11:28.513055+00:00","updated_at":"2026-07-05T12:11:28.513055+00:00"}