{"as_of":"2026-08-13T15:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13e010dd7f62e72a1cf3ec2ae0a5bb3c38bfa3f2871fbd26da47f7fd49937dac","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:38:38.976002Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2501.05570/citation-record","integrity":"/paper/2501.05570/integrity","json":"/paper/2501.05570/citation-record.json","paper":"/paper/2501.05570"},"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-10T21:38:40.368259Z","title":"Estimation of the exterior stability number of a graph by means of the minimal degree of the vertices","venue":null,"work_id":"6e39b670-b393-4b63-af3e-3148c37aaec4","year":1974},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.569741Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:e39fbceaacc36594ed1bafc6dc13f89a32b1470efb34f7c110e50eae6e2a1448","observation_id":"23667938-9f70-4427-b2e6-1a040ec73063","resolution":{"observed_at":"2026-08-10T21:38:40.372631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.354915Z","title":"Vizing's theorem in near-linear time, 2024","venue":null,"work_id":"b0c205ad-9c62-4cf5-bf8b-ebc367cac0ac","year":2024},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.575183Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:95874bfd68999708c50efe0146e7a90d29104bd152ce263b8113497d871cfc72","observation_id":"75853441-08e0-4de8-a7f8-cc40d54fd26a","resolution":{"observed_at":"2026-08-10T21:38:40.359136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.341436Z","title":"Distributed edge coloring in time polylogarithmic in","venue":null,"work_id":"7fae4bda-1b9c-4716-8223-f65d1efb1302","year":2022},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.579868Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:9a2863406f0c996f33d79378f62dbcbd41a4796e3b62129e396eab4dbbc60655","observation_id":"f7da93c9-716a-455f-befe-3789f91c83e8","resolution":{"observed_at":"2026-08-10T21:38:40.346171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.328778Z","title":"Derived graphs and digraphs","venue":null,"work_id":"39888e38-d316-424b-b4e2-d19ae61e01d3","year":1968},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.584781Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:910cf2a0830c60364dcce7fe09e4c84cd27dd31ea755c8ed44e47b45c42b531c","observation_id":"3ff1d510-5367-495a-9ef3-770714e70ca8","resolution":{"observed_at":"2026-08-10T21:38:40.332767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.315601Z","title":"A fast distributed algorithm for ( +1) -edge-coloring","venue":null,"work_id":"0da033e4-ed06-44fe-b296-cf4008ac7e58","year":2022},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.589291Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:3c57b675cb9d1364d69f2aac410bf52fb5b792bc0c427661961ec7ad0b3f76c9","observation_id":"9b0b33bf-4083-4d5e-9b04-a85d002ea6ac","resolution":{"observed_at":"2026-08-10T21:38:40.320103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.302685Z","title":"Arboricity-Dependent Algorithms for Edge Coloring","venue":null,"work_id":"857d410f-18cc-4ea6-acc1-1dfd70794336","year":2024},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.593260Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:63c9f1c428049e68926fc41242414956f2e8a959fd897989c252f07394699c2f","observation_id":"1681162a-459a-4888-8720-ee84ee088f13","resolution":{"observed_at":"2026-08-10T21:38:40.307156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.288888Z","title":"Determinant sums for undirected H amiltonicity","venue":null,"work_id":"97d83243-e265-4a6b-bc6b-1efa00bc4ed5","year":2014},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.598023Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:3e3f8371ed7f961ec2971cd68e13bfa215294a41d9eb65d60f7f898746adb9a0","observation_id":"5f89d4c9-41a3-4b85-a9da-7fa9a14953f3","resolution":{"observed_at":"2026-08-10T21:38:40.293359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.04987","last_updated":"2024-12-06T07:42:36Z","snapshot_observed_at":"2026-08-13T04:13:07.603800Z","submitted_at":"2024-04-07T15:10:25Z","title":"Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture","version":2},"cited_work":{"arxiv_id":"2404.04987","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.04987","snapshot_observed_at":"2026-08-10T21:38:39.033807Z","title":"Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture","venue":"cs.DS","work_id":"018fc095-c1b9-4100-9789-303104bfc3bb","year":2024},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.602040Z"},"links":{"cited_paper":"/paper/2404.04987","citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:66d79e880f8898e214d0e918bcf760daf0740743bec07b22a251972668e9c05d","observation_id":"205bbad6-5df2-4f32-93b6-a7a4031d142b","resolution":{"observed_at":"2026-08-10T21:38:39.038747Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.275725Z","title":"Exact algorithms for exact satisfiability and number of perfect matchings","venue":null,"work_id":"4801b258-57e4-485f-85f3-67d771c3e320","year":2007},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.606973Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:0bff05e078070623c760c8fdcab5a5a47f72c2bb3e9a724b08681d6f676d0ffc","observation_id":"c893f5f8-62a0-44b3-8fc7-1e402678fced","resolution":{"observed_at":"2026-08-10T21:38:40.280066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.248532Z","title":"Trimmed moebius inversion and graphs of bounded degree","venue":null,"work_id":"cd0b38d5-b1fe-42cf-a358-09454f568f48","year":2009},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.610992Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:95e0a431340ff469e751812ce93794596954b471889624720c9381ed8650f4c2","observation_id":"5cf435ed-32b5-42a8-b8f6-9ff8a5956872","resolution":{"observed_at":"2026-08-10T21:38:40.266344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.169016Z","title":"Narrow sieves for parameterized paths and packings","venue":null,"work_id":"0726967b-ad95-4ecb-bbc8-bc891d09e28a","year":2017},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.615371Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:bed3cbdb3f407e787f2e530e0e7802bcf1206edb4b2d0905494e507d27ead342","observation_id":"60dbf66d-819c-4e7e-96b7-213b84652160","resolution":{"observed_at":"2026-08-10T21:38:40.199210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.111202Z","title":"Set partitioning via inclusion-exclusion","venue":null,"work_id":"0bf32fb0-37e6-4db3-93cd-34e3aeb4f9a0","year":2009},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.619522Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:864c4eefd8a5c4ec8cac9f2462ff04fc74ba1f71f57d9d79d286d92accdd45d4","observation_id":"53450c60-e283-4e02-85b1-aade3946b411","resolution":{"observed_at":"2026-08-10T21:38:40.115810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.097797Z","title":"An estimate of the external stability number of a graph without suspended vertices","venue":null,"work_id":"bea9b5ac-6306-4510-9d3e-dc02e29ef734","year":1973},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.623825Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:77b260964e62f73af073fc83e7268da9c45542efd39170b597c216f988937cea","observation_id":"60945a41-81aa-4e47-acd9-9d8e905a1eff","resolution":{"observed_at":"2026-08-10T21:38:40.102164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.084637Z","title":"Enumerating maximal independent sets with applications to graph colouring","venue":null,"work_id":"ed5e5f07-f75d-45bf-8e7d-de66568bbf11","year":2004},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.628018Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:500e916604c8c16845db611c81e52689247d8d27ea29e4f082702e43b351e3b0","observation_id":"49ea91b4-2bf0-4fe7-94be-3220af929cd5","resolution":{"observed_at":"2026-08-10T21:38:40.088966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.072040Z","title":null,"venue":null,"work_id":"eecc3c37-bb4b-4a8c-adb2-62795593c961","year":2024},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.632551Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:3c9e817c3f3bf1976571b7edbb4bf647c83d30fc3ff6dfefda285627ccde7927","observation_id":"ce90985f-a342-4101-b890-4ba73852457c","resolution":{"observed_at":"2026-08-10T21:38:40.075879Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.058336Z","title":"Golovach, Dieter Kratsch, Mathieu Liedloff, and Artem V","venue":null,"work_id":"b51b87e5-fd8e-483a-a609-c00d7d2656c8","year":2013},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.636664Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:a689d549313eb7d9efcc1f05d5e6aaad0f420566d82f58d0a9572f74d3a360d7","observation_id":"24ef1ea8-f392-48e5-9c61-a9646a623d1c","resolution":{"observed_at":"2026-08-10T21:38:40.063732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.045703Z","title":"Dynamic Edge Coloring with Improved Approximation , page 1937–1945","venue":null,"work_id":"a9514866-2014-48e8-9ea6-b889d34a55f7","year":1937},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.640661Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:72a0a596c9d38856966ed0ad28d0f90046e0d3814702540a14eab2436a16735f","observation_id":"a7845aea-b59b-45da-a5cb-921d3c0b16b9","resolution":{"observed_at":"2026-08-10T21:38:40.049825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.032318Z","title":"Determinantal sieving","venue":null,"work_id":"cf68f16f-1bf9-47f1-b1d7-2c16a4e908d6","year":2024},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.645268Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:a37c74b8f67b317be8b7c810dfc6b722c1ef859c17b1c683ef820a8da2ae35e5","observation_id":"8c0f7c1d-2ab8-4d32-8cbe-8d909d9d3453","resolution":{"observed_at":"2026-08-10T21:38:40.036564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:40.019139Z","title":"Small Maximal Independent Sets and Faster Exact Graph Coloring , page 462–470","venue":null,"work_id":"d0f3dec1-aa9b-4aa5-b654-ce9ffa87e481","year":2001},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.649592Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:1c6a1236c4f21f6c17c827729c900468f9faad6b3b7ab3bbfb063c138dbfd898","observation_id":"3bd955dd-c50e-4cec-87ba-cb3bf2200dff","resolution":{"observed_at":"2026-08-10T21:38:40.023562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.991468Z","title":null,"venue":null,"work_id":"03ccc83d-1638-408e-be72-d86a20ac7496","year":2023},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.653754Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:b69cb40a3672fa008b201cc972c111ab523623bed56d6a1796f8f4d9956e9764","observation_id":"178201ec-cf9f-4780-a99b-9c35f1ee3009","resolution":{"observed_at":"2026-08-10T21:38:40.009044Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.880478Z","title":"Kulikov, and Ivan Mihajlin","venue":null,"work_id":"ba33ba4b-c26d-4129-afd0-4f5b787444d4","year":2016},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.657821Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:e5d0dd0e912ea6f3aeaa0ae815e1f7a105bf7c371eeb5d49bb7dbca6a6e4e9ac","observation_id":"215862bd-69b2-4b29-b08b-c5d386f0307f","resolution":{"observed_at":"2026-08-10T21:38:39.920129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.835099Z","title":null,"venue":null,"work_id":"5b39f2d5-a1ea-4617-972b-ba863fa8938d","year":2019},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.661968Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:ecbbbd712a022acb7a6169b0c407910d7df064d38ec0a2dd62df3f747c70e20e","observation_id":"e62ae34a-a490-41f7-b5ea-2b3a1a31c9ac","resolution":{"observed_at":"2026-08-10T21:38:39.854257Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.808390Z","title":null,"venue":null,"work_id":"8e46d211-2003-4737-8457-131e610fb9fe","year":2022},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.665650Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:c209674828e40b86b941c572c2331137d52422ce44fc5ac491c57a4bcf52ebde","observation_id":"e5a91303-da37-4857-b452-1aac65894990","resolution":{"observed_at":"2026-08-10T21:38:39.812571Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.795300Z","title":"The NP -completeness of edge-coloring","venue":null,"work_id":"a4a22ad6-3701-42cd-bf4b-eef473958b88","year":1981},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.669824Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:caa815e745b3d2c088e59e001f70be7ca0e48e51dccca7629fce6e3c3c7edec9","observation_id":"1b407445-03b0-4972-b622-7b768cf62803","resolution":{"observed_at":"2026-08-10T21:38:39.799642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.782336Z","title":"Minor summation formula of pfaffians","venue":null,"work_id":"28cbbc39-8dee-4f2a-aebf-a3a951e583e0","year":1995},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.674161Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:b304fab7f791a7de6d6a3c2f2b300fa961caeb9a2c12f5236807556e838d9c77","observation_id":"ef70bb03-1031-4a22-8b04-f5f6b26a5d49","resolution":{"observed_at":"2026-08-10T21:38:39.786293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11596","last_updated":"2024-02-18T14:17:30Z","snapshot_observed_at":"2026-08-13T04:16:02.756313Z","submitted_at":"2024-02-18T14:17:30Z","title":"Faster algorithms on linear delta-matroids","version":1},"cited_work":{"arxiv_id":"2402.11596","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.11596","snapshot_observed_at":"2026-08-10T21:38:39.011029Z","title":"Faster algorithms on linear delta-matroids","venue":"cs.DS","work_id":"9d6fdc58-51d8-4059-a823-0d429ad0cfe7","year":2024},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.678386Z"},"links":{"cited_paper":"/paper/2402.11596","citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:26c201efd0e449211224467437dca4c4e180d1be2b92ee12835b01763e45d04a","observation_id":"8a6c3e8a-165c-4f5e-ace7-29ab176de260","resolution":{"observed_at":"2026-08-10T21:38:39.017908Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.767611Z","title":"Improved edge-coloring with three colors","venue":null,"work_id":"5cfc95e2-0c7f-490c-aee4-8d5405bf85a7","year":2009},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.682829Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:7738dbc500831e4206d05542f2d5beebdfcf026750fc18ea3f426dc02e8f7714","observation_id":"953b6a79-6486-4a01-8aca-f24ff7b1e481","resolution":{"observed_at":"2026-08-10T21:38:39.772378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.752662Z","title":"Tight Lower Bounds for List Edge Coloring","venue":null,"work_id":"b713a95b-f3b3-4627-aa1f-284964e1c9bb","year":2018},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.686807Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:373483cfbee608948731446b992a726a060f34d116513893fb32132de402f638","observation_id":"9ad54390-f647-4031-a429-41c7aeb7003b","resolution":{"observed_at":"2026-08-10T21:38:39.757353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.739819Z","title":"If edge coloring is hard under SETH , then SETH is false","venue":null,"work_id":"160568f4-a4de-4c15-a61f-e238b0e1a985","year":2024},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.710474Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:601be81f537194a10a5e002b9fcd11b2fd726d55d1e6aa3946f47d4149b31845","observation_id":"e1563486-dbba-468d-9b60-bc70fc6053ae","resolution":{"observed_at":"2026-08-10T21:38:39.743613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.683516Z","title":null,"venue":null,"work_id":"115bfa16-9d24-4052-a480-9c3af7c6fb55","year":1976},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.737681Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:1e4eb88aa30345c7a2f7504d93e8a0c830f5227fb691ee97634f4c98e0645bc4","observation_id":"bdfa491b-3817-4ef2-b9a6-c6995681c4ea","resolution":{"observed_at":"2026-08-10T21:38:39.730310Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.605534Z","title":"Structure and hardness in P (dagstuhl seminar 16451)","venue":null,"work_id":"670c84b7-177f-47fe-bd19-639d1b3afeb5","year":2016},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.763289Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:114272622c41c56851fd679ccf2a9cf21ab685f44c47c1e7064d8169f25818c8","observation_id":"ebb4e13f-375e-48d0-913e-917b55c4663f","resolution":{"observed_at":"2026-08-10T21:38:39.631659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.591282Z","title":"Deterministic truncation of linear matroids","venue":null,"work_id":"c3471235-fda9-4497-9828-e3af8541bbbc","year":2018},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.803091Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:be68ecc6ff30ef6f686e995432cd07d222c30fbe8d842a3cf37a6ac913eaa633","observation_id":"d842edaf-b8fb-45a9-b418-f0364999ef5b","resolution":{"observed_at":"2026-08-10T21:38:39.595785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:38.822849Z","title":"Coverings and colorings of hypergraphs","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.822849Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:cb7539c3a62d225914b4f5f74b0e34690df41a9cb8534a06b586f032f20268b6","observation_id":"7ec71a75-50f9-4fa9-9154-6a240a437777","resolution":{"observed_at":"2026-08-10T21:38:38.822849Z","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-10T21:38:39.566709Z","title":"On the hardness of approximating minimization problems","venue":null,"work_id":"190c7c04-f57a-42d7-8c76-6a587bd3677c","year":1994},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.864450Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:35010b55274883403239493fedf19ba38469db975c2398f34033bba6973a735e","observation_id":"5ee99ad0-7ab4-4f7c-8c95-de5323749da3","resolution":{"observed_at":"2026-08-10T21:38:39.570861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.552923Z","title":null,"venue":null,"work_id":"ac52ba93-cf39-4cd4-a7c2-db4b6411d2a0","year":1990},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.892188Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:5a7594a335791e82eaad61f71361fa25f74530d891c9dbbe6cadee4a83cb5285","observation_id":"ffe997fd-9111-41e3-bb94-9aae24f191f5","resolution":{"observed_at":"2026-08-10T21:38:39.557281Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.539023Z","title":"List edge multicoloring in graphs with few cycles","venue":null,"work_id":"6e5a62a0-37ca-4d55-969b-68b544629a72","year":2004},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.903368Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:782c54c1793ed1e7ff792a5bbb630a18c2f2715d9d80826354442fc72f5ceeb4","observation_id":"38f22da8-95bb-4427-bc18-9d1516e6e4ea","resolution":{"observed_at":"2026-08-10T21:38:39.543458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.526630Z","title":"A parameterized view on matroid optimization problems","venue":null,"work_id":"1d59e829-837d-4c73-b6d8-e7dc0d2b370c","year":2009},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.908145Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:e315c847aabe77415e5b324fbe2b7a36fbef223e284cc7415b595da90bbabe88","observation_id":"01761d0b-b1e7-410a-9f06-ae3fdb84d883","resolution":{"observed_at":"2026-08-10T21:38:39.530664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.512705Z","title":"Domination in graphs with minimum degree two","venue":null,"work_id":"a3c68324-148e-4c93-b666-771cfa268c9c","year":1989},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.913155Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:9efa5412a26bdf830f6f147d8e290cd738abf427ecbb50b7ca24d80263aa52e5","observation_id":"e00c3664-b51c-4119-8317-1b72e3f5a437","resolution":{"observed_at":"2026-08-10T21:38:39.517672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.499125Z","title":"3-coloring in time O(1.3217^n) , 2023","venue":null,"work_id":"50befea6-61c7-46f2-90b3-bf6ff6ea2c44","year":2023},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.917738Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:0b1cda6e6b1b3e11bfb8cbad7f5bbf0c7ec6155b238f0e8289f47dc7bc885c01","observation_id":"3965e364-20e3-4a55-97e2-7e7249f7b4f4","resolution":{"observed_at":"2026-08-10T21:38:39.503620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.433552Z","title":"Randomized Algorithms","venue":null,"work_id":"545fd7a5-1c44-4de0-94cb-001fbdb785a5","year":1995},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.922423Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:ed92ddb32c10589b1ca8a185c522d7985afa19468d145ba66661f4b1f4d47383","observation_id":"3303b5d4-52e0-46d2-bea7-d36fef1abefc","resolution":{"observed_at":"2026-08-10T21:38:39.472633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.294005Z","title":"Matrices and matroids for systems analysis , volume 20","venue":null,"work_id":"95f5789b-2b10-414a-82cf-64a24bc18601","year":1999},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.927260Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:ba5d227d6bbb5e252d7706403228805f9045ed0f6ed403392efc5e00adbce820","observation_id":"5cc52cee-88e5-49b6-9517-239fcd15aa5e","resolution":{"observed_at":"2026-08-10T21:38:39.351409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.259538Z","title":"Theory of graphs","venue":null,"work_id":"521f6e7a-c13b-4241-a1b7-effe617dca38","year":1962},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.933008Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:797a388560a184402e58a6b6bb2f824653637734e1957a77bfb0c02853c1cdb5","observation_id":"824ac6ac-e002-4d97-ac11-107bbab313a4","resolution":{"observed_at":"2026-08-10T21:38:39.264161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.241736Z","title":"Matroid Theory","venue":null,"work_id":"afb505c1-ed5d-4409-bbfe-2641d9cd25c8","year":2011},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.937471Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:97e715048746a09250a7d1c498dfe9df163add53818cadc8fc5cf7c55cc8ea4e","observation_id":"774e39a4-9eab-49b7-b14a-5a092835fcc1","resolution":{"observed_at":"2026-08-10T21:38:39.246369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.227728Z","title":"Sur le nombre d'absorption d'un graphe simple","venue":null,"work_id":"80d18265-0949-4c29-8f99-001da2fbb130","year":1975},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.941738Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:20eb5268a308f2cc4781bc503d0c07093a9089943a2391c97b636448b7185a6f","observation_id":"c96a9fe2-b09d-4fce-8eb4-bb5da10d71c2","resolution":{"observed_at":"2026-08-10T21:38:39.232042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.212084Z","title":null,"venue":null,"work_id":"c04e4135-f9b7-49cc-bb28-f29d882a405d","year":1996},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.946035Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:4ad3d58e7800fb3089dd07467c290e3e7ca2397b22496827b14e153ffcf5b13c","observation_id":"1acb30f1-5cce-4340-ab79-6eaabdcdeb02","resolution":{"observed_at":"2026-08-10T21:38:39.216842Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.197033Z","title":null,"venue":null,"work_id":"753e8ab0-ae0a-4955-b1fa-2396fda4e15a","year":2011},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.951578Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:83c7f1b954612df0d05b732bc56872323708f9367f72089c61797b411161538c","observation_id":"4f5e9db3-5592-4e09-9119-0275d0d02d21","resolution":{"observed_at":"2026-08-10T21:38:39.201489Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.180015Z","title":"Abusing the T utte matrix: An algebraic instance compression for the K -set-cycle problem","venue":null,"work_id":"3c10e290-ffc0-4ed0-87d9-588909259014","year":2013},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.956173Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:f1595246fc31693327add01e2448010ca8ced6116ccea326d65b811ad3bc352a","observation_id":"3c727347-6043-427a-95f8-652357005195","resolution":{"observed_at":"2026-08-10T21:38:39.184631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.165002Z","title":"Finding paths of length k in O^*(2^k) time","venue":null,"work_id":"cab64674-ac19-4dec-86b6-ea2eae2eb29b","year":2009},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.961224Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:6d708ff79c64d0485802e43f9a9e790973496df701b4cfeac174e152ea75dae9","observation_id":"07df67be-df38-44a8-adad-06c72fea454b","resolution":{"observed_at":"2026-08-10T21:38:39.170180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.149981Z","title":"A Faster Algorithm for the 4-Coloring Problem","venue":null,"work_id":"6576a8da-e578-41d6-9ee3-ce0518da745a","year":2024},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.966444Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:f0771d7a5d0ccb6c8c98b65b5cfc0f363fbad1b841dbc4d0c93b6ecc0d1c10bd","observation_id":"a049a47c-0ea2-4278-aef9-9bd2446cb2cd","resolution":{"observed_at":"2026-08-10T21:38:39.154414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.135402Z","title":"Breaking the 2^n barrier for 5-coloring and 6-coloring","venue":null,"work_id":"ca63d80f-55c3-433d-8d97-e2589e299737","year":2021},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.971543Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:e86c1d92a369abc05ec4e657ab7db81a34c8c928be4de74c36700dd85ad736bd","observation_id":"b564cfd7-a51a-45a2-8b6e-b1c827ba7365","resolution":{"observed_at":"2026-08-10T21:38:39.140138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-10T21:38:39.050136Z","title":"Algorithmic applications of hypergraph and partition containers","venue":null,"work_id":"a25ba95d-17a9-4dca-b5e8-5e00aa78a067","year":2023},"citing_paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-10T21:38:38.976002Z"},"links":{"citing_paper":"/paper/2501.05570"},"observation_digest":"sha256:a79d01f4774ec57f0ee6134297cce065ca5c1ab855142dddd2a0e41d0ad52d71","observation_id":"315a6e92-82f4-4804-b4fd-9f41d84fa1a7","resolution":{"observed_at":"2026-08-10T21:38:39.055271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.05570","last_updated":"2025-01-09T20:51:46Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T21:10:36.005396Z","submitted_at":"2025-01-09T20:51:46Z","title":"Faster Edge Coloring by Partition Sieving"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":40},"total_outbound_references":51},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2501.05570."}