{"as_of":"2026-08-07T18:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b2583eb164a1a4d1f73660c2e601d1a6a664b7ec516c6b322a78815175a8d8b","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:38:50.729532Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-07T21:34:09.303480Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.04397","last_updated":"2022-12-08T16:55:01Z","snapshot_observed_at":"2026-08-07T12:15:47.780916Z","submitted_at":"2022-12-08T16:55:01Z","title":"The optimal edge-colouring threshold","version":1},"cited_work":{"arxiv_id":"2212.04397","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.04397","snapshot_observed_at":"2026-07-07T21:34:09.303480Z","title":"The optimal edge-colouring threshold","venue":"math.CO","work_id":"5186d899-b208-4145-965a-ff589611fdc3","year":2022},"citing_paper":{"arxiv_id":"2309.12607","last_updated":"2026-04-12T08:25:55Z","snapshot_observed_at":"2026-07-06T16:22:09.775204Z","submitted_at":"2023-09-22T03:48:11Z","title":"Robust Hamiltonicity in families of Dirac graphs","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-24T07:07:03.211243Z"},"links":{"cited_paper":"/paper/2212.04397","citing_paper":"/paper/2309.12607"},"observation_digest":"sha256:1a6e1d1fcac10ca1c0c7be3c16c0e6a802603ab301f1b347ca71e65732c44751","observation_id":"63f2e103-8a94-4052-bd18-171f8feffb68","resolution":{"observed_at":"2026-05-24T07:09:05.313448Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.04397","last_updated":"2022-12-08T16:55:01Z","snapshot_observed_at":"2026-08-07T12:15:47.780916Z","submitted_at":"2022-12-08T16:55:01Z","title":"The optimal edge-colouring threshold","version":1},"cited_work":{"arxiv_id":"2212.04397","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.04397","snapshot_observed_at":"2026-07-07T21:34:09.303480Z","title":"The optimal edge-colouring threshold","venue":"math.CO","work_id":"5186d899-b208-4145-965a-ff589611fdc3","year":2022},"citing_paper":{"arxiv_id":"2606.18174","last_updated":"2026-06-22T14:10:13Z","snapshot_observed_at":"2026-08-03T06:10:38.467053Z","submitted_at":"2026-06-16T17:08:58Z","title":"Universal probability bounds for partial Latin squares","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T23:37:21.762778Z"},"links":{"cited_paper":"/paper/2212.04397","citing_paper":"/paper/2606.18174"},"observation_digest":"sha256:2f6b019d361d068e18ddb7e5082911080be23ac1f5690be67345d9aae9683fec","observation_id":"07dc8282-8b96-4534-8efb-73fb73a20cf3","resolution":{"observed_at":"2026-07-03T22:19:00.486489Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.04397","last_updated":"2022-12-08T16:55:01Z","snapshot_observed_at":"2026-08-07T12:15:47.780916Z","submitted_at":"2022-12-08T16:55:01Z","title":"The optimal edge-colouring threshold","version":1},"cited_work":{"arxiv_id":"2212.04397","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.04397","snapshot_observed_at":"2026-07-07T21:34:09.303480Z","title":"The optimal edge-colouring threshold","venue":"math.CO","work_id":"5186d899-b208-4145-965a-ff589611fdc3","year":2022},"citing_paper":{"arxiv_id":"2607.05255","last_updated":"2026-07-06T16:01:49Z","snapshot_observed_at":"2026-08-02T01:31:20.321461Z","submitted_at":"2026-07-06T16:01:49Z","title":"No-$(k+1)$-in-line problem for $k \\geqslant 3$","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-07T21:25:11.018193Z"},"links":{"cited_paper":"/paper/2212.04397","citing_paper":"/paper/2607.05255"},"observation_digest":"sha256:bbbcb180d1e622ead303ce136866dcd8bac6aed8c7c089b8042c74e0beee2399","observation_id":"b730b1cc-65a4-4018-a36f-2de9736c3ffc","resolution":{"observed_at":"2026-07-07T21:34:09.304925Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.04397","last_updated":"2022-12-08T16:55:01Z","snapshot_observed_at":"2026-08-07T12:15:47.780916Z","submitted_at":"2022-12-08T16:55:01Z","title":"The optimal edge-colouring threshold","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.04397","snapshot_observed_at":"2026-08-07T04:38:50.729532Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-07T18:23:09.065946Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:50.729532Z"},"links":{"cited_paper":"/paper/2212.04397","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:fcf63587d03bf5f736f3e99d0e69124abb99d2c414376e9a8433b617d70516e4","observation_id":"899a397f-df9d-4ed9-a801-660a40a2d0c1","resolution":{"observed_at":"2026-08-07T04:38:50.729532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2212.04397/citation-record","integrity":"/paper/2212.04397/integrity","json":"/paper/2212.04397/citation-record.json","paper":"/paper/2212.04397"},"outbound":[],"paper":{"arxiv_id":"2212.04397","last_updated":"2022-12-08T16:55:01Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T12:15:47.780916Z","submitted_at":"2022-12-08T16:55:01Z","title":"The optimal edge-colouring threshold"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2212.04397."}