{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B7GSSHJQIGIHFC755HS45F5H6V","short_pith_number":"pith:B7GSSHJQ","schema_version":"1.0","canonical_sha256":"0fcd291d304190728bfde9e5ce97a7f55ae94e3207bc8621a93c6a741fdd625b","source":{"kind":"arxiv","id":"2512.02940","version":2},"attestation_state":"computed","paper":{"title":"Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. K. F. Iwakami, D. H. Moraes, F. S. Luiz, M. C. de Oliveira","submitted_at":"2025-12-02T17:04:57Z","abstract_excerpt":"We propose a novel heuristic quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs). In this framework, the coherent propagation of a quantum walker over a graph encodes its structural properties into state amplitudes, enabling the identification of highly influential vertices through their transition probabilities. To enhance stability and solution quality, we introduce a dynamic decoupling (``freezing'') mechanism that isolates vertices already selected for the cover, preventing their interference in subsequent iterations of the algorithm."},"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":"2512.02940","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-12-02T17:04:57Z","cross_cats_sorted":[],"title_canon_sha256":"44c64bf2a1a0043bd28bdeb9de9f1e07abcad6bfd810638a5d02141072d9f8a7","abstract_canon_sha256":"70ba3b69535ebe8f738b96a5f5efc40daa75fa32a437bda132440d6a5589662d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:19.191381Z","signature_b64":"mxAf+wuBN5pvamec4PfrlI91lTa8bVDJErwiWTzPwy2WfFaFmBoGVwdO5vHbUSx8wON4hu1rhi4heLPrIzN4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fcd291d304190728bfde9e5ce97a7f55ae94e3207bc8621a93c6a741fdd625b","last_reissued_at":"2026-05-26T01:03:19.190769Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:19.190769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"A. K. F. Iwakami, D. H. Moraes, F. S. Luiz, M. C. de Oliveira","submitted_at":"2025-12-02T17:04:57Z","abstract_excerpt":"We propose a novel heuristic quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs). In this framework, the coherent propagation of a quantum walker over a graph encodes its structural properties into state amplitudes, enabling the identification of highly influential vertices through their transition probabilities. To enhance stability and solution quality, we introduce a dynamic decoupling (``freezing'') mechanism that isolates vertices already selected for the cover, preventing their interference in subsequent iterations of the algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.02940","kind":"arxiv","version":2},"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/2512.02940/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":"2512.02940","created_at":"2026-05-26T01:03:19.190866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.02940v2","created_at":"2026-05-26T01:03:19.190866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.02940","created_at":"2026-05-26T01:03:19.190866+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7GSSHJQIGIH","created_at":"2026-05-26T01:03:19.190866+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7GSSHJQIGIHFC75","created_at":"2026-05-26T01:03:19.190866+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7GSSHJQ","created_at":"2026-05-26T01:03:19.190866+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/B7GSSHJQIGIHFC755HS45F5H6V","json":"https://pith.science/pith/B7GSSHJQIGIHFC755HS45F5H6V.json","graph_json":"https://pith.science/api/pith-number/B7GSSHJQIGIHFC755HS45F5H6V/graph.json","events_json":"https://pith.science/api/pith-number/B7GSSHJQIGIHFC755HS45F5H6V/events.json","paper":"https://pith.science/paper/B7GSSHJQ"},"agent_actions":{"view_html":"https://pith.science/pith/B7GSSHJQIGIHFC755HS45F5H6V","download_json":"https://pith.science/pith/B7GSSHJQIGIHFC755HS45F5H6V.json","view_paper":"https://pith.science/paper/B7GSSHJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.02940&json=true","fetch_graph":"https://pith.science/api/pith-number/B7GSSHJQIGIHFC755HS45F5H6V/graph.json","fetch_events":"https://pith.science/api/pith-number/B7GSSHJQIGIHFC755HS45F5H6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7GSSHJQIGIHFC755HS45F5H6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7GSSHJQIGIHFC755HS45F5H6V/action/storage_attestation","attest_author":"https://pith.science/pith/B7GSSHJQIGIHFC755HS45F5H6V/action/author_attestation","sign_citation":"https://pith.science/pith/B7GSSHJQIGIHFC755HS45F5H6V/action/citation_signature","submit_replication":"https://pith.science/pith/B7GSSHJQIGIHFC755HS45F5H6V/action/replication_record"}},"created_at":"2026-05-26T01:03:19.190866+00:00","updated_at":"2026-05-26T01:03:19.190866+00:00"}