{"as_of":"2026-08-16T19:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2f5b2aec69257f31fa54b47fcd2404c554384ef6ba1d0e793419b3ecc53e979","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:36:13.674838Z","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-08-15T16:24:04.741179Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1406.6531","last_updated":"2014-06-27T12:40:31Z","snapshot_observed_at":"2026-08-14T23:29:07.967986Z","submitted_at":"2014-06-25T11:53:18Z","title":"The regularity method for graphs and digraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.6531","snapshot_observed_at":"2026-08-15T21:36:13.674838Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.09793","last_updated":"2025-05-14T20:41:59Z","snapshot_observed_at":"2026-08-15T21:21:50.585797Z","submitted_at":"2025-05-14T20:41:59Z","title":"Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:36:13.674838Z"},"links":{"cited_paper":"/paper/1406.6531","citing_paper":"/paper/2505.09793"},"observation_digest":"sha256:2923a33499b95855f230e13628fba8d8bd3554da1fdb79cec7f985f49f007a5a","observation_id":"7e369b76-f105-4e4d-a20d-9a5d1cfd7f5b","resolution":{"observed_at":"2026-08-15T21:36:13.674838Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.6531","last_updated":"2014-06-27T12:40:31Z","snapshot_observed_at":"2026-08-14T23:29:07.967986Z","submitted_at":"2014-06-25T11:53:18Z","title":"The regularity method for graphs and digraphs","version":2},"cited_work":{"arxiv_id":"1406.6531","doi":null,"metadata_source":"pith","pith_arxiv_id":"1406.6531","snapshot_observed_at":"2026-08-15T16:24:04.741179Z","title":"The regularity method for graphs and digraphs","venue":"math.CO","work_id":"02d2405d-9fd0-4045-9fce-359c3fde1803","year":2014},"citing_paper":{"arxiv_id":"2509.07760","last_updated":"2025-09-09T13:58:07Z","snapshot_observed_at":"2026-08-16T07:40:11.159281Z","submitted_at":"2025-09-09T13:58:07Z","title":"A directed Andr\\'asfai-Erd\\H{o}s-S\\'os theorem and chromatic profiles of oriented cycles","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T16:24:04.645646Z"},"links":{"cited_paper":"/paper/1406.6531","citing_paper":"/paper/2509.07760"},"observation_digest":"sha256:94dd45d2afa6befa838611d0d03e5b339189724570e7106382826355708b7aab","observation_id":"3844e174-ce16-4b6c-95e6-bcaa7b73d3b2","resolution":{"observed_at":"2026-08-15T16:24:04.749744Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1406.6531","last_updated":"2014-06-27T12:40:31Z","snapshot_observed_at":"2026-08-14T23:29:07.967986Z","submitted_at":"2014-06-25T11:53:18Z","title":"The regularity method for graphs and digraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.6531","snapshot_observed_at":"2026-08-02T23:35:22.946067Z","title":"Taylor, The regularity method for graphs and digraphs, arXiv:1406.6531","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.14008","last_updated":"2026-06-07T02:12:37Z","snapshot_observed_at":"2026-08-14T09:16:52.228107Z","submitted_at":"2026-02-15T06:25:08Z","title":"On the supersaturation of oriented Tur\\'an problems","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T23:35:22.946067Z"},"links":{"cited_paper":"/paper/1406.6531","citing_paper":"/paper/2602.14008"},"observation_digest":"sha256:64c82930c0c1295fd66c187fe9218b8a5aeb5e6867704476bf423c5cc8840bc1","observation_id":"fa3b65dd-573a-4699-bed9-1aec7897e114","resolution":{"observed_at":"2026-08-02T23:35:22.946067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1406.6531/citation-record","integrity":"/paper/1406.6531/integrity","json":"/paper/1406.6531/citation-record.json","paper":"/paper/1406.6531"},"outbound":[],"paper":{"arxiv_id":"1406.6531","last_updated":"2014-06-27T12:40:31Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T23:29:07.967986Z","submitted_at":"2014-06-25T11:53:18Z","title":"The regularity method for graphs and digraphs"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1406.6531."}