{"as_of":"2026-08-11T11:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca407e6190a4bb595f8772fc8de2ef9e56437cccd0ed7d654faf735e97e56aaa","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T21:26:29.185866Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-07T05:52:23.197462Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-05-12T10:31:29.088770Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"cited_work":{"arxiv_id":"2511.16100","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.16100","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online Graph Coloring for $k$-Colorable Graphs","venue":"cs.DS","work_id":"b52e122c-8ff5-4e68-a285-a5cf6b67ab0d","year":2025},"citing_paper":{"arxiv_id":"2604.27690","last_updated":"2026-04-30T10:28:39Z","snapshot_observed_at":"2026-07-31T14:44:01.470504Z","submitted_at":"2026-04-30T10:28:39Z","title":"Online Coloring for Graphs of Large Odd Girth","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-07T05:52:23.197462Z"},"links":{"cited_paper":"/paper/2511.16100","citing_paper":"/paper/2604.27690"},"observation_digest":"sha256:65ab6f260675eb08b499fbda1c745a55bc6cdbd65fa8eaaf0ab89da4d1deebaf","observation_id":"85a725fa-31a2-4af2-b1e0-3dca5fe048ee","resolution":{"observed_at":"2026-05-12T10:31:29.090972Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2511.16100/citation-record","integrity":"/paper/2511.16100/integrity","json":"/paper/2511.16100/citation-record.json","paper":"/paper/2511.16100"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tight bounds for online coloring of basic graph classes","venue":null,"work_id":"579412b9-3afd-4afa-bfcc-2f2a638abfcf","year":2017},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:5342851b3c49e3ca04172bdbb88ea8ffe9a289783e4beaaa0b77a632f45a059d","observation_id":"e147791a-7842-4d74-8652-7f2e72627315","resolution":{"observed_at":"2026-05-17T21:32:08.580344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The nonstochastic multiarmed bandit problem.SIAM journal on computing, 32(1):48–77","venue":null,"work_id":"fa5f3096-cd79-4884-a6ea-5ddc11df027c","year":2002},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:1827e4d7758737a3844a00dfd63d6930b69f28480e7f2bc47a7dbb097c3380ea","observation_id":"6e4fd980-ba03-4d9a-af25-024a83db354a","resolution":{"observed_at":"2026-05-17T21:32:08.592669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Can machine learning be secure? InProceedings of the 2006 ACM Symposium on Information, computer and communications security, pages 16–25","venue":null,"work_id":"99718fe3-7ca2-4993-a78e-d8fe83f338d4","year":2006},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:832018d94f33f1ee940b31fc73b378b6ee9f34b5bf4b985e0879c1f0fe74c957","observation_id":"7992a87c-2e63-4eda-8b36-a9f2fe311e79","resolution":{"observed_at":"2026-05-17T21:32:08.577393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Effective coloration.The Journal of Symbolic Logic, 41(2):469–480","venue":null,"work_id":"a1d59a99-eaa6-4d93-b1b2-8014acd6e63c","year":1976},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:ad372cd6a6f4ede4c93ec0b2f6a80d0e4d36f587af165a729903ad1ef391d548","observation_id":"38fd2c92-875a-4045-bab9-3e4b060bcd4c","resolution":{"observed_at":"2026-05-17T21:32:08.589798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online coloring of bipartite graphs with and without advice.Algorithmica, 70(1):92–111","venue":null,"work_id":"d76162d1-feef-4d51-adfe-450c97615586","year":2014},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:b98636c80940deb0cabc9e2d2372638a535099c44488577334533622d4db0b0c","observation_id":"da830dcf-fcc5-44dd-9e0c-7f0121d3c0a9","resolution":{"observed_at":"2026-05-17T21:32:08.586599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online edge coloring is (nearly) as easy as offline","venue":null,"work_id":"873d8e00-ebc6-40ca-b4e7-95e6f9284820","year":2024},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:6d2ebcaf0f41be23a5f9efe70ae0558cfbd13de8035864011fab791f9b929faf","observation_id":"4b6e5a4e-b473-4c6e-95dd-8f3e2b41eb4c","resolution":{"observed_at":"2026-05-17T21:32:08.583579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deterministic online bipartite edge coloring","venue":null,"work_id":"5a203439-b458-4b92-bcaf-af29687c23ce","year":2025},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:4e870a6ad0091503d4a3c2699541649d49bf607dca05660dbaf2fbea9ac4c2b7","observation_id":"d2d1fc73-6aa4-4982-a965-6a97a4cd70df","resolution":{"observed_at":"2026-05-17T21:32:08.573668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.21560","last_updated":"2025-07-29T07:51:27Z","snapshot_observed_at":"2026-08-06T12:49:01.430212Z","submitted_at":"2025-07-29T07:51:27Z","title":"Online Edge Coloring: Sharp Thresholds","version":1},"cited_work":{"arxiv_id":"2507.21560","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.21560","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Online edge coloring: Sharp thresholds","venue":null,"work_id":"aa870a06-58e9-46e9-8639-97cae965da63","year":2025},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"cited_paper":"/paper/2507.21560","citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:b23b8769dd764a9601b4cb1cfeaf4ef9eb32d1cb602ec8d6c1115e404b33ae61","observation_id":"83ed5364-f906-4ea0-85f4-421f5a570338","resolution":{"observed_at":"2026-05-17T21:30:18.448175Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Graph theory and probability.Canadian Journal of Mathematics, 11:34–38","venue":null,"work_id":"02c3496e-12a1-4801-910c-d80cdeea4a11","year":1959},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:aae5869c576a55abb5c2c23f621e74d72552994afa97098aebe989703b7ddfad","observation_id":"ee7191ad-626a-4978-95e8-011eb89e1bb0","resolution":{"observed_at":"2026-05-17T21:32:08.570660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Zero knowledge and the chromatic number.Journal of Computer and System Sciences, 57(2):187–199","venue":null,"work_id":"0fff7811-7515-4a88-b4ca-9690f5e274df","year":1998},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:8f5140b14a363e03f0702d90ba277175acdd2d42858f71a00c350b048f178736","observation_id":"eca86307-e6d5-42af-a115-e3dbc71440fd","resolution":{"observed_at":"2026-05-17T21:32:08.567455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lower bounds for on-line graph color- ings","venue":null,"work_id":"9628af14-619b-46ab-8900-9d521fb2084e","year":2014},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:9b960134cc8289e7446fac91267e870dd8199f9433d050dd56ec1c62e17871dc","observation_id":"48867e9b-c8d6-4ee8-b7a6-38466537977a","resolution":{"observed_at":"2026-05-17T21:32:08.564042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On-line and first fit colorings of graphs.Journal of Graph theory, 12(2):217–227","venue":null,"work_id":"e5343c96-39bf-4399-8bee-625756beba5e","year":1988},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:6027b86463e301d2320ee49fbcea2aea540b51d6b7aae549924228a386c890cf","observation_id":"4232a109-35c2-4c97-bbcc-a0c0a311a137","resolution":{"observed_at":"2026-05-17T21:32:08.560938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Halld´orsson","venue":null,"work_id":"07df5b31-20ba-475f-9cd5-d4959b6db45d","year":1993},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:eafa4aaea207457811c47aeebadcd3bc86f1610b38692d0d9cbed065b5dad2a4","observation_id":"524e72c3-dc34-4348-84a8-f8f0f8c74373","resolution":{"observed_at":"2026-05-17T21:32:08.557779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parallel and on-line graph coloring.Journal of Algorithms, 23(2):265–280","venue":null,"work_id":"9170c1df-1928-4131-8d12-9f8eb9a7b197","year":1997},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:7ff3fe6b0440f2fa32881f89dc22025d84ef1c062b2568be827674e665733418","observation_id":"5651e6af-45ee-46e4-a248-9192665a50cf","resolution":{"observed_at":"2026-05-17T21:32:08.554808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lower bounds for on-line graph coloring.SODA ’92, Theoretical Computer Science, 130(1):163–174","venue":null,"work_id":"a387a66a-f61a-405a-b0fe-9e307355475b","year":1994},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:207929e4ded6da56057f856700e654fb63a80afb946da340f54ed1f12b4ba3ab","observation_id":"a54f7918-91a1-4341-b195-24035f235f33","resolution":{"observed_at":"2026-05-17T21:32:08.552045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coloring inductive graphs on-line.FOCS’90 and Algorithmica, 11:53–72","venue":null,"work_id":"6f2bc7a0-2273-4a6a-ba19-3c61e266eefc","year":1994},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:193f1bc7390c0bfda1d4db4c5d81ab52bdcb7510e08d841113dd2fb6fb04ccf3","observation_id":"0af6ea92-1046-4ab9-85ea-2143e9921a52","resolution":{"observed_at":"2026-05-17T21:32:08.549224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Better coloring of 3-colorable graphs","venue":null,"work_id":"e6bf7749-b75a-4bf2-a4b1-9fe685726e2b","year":2024},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:ae77bb4a68598af1ae46d1e81d1eed9b17620cce89389090a8e38577a7ce1c88","observation_id":"4667d71f-b062-4232-b029-ed3ea8190814","resolution":{"observed_at":"2026-05-17T21:32:08.545467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On-line coloring k-colorable graphs.Israel Journal of Mathematics, 105:93–104","venue":null,"work_id":"28d53cfe-7bc9-43bc-86d5-aecb7e303f4a","year":1998},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:67c99f88e013656da738847a03721b72fd4730352b19862c2eda38235869b503","observation_id":"7349470f-6e40-4a5a-8656-1d8eb713e1ac","resolution":{"observed_at":"2026-05-17T21:32:08.542443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coloring graphs on-line.Online algorithms: the state of the art, pages 281–305","venue":null,"work_id":"caa87fd3-f7d5-4ab7-a573-8ca446d6dc5d","year":2005},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:0ea00b7bea08c023eb04c1a427c11112b63d93304a66824309f3f396b87b8b22","observation_id":"fdbfeb8c-34c7-43f0-9130-a314ef9e02a1","resolution":{"observed_at":"2026-05-17T21:32:08.539237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"American Mathematical Society","venue":null,"work_id":"697ed430-552d-4876-b80f-22123697aa4b","year":1979},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:211e5a25fdf1ac06bb4c2d21d060ead9662b0c7b07b8cf057f30bb39fe17da0d","observation_id":"89f16bb7-765b-43ad-822b-d8d92c611aa6","resolution":{"observed_at":"2026-05-17T21:32:08.535955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An on-line graph coloring algorithm with sublinear performance ratio.Discrete Mathematics, 75(1-3):319–325","venue":null,"work_id":"3dd999bf-e1bc-496f-a45b-ad51f5fdd287","year":1989},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:2e09924d83e0509474aacca65b79924eb061d282dc366a1218807702baaef1ef","observation_id":"9f03bbdc-90e6-4ea5-8560-f2a85e77979c","resolution":{"observed_at":"2026-05-17T21:32:08.531168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cambridge University Press","venue":null,"work_id":"e36811e4-c182-45f9-8cf9-7073a5146490","year":2021},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:ad07c5a0a9e2a6284c9c72ca17736ab72173ff0d6889bb4131e15c4c1bd2cbf1","observation_id":"8c74d70c-40c8-4a4b-8b6f-3dc8d1a57097","resolution":{"observed_at":"2026-05-17T21:32:08.528023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Randomized online graph coloring.FOCS’90 and Journal of algorithms, 13(4):657–669","venue":null,"work_id":"02966ea3-ed5b-47e8-815a-ce82bc120c42","year":1992},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:ff64c7f8201f1130e5232add3fa0d6010b082a2f93fe09e560d41a6539fcb40a","observation_id":"9ab0a5c9-a198-4a28-a453-9977cb24d077","resolution":{"observed_at":"2026-05-17T21:32:08.525094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Probabilistic computations: Toward a unified measure of complexity","venue":null,"work_id":"e58a32d7-0768-4150-b48d-997b714229d2","year":1977},"citing_paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-17T21:26:29.185866Z"},"links":{"citing_paper":"/paper/2511.16100"},"observation_digest":"sha256:c05886155a68bdd0f068daa74da4364f2f98e592ec6073fb357441f82e674d0c","observation_id":"e2b8ba22-f360-4588-9664-12ee5c826804","resolution":{"observed_at":"2026-05-17T21:32:08.521932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2511.16100","last_updated":"2026-04-03T06:58:58Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T21:30:45.512701Z","submitted_at":"2025-11-20T06:45:14Z","title":"Online Graph Coloring for $k$-Colorable Graphs"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":23},"total_outbound_references":24},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 1 inbound Pith citation observation for arXiv:2511.16100."}