{"as_of":"2026-08-22T08:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f3494311c415f6404e7f0ff08ac008b491c4a78917cb5e4b501887c247895866","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T13:36:14.196460Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2607.28240/citation-record","integrity":"/paper/2607.28240/integrity","json":"/paper/2607.28240/citation-record.json","paper":"/paper/2607.28240"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:11.705411Z","title":"Complexity of finding embeddings in a k-tree.SIAM Journal on Algebraic Discrete Methods, 8(2):277–284, 1987.doi:10.1137/ 0608024","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:11.705411Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:ec6c7dfa173967c08b7a6d23806159b8281c4696157962a1329018d8f95b6a35","observation_id":"b0ee2f80-8195-4e8c-916c-ec974e77dc0d","resolution":{"observed_at":"2026-07-31T13:36:11.705411Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fsttcs.2024.7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Nandy, Krishna Priya K","venue":"arXiv (Cornell University)","work_id":"f67685da-c3c6-4002-9175-57b439710bec","year":2024},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:11.753069Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:a44a079b8c93030409808c3a0d9db2bc8958b0c7cc57593c3ae60e9e6e10d042","observation_id":"28a0a26d-f221-4231-a93f-9ac639e01ef9","resolution":{"observed_at":"2026-07-31T13:40:55.685239Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v40i17.38427","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Learning with structure: Computing consistent subsets on structurally-regular graphs","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"66d535e7-9767-4f45-be63-0abb7ea892cd","year":2026},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:11.875908Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:b74d863507e7c78a5f2b3bb2e6fe3b64fc68c86b89c36eb703abbf59abb3008c","observation_id":"f45b312a-f3ae-46e3-b829-67279e9db47d","resolution":{"observed_at":"2026-07-31T13:40:55.611452Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-31T13:36:11.949340Z","title":"Computational social choice: Parameterized complexity and challenges.Comput","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:11.949340Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:c3a4e28a4b3c074ee5fe9b934803310d72890cd8e23b25e9b03c6ee98cfded22","observation_id":"95d40dc8-a69c-4172-b4cd-08a9929e0ecd","resolution":{"observed_at":"2026-07-31T13:36:11.949340Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:12.039772Z","title":"Refined lower bounds for nearest neighbor condensation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.039772Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:3e704e3afe7cfd75621536525a4556d0a21bc4b669ff5c790d028176e41dd08b","observation_id":"00693193-299a-4e53-b85d-f9ad9f7050d1","resolution":{"observed_at":"2026-07-31T13:36:12.039772Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:12.088808Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.088808Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:ba607839642421c220392fdd5ab7e68c0588989afc82651e5cb0dab1ee37dfc8","observation_id":"8db8917d-83e1-455c-941c-05d8eb13278e","resolution":{"observed_at":"2026-07-31T13:36:12.088808Z","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":"10.1007/978-3-030-86593-1_14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"90bccde3-542d-44a2-bdab-a6c1ad75ccbf","year":2021},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.166729Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:0214506c8b8fbbfc4b1f1207616e0ae46fcd14256dc9c3969f0be11df06edb79","observation_id":"9cdd68e4-0c10-4e6b-b485-bde373eead76","resolution":{"observed_at":"2026-07-31T13:40:55.589760Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2023.05.024","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Discrete Applied Mathematics","work_id":"90eb6b8f-c544-40e3-84ee-b71a53b03e20","year":2023},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.239012Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:dc259926d95b44d61074d9dda080a5aace58233fb213e887cb2b8f9e168d9bdf","observation_id":"266ebc03-5c88-4e2c-9e18-4b588df0d506","resolution":{"observed_at":"2026-07-31T13:40:55.581394Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-31T13:36:12.318671Z","title":"Springer, 6 edition, 2025.doi:10.1007/978-3-662-70107-2","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.318671Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:db10f3f9f256fe1c77a98e0e5a395443d4faa3ec1ea23302e74d4f7eadc29853","observation_id":"d343e14a-daaf-4ceb-bc23-7abb18e0de21","resolution":{"observed_at":"2026-07-31T13:36:12.318671Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:12.415215Z","title":null,"venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.415215Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:2209161d5aba601359cb24d2f37f71d597c65b37b72011f07930176ad0f65053","observation_id":"80325fc6-3167-4029-b53e-3ee37ff6fff8","resolution":{"observed_at":"2026-07-31T13:36:12.415215Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:12.510006Z","title":"Parameterized complexity in machine learning.Comput","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.510006Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:3c4bda6584e1fd8d2ff5da659734d1af35310db37229b47efefa933a40440465","observation_id":"43275484-e214-43c5-b63c-b95cf3043e67","resolution":{"observed_at":"2026-07-31T13:36:12.510006Z","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":"10.1016/j.artint.2017.12.006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The complexity landscape of decompositional parame- ters for ILP.Artif","venue":"Artificial Intelligence","work_id":"126804d3-2a6f-4f98-8c5d-e92d7fb10fd9","year":2018},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.607944Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:23650b7f0d17b670e43b8d340f52577113d10cfc41c15a3e0d8460055e2129d1","observation_id":"c9c52f4f-74c8-44bf-abe5-f625ec982da3","resolution":{"observed_at":"2026-07-31T13:40:55.566300Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-31T13:36:12.744845Z","title":"Structural parameterizations of vertex integrity.Theor","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.744845Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:ca29aba3653505285bbbe3bff9de651d4a7684edfa3afe4ce33ec948e6eca080","observation_id":"116d527b-68df-4b7a-a940-e62e4913fcdf","resolution":{"observed_at":"2026-07-31T13:36:12.744845Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:12.874016Z","title":null,"venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.874016Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:e8ef3e3c9000d7692aca986a046611168478152f49bc2036fb90cb0881626935","observation_id":"bb2c3bcc-35ee-4650-8239-75991784ae9f","resolution":{"observed_at":"2026-07-31T13:36:12.874016Z","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":"10.1006/jcss.2001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:40:55.553737Z","title":"Which problems have strongly exponential complexity?J","venue":null,"work_id":"94e91dbd-d75d-476b-9d90-808dbed8013c","year":2001},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.953388Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:205834f4e5ae828f3281b6d4f0b82cc87e6621530e13ada849fa5dd8a81c16d7","observation_id":"1d4002be-5f01-4f8c-82bc-38ac3217a1e7","resolution":{"observed_at":"2026-07-31T13:40:55.556858Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v37i4.25559","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GLCC: A general framework for graph-level clustering","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"260ea4d1-b30a-48a4-99ac-fd7c6eb4720d","year":2023},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:12.999452Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:1a3e1cb309150f08d8230e33eb6e449c673759d2e1b480fb35641d2432e71a17","observation_id":"d299073f-da67-4141-a940-8b8ae3559b8a","resolution":{"observed_at":"2026-07-31T13:40:55.547669Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-74180-2_11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Consistent subset problem with two labels","venue":"Lecture notes in computer science","work_id":"529d4bc1-0eb3-492c-a201-08379be8ee05","year":2018},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.119633Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:a62a0da02accb583fb5ca03502ddc780c70526db6d23afa55f5f0ab6a9105eb0","observation_id":"1f2db688-d783-40b6-b497-c55a2a0d8399","resolution":{"observed_at":"2026-07-31T13:40:55.538848Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/lmcs-20(4:18)2024","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fine-grained meta-theorems for vertex integrity.Log","venue":"Logical Methods in Computer Science","work_id":"01e0e6cb-4b51-4495-8a80-e09390c5389e","year":2024},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.189235Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:90a84fb08f806df57c4fc549b15ce0814775a03ce7acfa5d5901d2a525d7d2af","observation_id":"fc74755b-0d1b-4200-9dcb-0494c71ac960","resolution":{"observed_at":"2026-07-31T13:40:55.530049Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-31T13:36:13.278912Z","title":"Interactive deep clustering via value mining","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.278912Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:fc170c4d4d5b5bb3b4c7ec2aafa5e7d9378c4d7568175ad2b372dedab27289f4","observation_id":"77d3e8c0-e048-4573-97ba-78e98a744ee7","resolution":{"observed_at":"2026-07-31T13:36:13.278912Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:13.353337Z","title":"Lower bounds based on the exponential time hypothesis.Bull","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.353337Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:a386b84aa169f31a605d43b5586e6bf344128a0edff69e07227b6f806557644e","observation_id":"de6f619d-2672-4fad-aba2-ccef52906cc6","resolution":{"observed_at":"2026-07-31T13:36:13.353337Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:13.450639Z","title":"Minimum selective subset on some graph classes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.450639Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:396ba60bfbf8393026254a45b8ca0a2f74f9ee2317e76dd768fb42477f152d36","observation_id":"56a2093c-b2a9-4e2a-9f3f-a8f2ee828c71","resolution":{"observed_at":"2026-07-31T13:36:13.450639Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:13.510220Z","title":"Minimum selective subset on unit disk graphs and circle graphs","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.510220Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:bd8ede3f0e180f9af34a47246eadee2c7a92678489142ea977baeea8ad2975e7","observation_id":"53cb11af-6842-4b55-b24e-e64fb405d654","resolution":{"observed_at":"2026-07-31T13:36:13.510220Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2022.79","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computing treedepth in polynomial space and linear FPT time","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"694b247c-058c-4193-b459-aed2cb287080","year":2022},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.581704Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:ead1d51dc62584f96a55be02c4818681b49fccd082ca049176f2785713757d0f","observation_id":"4ab3d952-4e98-4a12-9f7f-162a9debe418","resolution":{"observed_at":"2026-07-31T13:40:55.521185Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-07-31T13:36:13.670330Z","title":"Springer, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.670330Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:797018fb4610b7bc7ceeac44b3b81aa06350913b1d2500f3f2bb713e63fa5c52","observation_id":"4be9afc6-efcb-40f2-bf78-47fdc920fd11","resolution":{"observed_at":"2026-07-31T13:36:13.670330Z","resolver_source":null,"status":"malformed_identifier"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:13.804016Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.804016Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:82a3bfd6d96c1e4c7879bb18b5f30619c86197496b3bb4f3e384ca75715d56f2","observation_id":"fa10124e-21d0-4d68-af7a-7e2494dbfe69","resolution":{"observed_at":"2026-07-31T13:36:13.804016Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:36:13.891993Z","title":"A theorem on boolean matrices.Journal of the ACM, 9(1):11–12, 1962","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.891993Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:8bf7ce4cda578bdc5c3bf7fadd1a4a4e8716e6ae3a8284389fbee337f19b5659","observation_id":"e55c2916-841e-443c-af94-4cba9453f320","resolution":{"observed_at":"2026-07-31T13:36:13.891993Z","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":"10.1142/s0218195992000226","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"International Journal of Computational Geometry & Applications","work_id":"8ded1e3f-0f63-4762-9f52-67e579ff7b65","year":1992},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:13.976857Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:4f47228aaa8be229f39d05a4fddd5f6d5c2f4e10c51b091b9924cb25ae3657f4","observation_id":"96860c22-5d4c-46dd-a556-245ab24cac7f","resolution":{"observed_at":"2026-07-31T13:40:55.506129Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v39i9.32998","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semi-supervised clustering framework for fine-grained scene graph generation","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","work_id":"56029f85-e302-4ee1-93ef-5fa2bab5057c","year":2025},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:14.117179Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:281deab37d9daa5a8be01e5d312dc1b84dbe0e1449b2b711f0a31bd663934072","observation_id":"65a16346-8320-4d56-b82c-59043570e2d9","resolution":{"observed_at":"2026-07-31T13:40:55.497226Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.24963/ijcai.2025/780","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Aligning contrastive multiple clusterings with user interests","venue":null,"work_id":"c664ace1-4d0f-4291-972e-fb2923bd2e5a","year":2025},"citing_paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T13:36:14.196460Z"},"links":{"citing_paper":"/paper/2607.28240"},"observation_digest":"sha256:7ba1b8ee55f598feac6ee5af880cd166d344f9d61ec9c5a6da5203b1ddb235a6","observation_id":"ca0e4271-dfb5-423e-b339-b656f666b338","resolution":{"observed_at":"2026-07-31T13:40:55.486878Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.28240","last_updated":"2026-07-30T14:06:17Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-15T23:44:34.612416Z","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":13,"verified_fuzzy":0},"total_outbound_references":29},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"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."}