{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AKFDYYMBSBPRVEFDIC4DJTI6I7","short_pith_number":"pith:AKFDYYMB","schema_version":"1.0","canonical_sha256":"028a3c6181905f1a90a340b834cd1e47c3bd79182b2a8dbe48b9bee4a9594174","source":{"kind":"arxiv","id":"2607.28240","version":1},"attestation_state":"computed","paper":{"title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Manolis Vasilakis, Robert Ganian, Simon Wietheger","submitted_at":"2026-07-30T14:06:17Z","abstract_excerpt":"Instance selection is a vital technique for mitigating the computational bottlenecks of nearest-neighbor classification in large-scale supervised clustering. A classical theoretical formulation of this objective is the Minimum Consistent Subset (MCS) problem. While recent research has explored its complexity on unweighted graphs to uncover structural boundaries of tractability, arbitrary metric spaces are much more accurately modeled by (edge-)weighted graphs.\n  In this paper, we develop a comprehensive fine-grained complexity map of MCS on both unweighted and weighted graphs. As our main resu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.28240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T14:06:17Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6499f71f13ab3b0dd37ccf4df8c5a4e9b53a7237cdcc3bb3978a84082ca4086d","abstract_canon_sha256":"7bd8fec824bc824cc73e8a33cb668a85b0a8114a2eb5106a7deca909ae52f8ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"028a3c6181905f1a90a340b834cd1e47c3bd79182b2a8dbe48b9bee4a9594174","last_reissued_at":"2026-07-31T01:36:53.698063Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:36:53.698063Z"},"graph_snapshot":{"paper":{"title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Manolis Vasilakis, Robert Ganian, Simon Wietheger","submitted_at":"2026-07-30T14:06:17Z","abstract_excerpt":"Instance selection is a vital technique for mitigating the computational bottlenecks of nearest-neighbor classification in large-scale supervised clustering. A classical theoretical formulation of this objective is the Minimum Consistent Subset (MCS) problem. While recent research has explored its complexity on unweighted graphs to uncover structural boundaries of tractability, arbitrary metric spaces are much more accurately modeled by (edge-)weighted graphs.\n  In this paper, we develop a comprehensive fine-grained complexity map of MCS on both unweighted and weighted graphs. As our main resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28240","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.28240/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.28240","created_at":"2026-07-31T01:36:53.701299+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28240v1","created_at":"2026-07-31T01:36:53.701299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28240","created_at":"2026-07-31T01:36:53.701299+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKFDYYMBSBPR","created_at":"2026-07-31T01:36:53.701299+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKFDYYMBSBPRVEFD","created_at":"2026-07-31T01:36:53.701299+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKFDYYMB","created_at":"2026-07-31T01:36:53.701299+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7","json":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7.json","graph_json":"https://pith.science/api/pith-number/AKFDYYMBSBPRVEFDIC4DJTI6I7/graph.json","events_json":"https://pith.science/api/pith-number/AKFDYYMBSBPRVEFDIC4DJTI6I7/events.json","paper":"https://pith.science/paper/AKFDYYMB"},"agent_actions":{"view_html":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7","download_json":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7.json","view_paper":"https://pith.science/paper/AKFDYYMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28240&json=true","fetch_graph":"https://pith.science/api/pith-number/AKFDYYMBSBPRVEFDIC4DJTI6I7/graph.json","fetch_events":"https://pith.science/api/pith-number/AKFDYYMBSBPRVEFDIC4DJTI6I7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/action/storage_attestation","attest_author":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/action/author_attestation","sign_citation":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/action/citation_signature","submit_replication":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/action/replication_record"}},"created_at":"2026-07-31T01:36:53.701299+00:00","updated_at":"2026-07-31T01:36:53.701299+00:00"}