{"as_of":"2026-07-22T05:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1839b03498d4605f48f82bda922c97ac48197e9c3cd846275040747dfafee215","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-05-07T04:19:56.730439Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-21T06:31:05.380196+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/2605.03524/citation-record","integrity":"/paper/2605.03524/integrity","json":"/paper/2605.03524/citation-record.json","paper":"/paper/2605.03524"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Comparison of heuristic approaches to pci planning for quantum computers","venue":null,"work_id":"ce71420c-c80c-41d0-9581-238e81d28161","year":2023},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:95bf5c35d5846a393993f0e8803cdb92ce6e3feac30e9a265637623b741cd2ea","observation_id":"3e8ff78a-468a-4aa3-9107-5509a0adb860","resolution":{"observed_at":"2026-05-27T11:49:05.255696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Application of graph colouring to biological networks","venue":null,"work_id":"86c3cbd1-a386-4ef0-bdcc-c9900909c439","year":2010},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:b601c08f26bc7bd2b2cb9ba2473a8d907e54b60ac27da7c61bb08172d0a0b980","observation_id":"7cc3b63d-d11e-4832-8ba5-f7d7ee524594","resolution":{"observed_at":"2026-05-27T11:49:05.242311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Optical dipole traps for neutral atoms","venue":null,"work_id":"d36247c7-7965-43ed-9102-9e18e86fde22","year":2000},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:3174e3791b91e5382ae7272229ba21e29b1eb51576acb688e8f76c7bb420c434","observation_id":"e5ae0897-02cd-4421-aded-726f87eae774","resolution":{"observed_at":"2026-05-27T11:49:05.151606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1140/epjqt/","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T07:44:21.309450Z","title":"Kaltenbaek, M","venue":null,"work_id":"782f2798-4092-48c4-b2e7-6dc33f4837e2","year":2024},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:3986e158bd631a64ec8fd7aa8096b9d80555636773d1fbaf3554b8df5dc624b8","observation_id":"a3115ae9-45f2-401a-a25e-2fec037a88e7","resolution":{"observed_at":"2026-05-09T05:30:18.905377Z","resolver_source":"doi","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Ultracold rubidium atoms excited to rydberg levels","venue":null,"work_id":"345ec4cc-9c28-464b-b146-4b29e4922836","year":2015},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:1ae5b38ee8f3e31ce4547b9299c8a037275df1c1f198c23e3e4d6b8e4c97abcf","observation_id":"f96e6054-9d9e-4bb5-8e45-1aa2fa9842ba","resolution":{"observed_at":"2026-05-27T11:49:05.221224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Entanglement of neutral-atom qubits with long ground-rydberg coherence times","venue":null,"work_id":"d0dca57a-13f2-4f69-a9dd-159dee755251","year":2018},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:9f91aa7807cff14e4762c7c11a681188eb16b3949edce85a5b31c0b7dcf54343","observation_id":"39a06630-3f7d-4bd8-aa46-b4d6e872cc0f","resolution":{"observed_at":"2026-05-27T11:49:05.176933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Unit disk graphs","venue":null,"work_id":"8e520eff-04e0-4ef0-a89e-33045b23d1b7","year":1990},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:688a1d236e3281727c525523d46be7c0b0d4913dd4646b35968b1438c5d989e9","observation_id":"a712d299-1596-4f08-bf6e-773c7962cf0f","resolution":{"observed_at":"2026-05-27T11:49:05.180460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/2fprxquantum.4.010316","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum optimization with arbitrary connectivity using rydberg atom arrays","venue":null,"work_id":"1220a510-99ee-404e-a534-5d2b581dd838","year":2023},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:35eb6060706ead38e414cea12e543f984a091b4727160a00275834d7e4338511","observation_id":"b0a07a1b-3399-4bb8-a2e7-a828eb13b789","resolution":{"observed_at":"2026-05-09T05:30:18.884932Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Neural-powered unit disk graph embedding: qubits connectivity for some qubo problems","venue":null,"work_id":"a4a0d2b8-96de-46f8-a8d6-35ffd8250d78","year":2022},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:121a701a8cbfabb6779c5455bbc66e462886e39ef2b4ba25ba051d2dde6409c7","observation_id":"18f74376-9aca-461b-9b2d-d64451cb08b2","resolution":{"observed_at":"2026-05-27T11:49:05.252704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"The gurobi optimizer","venue":null,"work_id":"cffbd877-ea09-4349-a9a1-563c3c797fd2","year":2007},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:7dedfbce810a586d69ab59709639183d965421e9da75162a53c08b182ce80f99","observation_id":"11f73261-3f82-4763-b962-b6db631ee94b","resolution":{"observed_at":"2026-05-27T11:49:05.214943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Hybrid quantum investment optimization with minimal holding period","venue":null,"work_id":"33319c19-0cf7-4faa-b6eb-804646d2aaec","year":2021},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:c4fbe4c6a2ec96d2e3fb031b10369cf7659feb589c31dac9de270b9e178c601c","observation_id":"16f42fd4-7949-4f49-837b-12b3f5c411ba","resolution":{"observed_at":"2026-05-27T11:49:05.163401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Sequential minimal optimization for quantum-classical hybrid algorithms","venue":null,"work_id":"6f375fd6-7723-416d-ac64-23356a0a6934","year":2020},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:d9e57e58e1d148cbb2c0e2277afdb725416a92ef787389048294f39fa0cefb10","observation_id":"bd511b77-4878-40ff-acd2-6b6be18a948b","resolution":{"observed_at":"2026-05-27T11:49:05.209260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Multi-qubit entanglement and algorithms on a neutral-atom quantum computer","venue":null,"work_id":"babff049-771b-4da7-8b83-8c7b649c55ab","year":2022},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:0c477fcd17d94cfe5571e258badf2f7c12631e62dd3eaa7c8eaf9795f8d60101","observation_id":"f0fe628f-4126-42ce-afc5-948a0ec7fd9f","resolution":{"observed_at":"2026-05-27T11:49:05.145802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"A ship motion forecasting approach based on empirical mode decomposition method hybrid deep learning network and quantum butterfly optimization algorithm","venue":null,"work_id":"bbc959f5-0236-4266-aca0-823730ecd281","year":2022},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:5f4e335af040e4d0cf9787f502625ebd1da4539eda923e0c4f5e67fd4e0f10cc","observation_id":"ce21b40a-7130-4210-a32c-70806e2b5aca","resolution":{"observed_at":"2026-05-27T11:49:05.205581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Pulse based Variational Quantum Optimal Control for hybrid quantum computing","venue":null,"work_id":"70c1efd6-1170-419d-bb73-73533562f7ab","year":2023},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:e072c47495efdb49014fb5060aa5565aebea9d7c86f7a8d8ab35c8d247ff5658","observation_id":"acf60e35-9ddd-4907-8908-e16cab4fc1f4","resolution":{"observed_at":"2026-05-27T11:49:05.224068Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Mapping graph coloring to quantum annealing","venue":null,"work_id":"873c76b4-fb49-4343-83c4-b2bda80f50b7","year":2020},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:703fc45a600b57dacfc59936a5006abf0c9570513204bbb633a4324d94bb813d","observation_id":"b2433ac9-3c7d-4bb5-9473-6961345e9ed0","resolution":{"observed_at":"2026-05-27T11:49:05.158864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Disorder-assisted graph coloring on quantum annealers","venue":null,"work_id":"19e7b043-41f6-4e12-b8cb-a25a9b992006","year":2019},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:1a17098dae4bba8fd78d83441e5601f58cd23aaa30520959cd2ba6a1504029b7","observation_id":"ed739f45-303a-4aac-85c6-43001e95bfd4","resolution":{"observed_at":"2026-05-27T11:49:05.217857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Parameter tuning patterns for random graph coloring with quantum annealing","venue":null,"work_id":"6061151c-fc4f-4390-a691-cf7cc550e3ea","year":2012},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:fdc9b23c8f0b0254690aa9b1e40853e07b45fbc368d47a5a7dc5e3b693ba775e","observation_id":"25064e11-1693-4b3e-b883-55eb6dcf8e7d","resolution":{"observed_at":"2026-05-27T11:49:05.261351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Constrained quantum annealing of graph coloring","venue":null,"work_id":"ded306a5-ef84-4d85-833c-206a92fb1c83","year":2018},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:94b798c281778b6639b02cbbcfd9b36427405210a12e482ab01160287d95b838","observation_id":"d2056126-a508-479f-a0f2-bf97ce0960a7","resolution":{"observed_at":"2026-05-27T11:49:05.170136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Quantum annealing of the graph coloring problem","venue":null,"work_id":"0cbc1a06-9a29-4db8-87f6-525efdf76e38","year":2011},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:714342ce8e1ca0041615ebe20961827890b62b04e36b9783eca77dd3963edbc5","observation_id":"1f16d3e9-cd69-4103-9e01-ea7d39145ed5","resolution":{"observed_at":"2026-05-27T11:49:05.190268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10917","last_updated":"2020-02-23T03:09:57Z","snapshot_observed_at":"2026-07-06T08:59:58.313111Z","submitted_at":"2020-02-23T03:09:57Z","title":"Planning for Compilation of a Quantum Algorithm for Graph Coloring","version":1},"cited_work":{"arxiv_id":"2002.10917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.10917","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Planning for compilation of a quantum algorithm for graph coloring","venue":null,"work_id":"edd31c01-dd1c-4add-b730-20735c4bc063","year":2002},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"cited_paper":"/paper/2002.10917","citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:c567075b0e41209f523781186523369d172892962094e302d6d8de7435a422df","observation_id":"af4a38c3-de96-4e5f-89e6-fc51961375c3","resolution":{"observed_at":"2026-05-12T10:56:30.314948Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Eigenvalues and the max-cut problem","venue":null,"work_id":"d921a036-6b71-4888-a3dc-4dc1961415ca","year":1990},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:eeed2778a14967116d5c519b3d842b28d2aac66010bd14a9a12a88d24e85a79f","observation_id":"44915cc9-766d-418e-8889-7adecb87a749","resolution":{"observed_at":"2026-05-27T11:49:05.166934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Quantum optimization for the graph coloring problem with space-efficient embedding","venue":null,"work_id":"39954926-2398-413d-8611-60c0783dd9b7","year":2020},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:729a525e4d5a6f01b144ab02671a8798c1640b168f03dad8375799224fcc9f17","observation_id":"542cbe10-2b07-4ea8-835b-b52e83bf90fe","resolution":{"observed_at":"2026-05-27T11:49:05.142334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Improved complexity of quantum oracles for ternary grover algorithm for graph coloring","venue":null,"work_id":"4446be1c-eab6-4b68-a741-ed40ee4b7fcc","year":2011},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:7d229c01fee444f0d71088eec7889db2c7eaff2c090e222c8c5ac818dbb9f3eb","observation_id":"0507c471-5876-49e5-9a6b-7196817b4936","resolution":{"observed_at":"2026-05-27T11:49:05.193939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Hybrid quantum-classical algorithms for approximate graph coloring","venue":null,"work_id":"180844fc-c251-4f31-b129-6a6860a9da3a","year":null},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:cb0571f767525a7c94e58cb13a6172ec64ec034263a21e648096400793ab14d2","observation_id":"e4885a41-fa51-4dab-89dd-8d8d64d3a999","resolution":{"observed_at":"2026-05-27T11:49:05.173285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.22331/q-2022-03-30-678","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Available: https://doi.org/10.22331/q-2022-03-30-678","venue":null,"work_id":"16afb76c-c842-435a-8da3-a3f63d9973d8","year":2022},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:4230ecb25e28d6ca6d3e3d8d3fc05972bf4d76f5e0e40683bd72aa4d8461e313","observation_id":"a3034b44-9e33-47ac-a122-b37bf7ecae33","resolution":{"observed_at":"2026-05-09T05:30:18.898682Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Graph coloring using the reduced quantum genetic algorithm","venue":null,"work_id":"b39bf048-cb71-474c-8e2b-3cebe7b3ce37","year":2022},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:9cb40ced05d51d97a683e9550cf266cf37d5cfa9123a3f73789dda853d274b4c","observation_id":"2575f4f7-81c2-4a35-8e13-84a1787bf3e5","resolution":{"observed_at":"2026-05-27T11:49:05.197647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"df67bae4-4e57-436f-a462-e9e4ac7669b4","year":2011},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:a7104529fb1e657b59a8dfaa11dadeead665e22399cd7099d72856aecafae64c","observation_id":"563aaea4-7c50-4fbd-bf5f-f07e68ad3d6d","resolution":{"observed_at":"2026-05-27T11:49:05.201309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Finding a maximum independent set","venue":null,"work_id":"8e3cc729-cfe3-45a3-9873-20ccfc6cb9c6","year":1977},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:a2178083e42d501e53e94f229d779a128cba38590288cfe85733a1b6ef1c1aa8","observation_id":"88a61500-f881-4f45-8a70-bdc84b302b57","resolution":{"observed_at":"2026-05-27T11:49:05.264113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.11538","last_updated":"2019-11-04T20:50:57Z","snapshot_observed_at":"2026-07-06T07:17:36.309054Z","submitted_at":"2018-11-13T18:38:34Z","title":"A Tutorial on Formulating and Using QUBO Models","version":6},"cited_work":{"arxiv_id":"1811.11538","doi":"10.48550/arxiv.1811.11538","metadata_source":"arxiv_reference","pith_arxiv_id":"1811.11538","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"A tutorial on formulating and using qubo models","venue":null,"work_id":"0e035fa7-ece7-4bd0-83aa-88d9abefd5a3","year":2019},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"cited_paper":"/paper/1811.11538","citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:b90e6dcbbcc1fcbecf1173bc54d6933b339487f3f40a7e63beaca23558d01bc0","observation_id":"5cb96412-1326-4cf1-9a3c-3ccfb9084d4d","resolution":{"observed_at":"2026-05-12T10:56:30.306043Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Exact algorithms for the graph coloring problem","venue":null,"work_id":"91bc5674-550c-4ae8-a073-c1f83b5d4881","year":2018},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:293b381a8d6331f44d2be2700950a27fdd1b2bfa403cf6a362fc14c76fe98292","observation_id":"acb2dfb7-03db-4a2b-96d6-61bdbf035364","resolution":{"observed_at":"2026-05-27T11:49:05.227310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"An algorithm for the chromatic number of a graph","venue":null,"work_id":"85e13571-8da0-4d3a-b8a9-511f6ce2529a","year":1971},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:84a59619427e28ae692a3cb32207d31d2e3f37a77c56d47bdb32450fbe4bc8d8","observation_id":"8df78c02-fba0-473a-9a77-fa059ff35d37","resolution":{"observed_at":"2026-05-27T11:49:05.258621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"On various algorithms for estimating the chromatic number of a graph","venue":null,"work_id":"52def334-24e7-4581-8f83-d68ba5391692","year":1976},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:3bc5235db900752e4813554f7c7f13b710ada67278428ac4ba0d0fae70083173","observation_id":"0eb7d0cc-e22b-48a4-9875-8707d82153e7","resolution":{"observed_at":"2026-05-27T11:49:05.249521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1093/comjnl/10.1.85","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An upper bound for the chromatic number of a graph and its application to timetabling problems","venue":null,"work_id":"4af67718-8aec-4893-8e0a-d19e82133129","year":1967},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:b326a9553f5d68acb9231a52d77c6aa1c5cefc39f7ead852c6222ae217bc1e91","observation_id":"f6ae8b30-ffbe-4b2b-b23c-a02f1a2fabdd","resolution":{"observed_at":"2026-05-09T05:30:18.882567Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"On eigenvalues and colorings of graphs. ii","venue":null,"work_id":"64c4ae5c-ef10-435a-a231-371f7e286a66","year":2007},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:813491cb53fe27e83f22d43e0da116cce4dc762adfbfa117cb1ff00338a9e73b","observation_id":"67f28036-144c-47f6-adfb-d1c82f5fd18d","resolution":{"observed_at":"2026-05-27T11:49:05.236782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.01978","last_updated":"2017-03-07T01:53:06Z","snapshot_observed_at":"2026-07-06T04:55:21.423481Z","submitted_at":"2016-05-06T15:46:28Z","title":"An inertial lower bound for the chromatic number of a graph","version":4},"cited_work":{"arxiv_id":"1605.01978","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1605.01978","snapshot_observed_at":"2026-07-04T21:48:10.940674Z","title":"An inertial lower bound for the chromatic number of a graph","venue":null,"work_id":"f7f6ea48-c5ef-4339-a996-947445dc66b2","year":2016},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"cited_paper":"/paper/1605.01978","citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:e7f316e058a87c9ba1b21fb234becf1e9e4514198abfaaf3ea324b526f1b1f29","observation_id":"8c205979-0b77-442e-8dc4-38271b9f0643","resolution":{"observed_at":"2026-07-04T21:48:10.940674Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Lower bounds for the clique and the chromatic numbers of a graph","venue":null,"work_id":"8858f6d3-e3e5-454e-b0f2-3efe30e980e3","year":1983},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:c5b8c2155512eea1f94b86fdeb4f5483a83ef84e8aa113d3cd1cbb0cc73568f6","observation_id":"6c75417e-d068-4f59-bfee-ea00a3b7b075","resolution":{"observed_at":"2026-05-27T11:49:05.148766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Enumerating maximal independent sets with applications to graph colouring","venue":null,"work_id":"6181ed92-67a3-4999-909a-fcdebf935626","year":2004},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:a3137733cb5f7ce7602fc6643159c90582ca3617444cd4d47a7c943c0e68a1f4","observation_id":"79460001-71b1-4404-8dc7-f746c267ea5b","resolution":{"observed_at":"2026-05-27T11:49:05.233695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Solving optimization problems with rydberg analog quantum computers: Realistic requirements for quantum advantage using noisy simulation and classical benchmarks","venue":null,"work_id":"bd4489dc-c191-466d-8d9d-7d91e24839a3","year":2020},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:07689cfe9329dc50749827572f97e37e0fc88ccead6ade6bbfedccb41e89b7cd","observation_id":"cdea0326-a93c-4a8d-a55a-2ecb4dd33adc","resolution":{"observed_at":"2026-05-27T11:49:05.245383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"1411.4028","doi":"10.48550/arxiv.1411.4028","metadata_source":"pith","pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-07-10T19:27:32.382371Z","title":"A Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"5a33d9f3-407a-4c7e-a119-ff581c66b173","year":2014},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:ac3c7807408959943d078a59aa64edfa7ea0c82a8e8b7dac22f8175b5b1df919","observation_id":"6557d3f9-1444-4388-b34c-db1eefcdba1d","resolution":{"observed_at":"2026-05-12T10:56:30.301230Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-12T13:50:25.783822+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T13:50:25.783822+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.15044","last_updated":"2022-01-12T16:18:37Z","snapshot_observed_at":"2026-07-06T11:05:11.419828Z","submitted_at":"2021-04-30T15:13:04Z","title":"Pulser: An open-source package for the design of pulse sequences in programmable neutral-atom arrays","version":3},"cited_work":{"arxiv_id":"2104.15044","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.15044","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pulser: An open- source package for the design of pulse sequences in programmable neutral-atom arrays","venue":null,"work_id":"a7db06ad-6e55-463a-9bd2-1e2ea37a954e","year":2022},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"cited_paper":"/paper/2104.15044","citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:69e205c531cc634e3684f970111209bca7a40e8320367a7292064b5abcf79292","observation_id":"831c9bcf-55cc-4431-8358-ab5be5ae2c1a","resolution":{"observed_at":"2026-05-12T10:56:30.296714Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Quantum Computers for High-Performance Computing","venue":null,"work_id":"daf6b178-16ad-4854-bc8c-e68a42b48d11","year":2021},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:51b320dd04e4266530a2f0a54de1dd6e60c7558fe57b6eb455bb2d361fabf5de","observation_id":"3a0e5dcc-cf11-4b35-b656-27a4860b9a8e","resolution":{"observed_at":"2026-05-27T11:49:05.230520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Aquila: QuEra’s 256-qubit neutral-atom quantum computer","venue":null,"work_id":"1aa1bf98-80f8-4eee-88a3-3f66d9917c3a","year":2023},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:ce04dd0b538dfef306fe666e1569a12c6353f48af81b9f120c6aaa20997ea95b","observation_id":"7bc61bc3-4a60-4e1a-946c-07362b25e47b","resolution":{"observed_at":"2026-05-27T11:49:05.212174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"QAOA and QAA to solve a QUBO problem","venue":null,"work_id":"d2c25290-6cf7-4783-9039-922cb12d2766","year":2023},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:5165613bff8f7ae5bb98d4789773b48adec8b2c8e1fce12b3f7af223ad8832a4","observation_id":"93139096-4e56-47e6-9b42-3059511f1d4d","resolution":{"observed_at":"2026-05-27T11:49:05.239716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-06-05T21:23:00.469572Z","title":"Acceler- ating HPC With Quantum Computing: It Is a Software Challenge Too","venue":null,"work_id":"de6f59f3-10b2-4935-b9ce-7c6bafe16360","year":2022},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:72458cfa7474f9ee1def692eec4150ce336c5a01b00255d7380ee77ee3c05cab","observation_id":"560e1063-5ac6-41f2-b044-832fae3c6a92","resolution":{"observed_at":"2026-05-27T11:49:05.184025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+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-07-08T21:15:39.948596Z","title":"Adiabatic quantum computation","venue":null,"work_id":"1ccc2b8c-b164-41dd-9da9-a96e1f40f95d","year":2018},"citing_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-07T04:19:56.730439Z"},"links":{"citing_paper":"/paper/2605.03524"},"observation_digest":"sha256:f6a533a321e0c2fab2651b076363601e32a4fb18bfecbae0b5f196e85a343b99","observation_id":"2e5bf488-103c-420f-a28a-3dc943c4cfad","resolution":{"observed_at":"2026-05-27T11:49:05.186862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-21T06:31:05.380196+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":8,"verified_fuzzy":36},"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-07-21T06:31:05.380196+00:00","source":"crossref"},{"observed_at":"2026-07-21T06:31:00.184556+00:00","source":"retraction_watch"}],"thesis":"As of 22 July 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2605.03524."}