{"as_of":"2026-08-18T10:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2fcbead33462cae1c090d580177045be6c64225252ca8a6b6fa57df528671f53","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:32:07.806280Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T18:59:11.580304Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.07007","snapshot_observed_at":"2026-08-03T18:59:11.580304Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.02940","last_updated":"2026-05-23T13:30:26Z","snapshot_observed_at":"2026-08-10T00:49:36.581242Z","submitted_at":"2025-12-02T17:04:57Z","title":"Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T18:59:11.580304Z"},"links":{"cited_paper":"/paper/2508.07007","citing_paper":"/paper/2512.02940"},"observation_digest":"sha256:f1be342925d3afe052857d62224224ddb922383f5a070e39df6a69fe89eb5e4e","observation_id":"ba1d02c4-1b8b-497b-8fee-1edf3e17737f","resolution":{"observed_at":"2026-08-03T18:59:11.580304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.07007/citation-record","integrity":"/paper/2508.07007/integrity","json":"/paper/2508.07007/citation-record.json","paper":"/paper/2508.07007"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.378375Z","title":"For any partition of V into S and V \\ S, the edge of minimum weight crossing the cut belongs to some MST","venue":null,"work_id":"98fd9912-54eb-4a78-b559-6fd9b0251deb","year":null},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.679884Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:e690518482a8a9902530ced3f6a2680eff1c672e7557f0a0d4c38a149837f3f6","observation_id":"2e5205f5-8c4a-4e2f-ae2b-f8c36cf89e00","resolution":{"observed_at":"2026-08-05T22:32:08.381532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.369695Z","title":"non-Markovian","venue":null,"work_id":"f738bf48-2221-44be-96e6-63e963a898cb","year":2012},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.683420Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:42b9112ac7d47a722313e9d7cf6e44730315c03e5a89982114ab73bfd130742f","observation_id":"a66705b7-b0c9-496a-93ef-2cc573a01677","resolution":{"observed_at":"2026-08-05T22:32:08.372465Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.360485Z","title":"Castillo, Process Optimization: A Statistical Ap- proach, International Series in Operations Research & Management Science (Springer US, 2007)","venue":null,"work_id":"817ab724-20f5-4ab2-b90d-f9f8028ed834","year":2007},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.687653Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:f7767dbd6d7e35d99c1c0718dbbc940734857769dc64b96bf5a66dba1f5142d8","observation_id":"ef5bf9e6-f227-463e-864d-c68486cca366","resolution":{"observed_at":"2026-08-05T22:32:08.363434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.691080Z","title":"Lucas, Ising formulations of many np problems, Fron- tiers in Physics2, 10.3389/fphy.2014.00005 (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.691080Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:d9ccd24471994794007fd620e4af974cc0cf9e2faad08a6ef67f0260786b9922","observation_id":"9148fc6a-b641-47e3-a7d6-9f1c7c64181c","resolution":{"observed_at":"2026-08-05T22:32:07.691080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.352044Z","title":null,"venue":null,"work_id":"841b1a6d-11f8-4934-9668-c70416350895","year":2001},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.694233Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:d3d800ab6e81762385452251f60c96302152eeaf51ea295219a29ea4fa9b9bd2","observation_id":"12fceba9-ed9e-41f2-95c6-4f9f0a6f9fdc","resolution":{"observed_at":"2026-08-05T22:32:08.354796Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.343328Z","title":"Fowler, Improved QUBO formulations for D-Wave quantum computing, Master’s thesis, University of Auck- land (2017)","venue":null,"work_id":"00ebf5e6-deec-461c-b9f4-7fe20bb0de5a","year":2017},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.697318Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:806069e5e95c6661eb899b8db20b7935b39427a4c7343e0c2927de35453877e1","observation_id":"529e0bc9-8e08-42db-b304-f1da2ce1207e","resolution":{"observed_at":"2026-08-05T22:32:08.346459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.334349Z","title":"Graham and P","venue":null,"work_id":"9a74b643-fb5a-428c-9485-5212be106cd2","year":1985},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.700273Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:d83fca002c6dd244d05d3d925a1018c71a1fcad323a105c08c0ef0b605922493","observation_id":"19bb2465-3eae-4d7e-8b5f-7b98777be384","resolution":{"observed_at":"2026-08-05T22:32:08.337207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.325768Z","title":null,"venue":null,"work_id":"88b8a8cc-90a0-446c-bce3-e42745936430","year":1978},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.703561Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:8764666481ab39a17ab31b9ea708b72b1bf9c6abbfd8166c24e8473f754687a2","observation_id":"fde6415d-c23d-4483-b0f6-241700133dbe","resolution":{"observed_at":"2026-08-05T22:32:08.328589Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.316951Z","title":null,"venue":null,"work_id":"d0a8c529-dd02-4505-a1f4-de42d3823dd6","year":1969},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.706433Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:f8d1bfb4278de38762788f07eb469197649c07b779d438d8bb84af5f08af76e3","observation_id":"a2ead76e-38b5-4df0-b345-74fb3d6d521f","resolution":{"observed_at":"2026-08-05T22:32:08.319922Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.308222Z","title":"Asano, B","venue":null,"work_id":"4551d6e3-9309-4ca2-bde8-23e4f4222d5d","year":1988},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.709186Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:a7140bbbbe8e8f20857745b9a0ecb95b0fe17b787f6aad335cdc25acfc3f64e7","observation_id":"0d46f9c3-7aac-4470-b297-4538f3e046b5","resolution":{"observed_at":"2026-08-05T22:32:08.311131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.298702Z","title":"Päivinen, Clustering with a minimum spanning tree of scale-free-like structure, Pattern Recognition Letters 26, 921 (2005)","venue":null,"work_id":"97b8b51f-0bb4-4002-9603-b23f8e44bc34","year":2005},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.711887Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:02ca1809dcac21d19dd537011b9b8ae7c9afe0deb5290ad285cdce47caeb0fe5","observation_id":"5203de89-6760-48df-9afc-8412110efc57","resolution":{"observed_at":"2026-08-05T22:32:08.302454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.289641Z","title":null,"venue":null,"work_id":"bd8fbecc-b7f0-4cda-a24a-f3750763456f","year":2009},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.714893Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:59d35702fa0b5e87534da28ac6f534b3004f51d4fd76586ecb42a512d85e4ae5","observation_id":"0fedb453-2874-4c60-9c9b-be061a6a359b","resolution":{"observed_at":"2026-08-05T22:32:08.292364Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.280454Z","title":null,"venue":null,"work_id":"23d43350-34a6-448f-b20b-146548cfc96f","year":2012},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.717564Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:d5ee25b8bb77bf73b4ec7d09eb9f39d7cd0db1142bef4ee7e582fee1598fce86","observation_id":"b31acb22-1a06-44f3-b55f-2803021bc29b","resolution":{"observed_at":"2026-08-05T22:32:08.283530Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.271105Z","title":null,"venue":null,"work_id":"387420b6-b6a3-4c5b-9377-cc74d4302575","year":2002},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.720361Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:d75ab6fb772825707133ecc509b962cd2122083c51fb05db24371ee1343289b6","observation_id":"3d160955-6ea0-49fc-b158-7879cd528eb2","resolution":{"observed_at":"2026-08-05T22:32:08.274273Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.261289Z","title":null,"venue":null,"work_id":"02e5acf6-3ab3-4ef5-854d-34eab67df679","year":2014},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.722992Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:048357cf57aa9fb834ab29a267034cfc370955ecfc6b8158142ef68f1aefb32c","observation_id":"76b239e3-26fc-4a4a-9601-a678c9d29030","resolution":{"observed_at":"2026-08-05T22:32:08.264202Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.251811Z","title":null,"venue":null,"work_id":"2fd9b97d-4d40-4e93-b88b-e66046e5a2cc","year":1999},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.725514Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:7a9849c65c144e3ab5734df2ac86e2bd5dda9a5b7ad19750f9379c7e5c53fb75","observation_id":"cfad0e5b-de29-4886-9d4d-05389d49570d","resolution":{"observed_at":"2026-08-05T22:32:08.254888Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1080/13658810600665111","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Assuncao, M","venue":"International Journal of Geographical Information Systems","work_id":"dc7aac83-f913-40df-9d08-b7237df57b8f","year":2020},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.728259Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:db9f8b5c4ce284d1d454ed53638e86c442974df9c74000efbbd10b6fb76f8f07","observation_id":"218803e0-8342-480a-b1dd-17888678fd21","resolution":{"observed_at":"2026-08-05T22:32:07.972736Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.240842Z","title":"Suk and O","venue":null,"work_id":"96148789-288b-415b-8ba1-341c7c539dfe","year":1984},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.730979Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:534f63010c5ee114fcfc230b6926ef6a1cfd31485851da3ff7c64df686141a11","observation_id":"bbae1542-58f6-4ced-9ecb-c04daa8f8476","resolution":{"observed_at":"2026-08-05T22:32:08.245279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.231760Z","title":null,"venue":null,"work_id":"883cc81f-f26a-45f3-a1ac-eaf45cdf793d","year":1956},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.733659Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:fedbd3a185b092e4da1819af90309cb92148c8506add0ef04a8a4492455eb6ef","observation_id":"ecc6e5a1-9ab9-4e80-b53f-07a54f972d67","resolution":{"observed_at":"2026-08-05T22:32:08.234661Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.222541Z","title":null,"venue":null,"work_id":"bd668fd0-06b6-468a-a57a-8346c98a005c","year":1957},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.736444Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:af8e93907eb3e8ee314a90488da238182ecc85eee0437dc6f783db34d112a1f0","observation_id":"0e56027e-d3b5-4088-b5bf-d1a75641d362","resolution":{"observed_at":"2026-08-05T22:32:08.225638Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.739189Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.739189Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:3d576ff14cdbc89688744da23edd3c460fa26b3020deac78fd75a6cc8c68a2ac","observation_id":"36521b8a-2d8f-45ae-b2d4-cab8f06b9547","resolution":{"observed_at":"2026-08-05T22:32:07.739189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.741809Z","title":"Zhou, S.-T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.741809Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:b76e222fd836ef9c9ec5321c5000417cde352c6b96532b924cca2748447686f9","observation_id":"6ce30c6c-a396-44ab-9bc0-bec608675f46","resolution":{"observed_at":"2026-08-05T22:32:07.741809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.201378Z","title":"Squartini and D","venue":null,"work_id":"3f739b30-b917-484e-8657-54ec6570a889","year":2017},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.744325Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:84f1464f4d571baa0668deffffaed0bf27e3c6b2386997befc10d9e765eb9c78","observation_id":"af1043a5-5f9f-4aa4-bc35-29cd740d8b43","resolution":{"observed_at":"2026-08-05T22:32:08.204360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.746892Z","title":"Farhi and S","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.746892Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:a92a81c41028fbe6ceab8a66aa004298515772952719832fbada65bb3d3e1627","observation_id":"aa652951-28f6-45f2-bdde-bf3b8fd023c2","resolution":{"observed_at":"2026-08-05T22:32:07.746892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.749431Z","title":"Schulz, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.749431Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:cb65ca95404387b2a1e816ae721b354f09ea5fe85bc638cfa66ad6f29bcb480b","observation_id":"a9e303d5-14ee-4f89-b4a8-0711faca1f3b","resolution":{"observed_at":"2026-08-05T22:32:07.749431Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.752232Z","title":"Scully and M","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.752232Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:62bff04784b911d8820d6e756210058ce762e037a0bdec219adcebbabceb6b22","observation_id":"5909bcb1-e7d1-4699-924e-6c021c8ba08e","resolution":{"observed_at":"2026-08-05T22:32:07.752232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.754886Z","title":"Qiang, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.754886Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:8b7814a7c7873748928c14f2ec2bfa69f5568b047dee3fc40adb7a6a45941f11","observation_id":"eb1b558f-c9ea-477b-a932-896fd6850ace","resolution":{"observed_at":"2026-08-05T22:32:07.754886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.179180Z","title":null,"venue":null,"work_id":"521a9157-f104-4a4a-82f8-a7f0f183a490","year":2002},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.757819Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:0c447ce161eed9f35481c04af87bb386ced27cbb8c50035d38486f0ebe642c39","observation_id":"31affd64-2581-4b55-b119-08f9b55ad67a","resolution":{"observed_at":"2026-08-05T22:32:08.182667Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.169200Z","title":"Hatano and M","venue":null,"work_id":"800017cb-892f-414b-b2eb-2a3fe9ff1a60","year":2005},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.760545Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:41fb519fb867803b92aef60dcdf7e4f2deaefa15f2ef2668c5e13164726d18d9","observation_id":"b3779619-e5db-4233-8fdc-df1fab7c147c","resolution":{"observed_at":"2026-08-05T22:32:08.172411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.160282Z","title":"Sinatra, J","venue":null,"work_id":"e84fe2df-f044-44a2-8210-a79471834ff4","year":2011},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.763298Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:62e89563fdcbb5ae9981c2a6228f08ad155027cbbe5e26dae4669d3a96c5993f","observation_id":"7865ce15-93a8-45bf-96ba-c2a8de00f99d","resolution":{"observed_at":"2026-08-05T22:32:08.163155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.150719Z","title":null,"venue":null,"work_id":"481f8b7f-5e55-498d-8b58-6ba27667f375","year":2009},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.765846Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:08cb198e4b7250ee17a0ee9f8c3f303885aa8b7c03aac7a29a7d5cdb9fd41f7a","observation_id":"178fc7b8-8c8c-466f-ac66-9fddeea07a02","resolution":{"observed_at":"2026-08-05T22:32:08.153541Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2203.05274","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Duboux and Y","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","work_id":"6ec4fc9c-145e-4a7a-bc53-db0aee1d0bb9","year":2022},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.768635Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:49dbecbf117ef837e9ced876f6aa689517bb4fdf0606d53b339cc3a50c44cc9e","observation_id":"10bded46-068c-4ae2-99f5-b1712f85670f","resolution":{"observed_at":"2026-08-05T22:32:07.948914Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.141501Z","title":"Chakraborty, L","venue":null,"work_id":"12e8c5b4-7ef1-407b-b791-4464080e25bb","year":2016},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.771493Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:7a12421fe0fef1883d87e28a7c409bd3051126e328ce0159c6f0c6c8b46a63d7","observation_id":"e3f8c588-04e3-4625-96d6-19a8e7bc759f","resolution":{"observed_at":"2026-08-05T22:32:08.144694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.131803Z","title":null,"venue":null,"work_id":"23bb1902-3168-4bed-9dab-3a33222dca5f","year":2009},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.774148Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:cebc8855942c769a111791f1a8800b2cd4366c34fe648c186463721457ce4f5b","observation_id":"60575500-cb04-41ab-a5f7-63414ed12c0c","resolution":{"observed_at":"2026-08-05T22:32:08.135104Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.776779Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.776779Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:a311a23ec16713a206d1e9b2ccdd78b4041b07cdc6781beb48e4711ecbe8f6d3","observation_id":"0c3c1ab7-e284-4f88-8bba-aefc4b34b326","resolution":{"observed_at":"2026-08-05T22:32:07.776779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.779559Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.779559Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:3c0ff6d101f9b06b3bc950bfb33252fe8b027b88894a37c04f717a0ac2985d85","observation_id":"1c6069c7-15bd-4d2d-9ca0-62bb1bea8242","resolution":{"observed_at":"2026-08-05T22:32:07.779559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.782236Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.782236Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:9d71c0f138b37bd367abc828df3c025052dcddc4add43d971befba44470f642d","observation_id":"169364fa-c7ef-4ac7-8dec-e875697249b1","resolution":{"observed_at":"2026-08-05T22:32:07.782236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.784987Z","title":"Golub and C","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.784987Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:a25b6f2b66b9a1da19144359738ebb500ed874a84a332830da246c6ebf3f7bf2","observation_id":"0e6d92af-8a8d-4d19-b870-74c63ae4406a","resolution":{"observed_at":"2026-08-05T22:32:07.784987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.104460Z","title":"Cormen, C","venue":null,"work_id":"827e7bff-d912-4b78-9025-cc8fd4f8db1c","year":2001},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.787595Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:72842fac59c0a2d381aef6a0ce06afcb10ecd09c698a8a231d262f37d23b7e82","observation_id":"99e014fd-b9c7-4afe-bac8-5ee325c67269","resolution":{"observed_at":"2026-08-05T22:32:08.107522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.095168Z","title":"Tarjan, Efficiency of a good but not linear set union algorithm, Journal of the ACM (JACM)22, 215 (1975)","venue":null,"work_id":"7f7126a6-a343-4312-8e06-9de7e96323cd","year":1975},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.790430Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:99ee4295cba453dc01330cd4eb1dc5ccb72b600be3711f265c51249af75ca59c","observation_id":"4fbda83e-fc6d-4e7d-b5d5-b9a31d2d95bd","resolution":{"observed_at":"2026-08-05T22:32:08.098294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:07.792923Z","title":"Motlagh and N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.792923Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:95d1d9ee4ec5e63fbb83da808774a5c84e5e57a50523de8d479416da6d72b132","observation_id":"cd6aee10-2578-42dc-8062-e6de94fa9513","resolution":{"observed_at":"2026-08-05T22:32:07.792923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.079379Z","title":null,"venue":null,"work_id":"f7f330e7-5ee8-4b10-9913-c471ed514283","year":1995},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.795382Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:c3fea4d412006d87d570415a1e445609ce12556e0b9bee949d3f060bd70d6032","observation_id":"1c6efac9-91ce-48d6-99fc-f104f46af468","resolution":{"observed_at":"2026-08-05T22:32:08.082358Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.069598Z","title":"Beals, S","venue":null,"work_id":"5f3cc82a-d72e-483b-94d4-a68f928948c0","year":2013},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.797942Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:9dd74b608bf1097337b913c5b0ee16352112dddefb517d8104941bf49c2fd2d6","observation_id":"9db33f4a-59dd-4e73-9f90-807d9775ec3a","resolution":{"observed_at":"2026-08-05T22:32:08.072778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.060472Z","title":null,"venue":null,"work_id":"f00d6eb3-a016-4692-9582-51201d55b474","year":1948},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.800852Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:a2f27f7068d3c17f4729cd575515ccc76837e8e963155ed2ec3c914bc8cbc1b2","observation_id":"17f173d2-2bca-4a26-a2d4-2e31c12bce08","resolution":{"observed_at":"2026-08-05T22:32:08.063461Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.050425Z","title":"Cayley, A theorem on trees (Cambridge University Press, 1888) pp","venue":null,"work_id":"2b698453-16ef-4ff9-8ed7-0c432aef5e60","year":null},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.803566Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:0389e5398bdac138b4ce6f7443f4f2433fce26da975c73b0181f4569d9fa24e3","observation_id":"065f0ac7-4caf-4771-8143-920ad6ebaf5c","resolution":{"observed_at":"2026-08-05T22:32:08.053839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T22:32:08.040733Z","title":null,"venue":null,"work_id":"9f06bf59-c5fe-4cb0-a9e2-1a0c5adb594f","year":2013},"citing_paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T22:32:07.806280Z"},"links":{"citing_paper":"/paper/2508.07007"},"observation_digest":"sha256:6014d4042125fbd6aedec2f3b6cc2cf0bb744bbc060e2858c1ba645deaa94ff5","observation_id":"483d1375-06ea-4923-9a7e-f174c8356137","resolution":{"observed_at":"2026-08-05T22:32:08.043758Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.07007","last_updated":"2025-08-09T14:59:47Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T06:50:10.001343Z","submitted_at":"2025-08-09T14:59:47Z","title":"A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":2,"verified_fuzzy":15},"total_outbound_references":46},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 1 inbound Pith citation observation for arXiv:2508.07007."}