{"as_of":"2026-08-09T14:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ba825e7231b07851a3a468ea74bf73d754e5b4c43d49135222cadff0f24b6521","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-09T06:31:02.800959+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-05T18:20:38.612229Z","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-05T18:20:39.596005Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.14339","last_updated":"2021-05-29T16:55:58Z","snapshot_observed_at":"2026-08-09T10:45:40.640253Z","submitted_at":"2021-05-29T16:55:58Z","title":"Graphs whose all maximal induced forests are of the same order","version":1},"cited_work":{"arxiv_id":"2105.14339","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.14339","snapshot_observed_at":"2026-08-05T18:20:39.596005Z","title":"Graphs whose all maximal induced forests are of the same order","venue":"math.CO","work_id":"b24ffcce-7ae5-4f7a-a0ee-daead8d45fbf","year":2021},"citing_paper":{"arxiv_id":"2608.03480","last_updated":"2026-08-04T11:17:54Z","snapshot_observed_at":"2026-08-09T10:45:26.851752Z","submitted_at":"2026-08-04T11:17:54Z","title":"Efficient Multilingual Neural Machine Translation via Corpus-Driven Vocabulary Pruning: An English-Arabic Case Study","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T18:20:38.612229Z"},"links":{"cited_paper":"/paper/2105.14339","citing_paper":"/paper/2608.03480"},"observation_digest":"sha256:ab33b0fd48a721c90b774858bf3c95fc896628bf1d58f38f4d386d83ea75f46a","observation_id":"cd4dba45-8a17-47a6-a165-99e40b3e926b","resolution":{"observed_at":"2026-08-05T18:20:39.685019Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2105.14339/citation-record","integrity":"/paper/2105.14339/integrity","json":"/paper/2105.14339/citation-record.json","paper":"/paper/2105.14339"},"outbound":[],"paper":{"arxiv_id":"2105.14339","last_updated":"2021-05-29T16:55:58Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-09T10:45:40.640253Z","submitted_at":"2021-05-29T16:55:58Z","title":"Graphs whose all maximal induced forests are of the same order"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2105.14339."}