{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5R2WWJX6MIGM2LZN3WWF34ESPG","short_pith_number":"pith:5R2WWJX6","canonical_record":{"source":{"id":"1604.03243","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-12T04:37:35Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"17c11d7f08660d31db1d8033a172752049479140fde55244c83065e3ffb5a8ef","abstract_canon_sha256":"ba4a827c72d10576fac2a6f3d10a079a823774c239f27eedcbf9f266c6724e9b"},"schema_version":"1.0"},"canonical_sha256":"ec756b26fe620ccd2f2dddac5df09279b4f8aca56e9cbccdf14eb394cd1fe19f","source":{"kind":"arxiv","id":"1604.03243","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03243","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03243v3","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03243","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"5R2WWJX6MIGM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5R2WWJX6MIGM2LZN","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5R2WWJX6","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5R2WWJX6MIGM2LZN3WWF34ESPG","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03243","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-12T04:37:35Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"17c11d7f08660d31db1d8033a172752049479140fde55244c83065e3ffb5a8ef","abstract_canon_sha256":"ba4a827c72d10576fac2a6f3d10a079a823774c239f27eedcbf9f266c6724e9b"},"schema_version":"1.0"},"canonical_sha256":"ec756b26fe620ccd2f2dddac5df09279b4f8aca56e9cbccdf14eb394cd1fe19f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:47.842250Z","signature_b64":"iehWfEcknXEststPHyhAePV2CWNGqixs1kE1P2T2mJbAN1gFUoK8XSu56B2Z8UkH5AjXdYKx+KBVPM3PuucdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec756b26fe620ccd2f2dddac5df09279b4f8aca56e9cbccdf14eb394cd1fe19f","last_reissued_at":"2026-05-18T00:54:47.841794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:47.841794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03243","source_version":3,"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-18T00:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fpEn6G8DcfzWim3DGw/Ipl37kM/J8QoB/VfeGL/d2EkaUA1xFG4uguxuf1gIzPXV1x7bDeb2oZTeT98hIhuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:58:57.194165Z"},"content_sha256":"dba4135c38f63d801d337941e78e2ad169f5c8e1f8476e7ce69bb24f14a19365","schema_version":"1.0","event_id":"sha256:dba4135c38f63d801d337941e78e2ad169f5c8e1f8476e7ce69bb24f14a19365"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5R2WWJX6MIGM2LZN3WWF34ESPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Separating Sets of Strings by Finding Matching Patterns is Almost Always Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.CC","authors_text":"Giuseppe Lancia, Luke Mathieson, Pablo Moscato","submitted_at":"2016-04-12T04:37:35Z","abstract_excerpt":"We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in understanding the complexity of genetic algorithms. We show that the basic problem of finding a small set of patterns that match one set of strings but do not match any string in a second set is difficult (NP-complete, W[2]-hard when parameterized by the size of the pattern set, and APX-hard). We then perform a detailed parameterized analysis of the problem, separat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03243","kind":"arxiv","version":3},"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-18T00:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6BLcGn6ZND4qmj/40O44h/K64ZaFweM2M86XQ9sn5zo91gmvaREQZPBJjx+GivyA/4zM8yAAQZymRsn3qHO6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:58:57.194780Z"},"content_sha256":"7d351a13d426e809ef8a5da9692ccf8a3b3094c1fbedc0063401fb131647a84b","schema_version":"1.0","event_id":"sha256:7d351a13d426e809ef8a5da9692ccf8a3b3094c1fbedc0063401fb131647a84b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5R2WWJX6MIGM2LZN3WWF34ESPG/bundle.json","state_url":"https://pith.science/pith/5R2WWJX6MIGM2LZN3WWF34ESPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5R2WWJX6MIGM2LZN3WWF34ESPG/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-28T01:58:57Z","links":{"resolver":"https://pith.science/pith/5R2WWJX6MIGM2LZN3WWF34ESPG","bundle":"https://pith.science/pith/5R2WWJX6MIGM2LZN3WWF34ESPG/bundle.json","state":"https://pith.science/pith/5R2WWJX6MIGM2LZN3WWF34ESPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5R2WWJX6MIGM2LZN3WWF34ESPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5R2WWJX6MIGM2LZN3WWF34ESPG","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":"ba4a827c72d10576fac2a6f3d10a079a823774c239f27eedcbf9f266c6724e9b","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-12T04:37:35Z","title_canon_sha256":"17c11d7f08660d31db1d8033a172752049479140fde55244c83065e3ffb5a8ef"},"schema_version":"1.0","source":{"id":"1604.03243","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03243","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03243v3","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03243","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"5R2WWJX6MIGM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5R2WWJX6MIGM2LZN","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5R2WWJX6","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:7d351a13d426e809ef8a5da9692ccf8a3b3094c1fbedc0063401fb131647a84b","target":"graph","created_at":"2026-05-18T00:54:47Z","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":"We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in understanding the complexity of genetic algorithms. We show that the basic problem of finding a small set of patterns that match one set of strings but do not match any string in a second set is difficult (NP-complete, W[2]-hard when parameterized by the size of the pattern set, and APX-hard). We then perform a detailed parameterized analysis of the problem, separat","authors_text":"Giuseppe Lancia, Luke Mathieson, Pablo Moscato","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-12T04:37:35Z","title":"Separating Sets of Strings by Finding Matching Patterns is Almost Always Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03243","kind":"arxiv","version":3},"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:dba4135c38f63d801d337941e78e2ad169f5c8e1f8476e7ce69bb24f14a19365","target":"record","created_at":"2026-05-18T00:54:47Z","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":"ba4a827c72d10576fac2a6f3d10a079a823774c239f27eedcbf9f266c6724e9b","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-12T04:37:35Z","title_canon_sha256":"17c11d7f08660d31db1d8033a172752049479140fde55244c83065e3ffb5a8ef"},"schema_version":"1.0","source":{"id":"1604.03243","kind":"arxiv","version":3}},"canonical_sha256":"ec756b26fe620ccd2f2dddac5df09279b4f8aca56e9cbccdf14eb394cd1fe19f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec756b26fe620ccd2f2dddac5df09279b4f8aca56e9cbccdf14eb394cd1fe19f","first_computed_at":"2026-05-18T00:54:47.841794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:47.841794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iehWfEcknXEststPHyhAePV2CWNGqixs1kE1P2T2mJbAN1gFUoK8XSu56B2Z8UkH5AjXdYKx+KBVPM3PuucdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:47.842250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03243","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dba4135c38f63d801d337941e78e2ad169f5c8e1f8476e7ce69bb24f14a19365","sha256:7d351a13d426e809ef8a5da9692ccf8a3b3094c1fbedc0063401fb131647a84b"],"state_sha256":"4c6b9a1b009654ff1b93c4597412b6579ab3fa8559729bbd2c4407076b08a523"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57/1jHotzkSXLl8rEy3wtqpaU3e0rU7yYmpNd4o2hNHJ6CkhTp7L+MXi66XMqy8X9JG2XkccYKT6SjcLHLEWDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:58:57.197633Z","bundle_sha256":"c3d0ea549ac3ee7fa1f884b492afa2be9e316b28b4b5cb612f9091206fef7903"}}