{"as_of":"2026-08-08T16:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab377daea430c3f3edaf1015c1c3ec186b73d8b5ab748d7d676553e1505fcabc","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:45:03.715445Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.01701/citation-record","integrity":"/paper/2506.01701/integrity","json":"/paper/2506.01701/citation-record.json","paper":"/paper/2506.01701"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.518730Z","title":null,"venue":null,"work_id":"ce0df44b-899a-4e7d-8370-43ece60eb61a","year":2022},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.459236Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:97ac4957261b50f3f54297df1d338886ea6677711ce5f4957aa37cf84871458d","observation_id":"dd4b9a32-2663-4739-ba5d-8d92de9cafde","resolution":{"observed_at":"2026-08-07T11:45:37.539545Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.433006Z","title":null,"venue":null,"work_id":"63523a0f-8daa-4c04-9417-686bfd98378d","year":2025},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.509797Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:f39304861981a070b4b562a003609227ca4f575740362802ebcc385789eb4890","observation_id":"bbe4de13-0f4b-42ec-8f1c-6d79b59f40b5","resolution":{"observed_at":"2026-08-07T11:45:37.445743Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:03.112686Z","title":"Challenging big-bench tasks and whether chain-of-thought can solve them","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.112686Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:84044df846bf9bc453388a1130af34827a28913e2d4876cef7bf547e5a38f0d4","observation_id":"5d281952-eb8a-4ee6-bd56-9203aeda425f","resolution":{"observed_at":"2026-08-07T11:45:03.112686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T11:45:03.138014Z","title":"Llama 2: Open foundation and fine-tuned chat models.arXiv preprint arXiv:2307.09288,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.138014Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:a5d70cbf5491f5ddb0e388e6a8eed300036f6fd65d24af23aaa75f4e62e5a1ec","observation_id":"82e0b6a6-4e39-42ff-b4c6-240b3c5e3a6b","resolution":{"observed_at":"2026-08-07T11:45:03.138014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.672153Z","title":"Submodularity in data subset selection and active learning","venue":null,"work_id":"2480b057-cc50-48b3-984c-da2bd87b9e1d","year":1954},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.170072Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:2802e809e59eafe344de4618894be98c2654238507b51aa0ad59891a103ede89","observation_id":"2dcfcf36-cf84-401a-a493-6ac76828bcba","resolution":{"observed_at":"2026-08-07T11:45:37.686275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2402.04333","last_updated":"2024-06-13T03:42:02Z","snapshot_observed_at":"2026-08-07T17:47:02.067367Z","submitted_at":"2024-02-06T19:18:04Z","title":"LESS: Selecting Influential Data for Targeted Instruction Tuning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.04333","snapshot_observed_at":"2026-08-07T11:45:03.259826Z","title":"Less: Selecting influential data for targeted instruction tuning.arXiv preprint arXiv:2402.04333,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.259826Z"},"links":{"cited_paper":"/paper/2402.04333","citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:8cf061c9be988b9a1b111984cfe98ef8ec0512e5ea72e269ee0993549af8a425","observation_id":"e0929f37-826d-4ac9-9b84-95733f5edd1e","resolution":{"observed_at":"2026-08-07T11:45:03.259826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.633243Z","title":null,"venue":null,"work_id":"91a9379b-26f0-4236-8ece-61f307151506","year":2017},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.305644Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:1168fe7f189d9fb4e04953728f4b67b7fd1ad17a9c7ffbd75c485f5ebe4bd44c","observation_id":"a44991c5-a3e5-41ac-b4fd-839e90daff50","resolution":{"observed_at":"2026-08-07T11:45:37.651172Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.478490Z","title":null,"venue":null,"work_id":"a4c3161d-9faf-498e-9444-3575a6fc4969","year":2007},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.490520Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:94c089f096d8c1ce6ecc209cadc06d92bea3cfeb1d1df493dc3e949e29983c67","observation_id":"9f56b568-c7c4-47d1-9fbb-f78d45595db7","resolution":{"observed_at":"2026-08-07T11:45:37.498072Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:04.049915Z","title":"The EL2N score (Paul et al.,","venue":null,"work_id":"7e121df5-7059-41b2-ad4d-c1b8d08ce6e6","year":2023},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.606482Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:5a997bcbabc15f06e77092a176686c809876a76dcebec13f2c2a407d1f28d5e1","observation_id":"4e315095-a1ac-4baf-a36c-3eca4d568dfe","resolution":{"observed_at":"2026-08-07T11:45:04.066499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:04.005768Z","title":"Influence score (Tan et al., 2023; Xia et al.,","venue":null,"work_id":"595c46e3-255d-48fa-b341-037bba1eea6e","year":2023},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.626513Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:da84fcc7ee473a30a663eb3da2728bdf21d92cc990c187feae02611d7c53ab60","observation_id":"e0c10b56-9385-4e96-879c-c228d447715d","resolution":{"observed_at":"2026-08-07T11:45:04.028983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:03.953563Z","title":"Dyn-Unc He et al","venue":null,"work_id":"51e3f63f-fb53-48be-9953-9b219b06684c","year":2024},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.653152Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:2eaa525609fd7ef459622b1f34d7824bbdfe3496b0e8832c874dff81f5b9a6f5","observation_id":"44f37146-3d73-46f7-881e-19c7344235b1","resolution":{"observed_at":"2026-08-07T11:45:03.976410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:03.902222Z","title":null,"venue":null,"work_id":"99cc8271-4da9-428c-84f3-29d02ca0c0fa","year":2017},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.672370Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:977281534db90654385f8929c31f5c0e7ccf2ad03b6d57fb2bf9c37bb398ea52","observation_id":"86b2dd64-6c30-4579-a061-d73c23cda1e5","resolution":{"observed_at":"2026-08-07T11:45:03.926015Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:03.847433Z","title":"Yang et al","venue":null,"work_id":"993aab2e-79a8-4d18-aaa6-fd25bd9f25a6","year":2024},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.694491Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:b2e0e28cb71abf9bd6869e6754fe5bf2cbc1e0f1a0ad33a5cbaa1bbe23048989","observation_id":"cf1f15b6-674d-43c8-a3de-fa80a45f0abc","resolution":{"observed_at":"2026-08-07T11:45:03.869001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:03.799888Z","title":"One of the core steps of D2-Pruning is the Inverse Message Passing operation, which iteratively performs a greedy sample selection step","venue":null,"work_id":"830d6be3-3f6a-4421-b8fe-c4bb72a79ae2","year":2015},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.715445Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:46ef30948bc75c55dd82e1863d515369796e555b89b77a96bad6e36b1e94aa96","observation_id":"0cbed823-8f02-4b13-ab48-619d036b38ce","resolution":{"observed_at":"2026-08-07T11:45:03.819510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.598373Z","title":null,"venue":null,"work_id":"4121a642-09d2-49ff-8a81-35ed61660ebe","year":2021},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":256,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.339732Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:b87e1f1ce135134761bc339a978f2a444236fa8b6218ca973e201ae838c9d4db","observation_id":"67f30bc8-c606-4120-995c-f3b5df4088fc","resolution":{"observed_at":"2026-08-07T11:45:37.612394Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2301.13688","last_updated":"2023-02-14T16:33:33Z","snapshot_observed_at":"2026-08-05T20:18:14.325590Z","submitted_at":"2023-01-31T15:03:44Z","title":"The Flan Collection: Designing Data and Methods for Effective Instruction Tuning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.13688","snapshot_observed_at":"2026-08-07T11:45:03.041405Z","title":"The flan collection: Designing data and methods for effective instruction tuning.arXiv preprint arXiv:2301.13688,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":1982,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.041405Z"},"links":{"cited_paper":"/paper/2301.13688","citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:aae6ca1ea381c6663aebaa6adf1631b8472ce118253731b594da37ee05088efc","observation_id":"5ab3b404-10e6-428e-8ebc-221e7dca3548","resolution":{"observed_at":"2026-08-07T11:45:03.041405Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.355219Z","title":"This is because InfoMax does not have a greedy selection process on a per-sample basis","venue":null,"work_id":"5ff7f876-8a85-442b-af2a-31ed818e03ac","year":2023},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.534741Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:6a088be1cc0ea9cdfcc7013102f89407f4099b43a53c11e8725f667584248fd0","observation_id":"130287d0-8183-4bba-9543-583b9abc1174","resolution":{"observed_at":"2026-08-07T11:45:37.401137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08484","last_updated":"2020-11-14T18:47:35Z","snapshot_observed_at":"2026-07-06T08:58:39.542748Z","submitted_at":"2020-02-19T22:40:32Z","title":"Estimating Training Data Influence by Tracing Gradient Descent","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08484","snapshot_observed_at":"2026-08-07T11:45:03.064160Z","title":"Estimating training data influence by tracing gradient descent.arXiv preprint arXiv:2002.08484,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.064160Z"},"links":{"cited_paper":"/paper/2002.08484","citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:153b649c130cd826f59f8aef4f0e1b8542ad70bcef59fd1d5287ea2946e721c1","observation_id":"f2b3444f-c61d-4c34-a592-b81a78ae8b1a","resolution":{"observed_at":"2026-08-07T11:45:03.064160Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.811033Z","title":"Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation","venue":null,"work_id":"077c3ed6-c278-472d-be98-dd4bc95e07cc","year":2025},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.000931Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:34671dcce5fe58bfb97054ae3c34af03708f6dffaae52f25158f85ccd72fcae1","observation_id":"b567bfc5-00cb-4b91-b55e-a513c42d2fdc","resolution":{"observed_at":"2026-08-07T11:45:37.852196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-07T07:43:16.294957Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-07T11:45:00.974825Z","title":"Lora: Low-rank adaptation of large language models.arXiv preprint arXiv:2106.09685,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:00.974825Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:99ae4c76f6de74d70dafb3dbfdf95a52c2ef43c703b4c2519c50d0d35baf55e9","observation_id":"328733b6-3109-4e0f-8fbd-741e6b10925a","resolution":{"observed_at":"2026-08-07T11:45:00.974825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.732424Z","title":"Active learning for convolutional neural networks: A core-set approach","venue":null,"work_id":"a8b4a4fd-2736-4e5d-89fc-cc9374589222","year":2025},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.088063Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:a8e91a7217434014155627208be880020b06e06cd41c4f61d7a22c4df976e8d4","observation_id":"00aed012-907e-4584-8c49-6d1060e2bda6","resolution":{"observed_at":"2026-08-07T11:45:37.763943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:25.853705Z","title":"Name Time cost (min) Stage-1 of InfoMax 14.6Stage-2 of InfoMax 1.7Overall of InfoMax 16.1 D2-Pruning (Maharana et al.,","venue":null,"work_id":"ee5e62a7-a33a-41bd-bc76-4e5f4bef4d41","year":2019},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.571886Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:17b2fda41b1930468a8df4e91ef854a646db7ef987f6004de79b9b672a135ee9","observation_id":"98d38dc5-7111-4ac4-a28e-a6fc2cd16165","resolution":{"observed_at":"2026-08-07T11:45:31.991672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.893809Z","title":"On coresets for k-means and k-median clustering","venue":null,"work_id":"969bccc0-d5b6-4385-ae22-0edefab91262","year":2025},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T11:44:26.931773Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:cc97ad8c0a75e5e3c96dcc40c6af0271e987138011168ab94c0063a39a239ca2","observation_id":"4fb711f7-0203-48cd-8dd2-397168524f70","resolution":{"observed_at":"2026-08-07T11:45:37.910706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:45:37.561547Z","title":"dog\" exists, a text description like","venue":null,"work_id":"5cb63a62-a9a5-4c43-b6fb-05005cdd5ffc","year":2025},"citing_paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization","version":2},"reference_index":2048,"source":"pdf_text","source_observed_at":"2026-08-07T11:45:03.409757Z"},"links":{"citing_paper":"/paper/2506.01701"},"observation_digest":"sha256:ce62927c1fb41758cddaaaabc1fed8978271f33c7ad63de498480957c42e341e","observation_id":"982aafdd-bd57-442e-8fd7-a607686b48a5","resolution":{"observed_at":"2026-08-07T11:45:37.578482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2506.01701","last_updated":"2025-08-14T03:59:04Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-07T11:33:08.849762Z","submitted_at":"2025-06-02T14:06:42Z","title":"Data Pruning by Information Maximization"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":24},"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 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2506.01701."}