{"as_of":"2026-08-10T08:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e0b806a2912744dab5f75eb98d3058af595c4bfa35694ddbc4ff57cbc70bcc5","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T16:14:35.201293Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2508.18887/citation-record","integrity":"/paper/2508.18887/integrity","json":"/paper/2508.18887/citation-record.json","paper":"/paper/2508.18887"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:34.863500Z","title":"Quantum computing with neutral atoms,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.863500Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:dd78298b6c76d712da138b39488e0cca881eed6c61db26db2e96343876b28316","observation_id":"56964b0c-3498-40cf-a09c-c5a24352220b","resolution":{"observed_at":"2026-08-05T16:14:34.863500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:37.009127Z","title":"Ultracold rubidium atoms excited to rydberg levels,","venue":null,"work_id":"e20f2cb8-64c4-4e6d-973f-9b705ee8a323","year":2015},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.868816Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:40a36ba506885258fa9004894935bcbb49c2d4030fdaaec761b671dafc4f908e","observation_id":"7e80dc2a-c9f8-47a3-8d26-d6b9fc393c29","resolution":{"observed_at":"2026-08-05T16:14:37.056137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.887498Z","title":"Graph algorithms with neutral atom quantum processors,","venue":null,"work_id":"29ff0d3b-3e5d-4663-a4d8-cd272d03fa6b","year":2024},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.874205Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:13805ccd559ab3c369304f3b2d87c7b791881cc284067a9536d56cab0bb7ff19","observation_id":"d8c8a9a8-76d4-41dc-8262-49360226f907","resolution":{"observed_at":"2026-08-05T16:14:36.938930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:34.879540Z","title":"Unit disk graphs,","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.879540Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:552bd2bc2811a008b98808ca752a896cf157b09563e105e7754d6bddae940228","observation_id":"7494c001-9772-42f6-8d27-0bc51113d5b4","resolution":{"observed_at":"2026-08-05T16:14:34.879540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.833579Z","title":"Mixed-integer linear programming solver using benders decomposition assisted by a neutral-atom quantum processor,","venue":null,"work_id":"5727b556-8d07-4e6f-92af-98ea17b83471","year":2024},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.891743Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:239ebc26caa9e7a290e33557ff0c578163112cf696cb675adba9a5ad70f80106","observation_id":"d9064b88-f185-4854-8b34-68918078b509","resolution":{"observed_at":"2026-08-05T16:14:36.851271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.802069Z","title":"Quantum pricing-based column-generation framework for hard combinatorial problems,","venue":null,"work_id":"c8dae6fa-c5bb-421d-b9cd-7abb9592a5c0","year":2023},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.899567Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:67185e4acfb4f90818aff0d02a4e33b7148d1d3650246ec82df302f5303ea4d4","observation_id":"761813a1-b208-49ec-b725-8488b4cea492","resolution":{"observed_at":"2026-08-05T16:14:36.813049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.766017Z","title":"Bbq-mis: a parallel quantum algorithm for graph coloring problems,","venue":null,"work_id":"cb99576c-450f-4c02-862d-a951c8d65ab5","year":2023},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.905031Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:0f72707c62a526eb6711b7cf4ccc73ae8108e3dab4ba9564db2d5c3bf0202db3","observation_id":"bc16aeda-b221-42ed-ade1-e06d6e4f180d","resolution":{"observed_at":"2026-08-05T16:14:36.776502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.705026Z","title":"On some applications of the selective graph coloring problem,","venue":null,"work_id":"5a6fa53a-fa47-476e-a76e-20e1c42049f9","year":2015},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.909886Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:61125857dec5e951ad8f6eabb97a3281b7606d4d5e67a1144a69c645a6972f8e","observation_id":"f3ff66af-43a9-471a-bef3-404e2794bcc8","resolution":{"observed_at":"2026-08-05T16:14:36.727812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.635722Z","title":"Applications of graph coloring in modern computer science,","venue":null,"work_id":"1d27fb19-a2af-4686-8a18-01f00947a48f","year":2012},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.915758Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:0b07a245966ce769ab6fda2e19d5311a521194ed0ca9e4c449d83fdcdecb12bd","observation_id":"04a694a3-ac1f-4896-9726-e9357994e08f","resolution":{"observed_at":"2026-08-05T16:14:36.661634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.570733Z","title":"An application of iterated local search to graph coloring problem,","venue":null,"work_id":"b86ebe08-bcfe-4140-9800-d0547404bd97","year":2002},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.921282Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:df073f41bc948693826bd017592698419fcc48d1c222bec013f4b478b3e1a9f1","observation_id":"e165fbe1-7167-428d-bf0d-aa05d74357d3","resolution":{"observed_at":"2026-08-05T16:14:36.593951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.489048Z","title":null,"venue":null,"work_id":"5995c0b6-5caf-4e15-aed0-e29e90ebbfdb","year":1994},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.925929Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:850fa84efe9d5a52317604cffac45348917bf0faa0591702589a13183855560c","observation_id":"db572949-9e78-476e-b5d8-2f410eb590c0","resolution":{"observed_at":"2026-08-05T16:14:36.526549Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.422160Z","title":"A survey of graph coloring-its types, methods and applications,","venue":null,"work_id":"c54006c0-5785-4ff1-b903-db4843201244","year":2012},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.930454Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:ac688cd1da458a583e42c22ae4186c5d0794af13a2d7765eac15c4d3c8d102b2","observation_id":"53e03200-d931-40d0-b9b5-95beac2bb79d","resolution":{"observed_at":"2026-08-05T16:14:36.453504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.393129Z","title":"Register allocation & spilling via graph coloring,","venue":null,"work_id":"2bf67a62-e1dc-445e-a72a-e3dd234d2f67","year":1982},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.936309Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:0019d8f3b0e8c89bf36aceab3296ae4a3fd386fa0b06cc20cd3f85ade84af518","observation_id":"73581598-56b5-42e7-8bb8-ea0288783400","resolution":{"observed_at":"2026-08-05T16:14:36.399911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.364576Z","title":"A graph coloring algorithm for large scheduling problems,","venue":null,"work_id":"6da6ea43-eae4-48fa-be9a-733632b12768","year":1979},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.941587Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:c17f8cf116e4dd1dacda2d446a2b51ed62eb2a465b0dfee91fdfcc07ea282903","observation_id":"867b2037-2740-4f69-90ef-8860126cef7c","resolution":{"observed_at":"2026-08-05T16:14:36.374515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.344168Z","title":"Frequency assignment: Theory and applications,","venue":null,"work_id":"cf97e338-c8fd-49aa-8848-71b472855260","year":1980},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.946980Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:f88e38d5f30276457602148076678b346a09a4b402b8266c938a788108876f56","observation_id":"dc3d2377-3c80-4c7e-84ef-3469378a3a18","resolution":{"observed_at":"2026-08-05T16:14:36.351290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.307191Z","title":"Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results,","venue":null,"work_id":"8871e80e-3af2-47d3-9fd3-a0e8ebb84fd7","year":2009},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.952396Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:3a7224983e36430026dc4dd2e79d881c63f0298b93fd0e889971b6092050d8c9","observation_id":"88a97c41-f078-4c64-a21c-51d76cf6ac48","resolution":{"observed_at":"2026-08-05T16:14:36.318824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.279923Z","title":"An exact approach for the vertex coloring problem,","venue":null,"work_id":"577d6bf4-9eda-4964-b4cd-2e2b7ca1309e","year":2011},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.957308Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:8579168e9664678ce2e17324ed53c0aa9d41bdb2fd530f32e534db932164ab1f","observation_id":"a419be09-e7ec-46bb-bec4-b0bf9e8f073a","resolution":{"observed_at":"2026-08-05T16:14:36.285585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.252465Z","title":"A column generation approach for graph coloring,","venue":null,"work_id":"ac190401-bdbd-471b-be53-28207ed50a14","year":1996},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.962209Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:d6a4846c4fddbb13b6876ab719c6f57c7b72113163f312aa1a73162908d9686b","observation_id":"e15ce62b-11c2-484d-9e69-13402ad50a18","resolution":{"observed_at":"2026-08-05T16:14:36.263657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.215979Z","title":"A branch-and-cut algorithm for graph coloring,","venue":null,"work_id":"ea93cd13-6680-4cc0-90da-686e35dc6bfb","year":2006},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.968450Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:c5a2a00ac4bff016eee2a7da109cc1ae5e9857d440e943c757e0f4076aac677e","observation_id":"0ac22829-6ac0-4a43-95fd-ccd5ee48ea5c","resolution":{"observed_at":"2026-08-05T16:14:36.222832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.192628Z","title":"A wide branching strategy for the graph coloring problem,","venue":null,"work_id":"8d61da5f-c325-4b3a-84ce-0a2e23b050fc","year":2014},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.973885Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:1332102ba171f320541f51bb01909663959299eb0bc3b205060e583a1253fc00","observation_id":"b650ec0f-3a24-4c31-b66d-2e3d90a5f1c2","resolution":{"observed_at":"2026-08-05T16:14:36.198067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.170806Z","title":"A branch-and-price algorithm for the robust graph coloring problem,","venue":null,"work_id":"d261204e-bf12-4403-a62a-68c51daaf1ec","year":2014},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.979228Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:fd906945e5a03db3c2fb21a32f4f7ec41830fa45722724a329beee80e180a8ac","observation_id":"521b29a0-aec7-4e2a-b09b-b52ed540df5e","resolution":{"observed_at":"2026-08-05T16:14:36.177220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.149999Z","title":"A tutorial on column generation and branch-and-price for vehicle routing problems,","venue":null,"work_id":"a8a6c76b-ef68-4a87-a744-e6bac3fef66c","year":2010},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.983906Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:25a932821bf26209484668cfac0156b116475f6a9789cf3e75fec22ca8ca32b8","observation_id":"24119196-4d31-4dba-b213-f44d8c4e2bcf","resolution":{"observed_at":"2026-08-05T16:14:36.156015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.127479Z","title":"Send a job to fresnel,","venue":null,"work_id":"8a8eaecc-e389-4c6c-84f7-8f02c548236d","year":2025},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.989362Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:740b544f5bdbadf1def9ff45077ff317eb4646d257a9c0998594926c90ad905e","observation_id":"a947f0b9-038f-4ff4-b588-f56f5c5602e4","resolution":{"observed_at":"2026-08-05T16:14:36.132713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.108059Z","title":"Hybrid classical–quantum branch-and-bound algorithm for solving integer linear problems,","venue":null,"work_id":"e1b2333c-a3ee-49da-926c-de88e8e92da0","year":2024},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:34.994557Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:c62efb78330b86eac018c05a5698019e7a666aa68fad4f9eaae0eb525aa2ef3f","observation_id":"75fd8393-c8d7-40d6-af29-26ee191e3e93","resolution":{"observed_at":"2026-08-05T16:14:36.115346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-05T16:14:35.000151Z","title":"A quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.000151Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:54a777c00775263252645b4a72e388c3e8f5d88908c21cb6364cdda27cf465ac","observation_id":"74bbc064-4727-43d7-a71e-6e3a50f89f24","resolution":{"observed_at":"2026-08-05T16:14:35.000151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.090539Z","title":"Bayesian optimization with skopt; scikit-optimize 0.8.1 documenta- tion — scikit-optimize.github.io,","venue":null,"work_id":"217f824d-c452-4f08-a43a-3f6c057e81b5","year":2024},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.006339Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:cf95296337bf658456b98855332ff8b9b5fa96b7586f20263064b0688785552b","observation_id":"bfb4541d-1c59-41e6-83d9-fd5d0779485e","resolution":{"observed_at":"2026-08-05T16:14:36.097112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.069715Z","title":"Partitioning procedures for solving mixed-variables programming problems,","venue":null,"work_id":"dd9f888d-b088-4ccd-a904-ed54b94a094c","year":1962},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.012909Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:64f01172504a5615da042aed6369199d79892f53a4712e80a393ebbf7e468c81","observation_id":"02654c8e-830b-468d-aea5-6b2d523e4796","resolution":{"observed_at":"2026-08-05T16:14:36.075079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.049603Z","title":"Hybrid quantum benders’ decomposition for mixed-integer linear programming,","venue":null,"work_id":"2a550b85-1364-4906-8842-d8c44a676b2d","year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.017988Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:e67a1a7a3caeeb271cb70e05196c1bd6e3e88d35754d6557853470b2ca7df84a","observation_id":"cc6eceef-076d-4c9b-b18b-944d26d28186","resolution":{"observed_at":"2026-08-05T16:14:36.055498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.06678","last_updated":"2024-12-15T03:27:36Z","snapshot_observed_at":"2026-07-06T14:04:32.971017Z","submitted_at":"2022-10-13T02:26:27Z","title":"Fully and partially distributed Quantum Generalized Benders Decomposition for Unit Commitment Problems","version":2},"cited_work":{"arxiv_id":"2210.06678","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.06678","snapshot_observed_at":"2026-08-05T16:14:35.353562Z","title":"Fully and partially distributed Quantum Generalized Benders Decomposition for Unit Commitment Problems","venue":"quant-ph","work_id":"848f94e3-e7dc-479c-95de-306dd92fa0e8","year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.030217Z"},"links":{"cited_paper":"/paper/2210.06678","citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:dd68dbc4da2d5b0234b3211c5331643aa91d20646dee0263f794f23bfaa5222f","observation_id":"a2aa70c1-e3d0-4463-a568-0043aac2037d","resolution":{"observed_at":"2026-08-05T16:14:35.365527Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.07852","last_updated":"2022-01-20T16:19:10Z","snapshot_observed_at":"2026-07-31T09:28:01.338769Z","submitted_at":"2020-10-15T16:14:26Z","title":"On Hybrid Quantum and Classical Computing Algorithms for Mixed-Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.07852","snapshot_observed_at":"2026-08-05T16:14:35.037931Z","title":"On hybrid quantum and classical computing algorithms for mixed-integer programming,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.037931Z"},"links":{"cited_paper":"/paper/2010.07852","citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:65d60f185a8ecf0bf44f997c4e9ddd9b85aa02cc5d3c951dd8543415823ee18b","observation_id":"e4df8426-f672-4583-a9f4-31600fa09059","resolution":{"observed_at":"2026-08-05T16:14:35.037931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.029272Z","title":"Optimization of a refinery scheduling process with column generation and a quantum annealer,","venue":null,"work_id":"7254040a-ed8c-41f7-a4ec-3ddfce1df6ea","year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.043835Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:7ee021f1c01a47a103255757722d781c2c4fba7273dab95bee34dc95084016b1","observation_id":"a75b5d8d-e228-44f7-98d2-60b88acd29f8","resolution":{"observed_at":"2026-08-05T16:14:36.036470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:36.007863Z","title":"A branch and price approach for routing and refueling station location model,","venue":null,"work_id":"3db8176b-d876-4d83-b237-f33f59e1abcf","year":2016},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.049434Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:c3637c2792fefc5734552d8aa11d679cedb15a32465b1255f371756c73951571","observation_id":"92c37022-0542-4e8f-967b-bf555484a573","resolution":{"observed_at":"2026-08-05T16:14:36.014371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.981098Z","title":"A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection,","venue":null,"work_id":"7eb56d4f-1e68-40f1-a325-33409e2d5a69","year":2006},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.054481Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:d070d7e3f87b316beda733948da55faed2f447968a202bce878244f81f27db3a","observation_id":"b28785fc-7175-4ea3-9a69-5780f8bba548","resolution":{"observed_at":"2026-08-05T16:14:35.987252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.960461Z","title":"A branch-and-price algorithm for an integrated production and inventory routing problem,","venue":null,"work_id":"f0d4cfdf-5cd5-4d48-a130-b88ab8152ebc","year":2010},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.059437Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:56d8d01f5e9ef10993186ed6f7052255f4493d31deba479449be4eda29719bde","observation_id":"757e2e7c-b83d-4a2f-b07f-63d85956a169","resolution":{"observed_at":"2026-08-05T16:14:35.967098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.939845Z","title":"Unit commitment in electric energy systems,","venue":null,"work_id":"672d6364-198f-4b4a-8b30-1e58e7517ecd","year":2017},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.065235Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:064d66b69e23a0147c5e0dd7ba36b9be91f981e0face995f8017be18bb9977c9","observation_id":"18fdb416-6bc7-48cc-8463-e2be4b997aa8","resolution":{"observed_at":"2026-08-05T16:14:35.946239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.919923Z","title":"A branch-and-price method for a liquefied natural gas inventory routing problem,","venue":null,"work_id":"f13ec48a-4b8c-45cd-9e2c-ef86b5e6b006","year":2010},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.070846Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:8dbbb10770777bdf7951e5d1dec7e8d48098f7f78feb93033e2f5bea8717e13f","observation_id":"2b25a083-fbc8-4339-bd6f-83b3353c4060","resolution":{"observed_at":"2026-08-05T16:14:35.926339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.895040Z","title":"Optimization framework for distributed energy systems with integrated electrical grid constraints,","venue":null,"work_id":"2c36836f-e6c5-4ace-be41-e6080b435f84","year":2016},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.076092Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:09138f8c6eec5b7658fa949465c8b290c64d6079738cba1cd1c3a5f8942de785","observation_id":"c2f6a0d4-727c-40ec-9553-630fd0aeb708","resolution":{"observed_at":"2026-08-05T16:14:35.900504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.877200Z","title":"A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times,","venue":null,"work_id":"7bcf4e14-468e-46b9-b567-c994d6617093","year":2007},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.081715Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:9915bc20677145b09c4ac23d43e7de28e9d5522cfb6a102b738afd3f7b0d5824","observation_id":"b9b067c9-a4a0-4c3c-ae53-2b6fe3cf37be","resolution":{"observed_at":"2026-08-05T16:14:35.882165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.855017Z","title":"Branch-and-price for energy optimization in multi-hop wireless sensor networks,","venue":null,"work_id":"192c15b0-9392-4d8e-8519-2ef5ba95037d","year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.086739Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:545feb8a69a20dcbd37930e36a27105a5332b5fb4690bae3ff1603033c51c9ad","observation_id":"dd872ed5-bb70-489d-be8e-5c463721fbad","resolution":{"observed_at":"2026-08-05T16:14:35.864950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.829678Z","title":"Optimal admission control in damper- based networks: Branch-and-price algorithm,","venue":null,"work_id":"229b5068-a426-47dc-99c8-ced919c4247b","year":2023},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.092044Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:c6547175108dbde45f48969a39c2da54142725b26d183204b73c2e48ed3e75ab","observation_id":"57062aed-08a3-4427-afc9-8eae14460884","resolution":{"observed_at":"2026-08-05T16:14:35.837480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.807364Z","title":"A branch-and-price approach for integrating nurse and surgery scheduling,","venue":null,"work_id":"8d20c0da-6ca2-496c-9e10-2f9c38b3a461","year":2008},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.097139Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:e628901ba5062a59804840a87f676a992728b81f587769aa147a14fbf4f102c5","observation_id":"f7d0b780-c754-4da0-8404-ec1d3e1fc631","resolution":{"observed_at":"2026-08-05T16:14:35.813404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.102790Z","title":"A tutorial on quantum approximate optimization algorithm (qaoa): Fundamentals and applications,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.102790Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:dfc8e7d53bfc42209a43f72fca2801c3c22daae9a36f50fd73919b6d5b233bc9","observation_id":"fad2b6f0-5bd6-433a-9f61-adee35321da0","resolution":{"observed_at":"2026-08-05T16:14:35.102790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.770264Z","title":"The variational quantum eigensolver: a review of methods and best practices,","venue":null,"work_id":"08fd0ab1-b876-41c5-9f55-99e5dcf5927d","year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.107318Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:65ebfd4f66deaffd92d1673e172cc9f846f55d4f68d01d0ce24b22ba3382fee0","observation_id":"c8580495-3dae-494d-980a-bd4af6b1bf9c","resolution":{"observed_at":"2026-08-05T16:14:35.776901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.751883Z","title":"Hybrid quantum-classical heuristic to solve large-scale integer linear programs,","venue":null,"work_id":"7756f1b1-de93-446b-91ff-12666110200c","year":2023},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.112425Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:667bd568bbd2c14fdb78f7eb82b4597b50ba8301aa61d0a7078465559296920c","observation_id":"ccb76203-036c-4cf9-abf3-18539c7387e1","resolution":{"observed_at":"2026-08-05T16:14:35.756804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.725638Z","title":"A hybrid quantum- classical approach to solving scheduling problems,","venue":null,"work_id":"4c642a5a-0ebf-4259-857d-7d6608f0ef1e","year":2016},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.117842Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:3ef341100d7035674957aa5b9bce38656bb863fede5dbe6271610c75f691c09a","observation_id":"cbf3ea58-d06c-4953-b664-a56728ac3702","resolution":{"observed_at":"2026-08-05T16:14:35.732067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.689510Z","title":"Neural optimization for quantum architectures: graph embedding problems with distance encoder networks,","venue":null,"work_id":"5c2060b9-fd6a-40a1-b414-6086e7370d97","year":2023},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.123594Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:59153f904bb3c6ee90b3ee3b0bbbc94ff45f118474ba69e0782fcf07c17ca6c8","observation_id":"60da967e-f2ec-40d5-af6a-50828c835cc6","resolution":{"observed_at":"2026-08-05T16:14:35.699178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.13030","last_updated":"2022-08-02T09:51:39Z","snapshot_observed_at":"2026-07-06T13:35:35.736085Z","submitted_at":"2022-07-26T16:40:14Z","title":"Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.13030","snapshot_observed_at":"2026-08-05T16:14:35.130326Z","title":"Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.130326Z"},"links":{"cited_paper":"/paper/2207.13030","citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:19cd8bc01f862bf2a22d30ebfda92f9cad919a708d896bbc9fc4fc3cffba9d9e","observation_id":"40dbf28a-a224-4bc0-8e46-279193ca7ef4","resolution":{"observed_at":"2026-08-05T16:14:35.130326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.656438Z","title":"Neural- powered unit disk graph embedding: qubits connectivity for some qubo problems,","venue":null,"work_id":"ca5e94b4-77b4-4cfb-9d62-f5fca66aed5f","year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.136352Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:d5a6b7c42c4b49d6eccc03bd13a66680e1ec32ebbc358c7988a74bc2f011b3f7","observation_id":"77aff174-a12f-4415-b398-b6bf8235215a","resolution":{"observed_at":"2026-08-05T16:14:35.667869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.636864Z","title":"Using QAOA and QAA to solve a ud-mis problem,","venue":null,"work_id":"45f59081-acef-4e72-83d5-179f20adb4ec","year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.141499Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:f52d67d50721e4d8340091630749a123875106f6075cb23db8e060602c731207","observation_id":"ed27777a-dbda-411b-855b-7829ce417a44","resolution":{"observed_at":"2026-08-05T16:14:35.642109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.615345Z","title":"A branch-and-price algorithm for the generalized assignment problem,","venue":null,"work_id":"26dbe5a0-1845-4582-9475-52b660c31af4","year":1997},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.146945Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:235d71d2f914c62150af33e2b98943864339993ee9e57347655703b74bb962ef","observation_id":"28d19a2f-5671-4144-bc50-8a88cb834c36","resolution":{"observed_at":"2026-08-05T16:14:35.622433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.591799Z","title":"Branching in branch-and-price: a generic scheme,","venue":null,"work_id":"40be2b5e-233f-4178-aab1-5024064d82db","year":2011},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.152264Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:baba86902c73cec2519aa93eb5e241b4501fcce2dcba820089ab1d6bf4392c5c","observation_id":"1c87ecd1-b08f-4563-8d8c-81eb32ac05c8","resolution":{"observed_at":"2026-08-05T16:14:35.599310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.569122Z","title":"Bin packing with conflicts: a generic branch-and-price algorithm,","venue":null,"work_id":"1225a638-a205-40c5-9dee-bfa8cbb5cf8c","year":2013},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.157362Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:b78f44d418115dc7222d57188cdd3d2f2cab0839aa65a9c94387574f36585fca","observation_id":"fb0fc4c4-ee96-410a-8834-296a107884ea","resolution":{"observed_at":"2026-08-05T16:14:35.574723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.540963Z","title":"Glpk - gnu linear programming kit,","venue":null,"work_id":"0fe5e6dd-0470-4de8-8cab-cac13c7369d5","year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.162495Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:514684e33aca8d51ff5803cdb175c52a17d02c1f2a5fc7d82b002119f130b400","observation_id":"ef1d6f0b-8430-4217-97ad-31d87a1ec4bd","resolution":{"observed_at":"2026-08-05T16:14:35.553320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.520807Z","title":"Unit disk graph recognition is np-hard,","venue":null,"work_id":"3f2f9fcc-db85-48e9-8291-6ecee8eded51","year":1998},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.167704Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:cdc51265ac39bf174869b97a1bffdb6d35fef10793c2c89999c39690f73dbeaa","observation_id":"c62310f0-d38a-45a9-8df2-672aed6c77f2","resolution":{"observed_at":"2026-08-05T16:14:35.527763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.486008Z","title":"Adiabatic quantum computation,","venue":null,"work_id":"2ef62ee3-df4f-46dd-9899-a018a904737e","year":2018},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.172516Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:e23a6cda4d777719d42fd79acaa2b33a77c0de36f89ecf9e4ce4a828eec300ee","observation_id":"52fba998-98c4-407c-8a98-cfca3612fad5","resolution":{"observed_at":"2026-08-05T16:14:35.497665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.10816","last_updated":"2018-08-31T15:49:00Z","snapshot_observed_at":"2026-07-06T06:58:33.813486Z","submitted_at":"2018-08-31T15:49:00Z","title":"Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.10816","snapshot_observed_at":"2026-08-05T16:14:35.177153Z","title":"Quantum optimization for maximum independent set using rydberg atom arrays,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.177153Z"},"links":{"cited_paper":"/paper/1808.10816","citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:bb3b3c71f49cf5277b3a77051ac97254c37ece1c8c87332c303d563050b0e8b2","observation_id":"ab035c64-6bfb-4af2-9003-235ca1fa959a","resolution":{"observed_at":"2026-08-05T16:14:35.177153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.183421Z","title":"Controlling quantum many-body dynamics in driven rydberg atom arrays,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.183421Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:185105e81dc3d8c1a8da8d965b302536baf6a629ccf25341e1719c4152162466","observation_id":"1b71a172-0d4d-43db-b856-c9afe7128d8d","resolution":{"observed_at":"2026-08-05T16:14:35.183421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.189598Z","title":"On eigenvalues and colorings of graphs. ii,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.189598Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:a7453c4b8ba60e25e26e40e90f43a469e8ad995e8d481027cbe40603780e6814","observation_id":"dbd954ef-dccc-4387-bb22-0e64074b8794","resolution":{"observed_at":"2026-08-05T16:14:35.189598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.01978","snapshot_observed_at":"2026-08-05T16:14:35.194867Z","title":"An inertial lower bound for the chromatic number of a graph,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.194867Z"},"links":{"cited_paper":"/paper/1605.01978","citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:2b225509393f87098aeb2ed33f18117b1682b5133bcb6dae5a1231e8620d4f6a","observation_id":"15ab7bfc-d5d4-4b67-b7be-fe6c8e12f387","resolution":{"observed_at":"2026-08-05T16:14:35.194867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T16:14:35.441467Z","title":"Lower bounds for the clique and the chromatic numbers of a graph,","venue":null,"work_id":"263feb15-7be0-463e-9d5b-9c7a63dd6d60","year":1983},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.201293Z"},"links":{"citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:c75c47c4fcd7d5532eda86ecfec2ec4d204341bc9efa108c97d0f6789ec5d9b8","observation_id":"860e4ce6-9483-4863-bb0e-595daaf53dd0","resolution":{"observed_at":"2026-08-05T16:14:35.447157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":1,"verified_fuzzy":48},"total_outbound_references":60},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2508.18887."}