{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JS5OCNYUY3X7FB52LXPXK66RNS","short_pith_number":"pith:JS5OCNYU","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"},"canonical_sha256":"4cbae13714c6eff287ba5ddf757bd16cb6d932949a8a6d9afc7c18d943785546","source":{"kind":"arxiv","id":"2607.27915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27915","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27915v1","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27915","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"JS5OCNYUY3X7","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"pith_short_16","alias_value":"JS5OCNYUY3X7FB52","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"pith_short_8","alias_value":"JS5OCNYU","created_at":"2026-07-31T01:34:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JS5OCNYUY3X7FB52LXPXK66RNS","target":"record","payload":{"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"},"canonical_sha256":"4cbae13714c6eff287ba5ddf757bd16cb6d932949a8a6d9afc7c18d943785546","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"},"source_kind":"arxiv","source_id":"2607.27915","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-07-31T01:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1QGdHcO8j46DMjmOyoiG5fLyzZ9flUO0n9HQMeazkAm8w22jXT3aFLUiZjSa3ondXd+kLN/iAp1M7cwNk90BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:47:39.369969Z"},"content_sha256":"e13c33fce7eac2ca5c8c7af86102d0e5bc24d57b43f63f2c4109cd5d4329e8cd","schema_version":"1.0","event_id":"sha256:e13c33fce7eac2ca5c8c7af86102d0e5bc24d57b43f63f2c4109cd5d4329e8cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JS5OCNYUY3X7FB52LXPXK66RNS","target":"graph","payload":{"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"},"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-07-31T01:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYzp+kZfp7LYX6zLUtT2nnYcXkXPpLvihK8SR3zXs5CBe9FCHCX5ptcu9yYPE3dhSBzCIp0MNhSamL/YV6UuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T14:47:39.370499Z"},"content_sha256":"70614ea00db7cd6184b605b4803b204448bdb745aef995c51a373fc237207690","schema_version":"1.0","event_id":"sha256:70614ea00db7cd6184b605b4803b204448bdb745aef995c51a373fc237207690"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS/bundle.json","state_url":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JS5OCNYUY3X7FB52LXPXK66RNS/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-08-04T14:47:39Z","links":{"resolver":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS","bundle":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS/bundle.json","state":"https://pith.science/pith/JS5OCNYUY3X7FB52LXPXK66RNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JS5OCNYUY3X7FB52LXPXK66RNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JS5OCNYUY3X7FB52LXPXK66RNS","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":"1ed83c54d6ce843ab88d2a8e56e08b146df660b38776a725b95117538102cf18","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T09:29:26Z","title_canon_sha256":"ffb5c140250136caf86b3c392b6c88d406b2c35ee0c4ab520577a18ac7ecdc19"},"schema_version":"1.0","source":{"id":"2607.27915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27915","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27915v1","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27915","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"JS5OCNYUY3X7","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"pith_short_16","alias_value":"JS5OCNYUY3X7FB52","created_at":"2026-07-31T01:34:47Z"},{"alias_kind":"pith_short_8","alias_value":"JS5OCNYU","created_at":"2026-07-31T01:34:47Z"}],"graph_snapshots":[{"event_id":"sha256:70614ea00db7cd6184b605b4803b204448bdb745aef995c51a373fc237207690","target":"graph","created_at":"2026-07-31T01:34:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.27915/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Finley A. Quinton, Franz G. Fuchs, Pascal Halffmann, Ruben Pariente Bassa","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T09:29:26Z","title":"Iterative quantum algorithms for the minimum vertex cover problem based on continuous-time quantum walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27915","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:e13c33fce7eac2ca5c8c7af86102d0e5bc24d57b43f63f2c4109cd5d4329e8cd","target":"record","created_at":"2026-07-31T01:34:47Z","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":"1ed83c54d6ce843ab88d2a8e56e08b146df660b38776a725b95117538102cf18","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T09:29:26Z","title_canon_sha256":"ffb5c140250136caf86b3c392b6c88d406b2c35ee0c4ab520577a18ac7ecdc19"},"schema_version":"1.0","source":{"id":"2607.27915","kind":"arxiv","version":1}},"canonical_sha256":"4cbae13714c6eff287ba5ddf757bd16cb6d932949a8a6d9afc7c18d943785546","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cbae13714c6eff287ba5ddf757bd16cb6d932949a8a6d9afc7c18d943785546","first_computed_at":"2026-07-31T01:34:47.468853Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:34:47.468853Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e13c33fce7eac2ca5c8c7af86102d0e5bc24d57b43f63f2c4109cd5d4329e8cd","sha256:70614ea00db7cd6184b605b4803b204448bdb745aef995c51a373fc237207690"],"state_sha256":"92b021cb026eaa6c704a6d59580919da660aeeab7b2e2c5bcca0a744f87e950a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOY/wpR3EsFb6p2HDZ1cpnZShVQ5KqdHpe/Pvaf1LwxcHJgvPu6mD/Bk6lHF796vktffIT/O//McC0fp7qh+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T14:47:39.375592Z","bundle_sha256":"682713ff5d5c0e6d5676c0c671d79644bb092c5c9691141f33083e5df5c45b17"}}