{"as_of":"2026-08-15T08:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0f577a553714e0b3280b1e61e184966d23ab3a0796abcd75692bb5bc2368ee8","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-15T06:32:42.880941+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-05T10:39:25.572035Z","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-05T10:39:26.387843Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.16863","last_updated":"2025-04-25T08:49:54Z","snapshot_observed_at":"2026-08-09T13:41:38.821758Z","submitted_at":"2025-04-23T16:34:20Z","title":"On graphs with a simple structure of maximal cliques","version":2},"cited_work":{"arxiv_id":"2504.16863","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.16863","snapshot_observed_at":"2026-08-05T10:39:26.387843Z","title":"On graphs with a simple structure of maximal cliques","venue":"math.CO","work_id":"e199bf80-92c2-4f5b-ac13-d07012a5364c","year":2025},"citing_paper":{"arxiv_id":"2509.04026","last_updated":"2025-09-04T09:00:07Z","snapshot_observed_at":"2026-08-15T07:34:04.288432Z","submitted_at":"2025-09-04T09:00:07Z","title":"Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T10:39:25.572035Z"},"links":{"cited_paper":"/paper/2504.16863","citing_paper":"/paper/2509.04026"},"observation_digest":"sha256:1104b2dbb8fb0268d2047babe115b32a665aa44f45f854b734b0cfa1f221cd54","observation_id":"61ed4373-c6bf-4087-98c1-f36328431414","resolution":{"observed_at":"2026-08-05T10:39:26.395275Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.16863/citation-record","integrity":"/paper/2504.16863/integrity","json":"/paper/2504.16863/citation-record.json","paper":"/paper/2504.16863"},"outbound":[],"paper":{"arxiv_id":"2504.16863","last_updated":"2025-04-25T08:49:54Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-09T13:41:38.821758Z","submitted_at":"2025-04-23T16:34:20Z","title":"On graphs with a simple structure of maximal cliques"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2504.16863."}