{"as_of":"2026-08-06T10:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:11d824d92fd53c21571cd5d4d0134d60e4da348cc9865afdcb86e48060132c02","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":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T01:25:46.892284Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2605.03524","last_updated":"2026-05-05T08:59:53Z","snapshot_observed_at":"2026-08-03T15:35:46.816724Z","submitted_at":"2026-05-05T08:59:53Z","title":"BBQ-mIS: a parallel quantum algorithm for graph coloring problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.03524","snapshot_observed_at":"2026-08-01T01:25:46.892284Z","title":"Vercellino, G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25834","last_updated":"2026-07-28T15:13:14Z","snapshot_observed_at":"2026-08-04T06:32:33.875498Z","submitted_at":"2026-07-28T15:13:14Z","title":"Lowering the implementation barrier of neutral-atom quantum computing with agentic workflows","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T01:25:46.892284Z"},"links":{"cited_paper":"/paper/2605.03524","citing_paper":"/paper/2607.25834"},"observation_digest":"sha256:1db68228dd547071f7e2419b2ef32f1c5754f2917af4b002cda0348ef5376194","observation_id":"830a68bf-e850-404c-957b-f748f071159e","resolution":{"observed_at":"2026-08-01T01:25:46.892284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"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-08-03T15:35:46.816724Z","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:3015ac6ee5b3833bfefefc3479e57d8d6c73e8a5fd6bc1ca98e3fa7f74d8e14b","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:4405c1b512faf4c88978ee99e7314ee2d898baea40c256cc2a20ab9b1f884320","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:71dc268eaf67f6e5f2ab7c4b7972737c51bae4d29a23013bef6515baafb6ba86","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:63284420ee1509e5003f86f63dd7d6fa649c348e43109479b95b6c74aba52f9d","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:da9d40abfed4bf029697145b2ffac1b267581eec93fa3094aff97ffe2c9b3cf9","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:d31cd23610ab8b06afc5b1c4f8afc148d13f08301848752d37556d9288508f80","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:ea8fdd8ee3d2f1cbbb22eb2ff20c732f5bd29f3c3912112fe9f69f82a2bb634a","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:5eeb7ef12830ef3b1f7d1d381f1d28b4744d93ad7f68f167da5ca37429a17e2b","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:63f6729983f3dfbad40dc378027925e04e32131312a5c20e581db741f9196e6f","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:8cd188040858a6ced4339887598af0a5ae73fea21ca1c83d3b3306a18b926d97","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:15109b803726f74d663ccaf706ccfb0c8d037e9658e7b6a183d46c276acce840","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:bf59d779b8e13352cd61056fff7c670e4d8422101002362436a2344f5c81dc42","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:23c054ef288ed38a6764a456d12be80b22b1924533e84f1438cde473a09d7ab6","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:15dcfcfc7a08cb18b292802b43362aa98d72d2c9dbbfd36df4bd6f0621bdf78b","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:fffa8f047725d7e9a167fe61c8642d24abe9de8471c3f9d4a0c72f9d9bcbe0fd","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:73c2a610108915e140d09abcb44331cba53158cc66bba9c818e50bd689ea484a","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:48d90170151ee7ae14a8777e23152e15defcf6d1ed91790ff77a8e4c4bd93e17","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:baa86260ca7a50d521c4394d862e4a01801274e4eed5ca321e60d20ba6f563fd","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:6f91c3d36982e7a76cbe718e139faa5e48080a4158ddcef96a0db3b00d116b2c","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:4ef003b9283209cc997eb6acdc6fa5214551823f79228e611b9e8793176d7929","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:3df4681ed588c14c0772bd349c3e68e051cec91f406a06e0e4c28f27acd38bcf","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:cfa0c9e1037015ca8936fc736f0846483e1afca12a64e13f691b2c284eb94108","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:0f3a42a7d7726a38576033a307225282feb08018b4c8390088cdb5594645dd8f","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:2a4361c2929567508bc08067cb1df90b1271dd3b8267e9f18dad778f23f9ac3b","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:cd5c5390b2f210e851b0a110bf996bbde16db9ff6fc225db37bb2a8436588046","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Available: https://doi.org/10.22331/q-2022-03-30-678","venue":"Quantum","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-08-03T15:35:46.816724Z","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:7d4a1e758efc95be745edb5191544d017c3010a79efce6dda939006dd2648008","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:f37eabf4bc908d195ad4de44b6797cba10d5505d559d4e49ead05c896e1fd5bd","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:1d984d9a134482973ed24def612f66529af3eaadd519ba24ea146955a72c05a2","observation_id":"563aaea4-7c50-4fbd-bf5f-f07e68ad3d6d","resolution":{"observed_at":"2026-05-27T11:49:05.201309Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:49fcfeedf9f8fa95149a1d4b89b15bf40b11c970b69377b83d1016b2fdf19e1b","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-05T02:28:24.338817Z","title":"A tutorial on formulating and using qubo models","venue":"arXiv (Cornell University)","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-08-03T15:35:46.816724Z","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:842f874c25d67f51f837e613ee4842763e642febbd824928024e83f149d207e7","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:d1f646219f440a5bb084669b01796d4b1c936d85735f22de307125521e193a10","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:b2e0ef5a8d56a578be8b3578f49cc3fbf5fb89ed83c0d48bd5096f5d01fee0ef","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:58486a16553ecc931f3d1aca0f9f5e6406c3d2e6503fdfbae0250d53dafe1bff","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An upper bound for the chromatic number of a graph and its application to timetabling problems","venue":"The Computer Journal","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-08-03T15:35:46.816724Z","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:5a6c1158cff544aba7920400b75e9dfa4ea4520ddddcc642eea988a529db63df","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:75c3f025f5a5ca7b675a36dad557f3e9292440918fbc176b0e371392e78ddf8d","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:ab5ad987fd83fe5b1ff17681907bd4785d386a916c55863f2b2822da8ec20841","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:9359d255d73a1c1bd967313de52fb699f61d65a60bb0480fb8f931caca2e042b","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:d22cf720b2e0c61cfbc7b3bdf1e3157c141ef4bcbcce8c2ed5a9a02ef9100861","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:2f95a0bfa224a27adf50f848d43a3ddff858b2e8c5da5055590bded42b1e90ca","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-05T02:28:24.338817Z","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-08-03T15:35:46.816724Z","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:c7c2a4f6c8154a48bb1f5571285314b68eabd36da41f6dc9cc267ccb124408cc","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:8ddb07646bd6bf5d812de2b2f9d5e3c3c4180092adc180403003d7639f043820","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:394ad0d9e793e0d422ded9cb295d0935aa5cf88fe654454e2d02b4558dd48e0e","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:267038420a9a93c156f64390aeda7e19c519a3c5c6387723361c27eb6cfa889f","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:725e3ca8b10dd64f49b3d3ccff6e61fd2fa4f9b267162b6f1e5bd2daa9ccc43c","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:6272d22df8eb9c4da122c6e787705fb1918523f9cdd8f68f5a3f50368f00db83","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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:cf74f0c81c0ff73ec4d63345f0bf25556d810e0a1ef7fa056256eb62692762d8","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-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-03T15:35:46.816724Z","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":1,"verified_exact":8,"verified_fuzzy":35},"total_outbound_references":46},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 1 inbound Pith citation observation for arXiv:2605.03524."}