{"as_of":"2026-08-16T15:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:646aa959083a8f9ea3cb26f924fd9e956e5abe5ccf5719551f19577c44037b24","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-14T15:23:57.425866Z","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-14T15:23:57.802752Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1411.0856","last_updated":"2019-08-16T22:25:44Z","snapshot_observed_at":"2026-08-16T13:58:58.698107Z","submitted_at":"2014-11-04T10:48:15Z","title":"Graphs with few paths of prescribed length between any two vertices","version":2},"cited_work":{"arxiv_id":"1411.0856","doi":null,"metadata_source":"pith","pith_arxiv_id":"1411.0856","snapshot_observed_at":"2026-08-14T15:23:57.802752Z","title":"Graphs with few paths of prescribed length between any two vertices","venue":"math.CO","work_id":"05d5ddd2-8c13-4c25-9bbb-877984d9ac68","year":2014},"citing_paper":{"arxiv_id":"1908.01459","last_updated":"2019-11-02T03:10:27Z","snapshot_observed_at":"2026-08-14T15:09:56.722321Z","submitted_at":"2019-08-05T04:07:33Z","title":"3-uniform hypergraphs with few Berge paths of length three between any two vertices","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:23:57.425866Z"},"links":{"cited_paper":"/paper/1411.0856","citing_paper":"/paper/1908.01459"},"observation_digest":"sha256:739fbb4f629b99b1f9f1a79e193faabf46a190d9cf44f481a617d14f840cb5c8","observation_id":"626f26fe-87a6-4373-adeb-df2a487bb53d","resolution":{"observed_at":"2026-08-14T15:23:57.812467Z","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/1411.0856/citation-record","integrity":"/paper/1411.0856/integrity","json":"/paper/1411.0856/citation-record.json","paper":"/paper/1411.0856"},"outbound":[],"paper":{"arxiv_id":"1411.0856","last_updated":"2019-08-16T22:25:44Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T13:58:58.698107Z","submitted_at":"2014-11-04T10:48:15Z","title":"Graphs with few paths of prescribed length between any two vertices"},"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:1411.0856."}