{"as_of":"2026-08-06T01:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:757e55aca9a08524f2b014f7eaf65c7728c9db45ecd3f4855701db7e9c5cfa52","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T18:54:58.735909Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2606.00541/citation-record","integrity":"/paper/2606.00541/integrity","json":"/paper/2606.00541/citation-record.json","paper":"/paper/2606.00541"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:54:58.735909Z","title":"The traveling salesman problem: a computational study,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:02a14749c4727bccd6bd465e3b937d53578773def5fc57b58ab5892be922f650","observation_id":"d4667c23-b1f3-4c02-ab8b-253d69d30a95","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"An effective implementation of the lin–kernighan traveling salesman heuristic,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:0178337468f5bbc1699d3d98380017d3fa356f19877a380d9a8e8da949c77cc5","observation_id":"1f239b9a-a16c-4515-8e9d-e7cc950393e3","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Quantum computing in the nisq era and beyond,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:674127740bd5dcb8da18707db9445130b2d9ea6319fb2ba5ffe1a158b9d75eea","observation_id":"6b550f76-b410-40dc-a731-90aee1117fd9","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Large-scale quantum approximate opti- mization via divide-and-conquer,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:a4cad20282e4caa5ca07dce3280a5703a4a310640f7dd253e73bcf494abe46b5","observation_id":"ace6e980-c656-4aaa-9499-b680837b690d","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Quantum-inspired evolutionary algorithm for a class of combinatorial optimization,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:4eb2e486e8f3c527b9787eb4b1598dac96e6d8ef25025f44de75df94670a42fd","observation_id":"2d73456d-e037-4d14-b9a5-08e4284c8f3a","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"A practical applicable quantum–classical hybrid ant colony algorithm for the nisq era: M. wu et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:27fadd5ea104e427bb0321e815c6f7b6263ba6446a36c7e71300d8b081ed762f","observation_id":"0c3ca5cc-0171-4565-98e1-5df30a94f0a6","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"A hybrid approach for solving optimization problems on small quantum computers,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:e41c20d5fbb5a6d09864b3157919daa53ee6ce3b6fe15051bf6dfbab649d9620","observation_id":"99cefad5-8f0f-44d5-a8ab-3622dd7ba2ab","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Divide and conquer for combinatorial optimization and distributed quantum computation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:85061bccf60d1defaad4fc324c69026f5a649dcee0d2e6c5e12abe173fd35e2f","observation_id":"7482980b-2d14-49a3-b737-41fe464a47ca","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Hybrid quantum solvers in production: how to succeed in the nisq era?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:7f136b209bff78faccc3d3a990d7b7fa3d6bedd572de318cf1a62593651db0c1","observation_id":"63fba10c-5df1-41c4-a9d3-1e7f3e90b5da","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Noisy intermediate-scale quantum algorithms,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:179005558787636d5c4595c04f8eef3d39c9b899498ea013645c6c36cdc654af","observation_id":"f4d241f1-8185-40bc-9b05-2f18be8fa047","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Nisq-compatible approximate quantum algorithm for unconstrained and constrained discrete optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:26ad3ae4b665b75b0d01f9640304e00301b84ebd235b57c2d35d33d44302093c","observation_id":"c6fecba0-d070-44b7-977f-e524f1d1ec4b","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"A review of recent advances in quantum-inspired metaheuristics,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:62ca983fd9b77b57812a5e0e00a23c97e8fcd910a6ff63e9aa0da9e4ac7abaf6","observation_id":"cdb2b53f-bff2-4e0d-b7d4-5f0958a81ab1","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"A memetic quantum-inspired ge- netic algorithm based on tabu search,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:f35683b71142cb24f6a566470a25fb90e317d94dc6e7b8af847012f41e5bf472","observation_id":"3bf7c79a-3fbf-404f-a936-b15a6d9021bd","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"A survey of quantum genetic algorithm for combinatorial optimization problems,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:fe40394d02e64d4dc37487bd0dff452186518e9fd1a60a727303fac3a0d76c93","observation_id":"e66d36a5-b591-474d-9d8f-f1954baa3a38","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Quantum-inspired evolutionary algorithms: a survey and em- pirical study,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:0f340fe5bab8bcdc5d802932e6f7f2f09487dacd78f1ad238f3ee2a646139bd7","observation_id":"6f5faeda-43ea-48df-91e6-21a57d9801d2","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Quantum rotation gate in quantum-inspired evolutionary algorithm: A review, analysis and comparison study,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:c76367201185abd1929a1240a7e675b166c6b2bb8ff037fbc2051f772ab6ae24","observation_id":"831a902b-2c7a-4b9b-afff-f49e9aaf2736","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Quantum-inspired evolutionary algorithms with a new termination criterion, h/sub/spl epsi//gate, and two-phase scheme,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:b32bf8372094876c3f7ebf2405d4778b09e29e1bb0aa33d27a0a69c20947d980","observation_id":"a3f133e3-2eb5-4871-9a4c-3ca42d63f711","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"A fast quantum mechanical algorithm for database search,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:17c28af9aa9a7749cf2708238dfc04467367e2589c542da0ba0f36d3d16ef2a2","observation_id":"122a4119-4388-419e-8282-aa0db659ce4b","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Variational learning of grover’s quantum search algorithm,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:492228e3807c3b4d3e375c4fb5f04e4c65ca644fcc7ebc20e50aa4fac74ff877","observation_id":"04f531c4-ce62-4ff8-a98e-6008720a7e4c","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Function maximization with dynamic quantum search,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:a71020c14f5b00a2e37ccba7571aad0092b20b58e70f0dad5ba93533ac4ddb77","observation_id":"f825f28d-11da-4e11-a753-7bb363b151b9","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Applying k-means clustering and genetic algorithm for solving mtsp,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:0fdeb7a98705bd3a2a46d46cf6b5df92a08844907f4615cce1a2c34344e11d62","observation_id":"fe081343-28c9-4dc9-968c-c524e0f40b70","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Intraclustsp—an incre- mental intra-cluster refinement heuristic algorithm for symmetric travel- ling salesman problem,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:f3038653e89a9802ec9ea17ae15bd2ef6e42f1eba1c1b5dd65722cf5eca3a113","observation_id":"278b5006-2907-45ee-9235-3680e03c9911","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Feedback- based quantum optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:b8158a533a21a2e8d8bf29954fd4d2e09d6b3f0ccc6f614d74130a19b825c0c6","observation_id":"6bf9a624-6561-4ad9-a52b-9334d61ef4f9","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"The traveling salesman problem: a case study,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:5cd296e055d791c4133868015687860dd6711fdf4ab696b7e2f5ef2322c6953b","observation_id":"46d23f1e-abfb-4c97-a849-f85e9575c975","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Grover adaptive search for constrained polynomial binary optimization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:69a5b169d3b9a3db25bc55f1ca680c6b8a21f58b641db571ee84d8bbc913a9f5","observation_id":"ce8738ab-f223-4bf1-903f-652438865193","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Hybrid quantum-classical multilevel approach for maximum cuts on graphs,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:d63e62539896e0d069df00df30826675dac12901b5179ae3e14516babbcd56a0","observation_id":"09432d91-ccca-4b27-bb4e-1c29c6974081","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Continuous optimiza- tion by quantum adaptive distribution search,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:87ed300bf3e193bec66094ead76ab9177d8b7b54f05b382656758d6e01fb7db2","observation_id":"96037d3a-54a0-4fb6-b18e-6d39bd9f9a8c","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"An improvement to the 2-opt heuristic algorithm for approximation of optimal tsp tour,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:538a18dd038c07eb7d80770b2b65b618fb5ac68b584b0a7b33337a90cf4f00d4","observation_id":"f5804429-b634-461b-adec-249ca5a0d932","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Ising formulations of many np problems,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:0ce226aaa6dc54f852c5278cdaf909a2f07b0de5fa491ed2dd57f971e53de671","observation_id":"f836d617-ed9d-433f-9646-35b6da5828ef","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"A qubo model for the traveling salesman problem with time windows,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:a5193702f2d7f7697738f04b86ad0f8474b2fecf0099ecdda4644342e7caf0a1","observation_id":"36d802bc-28cd-45d4-9681-f0709e8c8687","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Variational quantum algorithms,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:0c182cffdb334c94d4daba1e9a28bb74d1848920d764070c589e2a9b2a391a78","observation_id":"88b0b3a7-0702-458f-8ba2-3f4aea1ad686","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:0b5dc49126bae4213909b87d3fd1b8f20ac79731382ca24103ec5ab3e62932cf","observation_id":"0e932c01-afe4-4721-b6e3-b7a6aea53f0e","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"Tight bounds on quantum searching,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:6f067afd809463fb000261e189f64558e59261b333a2900486573aee3c707e24","observation_id":"31ec0add-3268-4541-ac51-611484c2309e","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","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-06-28T18:54:58.735909Z","title":"The theory of variational hybrid quantum-classical algorithms,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:a13214587b02d6349cf43a89b490ccd218cbff3ae66214825b4e23e525bbb44f","observation_id":"5e1f20ec-4f39-49c3-8f8b-875ad2deab9c","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15926","last_updated":"2024-09-24T09:47:28Z","snapshot_observed_at":"2026-07-06T19:21:03.775247Z","submitted_at":"2024-09-24T09:47:28Z","title":"QHyper: an integration library for hybrid quantum-classical optimization","version":1},"cited_work":{"arxiv_id":"2409.15926","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.15926","snapshot_observed_at":"2026-06-28T19:42:35.942273Z","title":"Qhyper: an integration library for hybrid quantum-classical optimization,","venue":null,"work_id":"3871523c-b6ec-4049-801d-302a39cfe0e6","year":2024},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"cited_paper":"/paper/2409.15926","citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:aef1582481cf47465789e3ae0a55360cc0394dc2d991f59173179a4944b0a193","observation_id":"4bb8b575-e51f-4f71-8727-5ab0da925035","resolution":{"observed_at":"2026-06-28T19:42:35.943991Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-28T18:54:58.735909Z","title":"Solving nonnative combinatorial optimization problems using hybrid quantum–classical algorithms,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T18:54:58.735909Z"},"links":{"citing_paper":"/paper/2606.00541"},"observation_digest":"sha256:618a8e627dbcb4cd0c0c31482e7387b1de14cd1fcd24d4d308cc1ddb10401c7b","observation_id":"54ae6767-f2b9-4b96-a689-d00ba0eeae64","resolution":{"observed_at":"2026-06-28T18:54:58.735909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.00541","last_updated":"2026-05-30T05:17:07Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T23:41:15.410587Z","submitted_at":"2026-05-30T05:17:07Z","title":"A NISQ-Aware Hybrid Quantum-Classical Framework for Scalable Combinatorial Optimization"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":36},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2606.00541."}