{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JS5OCNYUY3X7FB52LXPXK66RNS","short_pith_number":"pith:JS5OCNYU","schema_version":"1.0","canonical_sha256":"4cbae13714c6eff287ba5ddf757bd16cb6d932949a8a6d9afc7c18d943785546","source":{"kind":"arxiv","id":"2607.27915","version":1},"attestation_state":"computed","paper":{"title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Finley A. Quinton, Franz G. Fuchs, Pascal Halffmann, Ruben Pariente Bassa","submitted_at":"2026-07-30T09:29:26Z","abstract_excerpt":"We introduce a constraint-preserving hybrid quantum-classical greedy framework for the minimum vertex cover problem, which extends directly to maximum independent set by bitwise complementation. The framework uses projected Pauli-X terms whose sum preserves the feasible subspace and acts within it exactly as the adjacency matrix of a layered graph of feasible covers. This graph is connected, so every feasible cover is linked to the configuration containing all vertices by a sequence of allowed single-vertex flips. Starting from this configuration, the corresponding continuous-time quantum walk"},"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":"2607.27915","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T09:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"ffb5c140250136caf86b3c392b6c88d406b2c35ee0c4ab520577a18ac7ecdc19","abstract_canon_sha256":"1ed83c54d6ce843ab88d2a8e56e08b146df660b38776a725b95117538102cf18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cbae13714c6eff287ba5ddf757bd16cb6d932949a8a6d9afc7c18d943785546","last_reissued_at":"2026-07-31T01:34:47.468853Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:34:47.468853Z"},"graph_snapshot":{"paper":{"title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Finley A. Quinton, Franz G. Fuchs, Pascal Halffmann, Ruben Pariente Bassa","submitted_at":"2026-07-30T09:29:26Z","abstract_excerpt":"We introduce a constraint-preserving hybrid quantum-classical greedy framework for the minimum vertex cover problem, which extends directly to maximum independent set by bitwise complementation. The framework uses projected Pauli-X terms whose sum preserves the feasible subspace and acts within it exactly as the adjacency matrix of a layered graph of feasible covers. This graph is connected, so every feasible cover is linked to the configuration containing all vertices by a sequence of allowed single-vertex flips. Starting from this configuration, the corresponding continuous-time quantum walk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27915","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/2607.27915/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":"2607.27915","created_at":"2026-07-31T01:34:47.471999+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27915v1","created_at":"2026-07-31T01:34:47.471999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27915","created_at":"2026-07-31T01:34:47.471999+00:00"},{"alias_kind":"pith_short_12","alias_value":"JS5OCNYUY3X7","created_at":"2026-07-31T01:34:47.471999+00:00"},{"alias_kind":"pith_short_16","alias_value":"JS5OCNYUY3X7FB52","created_at":"2026-07-31T01:34:47.471999+00:00"},{"alias_kind":"pith_short_8","alias_value":"JS5OCNYU","created_at":"2026-07-31T01:34:47.471999+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/JS5OCNYUY3X7FB52LXPXK66RNS","json":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS.json","graph_json":"https://pith.science/api/pith-number/JS5OCNYUY3X7FB52LXPXK66RNS/graph.json","events_json":"https://pith.science/api/pith-number/JS5OCNYUY3X7FB52LXPXK66RNS/events.json","paper":"https://pith.science/paper/JS5OCNYU"},"agent_actions":{"view_html":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS","download_json":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS.json","view_paper":"https://pith.science/paper/JS5OCNYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27915&json=true","fetch_graph":"https://pith.science/api/pith-number/JS5OCNYUY3X7FB52LXPXK66RNS/graph.json","fetch_events":"https://pith.science/api/pith-number/JS5OCNYUY3X7FB52LXPXK66RNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS/action/storage_attestation","attest_author":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS/action/author_attestation","sign_citation":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS/action/citation_signature","submit_replication":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS/action/replication_record"}},"created_at":"2026-07-31T01:34:47.471999+00:00","updated_at":"2026-07-31T01:34:47.471999+00:00"}