{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QMROEXLBZXWIBDSQX6IPFRZ7BA","short_pith_number":"pith:QMROEXLB","canonical_record":{"source":{"id":"2508.07007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-09T14:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"11a2b990b65bb7791b1216d3a8ebb28cf9d9ab89451d52863d3437930ef29037","abstract_canon_sha256":"521a55377a6a0bef62cd3047d7e99c64a99fd6de170a074c4448dea69a6edd13"},"schema_version":"1.0"},"canonical_sha256":"8322e25d61cdec808e50bf90f2c73f081bd33f28b91f916f8e08fb96ca6024de","source":{"kind":"arxiv","id":"2508.07007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07007","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07007v1","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07007","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"QMROEXLBZXWI","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"pith_short_16","alias_value":"QMROEXLBZXWIBDSQ","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"pith_short_8","alias_value":"QMROEXLB","created_at":"2026-07-05T11:51:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QMROEXLBZXWIBDSQX6IPFRZ7BA","target":"record","payload":{"canonical_record":{"source":{"id":"2508.07007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-09T14:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"11a2b990b65bb7791b1216d3a8ebb28cf9d9ab89451d52863d3437930ef29037","abstract_canon_sha256":"521a55377a6a0bef62cd3047d7e99c64a99fd6de170a074c4448dea69a6edd13"},"schema_version":"1.0"},"canonical_sha256":"8322e25d61cdec808e50bf90f2c73f081bd33f28b91f916f8e08fb96ca6024de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:39.159531Z","signature_b64":"orHKzr/ds9o1e0ABX1slL3jc61J76cAosw94fQwhPeZW5fIVf38LgKu2Od+HfpjHdyDdKXVK8QTly43zOmDmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8322e25d61cdec808e50bf90f2c73f081bd33f28b91f916f8e08fb96ca6024de","last_reissued_at":"2026-07-05T11:51:39.158883Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:39.158883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.07007","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-05T11:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecQB3sQ5/ULkrdVmQkm/C21U+hw5agzru9SVnOHAv/3fP/wQeOwm3n0W0Z3iiexyT37A86xF1X9m4VKcEx/yDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:48:19.131308Z"},"content_sha256":"2d72c965b46e713b03a8fd8be477aa8e54ec29d47ec26fc58a3cbf3efee3f7d2","schema_version":"1.0","event_id":"sha256:2d72c965b46e713b03a8fd8be477aa8e54ec29d47ec26fc58a3cbf3efee3f7d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QMROEXLBZXWIBDSQX6IPFRZ7BA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"F. F. Fanchini, F. S. Luiz, J. P. Papa, M. C. de Oliveira, Victor Hugo C. de Albuquerque","submitted_at":"2025-08-09T14:59:47Z","abstract_excerpt":"We present a novel quantum walk-based approach to solve the Minimum Spanning Tree (MST) problem under a maximal degree constraint (MDC). By recasting the classical MST problem as a quantum walk on a graph, where vertices are encoded as quantum states and edge weights are inverted to define a modified Hamiltonian, we demonstrate that the quantum evolution naturally selects the MST by maximizing the cumulative transition probability (and thus the Shannon entropy) over the spanning tree. Our method, termed Quantum Kruskal with MDC, significantly reduces the quantum resource requirement to $\\mathc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07007","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/2508.07007/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-05T11:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"op0lg8kNNwmfGCgYxpo/SkeZpPzMdONhDxPJ+ZxjxNgR9WS0/5rL4lT09K5RyNk2S1e1hmdblFDVc2q1R88ICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:48:19.131810Z"},"content_sha256":"7b7155b3429cf87e10a920553254b33a805f134d3b1fab2ebecaba55706ba826","schema_version":"1.0","event_id":"sha256:7b7155b3429cf87e10a920553254b33a805f134d3b1fab2ebecaba55706ba826"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMROEXLBZXWIBDSQX6IPFRZ7BA/bundle.json","state_url":"https://pith.science/pith/QMROEXLBZXWIBDSQX6IPFRZ7BA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMROEXLBZXWIBDSQX6IPFRZ7BA/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-04T15:48:19Z","links":{"resolver":"https://pith.science/pith/QMROEXLBZXWIBDSQX6IPFRZ7BA","bundle":"https://pith.science/pith/QMROEXLBZXWIBDSQX6IPFRZ7BA/bundle.json","state":"https://pith.science/pith/QMROEXLBZXWIBDSQX6IPFRZ7BA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMROEXLBZXWIBDSQX6IPFRZ7BA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QMROEXLBZXWIBDSQX6IPFRZ7BA","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":"521a55377a6a0bef62cd3047d7e99c64a99fd6de170a074c4448dea69a6edd13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-09T14:59:47Z","title_canon_sha256":"11a2b990b65bb7791b1216d3a8ebb28cf9d9ab89451d52863d3437930ef29037"},"schema_version":"1.0","source":{"id":"2508.07007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07007","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07007v1","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07007","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"QMROEXLBZXWI","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"pith_short_16","alias_value":"QMROEXLBZXWIBDSQ","created_at":"2026-07-05T11:51:39Z"},{"alias_kind":"pith_short_8","alias_value":"QMROEXLB","created_at":"2026-07-05T11:51:39Z"}],"graph_snapshots":[{"event_id":"sha256:7b7155b3429cf87e10a920553254b33a805f134d3b1fab2ebecaba55706ba826","target":"graph","created_at":"2026-07-05T11:51:39Z","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/2508.07007/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a novel quantum walk-based approach to solve the Minimum Spanning Tree (MST) problem under a maximal degree constraint (MDC). By recasting the classical MST problem as a quantum walk on a graph, where vertices are encoded as quantum states and edge weights are inverted to define a modified Hamiltonian, we demonstrate that the quantum evolution naturally selects the MST by maximizing the cumulative transition probability (and thus the Shannon entropy) over the spanning tree. Our method, termed Quantum Kruskal with MDC, significantly reduces the quantum resource requirement to $\\mathc","authors_text":"F. F. Fanchini, F. S. Luiz, J. P. Papa, M. C. de Oliveira, Victor Hugo C. de Albuquerque","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07007","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:2d72c965b46e713b03a8fd8be477aa8e54ec29d47ec26fc58a3cbf3efee3f7d2","target":"record","created_at":"2026-07-05T11:51:39Z","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":"521a55377a6a0bef62cd3047d7e99c64a99fd6de170a074c4448dea69a6edd13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-09T14:59:47Z","title_canon_sha256":"11a2b990b65bb7791b1216d3a8ebb28cf9d9ab89451d52863d3437930ef29037"},"schema_version":"1.0","source":{"id":"2508.07007","kind":"arxiv","version":1}},"canonical_sha256":"8322e25d61cdec808e50bf90f2c73f081bd33f28b91f916f8e08fb96ca6024de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8322e25d61cdec808e50bf90f2c73f081bd33f28b91f916f8e08fb96ca6024de","first_computed_at":"2026-07-05T11:51:39.158883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:51:39.158883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"orHKzr/ds9o1e0ABX1slL3jc61J76cAosw94fQwhPeZW5fIVf38LgKu2Od+HfpjHdyDdKXVK8QTly43zOmDmBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:51:39.159531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.07007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d72c965b46e713b03a8fd8be477aa8e54ec29d47ec26fc58a3cbf3efee3f7d2","sha256:7b7155b3429cf87e10a920553254b33a805f134d3b1fab2ebecaba55706ba826"],"state_sha256":"aba770ceb43daded3882c8ee6e44a06fb2e767ae7c7fd8f5e8498ae1c455ed8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6rVT8aNdQ6hKkG1QGuymLP548cMkVc779vcXAPCvK3tW2gxzvHFc/lATlCT8nKC+9mXc0GjateIzNUJ9s/jDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:48:19.135602Z","bundle_sha256":"f7a391f47503fe15556e64f81dd8a84daf0d563498940d920a3b178968330d11"}}