Paper Citation Record · LEDGER

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset

As of 22 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2607.28240.

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

pith.paper-citation-record.v1
2607.28240 v1

Coverage vector

measured 29 of 29 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-31T13:36:14.196460Z

measured 29 of 29 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+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

29 of 29 outbound references displayed

verified exact13
verified fuzzy0
unresolved13
parse uncertain0
malformed identifier3
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b0ee2f80-8195-4e8c-916c-ec974e77dc0d · outbound

This paper cites Complexity of finding embeddings in a k-tree.SIAM Journal on Algebraic Discrete Methods, 8(2):277–284, 1987.doi:10.1137/ 0608024.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Complexity of finding embeddings in a k-tree.SIAM Journal on Algebraic Discrete Methods, 8(2):277–284, 1987.doi:10.1137/ 0608024

Reference 1

Resolution: malformed identifier; no resolver link, observed 2026-07-31T13:36:11.705411Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 28a0a26d-f221-4231-a93f-9ac639e01ef9 · outbound

This paper cites Nandy, Krishna Priya K.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Nandy, Krishna Priya K

Reference 2

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.685239Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation f45b312a-f3ae-46e3-b829-67279e9db47d · outbound

This paper cites Learning with structure: Computing consistent subsets on structurally-regular graphs.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Learning with structure: Computing consistent subsets on structurally-regular graphs

Reference 3

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.611452Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 95d40dc8-a69c-4172-b4cd-08a9929e0ecd · outbound

This paper cites Computational social choice: Parameterized complexity and challenges.Comput.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Computational social choice: Parameterized complexity and challenges.Comput

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:11.949340Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00693193-299a-4e53-b85d-f9ad9f7050d1 · outbound

This paper cites Refined lower bounds for nearest neighbor condensation.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Refined lower bounds for nearest neighbor condensation

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:12.039772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8db8917d-83e1-455c-941c-05d8eb13278e · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:12.088808Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cdd68e4-0c10-4e6b-b485-bde373eead76 · outbound

This paper cites an unresolved cited work.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Unresolved cited work

Reference 7

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.589760Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 266ebc03-5c88-4e2c-9e18-4b588df0d506 · outbound

This paper cites an unresolved cited work.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Unresolved cited work

Reference 8

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.581394Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation d343e14a-daaf-4ceb-bc23-7abb18e0de21 · outbound

This paper cites Springer, 6 edition, 2025.doi:10.1007/978-3-662-70107-2.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Springer, 6 edition, 2025.doi:10.1007/978-3-662-70107-2

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:12.318671Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80325fc6-3167-4029-b53e-3ee37ff6fff8 · outbound

This paper cites an unresolved cited work.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:12.415215Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 43275484-e214-43c5-b63c-b95cf3043e67 · outbound

This paper cites Parameterized complexity in machine learning.Comput.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Parameterized complexity in machine learning.Comput

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:12.510006Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c9c52f4f-74c8-44bf-abe5-f625ec982da3 · outbound

This paper cites The complexity landscape of decompositional parame- ters for ILP.Artif.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset The complexity landscape of decompositional parame- ters for ILP.Artif

Reference 12

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.566300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 116d527b-68df-4b7a-a940-e62e4913fcdf · outbound

This paper cites Structural parameterizations of vertex integrity.Theor.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Structural parameterizations of vertex integrity.Theor

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:12.744845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb2c3bcc-35ee-4650-8239-75991784ae9f · outbound

This paper cites an unresolved cited work.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:12.874016Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d4002be-5f01-4f8c-82bc-38ac3217a1e7 · outbound

This paper cites Which problems have strongly exponential complexity?J.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Which problems have strongly exponential complexity?J

Reference 15

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.556858Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation d299073f-da67-4141-a940-8b8ae3559b8a · outbound

This paper cites GLCC: A general framework for graph-level clustering.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset GLCC: A general framework for graph-level clustering

Reference 16

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.547669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 1f2db688-d783-40b6-b497-c55a2a0d8399 · outbound

This paper cites Consistent subset problem with two labels.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Consistent subset problem with two labels

Reference 17

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.538848Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation fc74755b-0d1b-4200-9dcb-0494c71ac960 · outbound

This paper cites Fine-grained meta-theorems for vertex integrity.Log.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Fine-grained meta-theorems for vertex integrity.Log

Reference 18

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.530049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 77d3e8c0-e048-4573-97ba-78e98a744ee7 · outbound

This paper cites Interactive deep clustering via value mining.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Interactive deep clustering via value mining

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:13.278912Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de6f619d-2672-4fad-aba2-ccef52906cc6 · outbound

This paper cites Lower bounds based on the exponential time hypothesis.Bull.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Lower bounds based on the exponential time hypothesis.Bull

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:13.353337Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56a2093c-b2a9-4e2a-9f3f-a8f2ee828c71 · outbound

This paper cites Minimum selective subset on some graph classes.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Minimum selective subset on some graph classes

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:13.450639Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53cb11af-6842-4b55-b24e-e64fb405d654 · outbound

This paper cites Minimum selective subset on unit disk graphs and circle graphs.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Minimum selective subset on unit disk graphs and circle graphs

Reference 22

Resolution: malformed identifier; no resolver link, observed 2026-07-31T13:36:13.510220Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ab3d952-4e98-4a12-9f7f-162a9debe418 · outbound

This paper cites Computing treedepth in polynomial space and linear FPT time.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Computing treedepth in polynomial space and linear FPT time

Reference 23

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.521185Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 4be9afc6-efcb-40f2-bf78-47fdc920fd11 · outbound

This paper cites Springer, 2012.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Springer, 2012

Reference 24

Resolution: malformed identifier; no resolver link, observed 2026-07-31T13:36:13.670330Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa10124e-21d0-4d68-af7a-7e2494dbfe69 · outbound

This paper cites an unresolved cited work.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Unresolved cited work

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:13.804016Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e55c2916-841e-443c-af94-4cba9453f320 · outbound

This paper cites A theorem on boolean matrices.Journal of the ACM, 9(1):11–12, 1962.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset A theorem on boolean matrices.Journal of the ACM, 9(1):11–12, 1962

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-31T13:36:13.891993Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 96860c22-5d4c-46dd-a556-245ab24cac7f · outbound

This paper cites an unresolved cited work.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Unresolved cited work

Reference 27

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.506129Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 65a16346-8320-4d56-b82c-59043570e2d9 · outbound

This paper cites Semi-supervised clustering framework for fine-grained scene graph generation.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Semi-supervised clustering framework for fine-grained scene graph generation

Reference 28

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.497226Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation ca0e4271-dfb5-423e-b339-b656f666b338 · outbound

This paper cites Aligning contrastive multiple clusterings with user interests.

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset Aligning contrastive multiple clusterings with user interests

Reference 29

Resolution: verified exact; doi, observed 2026-07-31T13:40:55.486878Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Pith citing papers

No inbound Pith citation observations are available.