{"as_of":"2026-08-15T13:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7769cfe816162b89910c6466ce114263c88ff0727536fc1c967acd2a4288e22a","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-14T05:25:45.900033Z","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-14T05:25:45.941055Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.14863","last_updated":"2026-07-08T08:49:12Z","snapshot_observed_at":"2026-08-07T16:00:40.834493Z","submitted_at":"2025-04-21T05:08:16Z","title":"On minimal nonperfectly divisible fork-free graphs","version":3},"cited_work":{"arxiv_id":"2504.14863","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.14863","snapshot_observed_at":"2026-08-14T05:25:45.941055Z","title":"On minimal nonperfectly divisible fork-free graphs","venue":"math.CO","work_id":"925c8beb-e8c1-4388-9412-3f5be3cd6a89","year":2025},"citing_paper":{"arxiv_id":"2608.13519","last_updated":"2026-08-13T17:38:36Z","snapshot_observed_at":"2026-08-15T13:16:35.459643Z","submitted_at":"2026-08-13T17:38:36Z","title":"Every fork-free graph is perfectly weight divisible","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T05:25:45.900033Z"},"links":{"cited_paper":"/paper/2504.14863","citing_paper":"/paper/2608.13519"},"observation_digest":"sha256:ed06af31460876d25cf03958b4d9b4bcd5514553ba2b767c6790f5073946b52c","observation_id":"d02d9aae-018b-480a-b7af-2b92391cc679","resolution":{"observed_at":"2026-08-14T05:25:45.948687Z","resolver_source":"local_arxiv","status":"verified_exact"},"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.14863/citation-record","integrity":"/paper/2504.14863/integrity","json":"/paper/2504.14863/citation-record.json","paper":"/paper/2504.14863"},"outbound":[],"paper":{"arxiv_id":"2504.14863","last_updated":"2026-07-08T08:49:12Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T16:00:40.834493Z","submitted_at":"2025-04-21T05:08:16Z","title":"On minimal nonperfectly divisible fork-free 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-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.14863."}