{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TMB24WT6QRKLABPSERWSVI7Z2C","short_pith_number":"pith:TMB24WT6","schema_version":"1.0","canonical_sha256":"9b03ae5a7e8454b005f2246d2aa3f9d0bd25907d1046a3d5095db3791c5d9e99","source":{"kind":"arxiv","id":"1810.09232","version":2},"attestation_state":"computed","paper":{"title":"On the Minimum Consistent Subset Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Jean-Lou De Carufel, Michiel Smid, Paz Carmi, Saeed Mehrabi, Sergio Cabello","submitted_at":"2018-10-22T13:10:05Z","abstract_excerpt":"Let $P$ be a set of $n$ colored points in the plane. Introduced by Hart (1968), a consistent subset of $P$, is a set $S\\subseteq P$ such that for every point $p$ in $P\\setminus S$, the closest point of $p$ in $S$ has the same color as $p$. The consistent subset problem is to find a consistent subset of $P$ with minimum cardinality. This problem is known to be NP-complete even for two-colored point sets. Since the initial presentation of this problem, aside from the hardness results, there has not been a significant progress from the algorithmic point of view. In this paper we present the follo"},"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":"1810.09232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-10-22T13:10:05Z","cross_cats_sorted":[],"title_canon_sha256":"5f5c2ecc59add5afb67b9de74119f7c1e1436cc03fede1d909977a02d4d0b2b7","abstract_canon_sha256":"5c39f0f36d00a1d66811916e0be76ddb7e3c3d5a3838fe005dd0afcad4a76840"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:57.525553Z","signature_b64":"BiZF+2zWKeuypMA5RRjpyT8mXkwC+AuG+O/JXcowZOifnnfZUFvP74LKVJjbjSTY8hRbORAqyaAd/R35Pc2XAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b03ae5a7e8454b005f2246d2aa3f9d0bd25907d1046a3d5095db3791c5d9e99","last_reissued_at":"2026-05-17T23:59:57.524957Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:57.524957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Minimum Consistent Subset Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Anil Maheshwari, Jean-Lou De Carufel, Michiel Smid, Paz Carmi, Saeed Mehrabi, Sergio Cabello","submitted_at":"2018-10-22T13:10:05Z","abstract_excerpt":"Let $P$ be a set of $n$ colored points in the plane. Introduced by Hart (1968), a consistent subset of $P$, is a set $S\\subseteq P$ such that for every point $p$ in $P\\setminus S$, the closest point of $p$ in $S$ has the same color as $p$. The consistent subset problem is to find a consistent subset of $P$ with minimum cardinality. This problem is known to be NP-complete even for two-colored point sets. Since the initial presentation of this problem, aside from the hardness results, there has not been a significant progress from the algorithmic point of view. In this paper we present the follo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09232","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1810.09232","created_at":"2026-05-17T23:59:57.525042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09232v2","created_at":"2026-05-17T23:59:57.525042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09232","created_at":"2026-05-17T23:59:57.525042+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMB24WT6QRKL","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMB24WT6QRKLABPS","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMB24WT6","created_at":"2026-05-18T12:32:53.628368+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/TMB24WT6QRKLABPSERWSVI7Z2C","json":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C.json","graph_json":"https://pith.science/api/pith-number/TMB24WT6QRKLABPSERWSVI7Z2C/graph.json","events_json":"https://pith.science/api/pith-number/TMB24WT6QRKLABPSERWSVI7Z2C/events.json","paper":"https://pith.science/paper/TMB24WT6"},"agent_actions":{"view_html":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C","download_json":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C.json","view_paper":"https://pith.science/paper/TMB24WT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09232&json=true","fetch_graph":"https://pith.science/api/pith-number/TMB24WT6QRKLABPSERWSVI7Z2C/graph.json","fetch_events":"https://pith.science/api/pith-number/TMB24WT6QRKLABPSERWSVI7Z2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C/action/storage_attestation","attest_author":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C/action/author_attestation","sign_citation":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C/action/citation_signature","submit_replication":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C/action/replication_record"}},"created_at":"2026-05-17T23:59:57.525042+00:00","updated_at":"2026-05-17T23:59:57.525042+00:00"}