{"as_of":"2026-08-20T04:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d035805e76ece9dd3eda8cd534b8ffd092330c0f9ef5cd600dd2f8514c18bc8","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-19T06:32:44.657259+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-05-23T17:30:44.581466Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T17:33:15.877605Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.12478","last_updated":"2024-10-02T09:02:19Z","snapshot_observed_at":"2026-08-16T14:25:21.186149Z","submitted_at":"2024-01-23T04:16:58Z","title":"Mini-batch Submodular Maximization","version":2},"cited_work":{"arxiv_id":"2401.12478","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.12478","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mini-batch submodular maxim ization","venue":null,"work_id":"6c623055-8a19-4d0a-b4af-82d6dc4c6427","year":null},"citing_paper":{"arxiv_id":"2411.03451","last_updated":"2026-05-15T18:20:19Z","snapshot_observed_at":"2026-08-17T21:02:50.178643Z","submitted_at":"2024-11-05T19:08:07Z","title":"Redundancy Is All You Need (for CSP Sparsification)","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-23T17:30:44.581466Z"},"links":{"cited_paper":"/paper/2401.12478","citing_paper":"/paper/2411.03451"},"observation_digest":"sha256:9b2f98d5543c71b703c971a6eebd28cc90001dc8c3a7da756698b0a32d6fffb9","observation_id":"f6289586-e9a8-4db9-8278-aba9250b1a0f","resolution":{"observed_at":"2026-05-23T17:33:15.880437Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.12478/citation-record","integrity":"/paper/2401.12478/integrity","json":"/paper/2401.12478/citation-record.json","paper":"/paper/2401.12478"},"outbound":[],"paper":{"arxiv_id":"2401.12478","last_updated":"2024-10-02T09:02:19Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:25:21.186149Z","submitted_at":"2024-01-23T04:16:58Z","title":"Mini-batch Submodular Maximization"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2401.12478."}