{"as_of":"2026-08-17T01:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1cf3fc3529756ba26779b7c4747299f77bd39e3733de430e3fec6aabcc4f97a6","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-16T06:30:59.297886+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-15T16:54:42.452962Z","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:877e42da9d58fd6b5bb7d9d53eb31b0cff656bf74d3b157875b5df92cf74daab","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-15T16:54:42.452962Z","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:49fa5aa515c94bd49107f383015f73e84a0a7a5f5c498b15450084c1ded71702","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:e5fa4ef8e24700ebc0c51bc5413afdb324088450a7f854f8978dc9e92402e0b4","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:391aeb8a658b62d0b041c94090529ccc4177232e89a2c560e4cbbbaf06c0d254","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-15T16:54:42.452962Z","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:d4536cd240f5843f5dd404b6a216469198a7b0501bfce30049f382ff5b45e651","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:c827922fb195de2227f000f42dd7ea8a8a9831263dfdb2301f825a9f8298ddee","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:8f6dbd3c273a943a02669f08dd8bb8ee4292653973666c003f9d8c63d9c41f8b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:6cab80c034292a0968bb36b7f001ae6ed0a45b3e8366630dff2457ed92e1e29d","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:17be5335aa0580538d09cd9b75cf11864aa868c6c0b203d63a166b9da0056013","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:4d23b24ba2d78c7e0507264d20d305cf51a72621806a58df68e05aa2febe678d","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:f4e56ff85df58c78e608c7a83067669ed1651600a92303f7a5fd438d724a71dc","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:b47faceb860c0dfe5699ad692415776c489cfe05ea200e305cb91591d6efe561","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:05bfaa598bd454ac01215205244acf52b38f8c460f867161987ae6be3c816a9d","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:a113d8d7c27392b2e8af3dfc9e31b8c0fc611e647756ebb9b0b88b08167976a5","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:167298ccb12319c52283a6b215035cdc491c786399841359a6454a711704e89b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:78c32095fc6f842e029100b558b79ac84eadef8de6523ddb082ea180bdaf657e","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:4c31b98cfa8d3202e9dc8c1225e0ddc42bd69b5edfff431d9e19aedb2519fbc9","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:49a15c1252dac33db8dce4b4195a1d4eb1ac287f1e21e50ad545d967b55abfa6","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:8a619eb1459c3c72eb60925132efe07dca251149a072dfd552b72796509d2fef","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:b7569764c311e4d1ab20b5ab965a16f2a86694b249b7caf876585ff505bf1630","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:1115035ede65468d18d06a048f4605a72488df172d5e1ae6213060ccc6e9736c","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:a6414cdd46c47d1c80d58c148b08a824aac9379afeccd2e39baa21c5e78f5495","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:b67d8bf7a8e988530565674608abfe1615187902f55fd89fdc6869ca6604b199","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:ab54e29f46e4caffa5eeb92b09f1395bdc7ca5d638c463fc044f3c23b66f743e","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-16T20:17:55.570300Z","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-15T16:54:42.452962Z","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:028fc387cb0db401fb503563103215facef4e98e437e70ced214612d8ac98239","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-15T16:54:42.452962Z","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:789305dde75fe5464cc4e9b16217a4c3504cd550a7cc9aab02c9e97f2644b8f4","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:f4be53eb44476bd6c5764d61e0f18c9589df52a28cca15f06e0c855c81639da9","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:3f069b6a0bd12d4c80ec4e84a42737f142201048da353070f264a36bb3c18300","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-16T16:24:38.520410Z","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-15T16:54:42.452962Z","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:1e84d35db7754346fca9141510aa62b801c0ccc820d6b9354e8a2a16ba517726","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-16T19:13:12.703571Z","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-15T16:54:42.452962Z","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:bc1fcc3ccf71b67cb1c5df05b490b430e4962389c020a4229581cad7224ddb79","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-15T16:54:42.452962Z","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:18251cdd2885ee02f550e1bde32a60d85f62ab864f9d210fb494594eb99f0745","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:a3a983fbdcd85fb7a7bfb69cf49d6fae430274ea92971397ef6255d98013703d","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:ddb0c8325a792a5d72120020d6981adb5aacd917652753667eb9f00bdab2d832","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:d0e96403083636a92a4e827eaaa197d9258932f0db87cf5ab580b037d1622201","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:8c85635d970d80e249514f9e9c3f9667466f50c837c833518f3d98120822071a","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:b178f57ce7aef1aa3143cc04d9a6d4a9adc19773a1b6a10d094c199fb737d720","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:9f852c638db3ffd4aada61b4b450d8b09bcf01b35750322bf6d0cabdb851e838","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:dcefad3fc7cd04d270b4159d29fb2551457a6b04322276b8ec144b611c6504a1","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:6f9415e5421674d1a5d2270e4e49dc393687374ad5200349648a1f3bf7fe8958","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:a65dfa1f67a0f15b1b79511eba4a6d61fb0376fe1a91ad51b150d90dcb67878b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:7ef97adbe2fc832a859865f27e09cf3c1d002428a8b7bd6023fa363006f8a69e","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:57423dc15e0b64b02d40d2deb637bca49cc36984d3e4c9a79ee39bc573c66a41","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-15T16:54:42.452962Z","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:422ebccca29b8a9679b63773927cb300b934defdde871d105e3b15f3c852306a","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:990b91fc67710e3ca7bcf8c19fca7e0ff18da10c070cedbabb18c984b84d486b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:5726f0b194ef40dfd3cff0f843537d26adc25f512da48e6eac2c883682b7762c","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:98853b11a62077ac071d6c7398c989dfcf5fe5f05be38589b48f18a7ba28fcb8","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-16T16:43:11.296753Z","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-15T16:54:42.452962Z","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:dd8725c29c771681cada6e207ea39b7bf326b27f69ad5f3522e28e654aeacc79","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-15T16:54:42.452962Z","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:abbf06196d6c13a8ff89629855aadfafba10185a0731777ab56de3cfd83ed319","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:1468a094f9e5cf5ba8d92b07d3811dcc53c2f1552d07d4f483598d07f3c62918","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:9301306f8ccceb51ccc777cd7dafcf873ac4585ad52dab78b9adff35444191a6","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:8f478f31182062a18cc85505ea70a61f525a1815954de42bdd80b9c464211cbf","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:3c64b086f5cc7dea1e5613088f670c3750437bd3c6078e2527bdde4462223c30","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:ce5bbaa52ca579ff54cfdce80afb6ad4b976e113b31855a5a3761ffdcddfb8be","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:c2d95c3ead071d39e198e3e24abbe6396aa1e14c3169021b1ffa1cb0ccb48f6b","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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:c04528e81674253e3ac453e03f57d9881e23e36d0134dbb57c0e0996078c9d61","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-08-14T18:34:32.276582Z","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-15T16:54:42.452962Z","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:b2f32cc9439325e77b7dfa7ea01af7e6778300cc5283a38e7e7c046f67b308b7","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-15T16:54:42.452962Z","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:4f58da0505905ab5460a54cdf0940fee1b660ebc2ef22e92f5b3fe78df62550c","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-15T16:54:42.452962Z","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:37f7ff9d4639e7aaf3f03a1226d185c54f06c352e2fe4ad96cf3a028d26bb7d9","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-08-15T09:00:29.296669Z","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-15T16:54:42.452962Z","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:ae4045cad188f9e0c2ce46bb03ac5518d555d656d72d6d54cdf387e996362e50","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-15T16:54:42.452962Z","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:b58bbb6077d974e94aca6999a34c3167b1b03dd372d519ceb68a4d484b330806","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T16:54:42.452962Z","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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2508.18887."}