{"as_of":"2026-08-16T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ba694d2e13b1a555493c037d0e89c1a75249bfbc309d4c24ac6549a7668cf0d8","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-16T06:30:59.297886+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-14T13:16:51.821317Z","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-14T13:16:51.910102Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.01812","last_updated":"2021-11-21T14:30:05Z","snapshot_observed_at":"2026-08-16T20:11:13.403858Z","submitted_at":"2019-06-05T03:46:27Z","title":"Tur\\'an number of disjoint triangles in 4-partite graphs","version":4},"cited_work":{"arxiv_id":"1906.01812","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.01812","snapshot_observed_at":"2026-08-14T13:16:51.910102Z","title":"Tur\\'an number of disjoint triangles in 4-partite graphs","venue":"math.CO","work_id":"7891fbee-5fb7-4a85-99da-5b025282da89","year":2019},"citing_paper":{"arxiv_id":"1908.05983","last_updated":"2020-10-30T12:38:05Z","snapshot_observed_at":"2026-08-16T10:41:49.944051Z","submitted_at":"2019-08-16T14:17:20Z","title":"Tur\\'{a}n Problems for Vertex-disjoint Cliques in Multi-partite Hypergraphs","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:16:51.821317Z"},"links":{"cited_paper":"/paper/1906.01812","citing_paper":"/paper/1908.05983"},"observation_digest":"sha256:d3ad280d4ccec89978214713bf26ac8f088922bdd3db94eea2661d02e066ff57","observation_id":"053e2a35-4631-4347-976a-9fbd4668bb47","resolution":{"observed_at":"2026-08-14T13:16:51.917534Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1906.01812/citation-record","integrity":"/paper/1906.01812/integrity","json":"/paper/1906.01812/citation-record.json","paper":"/paper/1906.01812"},"outbound":[],"paper":{"arxiv_id":"1906.01812","last_updated":"2021-11-21T14:30:05Z","latest_version":4,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T20:11:13.403858Z","submitted_at":"2019-06-05T03:46:27Z","title":"Tur\\'an number of disjoint triangles in 4-partite graphs"},"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 1 inbound Pith citation observation for arXiv:1906.01812."}