{"as_of":"2026-08-12T04:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7d84443f40fd66150cad2bd7008e32a8c6dccc6e3c1be9a09fc6695bca566b2e","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T12:49:06.676513Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"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-17T21:26:29.185866Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-17T21:30:18.446471Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2507.21560/citation-record","integrity":"/paper/2507.21560/integrity","json":"/paper/2507.21560/citation-record.json","paper":"/paper/2507.21560"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:49:11.510372Z","title":"Vizing's theorem in near-linear time","venue":null,"work_id":"76fc27bc-6514-4a2c-9464-5cd05d02d503","year":2025},"citing_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},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:04.140827Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:1c90bb45a00645972ede071a21ff2b3b815d130f16215c1fb23d0ec828b8926b","observation_id":"9ae81be9-5ed8-4ec2-be07-f9803d368eb7","resolution":{"observed_at":"2026-08-06T12:49:11.622645Z","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-08-06T12:49:11.236094Z","title":"Switch scheduling via randomized edge coloring","venue":null,"work_id":"a1dad859-9c41-480a-a6ec-ed0f5ceb9501","year":2003},"citing_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},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:04.294590Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:3093ef918b990c4c2afb35f7315e76c0df9a836a424a88eec68def3502f8d654","observation_id":"707dc13e-afdd-4376-8af8-bb428235adfe","resolution":{"observed_at":"2026-08-06T12:49:11.371111Z","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-08-06T12:49:10.924416Z","title":"On the power of randomization in on-line algorithms","venue":null,"work_id":"2dd6accf-cc2c-4219-9e0d-4b041aee187f","year":1994},"citing_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},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:04.463686Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:65f80d6718bccebd58bdf77a86040a4744edda1461515f659c44f46003c0ad7a","observation_id":"6bea523a-a754-407a-8a41-5dadf405fcaa","resolution":{"observed_at":"2026-08-06T12:49:11.069811Z","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-08-06T12:49:10.611014Z","title":"Online edge coloring algorithms via the nibble method","venue":null,"work_id":"a54c58ba-8d7e-40ec-9385-6c77497a6131","year":2021},"citing_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},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:04.590592Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:1e2f43af6cd303a323c5b116c932ee9ef258b5cc26a00b917097be8b0f129139","observation_id":"70d20273-3e45-4466-a8fb-074f0182feda","resolution":{"observed_at":"2026-08-06T12:49:10.760390Z","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-08-06T12:49:10.313408Z","title":"Online graph edge-coloring in the random-order arrival model","venue":null,"work_id":"f7168ec8-2ee2-454e-a72f-c9f6dd84b11d","year":2012},"citing_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},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:04.807206Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:eb3f07be54cbe18d4abd25fa753f30e27ab6563c5b62b41e8b842efb4818c265","observation_id":"ee49517a-006e-4c6d-b178-22284ba8d3a6","resolution":{"observed_at":"2026-08-06T12:49:10.482636Z","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-08-06T12:49:10.032602Z","title":"The greedy algorithm is optimal for on-line edge coloring","venue":null,"work_id":"75e49476-fa53-4b95-bd53-d774e98fb3b0","year":1992},"citing_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},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:04.987619Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:2aa51d36e95251ada8555fa354449b5e68e65c8faf76675adf318db3ab48c0f1","observation_id":"fe468f96-2d42-4176-ac62-59521f233521","resolution":{"observed_at":"2026-08-06T12:49:10.161384Z","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-08-06T12:49:09.663348Z","title":"Online edge coloring is (nearly) as easy as offline","venue":null,"work_id":"c33a1085-54f0-42fc-8d50-76a7784e562a","year":2024},"citing_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},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:05.130578Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:e8cf3720c95aee7e29e927a52d5be2a714694d390c0c9c3bec64a3edf72e25a6","observation_id":"88367e03-1d19-44c6-9d84-6863ed1188b2","resolution":{"observed_at":"2026-08-06T12:49:09.847026Z","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-08-06T12:49:09.297867Z","title":"Simple and optimal online bipartite edge coloring","venue":null,"work_id":"8fd68ff5-c794-484d-817c-83d7a4de14d9","year":2024},"citing_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},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:05.287188Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:f2ec7bc3b1abe899eae49f205b6a7437b453d1c5e22711da0e6fd3eba2d8de7c","observation_id":"dba607ed-cc26-4e3d-9c0c-0c74143bd32a","resolution":{"observed_at":"2026-08-06T12:49:09.466581Z","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-08-06T12:49:09.041997Z","title":"Deterministic online bipartite edge coloring","venue":null,"work_id":"ffb69bb3-63a3-4043-a5c3-34c55ec4242c","year":2025},"citing_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},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:05.419472Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:53671b566cec67123e692aab069a73ad10bdb236fd2878506952ebcfcdbb26db","observation_id":"4bbb54da-6fd1-4f58-bd30-e3376a7a3556","resolution":{"observed_at":"2026-08-06T12:49:09.167846Z","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-08-06T12:49:08.777959Z","title":"Tight bounds for online edge coloring","venue":null,"work_id":"6388fa23-e69c-4fcb-aafe-dc317f31c2d1","year":2019},"citing_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},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:05.593213Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:b55db14e6ade11d8a128a148447cf5350b2b71e6862537fd6d9e9e6e359190c5","observation_id":"357b00d3-eb60-4370-a848-ff0c8d59de24","resolution":{"observed_at":"2026-08-06T12:49:08.914663Z","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-08-06T12:49:08.473857Z","title":"Randomized greedy online edge coloring succeeds for dense and randomly-ordered graphs","venue":null,"work_id":"e9b54999-2364-4e11-8c68-fbdd7b9a24d6","year":2025},"citing_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},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:05.739319Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:ea95b7c740375bb48645ee9493f55765df3cb5eb6e4bc993fa5b6b6b6d89123e","observation_id":"b0b11143-86fc-41c4-a8cf-4b5e5421c604","resolution":{"observed_at":"2026-08-06T12:49:08.639997Z","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-08-06T12:49:08.229115Z","title":"The np-completeness of edge-coloring","venue":null,"work_id":"cf87305d-768f-430a-80ff-95a4dd94a1eb","year":1981},"citing_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},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:05.880797Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:a8a6db6b9fd6ee33747af4be5b3dc31b83b9257ae69e3d01bc3ea9551b0ec14a","observation_id":"671e0d1d-061a-4598-8c05-2e7ad442ef05","resolution":{"observed_at":"2026-08-06T12:49:08.344883Z","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-08-06T12:49:07.969283Z","title":"Asymptotically good list-colorings","venue":null,"work_id":"6b13811b-ef82-4813-88e3-d27d87ace08d","year":1996},"citing_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},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:06.006583Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:30586f2da94558ac0a74f7435659e27fc167c1281c658f98ee6b49b7e4092104","observation_id":"806d39c4-4a64-44a1-83ce-13aa8a4c4d0e","resolution":{"observed_at":"2026-08-06T12:49:08.081062Z","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-08-06T12:49:07.728099Z","title":"Online edge coloring via tree recurrences and correlation decay","venue":null,"work_id":"bd7066ee-07f7-47a3-8140-0a10de181c71","year":2022},"citing_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},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:06.142322Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:72558dd75395febc4893dae3c4207f95482fae4ea9d8e2e8ad128a4fb96690c9","observation_id":"dd029ebf-6bfb-4d75-9dbb-97aa6624d87f","resolution":{"observed_at":"2026-08-06T12:49:07.836862Z","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-08-06T12:49:07.419987Z","title":"Solutions of ordinary differential equations as limits of pure jump markov processes","venue":null,"work_id":"0ecc0b24-c939-4d22-8553-64d32a15e22d","year":1970},"citing_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},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:06.292169Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:9f3c02e78e61cfcdd8a619463406789b079b24a850ac31349f7c0bdfa1c2864d","observation_id":"6f3a67d9-18de-4e1b-913a-5074356dadd3","resolution":{"observed_at":"2026-08-06T12:49:07.554820Z","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-08-06T12:49:07.129790Z","title":"The greedy algorithm is not optimal for on-line edge coloring","venue":null,"work_id":"a74c635c-73ad-459b-9909-8cb2ca649886","year":2021},"citing_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},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:06.411422Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:40a0c1e89c0d47050aa93e6b35f5326345acfb14085499aaaf7429516a138c48","observation_id":"77604b77-a18c-4473-bed5-d29ecf1d09e8","resolution":{"observed_at":"2026-08-06T12:49:07.281682Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T12:49:06.545255Z","title":"On an estimate of the chromatic class of a p-graph","venue":null,"work_id":null,"year":1964},"citing_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},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:06.545255Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:81ccb40aa206f00ab8f9603397f00b5f109cadcf55968e276d37d08bec4235ed","observation_id":"c1f84754-0d6f-4c52-b597-9af78c2477ab","resolution":{"observed_at":"2026-08-06T12:49:06.545255Z","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-06T12:49:06.829239Z","title":"Probabilistic computations: Toward a unified measure of complexity","venue":null,"work_id":"53336c13-71cc-49c9-9f88-6c21b30984f0","year":1977},"citing_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},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T12:49:06.676513Z"},"links":{"citing_paper":"/paper/2507.21560"},"observation_digest":"sha256:33d4e5e01587cb2a36a4984f173cfda48e8612b580bcea810b29ed17b39b56bf","observation_id":"f678da36-d9db-4c3e-b991-4c0594089ac4","resolution":{"observed_at":"2026-08-06T12:49:06.953252Z","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":"2507.21560","last_updated":"2025-07-29T07:51:27Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T12:49:01.430212Z","submitted_at":"2025-07-29T07:51:27Z","title":"Online Edge Coloring: Sharp Thresholds"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":18},"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 12 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 1 inbound Pith citation observation for arXiv:2507.21560."}