{"as_of":"2026-08-08T07:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9060a310c5d40a38bb2e256d5dcc3e0eff10a437718f6a82778207539089636c","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-08T06:32:00.761636+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:31:19.729096Z","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:31:20.975308Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.15215","last_updated":"2024-08-27T17:23:58Z","snapshot_observed_at":"2026-07-06T19:06:41.697671Z","submitted_at":"2024-08-27T17:23:58Z","title":"Maximum induced trees and forests of bounded degree in random graphs","version":1},"cited_work":{"arxiv_id":"2408.15215","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.15215","snapshot_observed_at":"2026-08-07T11:31:20.975308Z","title":"Maximum induced trees and forests of bounded degree in random graphs","venue":"math.CO","work_id":"52363cba-0639-467a-a55d-000717886a01","year":2024},"citing_paper":{"arxiv_id":"2506.02801","last_updated":"2025-07-03T08:28:32Z","snapshot_observed_at":"2026-08-07T11:13:15.449409Z","submitted_at":"2025-06-03T12:32:26Z","title":"Concentration of the maximum size of an induced subtree in moderately sparse random graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:31:19.729096Z"},"links":{"cited_paper":"/paper/2408.15215","citing_paper":"/paper/2506.02801"},"observation_digest":"sha256:a4b038b8c50574e28b2836778202031d7982fba9cf0caf118fff350dd5636cef","observation_id":"9e07370a-412c-49df-91d9-3f548eb006fa","resolution":{"observed_at":"2026-08-07T11:31:20.979924Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.15215/citation-record","integrity":"/paper/2408.15215/integrity","json":"/paper/2408.15215/citation-record.json","paper":"/paper/2408.15215"},"outbound":[],"paper":{"arxiv_id":"2408.15215","last_updated":"2024-08-27T17:23:58Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T19:06:41.697671Z","submitted_at":"2024-08-27T17:23:58Z","title":"Maximum induced trees and forests of bounded degree in random 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2408.15215."}