{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TMB24WT6QRKLABPSERWSVI7Z2C","short_pith_number":"pith:TMB24WT6","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"},"canonical_sha256":"9b03ae5a7e8454b005f2246d2aa3f9d0bd25907d1046a3d5095db3791c5d9e99","source":{"kind":"arxiv","id":"1810.09232","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09232","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09232v2","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09232","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"TMB24WT6QRKL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TMB24WT6QRKLABPS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TMB24WT6","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TMB24WT6QRKLABPSERWSVI7Z2C","target":"record","payload":{"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"},"canonical_sha256":"9b03ae5a7e8454b005f2246d2aa3f9d0bd25907d1046a3d5095db3791c5d9e99","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"},"source_kind":"arxiv","source_id":"1810.09232","source_version":2,"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-05-17T23:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzIVoeogM0tZBEddM3NqZ0Ue8s13gHy/CTfVQ23TZ8NzJmWm0ASDBya/wx6z/aTkc0xmvRFzSpyhydFrRCHyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:12:10.166599Z"},"content_sha256":"09440ef2adf24100b6839afe3c703b9866c2b5b3b48e8345eb5f4bddfcd453bb","schema_version":"1.0","event_id":"sha256:09440ef2adf24100b6839afe3c703b9866c2b5b3b48e8345eb5f4bddfcd453bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TMB24WT6QRKLABPSERWSVI7Z2C","target":"graph","payload":{"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"},"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-05-17T23:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ypky1hv7jBpn0MrZjzGrpI2S4cZgOSuBFymoAU8pg/3qoYpTHZaAMgRwCIB0S3PaTndKPL2S1BAXYj0pda9nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:12:10.166941Z"},"content_sha256":"6bddba6a9e31d8e27246c4df41c13de994902d4c0bbf7d0ed85cfac84ac77218","schema_version":"1.0","event_id":"sha256:6bddba6a9e31d8e27246c4df41c13de994902d4c0bbf7d0ed85cfac84ac77218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C/bundle.json","state_url":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMB24WT6QRKLABPSERWSVI7Z2C/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-06-01T13:12:10Z","links":{"resolver":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C","bundle":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C/bundle.json","state":"https://pith.science/pith/TMB24WT6QRKLABPSERWSVI7Z2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMB24WT6QRKLABPSERWSVI7Z2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TMB24WT6QRKLABPSERWSVI7Z2C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5c39f0f36d00a1d66811916e0be76ddb7e3c3d5a3838fe005dd0afcad4a76840","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-10-22T13:10:05Z","title_canon_sha256":"5f5c2ecc59add5afb67b9de74119f7c1e1436cc03fede1d909977a02d4d0b2b7"},"schema_version":"1.0","source":{"id":"1810.09232","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09232","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09232v2","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09232","created_at":"2026-05-17T23:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"TMB24WT6QRKL","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TMB24WT6QRKLABPS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TMB24WT6","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:6bddba6a9e31d8e27246c4df41c13de994902d4c0bbf7d0ed85cfac84ac77218","target":"graph","created_at":"2026-05-17T23:59:57Z","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"},"paper":{"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","authors_text":"Ahmad Biniaz, Anil Maheshwari, Jean-Lou De Carufel, Michiel Smid, Paz Carmi, Saeed Mehrabi, Sergio Cabello","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-10-22T13:10:05Z","title":"On the Minimum Consistent Subset Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09232","kind":"arxiv","version":2},"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:09440ef2adf24100b6839afe3c703b9866c2b5b3b48e8345eb5f4bddfcd453bb","target":"record","created_at":"2026-05-17T23:59:57Z","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":"5c39f0f36d00a1d66811916e0be76ddb7e3c3d5a3838fe005dd0afcad4a76840","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-10-22T13:10:05Z","title_canon_sha256":"5f5c2ecc59add5afb67b9de74119f7c1e1436cc03fede1d909977a02d4d0b2b7"},"schema_version":"1.0","source":{"id":"1810.09232","kind":"arxiv","version":2}},"canonical_sha256":"9b03ae5a7e8454b005f2246d2aa3f9d0bd25907d1046a3d5095db3791c5d9e99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b03ae5a7e8454b005f2246d2aa3f9d0bd25907d1046a3d5095db3791c5d9e99","first_computed_at":"2026-05-17T23:59:57.524957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:57.524957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BiZF+2zWKeuypMA5RRjpyT8mXkwC+AuG+O/JXcowZOifnnfZUFvP74LKVJjbjSTY8hRbORAqyaAd/R35Pc2XAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:57.525553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09232","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09440ef2adf24100b6839afe3c703b9866c2b5b3b48e8345eb5f4bddfcd453bb","sha256:6bddba6a9e31d8e27246c4df41c13de994902d4c0bbf7d0ed85cfac84ac77218"],"state_sha256":"aa6d5ea923331e5faf55be8eadae01e0a635ae8972b6f77f1838ad590fd2a8ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F36qp9DhCddq1R8KUnYxR28wtdfNLAje+TNNBqV20d0KXPN3RPnoOJsQQU1Ud0qO3oZpibzn/PjNJuint917Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:12:10.168916Z","bundle_sha256":"764252e2d611f97445cd8ebf2b6e09fb4728b3a5547df3798f4a95ccb5a70bef"}}