{"as_of":"2026-08-13T12:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f01b62ff90ad917a707277bcefe13a26212ca5deb74b44eb8a32c2de5e26a582","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T17:59:20.713038Z","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-07T05:37:39.499968Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1910.05390","last_updated":"2021-03-28T16:10:30Z","snapshot_observed_at":"2026-07-06T08:28:54.629267Z","submitted_at":"2019-10-11T19:57:33Z","title":"The Maximum Matroid of a Graph","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.05390","snapshot_observed_at":"2026-08-09T17:59:20.713038Z","title":"The maximum matroid of a graph","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2502.00799","last_updated":"2025-02-02T13:39:45Z","snapshot_observed_at":"2026-08-10T05:01:16.614755Z","submitted_at":"2025-02-02T13:39:45Z","title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T17:59:20.713038Z"},"links":{"cited_paper":"/paper/1910.05390","citing_paper":"/paper/2502.00799"},"observation_digest":"sha256:ad525d66ce201d5ffa5a9b5ea2b3a92781327965b75bd8d1c92cf7d9a7a9f4be","observation_id":"53b9c98e-fe94-49c5-8f91-aec5d8c632de","resolution":{"observed_at":"2026-08-09T17:59:20.713038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.05390","last_updated":"2021-03-28T16:10:30Z","snapshot_observed_at":"2026-07-06T08:28:54.629267Z","submitted_at":"2019-10-11T19:57:33Z","title":"The Maximum Matroid of a Graph","version":2},"cited_work":{"arxiv_id":"1910.05390","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.05390","snapshot_observed_at":"2026-08-07T05:37:39.499968Z","title":"The Maximum Matroid of a Graph","venue":"math.CO","work_id":"1c20b1c0-c84e-4fe5-8125-cd4ae5b12edb","year":2019},"citing_paper":{"arxiv_id":"2506.07757","last_updated":"2025-06-09T13:37:57Z","snapshot_observed_at":"2026-08-07T05:23:59.347191Z","submitted_at":"2025-06-09T13:37:57Z","title":"Algebraic Geometry of Cactus, Pascal, and Pappus Matroids","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:37:39.441360Z"},"links":{"cited_paper":"/paper/1910.05390","citing_paper":"/paper/2506.07757"},"observation_digest":"sha256:f460d1c47d64e9374cdf445ad55133a254fb697a223c619b2b7fb8381ff4170d","observation_id":"4f683d42-f036-4533-a7b2-3212643be4e1","resolution":{"observed_at":"2026-08-07T05:37:39.505765Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1910.05390/citation-record","integrity":"/paper/1910.05390/integrity","json":"/paper/1910.05390/citation-record.json","paper":"/paper/1910.05390"},"outbound":[],"paper":{"arxiv_id":"1910.05390","last_updated":"2021-03-28T16:10:30Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T08:28:54.629267Z","submitted_at":"2019-10-11T19:57:33Z","title":"The Maximum Matroid of a Graph"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1910.05390."}