{"as_of":"2026-08-13T01:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:402d800db6a2722d34738780cd4c6d26eb35ced1d521e2c665af8de0a00ccf26","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-08-07T11:14:50.880021Z","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-07T11:15:12.473923Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1812.09089","last_updated":"2018-12-24T07:17:52Z","snapshot_observed_at":"2026-07-06T07:22:50.990416Z","submitted_at":"2018-12-21T12:48:01Z","title":"The maximum number of triangles in graphs without large linear forests","version":2},"cited_work":{"arxiv_id":"1812.09089","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.09089","snapshot_observed_at":"2026-08-07T11:15:12.473923Z","title":"The maximum number of triangles in graphs without large linear forests","venue":"math.CO","work_id":"a5565104-614d-4aa0-b5b1-74aec319e8b9","year":2018},"citing_paper":{"arxiv_id":"2506.03418","last_updated":"2025-06-03T21:57:06Z","snapshot_observed_at":"2026-08-09T20:13:11.965758Z","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:50.880021Z"},"links":{"cited_paper":"/paper/1812.09089","citing_paper":"/paper/2506.03418"},"observation_digest":"sha256:08ff28188c75fdcd4a3c18e3b450352dc5a8ac73764334e41ccd1220aaf74b6d","observation_id":"e4a7fbd0-2d1a-4c6a-9466-905470fcb5d0","resolution":{"observed_at":"2026-08-07T11:15:12.543787Z","resolver_source":"local_arxiv","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/1812.09089/citation-record","integrity":"/paper/1812.09089/integrity","json":"/paper/1812.09089/citation-record.json","paper":"/paper/1812.09089"},"outbound":[],"paper":{"arxiv_id":"1812.09089","last_updated":"2018-12-24T07:17:52Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T07:22:50.990416Z","submitted_at":"2018-12-21T12:48:01Z","title":"The maximum number of triangles in graphs without large linear forests"},"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 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1812.09089."}