Paper Citation Record · LEDGER

Data Pruning by Information Maximization

As of 10 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2506.01701.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.01701 v2

Coverage vector

measured 24 of 24 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:45:03.715445Z

measured 24 of 24 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

24 of 24 outbound references displayed

verified exact0
verified fuzzy12
unresolved12
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation dd4b9a32-2663-4739-ba5d-8d92de9cafde · outbound

This paper cites an unresolved cited work.

Data Pruning by Information Maximization Unresolved cited work

Reference 3

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:45:37.539545Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation bbe4de13-0f4b-42ec-8f1c-6d79b59f40b5 · outbound

This paper cites an unresolved cited work.

Data Pruning by Information Maximization Unresolved cited work

Reference 5

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:45:37.445743Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5d281952-eb8a-4ee6-bd56-9203aeda425f · outbound

This paper cites Challenging big-bench tasks and whether chain-of-thought can solve them.

Data Pruning by Information Maximization Challenging big-bench tasks and whether chain-of-thought can solve them

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-07T11:45:03.112686Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82e0b6a6-4e39-42ff-b4c6-240b3c5e3a6b · outbound

This paper cites Llama 2: Open Foundation and Fine-Tuned Chat Models.

Data Pruning by Information Maximization Llama 2: Open Foundation and Fine-Tuned Chat Models

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T11:45:03.138014Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2dcfcf36-cf84-401a-a493-6ac76828bcba · outbound

This paper cites Submodularity in data subset selection and active learning.

Data Pruning by Information Maximization Submodularity in data subset selection and active learning

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:37.686275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation e0929f37-826d-4ac9-9b84-95733f5edd1e · outbound

This paper cites LESS: Selecting Influential Data for Targeted Instruction Tuning.

Data Pruning by Information Maximization LESS: Selecting Influential Data for Targeted Instruction Tuning

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T11:45:03.259826Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a44991c5-a3e5-41ac-b4fd-839e90daff50 · outbound

This paper cites an unresolved cited work.

Data Pruning by Information Maximization Unresolved cited work

Reference 11

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:45:37.651172Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 9f56b568-c7c4-47d1-9fbb-f78d45595db7 · outbound

This paper cites an unresolved cited work.

Data Pruning by Information Maximization Unresolved cited work

Reference 15

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:45:37.498072Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 4e315095-a1ac-4baf-a36c-3eca4d568dfe · outbound

This paper cites The EL2N score (Paul et al.,.

Data Pruning by Information Maximization The EL2N score (Paul et al.,

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:04.066499Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation e0c10b56-9385-4e96-879c-c228d447715d · outbound

This paper cites Influence score (Tan et al., 2023; Xia et al.,.

Data Pruning by Information Maximization Influence score (Tan et al., 2023; Xia et al.,

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:04.028983Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 44f37146-3d73-46f7-881e-19c7344235b1 · outbound

This paper cites Dyn-Unc He et al.

Data Pruning by Information Maximization Dyn-Unc He et al

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:03.976410Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 86b2dd64-6c30-4579-a061-d73c23cda1e5 · outbound

This paper cites an unresolved cited work.

Data Pruning by Information Maximization Unresolved cited work

Reference 22

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:45:03.926015Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation cf1f15b6-674d-43c8-a3de-fa80a45f0abc · outbound

This paper cites Yang et al.

Data Pruning by Information Maximization Yang et al

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:03.869001Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 0cbed823-8f02-4b13-ab48-619d036b38ce · outbound

This paper cites One of the core steps of D2-Pruning is the Inverse Message Passing operation, which iteratively performs a greedy sample selection step.

Data Pruning by Information Maximization One of the core steps of D2-Pruning is the Inverse Message Passing operation, which iteratively performs a greedy sample selection step

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:03.819510Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 67f30bc8-c606-4120-995c-f3b5df4088fc · outbound

This paper cites an unresolved cited work.

Data Pruning by Information Maximization Unresolved cited work

Reference 256

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:45:37.612394Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5ab3b404-10e6-428e-8ebc-221e7dca3548 · outbound

This paper cites The Flan Collection: Designing Data and Methods for Effective Instruction Tuning.

Data Pruning by Information Maximization The Flan Collection: Designing Data and Methods for Effective Instruction Tuning

Reference 1982

Resolution: unresolved; no resolver link, observed 2026-08-07T11:45:03.041405Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 130287d0-8183-4bba-9543-583b9abc1174 · outbound

This paper cites This is because InfoMax does not have a greedy selection process on a per-sample basis.

Data Pruning by Information Maximization This is because InfoMax does not have a greedy selection process on a per-sample basis

Reference 2007

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:37.401137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f2b3444f-c61d-4c34-a592-b81a78ae8b1a · outbound

This paper cites Estimating Training Data Influence by Tracing Gradient Descent.

Data Pruning by Information Maximization Estimating Training Data Influence by Tracing Gradient Descent

Reference 2015

Resolution: unresolved; no resolver link, observed 2026-08-07T11:45:03.064160Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b567bfc5-00cb-4b91-b55e-a513c42d2fdc · outbound

This paper cites Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation.

Data Pruning by Information Maximization Blip: Bootstrapping language-image pre-training for unified vision-language understanding and generation

Reference 2018

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:37.852196Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 328733b6-3109-4e0f-8fbd-741e6b10925a · outbound

This paper cites LoRA: Low-Rank Adaptation of Large Language Models.

Data Pruning by Information Maximization LoRA: Low-Rank Adaptation of Large Language Models

Reference 2020

Resolution: unresolved; no resolver link, observed 2026-08-07T11:45:00.974825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00aed012-907e-4584-8c49-6d1060e2bda6 · outbound

This paper cites Active learning for convolutional neural networks: A core-set approach.

Data Pruning by Information Maximization Active learning for convolutional neural networks: A core-set approach

Reference 2022

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:37.763943Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 98d38dc5-7111-4ac4-a28e-a6fc2cd16165 · outbound

This paper cites Name Time cost (min) Stage-1 of InfoMax 14.6Stage-2 of InfoMax 1.7Overall of InfoMax 16.1 D2-Pruning (Maharana et al.,.

Data Pruning by Information Maximization Name Time cost (min) Stage-1 of InfoMax 14.6Stage-2 of InfoMax 1.7Overall of InfoMax 16.1 D2-Pruning (Maharana et al.,

Reference 2023

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:31.991672Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 4fb711f7-0203-48cd-8dd2-397168524f70 · outbound

This paper cites On coresets for k-means and k-median clustering.

Data Pruning by Information Maximization On coresets for k-means and k-median clustering

Reference 2024

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:37.910706Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 982aafdd-bd57-442e-8fd7-a607686b48a5 · outbound

This paper cites dog" exists, a text description like.

Data Pruning by Information Maximization dog" exists, a text description like

Reference 2048

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:45:37.578482Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Pith citing papers

No inbound Pith citation observations are available.