{"as_of":"2026-08-11T02:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74e067779272bb8044b8b9c5d87a13597e0a158f3f2452885eb37c1e87dc0207","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:33:15.956057Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2602.07913/citation-record","integrity":"/paper/2602.07913/integrity","json":"/paper/2602.07913/citation-record.json","paper":"/paper/2602.07913"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T03:33:15.345107Z","title":"Approximation algorithms for the set covering and vertex cover problems,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.345107Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:484a80ec79d1d8b206861f49a21c2c118cc009bd17688cac223bf32f81dcd322","observation_id":"fab4d098-9d0b-4fc4-bec6-05d50690600c","resolution":{"observed_at":"2026-08-03T03:33:15.345107Z","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":"10.1007/978-3-030-54621-2_599-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hoffman and M","venue":"Encyclopedia of Optimization","work_id":"de4dd1e0-7035-4bcf-ad92-efdeb64b48f4","year":2025},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.394837Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:4530ef9c54a521775a3e0e7a05e9ef61e82b0df172d00b5bdbf8f106f15d9c4c","observation_id":"3e1beb32-8d2d-4a58-84b9-4733e26b64b1","resolution":{"observed_at":"2026-08-03T03:39:13.359278Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-03T03:33:15.448503Z","title":"Conflict-based search for optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.448503Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:179578a53a5aefeba5fff5cdb6f255f7a196db0ed08e04b5d72126532f4404a9","observation_id":"aeb03487-4c67-4494-b0ce-5c3577736b8b","resolution":{"observed_at":"2026-08-03T03:33:15.448503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.08291","last_updated":"2019-06-19T18:17:14Z","snapshot_observed_at":"2026-07-06T08:01:30.099981Z","submitted_at":"2019-06-19T18:17:14Z","title":"Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.08291","snapshot_observed_at":"2026-08-03T03:33:15.484750Z","title":"Multi-agent pathfinding: Definitions, variants, and benchmarks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.484750Z"},"links":{"cited_paper":"/paper/1906.08291","citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:ed75803b2060870fbb10a8b5142b126d26560bcda0d27c666219682b812827e8","observation_id":"70dff7c9-ddd1-4a19-8030-8c40379255d6","resolution":{"observed_at":"2026-08-03T03:33:15.484750Z","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-03T03:33:15.527449Z","title":"A survey on coverage path planning for robotics,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.527449Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:66b0931724e8bdceb2bc7d9eb31a3545a953e0a82674ed0f2a029a7a1fba2c48","observation_id":"5a6e662c-990d-4608-b93a-ee79ff4b9988","resolution":{"observed_at":"2026-08-03T03:33:15.527449Z","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-03T03:33:15.575067Z","title":"A quantum approach for cov- erage path planning in multi-vehicle deployments,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.575067Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:86f9d5d68b33df3093a3d103a2bd093be2f422612e870e2c82ff99bbea83f363","observation_id":"05a1204e-cee4-4d58-84ed-4e1ddf50d7a6","resolution":{"observed_at":"2026-08-03T03:33:15.575067Z","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-03T03:33:15.644752Z","title":"Ising formulations of many np problems,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.644752Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:83e95056f3ea96bf2287a8f322a9c10fa6a843657594a87c7727ad8536f36fcd","observation_id":"be4bae49-1ef0-4d88-b8b9-ea2b88dc6911","resolution":{"observed_at":"2026-08-03T03:33:15.644752Z","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-03T03:33:15.694753Z","title":"Quantum bridge analytics i: A tutorial on formulating and us- ing qubo models,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.694753Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:f3cd9853e8b82d78394e187ef5e5211058d3e9cfba92c6e55e3150c2e99c632d","observation_id":"bbfece3a-50d3-4245-abbd-53b631080f0f","resolution":{"observed_at":"2026-08-03T03:33:15.694753Z","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-03T03:33:15.754755Z","title":"Quantum annealing in the transverse ising model,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.754755Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:2507b227b5637c14198df17423dbe8ddb835366a237d0aa7d80209d3153dfb4b","observation_id":"d0d62035-56cd-4599-90bc-3c420bfe1d70","resolution":{"observed_at":"2026-08-03T03:33:15.754755Z","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-03T03:33:15.804751Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.804751Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:64f0ee499c783b79efb4428439fa56d4aebf08567ecffd6b99a3427bc9a00fed","observation_id":"71945046-be1e-4c0b-9e64-582594dd579f","resolution":{"observed_at":"2026-08-03T03:33:15.804751Z","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-03T03:33:15.844676Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.844676Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:33ec7cbd50c52d5c08b2d17dcd72b4e5417e0bf1351b1beb005cfac4daff5c14","observation_id":"336e57c7-d29a-4795-9238-8a619ee2c90b","resolution":{"observed_at":"2026-08-03T03:33:15.844676Z","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-03T03:33:15.884991Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.884991Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:66a3f81331d356740ca8f8202f5fa0e5a54441ffff51480af071427787b7d241","observation_id":"fcb88773-5380-46c4-bb06-cce9d138c439","resolution":{"observed_at":"2026-08-03T03:33:15.884991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.09844","last_updated":"2017-05-27T17:09:56Z","snapshot_observed_at":"2026-08-09T06:16:52.025374Z","submitted_at":"2017-05-27T17:09:56Z","title":"Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.09844","snapshot_observed_at":"2026-08-03T03:33:15.894187Z","title":"Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.894187Z"},"links":{"cited_paper":"/paper/1705.09844","citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:d32f5f525574c6428f3b4c5e4edc4d76a1ae5fa58b960071a3436681984a1bc3","observation_id":"b0153e2b-558a-47d0-ade2-4e99422cede7","resolution":{"observed_at":"2026-08-03T03:33:15.894187Z","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-03T03:33:15.901066Z","title":"Ehrgott,Multicriteria Optimization, 2nd ed., ser","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.901066Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:4e4747a2dfa326d91e950ddaf9e40f35f429d649497f01617d3390898b8bd9a8","observation_id":"f8f2b912-7e15-4c53-88fd-ec9a0df9e486","resolution":{"observed_at":"2026-08-03T03:33:15.901066Z","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-03T03:33:15.908660Z","title":"Osmnx: New methods for acquiring, con- structing, analyzing, and visualizing complex street networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.908660Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:61f100f159fcb40ffcfbe6f477f2754273c22fe8a00113bcd8d2a53f00a46f32","observation_id":"c86b60be-b41e-40ac-ad22-6c70308457fa","resolution":{"observed_at":"2026-08-03T03:33:15.908660Z","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-03T03:33:15.913291Z","title":"Valhalla: Open source routing engine,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.913291Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:ca789692edfb809967ff69f5e04f8f79c24187a855278ba55ae946d345588725","observation_id":"2137981e-3e6b-4876-af14-eaeea1aa4fa7","resolution":{"observed_at":"2026-08-03T03:33:15.913291Z","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-03T03:33:15.921029Z","title":"Gurobi optimizer ref- erence manual,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.921029Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:ae6635b3f481f14232dd426e3eec24b4982703bfd2b0dc747f50eb7a0307e1d7","observation_id":"dd11836e-a1a6-45cb-bf76-fa1aa21ca7fd","resolution":{"observed_at":"2026-08-03T03:33:15.921029Z","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-03T03:33:15.925685Z","title":"Op- timization by simulated annealing,","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.925685Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:a2e24a531bcd23ccc08cf5b78ede0fc6f7b7bbe814cdd972f17caca30eef5158","observation_id":"c8a3d22b-3cfb-4503-907d-014a5e30253e","resolution":{"observed_at":"2026-08-03T03:33:15.925685Z","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-03T03:33:15.929998Z","title":"Hybrid solvers for quadratic optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.929998Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:4455f4b59d102386c59bc64f755218a734dc5f3339ed07a20ebf719705105876","observation_id":"b38aaef9-c39d-41b4-ac60-d6b0a7c77400","resolution":{"observed_at":"2026-08-03T03:33:15.929998Z","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-03T03:33:15.933974Z","title":"Advantage2 4400q quantum computer: Technology overview,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.933974Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:1b7dc56c7490d2bbeea2ea9759f48eecfc50f9c1d78a8b03b2513685724ab558","observation_id":"3ab2b828-e04c-496d-9b24-6a13518db572","resolution":{"observed_at":"2026-08-03T03:33:15.933974Z","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-03T03:33:15.941494Z","title":"Minor-embedding in adiabatic quantum computation: I. the parameter setting problem,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.941494Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:e6e2c5e156065f0379b0975e420b8e9222cd6626b76aa6cfcb1734564364c9e9","observation_id":"ed579c75-41b5-47e0-8c0b-9766133eb721","resolution":{"observed_at":"2026-08-03T03:33:15.941494Z","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-03T03:33:15.946722Z","title":"A mathematical theory of communi- cation,","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.946722Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:ee51b1464b27e268dc9b9a6012fcef5b1e5a627be612c143ecf2f93dab652377","observation_id":"43ae6354-0761-412a-9a0e-131b19de88d2","resolution":{"observed_at":"2026-08-03T03:33:15.946722Z","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-03T03:33:15.951607Z","title":"Herfindahl–hirschman index level of concentration values modification and analysis of their change,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.951607Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:893ae381bc4ee644ad5c6ac04f8fbead274bf251f23adfe90c011dce319864b7","observation_id":"a8406ca2-4f6f-4ff3-aaab-1b88cdfbc7f2","resolution":{"observed_at":"2026-08-03T03:33:15.951607Z","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-03T03:33:15.956057Z","title":"Multi-objective optimization for pareto frontier sen- sitivity analysis in power systems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.956057Z"},"links":{"citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:483100ea2ce95afc5200c105fa057b81a84a7a003663d90ff9fa54dbf8e0ec55","observation_id":"fd555e55-f0e3-4148-9320-d6f62f1e1486","resolution":{"observed_at":"2026-08-03T03:33:15.956057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":24},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2602.07913."}