{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3VPNCDEID5FIG4WS53ME36PPBQ","short_pith_number":"pith:3VPNCDEI","canonical_record":{"source":{"id":"1202.2820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T19:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"b8ac98d9d7c092ed4e5d2a19998ef624cff919b6c8ccc4f4c19f387c25d02984","abstract_canon_sha256":"537046597f8ed6ff33c8a030b017782265691f6a7d28b6c735d64790039e191f"},"schema_version":"1.0"},"canonical_sha256":"dd5ed10c881f4a8372d2eed84df9ef0c1c35b00616c6397259ba6d109a9fb9a1","source":{"kind":"arxiv","id":"1202.2820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2820","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2820v1","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2820","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"3VPNCDEID5FI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3VPNCDEID5FIG4WS","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3VPNCDEI","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3VPNCDEID5FIG4WS53ME36PPBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T19:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"b8ac98d9d7c092ed4e5d2a19998ef624cff919b6c8ccc4f4c19f387c25d02984","abstract_canon_sha256":"537046597f8ed6ff33c8a030b017782265691f6a7d28b6c735d64790039e191f"},"schema_version":"1.0"},"canonical_sha256":"dd5ed10c881f4a8372d2eed84df9ef0c1c35b00616c6397259ba6d109a9fb9a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:25.638887Z","signature_b64":"R8lqiVZ+Sp1rHiK0S53OciCpZK/xz+i24uxC2NpSxMFfC2EADd0Er+mdgZVy61A4Fqw2UQdhaCAACsH6atMqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd5ed10c881f4a8372d2eed84df9ef0c1c35b00616c6397259ba6d109a9fb9a1","last_reissued_at":"2026-05-18T04:02:25.637886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:25.637886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2820","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-05-18T04:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BmImZYK5EHr4NI4jw8g9R/vRFCll/QNpIWCnlWPhrMF4mtPYdN2+lzqWvVkHqVffGOLKCUDQjO31xaoeKdtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:18:25.978271Z"},"content_sha256":"9bbbf9f7f74202c538ea09150383a9d4d0ce8cf48a116a3d7cdb4bb691c6ad42","schema_version":"1.0","event_id":"sha256:9bbbf9f7f74202c538ea09150383a9d4d0ce8cf48a116a3d7cdb4bb691c6ad42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3VPNCDEID5FIG4WS53ME36PPBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximating String Selection Problems with Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avivit Levy, Christina Boucher, David Pritchard, Gad M. Landau, Oren Weimann","submitted_at":"2012-02-13T19:09:26Z","abstract_excerpt":"Many problems in bioinformatics are about finding strings that approximately represent a collection of given strings. We look at more general problems where some input strings can be classified as outliers. The Close to Most Strings problem is, given a set S of same-length strings, and a parameter d, find a string x that maximizes the number of \"non-outliers\" within Hamming distance d of x. We prove this problem has no PTAS unless ZPP=NP, correcting a decade-old mistake. The Most Strings with Few Bad Columns problem is to find a maximum-size subset of input strings so that the number of non-id"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2820","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":""},"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-18T04:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSW8cZNdJr7tabzbUeD1sXv4TFVrl09c++2eaPMDHfaD/94mSOcOZWCCjSWxx8rKYrJqWzgkXl3p7Xc+kq0DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:18:25.978650Z"},"content_sha256":"b18d4e221ef6443e0bd09774ad7b418184ce40b27de4cf7c6107121a03cb59af","schema_version":"1.0","event_id":"sha256:b18d4e221ef6443e0bd09774ad7b418184ce40b27de4cf7c6107121a03cb59af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VPNCDEID5FIG4WS53ME36PPBQ/bundle.json","state_url":"https://pith.science/pith/3VPNCDEID5FIG4WS53ME36PPBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VPNCDEID5FIG4WS53ME36PPBQ/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-05-25T19:18:25Z","links":{"resolver":"https://pith.science/pith/3VPNCDEID5FIG4WS53ME36PPBQ","bundle":"https://pith.science/pith/3VPNCDEID5FIG4WS53ME36PPBQ/bundle.json","state":"https://pith.science/pith/3VPNCDEID5FIG4WS53ME36PPBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VPNCDEID5FIG4WS53ME36PPBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3VPNCDEID5FIG4WS53ME36PPBQ","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":"537046597f8ed6ff33c8a030b017782265691f6a7d28b6c735d64790039e191f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T19:09:26Z","title_canon_sha256":"b8ac98d9d7c092ed4e5d2a19998ef624cff919b6c8ccc4f4c19f387c25d02984"},"schema_version":"1.0","source":{"id":"1202.2820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2820","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2820v1","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2820","created_at":"2026-05-18T04:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"3VPNCDEID5FI","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3VPNCDEID5FIG4WS","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3VPNCDEI","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:b18d4e221ef6443e0bd09774ad7b418184ce40b27de4cf7c6107121a03cb59af","target":"graph","created_at":"2026-05-18T04:02:25Z","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":"Many problems in bioinformatics are about finding strings that approximately represent a collection of given strings. We look at more general problems where some input strings can be classified as outliers. The Close to Most Strings problem is, given a set S of same-length strings, and a parameter d, find a string x that maximizes the number of \"non-outliers\" within Hamming distance d of x. We prove this problem has no PTAS unless ZPP=NP, correcting a decade-old mistake. The Most Strings with Few Bad Columns problem is to find a maximum-size subset of input strings so that the number of non-id","authors_text":"Avivit Levy, Christina Boucher, David Pritchard, Gad M. Landau, Oren Weimann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T19:09:26Z","title":"On Approximating String Selection Problems with Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2820","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:9bbbf9f7f74202c538ea09150383a9d4d0ce8cf48a116a3d7cdb4bb691c6ad42","target":"record","created_at":"2026-05-18T04:02:25Z","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":"537046597f8ed6ff33c8a030b017782265691f6a7d28b6c735d64790039e191f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-13T19:09:26Z","title_canon_sha256":"b8ac98d9d7c092ed4e5d2a19998ef624cff919b6c8ccc4f4c19f387c25d02984"},"schema_version":"1.0","source":{"id":"1202.2820","kind":"arxiv","version":1}},"canonical_sha256":"dd5ed10c881f4a8372d2eed84df9ef0c1c35b00616c6397259ba6d109a9fb9a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd5ed10c881f4a8372d2eed84df9ef0c1c35b00616c6397259ba6d109a9fb9a1","first_computed_at":"2026-05-18T04:02:25.637886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:25.637886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R8lqiVZ+Sp1rHiK0S53OciCpZK/xz+i24uxC2NpSxMFfC2EADd0Er+mdgZVy61A4Fqw2UQdhaCAACsH6atMqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:25.638887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bbbf9f7f74202c538ea09150383a9d4d0ce8cf48a116a3d7cdb4bb691c6ad42","sha256:b18d4e221ef6443e0bd09774ad7b418184ce40b27de4cf7c6107121a03cb59af"],"state_sha256":"ed58011d932a4c02ec076904b5452013e579aa8ee237e83b8de1ea66be8f47d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsDJDNrIeSq64j51ct8d8VqMTzbd2uGgkYTisQKFkI2N/CeNI/xzK83NALLhy+4cE8Ix8++Bn1PQ7MlkT6xxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:18:25.981267Z","bundle_sha256":"d4d72350a3e0c91177fa422575a24d9c794a1e333c701abc3421ebe030d67678"}}