{"as_of":"2026-08-19T12:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e3439ca5857cfd9ae44a1c8390d53285103c087c0e17895d9a84fa3da9b40cce","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:06:54.782142Z","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-11T04:40:58.488082Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.01314","last_updated":"2023-08-21T01:24:36Z","snapshot_observed_at":"2026-08-16T15:19:02.013315Z","submitted_at":"2023-07-03T19:40:31Z","title":"Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.01314","snapshot_observed_at":"2026-08-15T18:06:54.782142Z","title":"Bennett, E","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19456","last_updated":"2025-07-25T17:42:23Z","snapshot_observed_at":"2026-08-15T17:50:29.030890Z","submitted_at":"2025-07-25T17:42:23Z","title":"Odd Ramsey numbers of multipartite graphs and hypergraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:06:54.782142Z"},"links":{"cited_paper":"/paper/2307.01314","citing_paper":"/paper/2507.19456"},"observation_digest":"sha256:3951d8c641257da14ca2d48dc590daa436df8daf25cf825661bd0686d075134b","observation_id":"3969ebae-b631-44f0-adc1-25370beb32fe","resolution":{"observed_at":"2026-08-15T18:06:54.782142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.01314","last_updated":"2023-08-21T01:24:36Z","snapshot_observed_at":"2026-08-16T15:19:02.013315Z","submitted_at":"2023-07-03T19:40:31Z","title":"Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class","version":3},"cited_work":{"arxiv_id":"2307.01314","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.01314","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Edge-coloring a graph G so that every copy of a graphHhas an odd color class","venue":null,"work_id":"f4929788-f559-48ea-8549-6c0017bdc343","year":2023},"citing_paper":{"arxiv_id":"2605.07322","last_updated":"2026-05-08T06:28:44Z","snapshot_observed_at":"2026-07-31T15:03:18.647540Z","submitted_at":"2026-05-08T06:28:44Z","title":"New results on the odd- and unique-Ramsey numbers","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-11T01:10:28.629383Z"},"links":{"cited_paper":"/paper/2307.01314","citing_paper":"/paper/2605.07322"},"observation_digest":"sha256:3ccd7350b41529c1afdcf5f351b4294f96abd2981d60eb04cb35aef0c36ff9af","observation_id":"b366141c-392e-4378-86eb-289ea90eea44","resolution":{"observed_at":"2026-05-11T04:40:58.492593Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2307.01314/citation-record","integrity":"/paper/2307.01314/integrity","json":"/paper/2307.01314/citation-record.json","paper":"/paper/2307.01314"},"outbound":[],"paper":{"arxiv_id":"2307.01314","last_updated":"2023-08-21T01:24:36Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T15:19:02.013315Z","submitted_at":"2023-07-03T19:40:31Z","title":"Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2307.01314."}