{"as_of":"2026-08-10T20:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9b954f4ebc9e2621ca503f5bf914886a798fc6e7eaad98b5a20251142245b036","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:11:36.334568Z","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-07-03T03:37:35.232087Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":"2202.00132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-07-03T03:37:35.232087Z","title":"Submodularity in machine learning and artificial intelligence.ArXiv, abs/2202.00132","venue":null,"work_id":"83a2d723-7834-4f2a-a012-e49eae74b5c5","year":2022},"citing_paper":{"arxiv_id":"2309.12284","last_updated":"2024-05-03T17:36:07Z","snapshot_observed_at":"2026-08-02T15:00:50.388422Z","submitted_at":"2023-09-21T17:45:42Z","title":"MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Models","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T10:07:53.748795Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2309.12284"},"observation_digest":"sha256:d8707415a21bebb4cbb9293a209cfd3bdd855877120390fe06bdeaa143820570","observation_id":"6c73a10c-b19d-4f42-89b6-bbb1b2d90002","resolution":{"observed_at":"2026-05-13T10:07:53.794000Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-08-07T15:11:36.334568Z","title":"Submodularity In Machine Learning and Artificial Intelligence,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16169","last_updated":"2026-07-07T20:37:46Z","snapshot_observed_at":"2026-08-10T12:25:35.776342Z","submitted_at":"2025-05-22T03:14:53Z","title":"Partitioning and Observability in Linear Systems via Submodular Optimization","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:11:36.334568Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2505.16169"},"observation_digest":"sha256:b1bec33a63a0110e8715988b2623071717e4b5ce8938bceb9a8da0e6957f4166","observation_id":"2e4e283d-aab2-442a-9bb0-16ab785df192","resolution":{"observed_at":"2026-08-07T15:11:36.334568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-08-06T12:47:43.011261Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.21482","last_updated":"2025-07-29T03:51:00Z","snapshot_observed_at":"2026-08-07T22:01:33.492073Z","submitted_at":"2025-07-29T03:51:00Z","title":"Improving Task Diversity in Label Efficient Supervised Finetuning of LLMs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T12:47:43.011261Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2507.21482"},"observation_digest":"sha256:aff8479ed5f31b03d90a496d3749ecc4e4f85df8e2c717edd95a2ad19a846940","observation_id":"28346ea3-1fb3-4d53-9bcb-da400756e2dc","resolution":{"observed_at":"2026-08-06T12:47:43.011261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-08-04T10:13:58.842695Z","title":"Bilmes , Submodularity in machine learning and artificial intelligence , arXiv:2202.00132, (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.11519","last_updated":"2026-07-04T16:21:20Z","snapshot_observed_at":"2026-08-10T07:14:50.609122Z","submitted_at":"2025-10-13T15:24:49Z","title":"Robust Least Squares Problems with Binary Uncertain Data","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T10:13:58.842695Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2510.11519"},"observation_digest":"sha256:72029d1fb9cfebc9c13fdc37274874293d5e89080effb3ff8f495de740705a71","observation_id":"ada8709e-93ba-4c3b-9024-b3c542f44dc4","resolution":{"observed_at":"2026-08-04T10:13:58.842695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":"2202.00132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-07-03T03:37:35.232087Z","title":"Submodularity in machine learning and artificial intelligence.ArXiv, abs/2202.00132","venue":null,"work_id":"83a2d723-7834-4f2a-a012-e49eae74b5c5","year":2022},"citing_paper":{"arxiv_id":"2605.06900","last_updated":"2026-05-07T20:00:40Z","snapshot_observed_at":"2026-07-06T23:19:20.674889Z","submitted_at":"2026-05-07T20:00:40Z","title":"Accelerated Relax-and-Round for Concave Coverage Problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-11T00:52:41.972226Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2605.06900"},"observation_digest":"sha256:a8aa9015f8b207b09db9ea32217598682837caf2a09b5e503be7ab7183fdf2cb","observation_id":"d9836d13-7cf4-4e8c-b331-384ccbd0245f","resolution":{"observed_at":"2026-05-11T05:05:57.075458Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":"2202.00132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-07-03T03:37:35.232087Z","title":"Submodularity in machine learning and artificial intelligence.ArXiv, abs/2202.00132","venue":null,"work_id":"83a2d723-7834-4f2a-a012-e49eae74b5c5","year":2022},"citing_paper":{"arxiv_id":"2605.12872","last_updated":"2026-05-13T01:36:43Z","snapshot_observed_at":"2026-08-04T16:43:43.487806Z","submitted_at":"2026-05-13T01:36:43Z","title":"SMA: Submodular Modality Aligner For Data Efficient Multimodal Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-14T20:32:00.361991Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2605.12872"},"observation_digest":"sha256:695fa9e513944faf38c99d6d52f1b29d741e34e976af2ce0a28504506898ca7e","observation_id":"41e25a10-01f4-49de-abec-f81ba440bba9","resolution":{"observed_at":"2026-05-14T20:32:56.596654Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":"2202.00132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-07-03T03:37:35.232087Z","title":"Submodularity in machine learning and artificial intelligence.ArXiv, abs/2202.00132","venue":null,"work_id":"83a2d723-7834-4f2a-a012-e49eae74b5c5","year":2022},"citing_paper":{"arxiv_id":"2605.24779","last_updated":"2026-05-23T23:43:24Z","snapshot_observed_at":"2026-07-31T08:34:19.969246Z","submitted_at":"2026-05-23T23:43:24Z","title":"Complement Submodular Information Measures for Balanced and Robust Data Selection","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T13:18:02.382334Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2605.24779"},"observation_digest":"sha256:63aeec4fcf12daf9392503f77263d89c5bf065fd76f6cafbd87893eaf1d8a819","observation_id":"ba973b6c-f49c-4208-bd03-2ae66975c2b6","resolution":{"observed_at":"2026-06-30T13:24:40.230230Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":"2202.00132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-07-03T03:37:35.232087Z","title":"Submodularity in machine learning and artificial intelligence.ArXiv, abs/2202.00132","venue":null,"work_id":"83a2d723-7834-4f2a-a012-e49eae74b5c5","year":2022},"citing_paper":{"arxiv_id":"2605.29448","last_updated":"2026-07-18T01:59:39Z","snapshot_observed_at":"2026-08-06T23:52:37.250294Z","submitted_at":"2026-05-28T06:40:29Z","title":"How Much Is a Dataset Worth? Scaling Laws, the Vendi Score, and Matrix Spectral Functions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T08:33:05.952601Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2605.29448"},"observation_digest":"sha256:32627a42a9bf2686d57f6d0299c45273a341e57616a4c8a4b436da1a80b56b7d","observation_id":"94563602-b027-4df5-9cde-02316fde0025","resolution":{"observed_at":"2026-06-29T08:33:14.772666Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-08-02T12:58:41.632832Z","title":"Submodularity in machine learning and artificial intelligence","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29448","last_updated":"2026-07-18T01:59:39Z","snapshot_observed_at":"2026-08-06T23:52:37.250294Z","submitted_at":"2026-05-28T06:40:29Z","title":"How Much Is a Dataset Worth? Scaling Laws, the Vendi Score, and Matrix Spectral Functions","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T12:58:41.632832Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2605.29448"},"observation_digest":"sha256:3cce141072ab06b9be296f14c2c471da1a649b2818e92ac2950cd326329460f3","observation_id":"21ea8ec0-5cb7-4200-8069-1fd20dfde975","resolution":{"observed_at":"2026-08-02T12:58:41.632832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":"2202.00132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-07-03T03:37:35.232087Z","title":"Submodularity in machine learning and artificial intelligence.ArXiv, abs/2202.00132","venue":null,"work_id":"83a2d723-7834-4f2a-a012-e49eae74b5c5","year":2022},"citing_paper":{"arxiv_id":"2606.10192","last_updated":"2026-06-08T21:28:54Z","snapshot_observed_at":"2026-08-08T05:21:48.010115Z","submitted_at":"2026-06-08T21:28:54Z","title":"Submodular Optimization with Applications to Decision and Control","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-27T15:14:03.455914Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2606.10192"},"observation_digest":"sha256:c150daa0b4420f16c7875044313505f43aabbede0f5aa6a0fc3afad57f09d5b9","observation_id":"9e9a1fbb-1fe6-4a2d-86ac-43484eb71e5a","resolution":{"observed_at":"2026-07-03T03:37:35.233423Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":"2202.00132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-07-03T03:37:35.232087Z","title":"Submodularity in machine learning and artificial intelligence.ArXiv, abs/2202.00132","venue":null,"work_id":"83a2d723-7834-4f2a-a012-e49eae74b5c5","year":2022},"citing_paper":{"arxiv_id":"2607.00725","last_updated":"2026-08-05T11:48:36Z","snapshot_observed_at":"2026-08-08T23:10:26.226236Z","submitted_at":"2026-07-01T10:12:15Z","title":"Recall Is Not Enough: A Reader-Context Diagnostic for Budget-Constrained Retrieval-Augmented Generation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-02T13:32:55.274187Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2607.00725"},"observation_digest":"sha256:0d66d87756b2f66c8e7014a09e8664579aaea20a81c842b901ad9c2dac16004e","observation_id":"322e00e5-5ad4-47e9-a1c4-66b2d950b7ae","resolution":{"observed_at":"2026-07-02T13:36:58.511304Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence","version":2},"cited_work":{"arxiv_id":"2202.00132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.00132","snapshot_observed_at":"2026-07-03T03:37:35.232087Z","title":"Submodularity in machine learning and artificial intelligence.ArXiv, abs/2202.00132","venue":null,"work_id":"83a2d723-7834-4f2a-a012-e49eae74b5c5","year":2022},"citing_paper":{"arxiv_id":"2607.00843","last_updated":"2026-07-01T12:09:41Z","snapshot_observed_at":"2026-08-09T14:20:47.096589Z","submitted_at":"2026-07-01T12:09:41Z","title":"Submodular Maximization over Many Matroids via Ordered Local Search","version":1},"reference_index":167,"source":"arxiv_source","source_observed_at":"2026-07-02T04:31:33.375845Z"},"links":{"cited_paper":"/paper/2202.00132","citing_paper":"/paper/2607.00843"},"observation_digest":"sha256:93116199147b034859199f8ed5dcf7df57d1ed82c5120cbef17c82e2e66505ec","observation_id":"ce978379-3edd-40a9-83e3-d6677f4944d2","resolution":{"observed_at":"2026-07-02T04:36:35.996952Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.00132/citation-record","integrity":"/paper/2202.00132/integrity","json":"/paper/2202.00132/citation-record.json","paper":"/paper/2202.00132"},"outbound":[],"paper":{"arxiv_id":"2202.00132","last_updated":"2022-10-04T08:10:44Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T12:25:03.559123Z","submitted_at":"2022-01-31T22:41:35Z","title":"Submodularity In Machine Learning and Artificial Intelligence"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2202.00132."}