{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AKFDYYMBSBPRVEFDIC4DJTI6I7","short_pith_number":"pith:AKFDYYMB","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"},"canonical_sha256":"028a3c6181905f1a90a340b834cd1e47c3bd79182b2a8dbe48b9bee4a9594174","source":{"kind":"arxiv","id":"2607.28240","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28240","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28240v1","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28240","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"pith_short_12","alias_value":"AKFDYYMBSBPR","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"pith_short_16","alias_value":"AKFDYYMBSBPRVEFD","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"pith_short_8","alias_value":"AKFDYYMB","created_at":"2026-07-31T01:36:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AKFDYYMBSBPRVEFDIC4DJTI6I7","target":"record","payload":{"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"},"canonical_sha256":"028a3c6181905f1a90a340b834cd1e47c3bd79182b2a8dbe48b9bee4a9594174","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"},"source_kind":"arxiv","source_id":"2607.28240","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T01:36:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UC2rAPk5zDV/St3Mc2W+RTJgoQQbomaYTqweZW2Xfn1kZb36S0g/2sp5LxliO21/bvi+73qFmZhy/Y9O1nQUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T23:07:37.666842Z"},"content_sha256":"6b6970f0a17516b58baf721f95f112a3d849a73ad355bad2d1dfedaa0890a93d","schema_version":"1.0","event_id":"sha256:6b6970f0a17516b58baf721f95f112a3d849a73ad355bad2d1dfedaa0890a93d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AKFDYYMBSBPRVEFDIC4DJTI6I7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T01:36:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gnRBn5oY0K6RKOmeLpA2uhVJrqrVm5KDSN1BxVlvW77ifZimivgfX3sEZwQptrtUXLWnslVH3WcJqoMBaS2lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T23:07:37.667344Z"},"content_sha256":"4c474eb801e5dfaba6fb1a406ff1b28817eb4ec6dfc4ee79859dcd41b6abe11d","schema_version":"1.0","event_id":"sha256:4c474eb801e5dfaba6fb1a406ff1b28817eb4ec6dfc4ee79859dcd41b6abe11d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:AKFDYYMBSBPRVEFDIC4DJTI6I7","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1006/JCSS.2001.1774 resolves to 'Which Problems Have Strongly Exponential Complexity?'. A reader following the printed text alone cannot reach it.","snippet":"Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity?J. Comput. Syst. Sci., 63(4):512–530, 2001.doi:10.1006/JCSS.2001. 1774","arxiv_id":"2607.28240","detector":"doi_compliance","evidence":{"ref_index":15,"verdict_class":"incontrovertible","resolved_title":"Which Problems Have Strongly Exponential Complexity?","printed_excerpt":"10.1006/jcss.2001","reconstructed_doi":"10.1006/JCSS.2001.1774"},"severity":"advisory","ref_index":15,"audited_at":"2026-07-31T13:41:41.666753Z","event_type":"pith.integrity.v1","detected_doi":"10.1006/JCSS.2001.1774","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"edd17bbe8a68a88daa81af89ab216f015b2d05cf8463f42417fd5d8cd4f3223a","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Which Problems Have Strongly Exponential Complexity?","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14406,"payload_sha256":"f57fe18c21ab9ee044c00583ae760a603706ba52a1e80a488ea3adbfbcee7e90","signature_b64":"Kvtm9qqoqwj5JU1pMc/pSxuowNuTp80+ajtiNl5DN9mfRt85BJ+X3abPgLRdkidi+AwbYZA4VwOw79r4WCm6BA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T13:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4dXe7Gb9h4dQzjPPG7TbCoVbTDdhom9WezU51h+l1ng4Z8h3nQAyk8o1SZsDvDGpxukIgQhL73OzyDfW1n6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T23:07:37.669587Z"},"content_sha256":"1f1d9c8dd73827379c7268dbe45ab5cd6b75355aadc17a496cfefc6e38f742db","schema_version":"1.0","event_id":"sha256:1f1d9c8dd73827379c7268dbe45ab5cd6b75355aadc17a496cfefc6e38f742db"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:AKFDYYMBSBPRVEFDIC4DJTI6I7","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/J.COSREV.2025.100835 resolves to 'Computational Social Choice: Parameterized complexity and challenges'. A reader following the printed text alone cannot reach it.","snippet":"Jiehua Chen, Christian Hatschka, and Sofia Simola. Computational social choice: Parameterized complexity and challenges.Comput. Sci. Rev., 61:100835, 2026.doi:10.1016/J.COSREV.2025. 100835","arxiv_id":"2607.28240","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":"Computational Social Choice: Parameterized complexity and challenges","printed_excerpt":"10.1016/j.cosrev.2025","reconstructed_doi":"10.1016/J.COSREV.2025.100835"},"severity":"advisory","ref_index":4,"audited_at":"2026-07-31T13:41:41.666753Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/J.COSREV.2025.100835","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9f8fbf457016c311af381f965b6c986d2bc845fccec34ddb2e517ef23d5cb6f4","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Computational Social Choice: Parameterized complexity and challenges","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14405,"payload_sha256":"fc0c6087b3cf7493ba9328aba6bae848266d218f6d79316c49b884615e2d8688","signature_b64":"WYMXSoqooEHzzP7luefxDYHxvH8odMS02Tg5gW50M73o1FCELBgq9wCBZ+wmCHO99UF9YKuRk1djHDiJA9NPDQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T13:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LpljBVfgiA76LO9lvkSxH2tSSpGQgU/rvru1Il00iVnqP+WOQrx5pdYArauBCSOuN+H5JREHm0tmU2BbJ9/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T23:07:37.670029Z"},"content_sha256":"5449f15d298d14086fc35104e35bccf961d568b9ed5011949308a69c70e71331","schema_version":"1.0","event_id":"sha256:5449f15d298d14086fc35104e35bccf961d568b9ed5011949308a69c70e71331"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/bundle.json","state_url":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-02T23:07:37Z","links":{"resolver":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7","bundle":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/bundle.json","state":"https://pith.science/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKFDYYMBSBPRVEFDIC4DJTI6I7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AKFDYYMBSBPRVEFDIC4DJTI6I7","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7bd8fec824bc824cc73e8a33cb668a85b0a8114a2eb5106a7deca909ae52f8ba","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T14:06:17Z","title_canon_sha256":"6499f71f13ab3b0dd37ccf4df8c5a4e9b53a7237cdcc3bb3978a84082ca4086d"},"schema_version":"1.0","source":{"id":"2607.28240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28240","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28240v1","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28240","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"pith_short_12","alias_value":"AKFDYYMBSBPR","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"pith_short_16","alias_value":"AKFDYYMBSBPRVEFD","created_at":"2026-07-31T01:36:53Z"},{"alias_kind":"pith_short_8","alias_value":"AKFDYYMB","created_at":"2026-07-31T01:36:53Z"}],"graph_snapshots":[{"event_id":"sha256:4c474eb801e5dfaba6fb1a406ff1b28817eb4ec6dfc4ee79859dcd41b6abe11d","target":"graph","created_at":"2026-07-31T01:36:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.28240/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Manolis Vasilakis, Robert Ganian, Simon Wietheger","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T14:06:17Z","title":"Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28240","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6b6970f0a17516b58baf721f95f112a3d849a73ad355bad2d1dfedaa0890a93d","target":"record","created_at":"2026-07-31T01:36:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7bd8fec824bc824cc73e8a33cb668a85b0a8114a2eb5106a7deca909ae52f8ba","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-30T14:06:17Z","title_canon_sha256":"6499f71f13ab3b0dd37ccf4df8c5a4e9b53a7237cdcc3bb3978a84082ca4086d"},"schema_version":"1.0","source":{"id":"2607.28240","kind":"arxiv","version":1}},"canonical_sha256":"028a3c6181905f1a90a340b834cd1e47c3bd79182b2a8dbe48b9bee4a9594174","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"028a3c6181905f1a90a340b834cd1e47c3bd79182b2a8dbe48b9bee4a9594174","first_computed_at":"2026-07-31T01:36:53.698063Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:36:53.698063Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28240","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:1f1d9c8dd73827379c7268dbe45ab5cd6b75355aadc17a496cfefc6e38f742db","sha256:5449f15d298d14086fc35104e35bccf961d568b9ed5011949308a69c70e71331"]}],"invalid_events":[],"applied_event_ids":["sha256:6b6970f0a17516b58baf721f95f112a3d849a73ad355bad2d1dfedaa0890a93d","sha256:4c474eb801e5dfaba6fb1a406ff1b28817eb4ec6dfc4ee79859dcd41b6abe11d"],"state_sha256":"39a4a60fff0872c9c7494f4e5856155bcbcfbfc54cfe368c7a74986c985dbec0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lni/d6sQ1fJFuANxs9MHllCTP/b5/Lt9nanS2hyFxPG4CNX8JU6m33DrUt0LKE3x2QJd04YSP3XYJqGR3gwvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T23:07:37.672458Z","bundle_sha256":"ead516de989ec7e44ac806e8a2c2597f214edaed35d41212c0f3014de29ff738"}}