{"as_of":"2026-08-12T13:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:523c25db19221c15a848d03ee07ca788b726367ea09fe984f543a72492a892e6","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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-06-28T22:04:58.692677Z","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-07-01T19:46:10.681150Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.14447","last_updated":"2024-10-18T13:07:11Z","snapshot_observed_at":"2026-07-06T19:35:57.222956Z","submitted_at":"2024-10-18T13:07:11Z","title":"How many random edges make an almost-Dirac graph Hamiltonian?","version":1},"cited_work":{"arxiv_id":"2410.14447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14447","snapshot_observed_at":"2026-07-01T19:46:10.681150Z","title":null,"venue":null,"work_id":"0a49c7db-bdda-4686-ae7c-84ef1e076e13","year":2024},"citing_paper":{"arxiv_id":"2605.31398","last_updated":"2026-05-29T15:03:44Z","snapshot_observed_at":"2026-08-08T09:04:33.709801Z","submitted_at":"2026-05-29T15:03:44Z","title":"Universality for rainbow oriented cycles in perturbed digraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T22:04:58.692677Z"},"links":{"cited_paper":"/paper/2410.14447","citing_paper":"/paper/2605.31398"},"observation_digest":"sha256:b048f0695031e68ed33fb2c90f167d04f2999fab13bdd62ad4f98a598da37568","observation_id":"b712377d-68dd-4624-beb1-666531b997ed","resolution":{"observed_at":"2026-07-01T19:46:10.682696Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.14447/citation-record","integrity":"/paper/2410.14447/integrity","json":"/paper/2410.14447/citation-record.json","paper":"/paper/2410.14447"},"outbound":[],"paper":{"arxiv_id":"2410.14447","last_updated":"2024-10-18T13:07:11Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T19:35:57.222956Z","submitted_at":"2024-10-18T13:07:11Z","title":"How many random edges make an almost-Dirac graph Hamiltonian?"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2410.14447."}