{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TI5CMCFKI5QHA4AZ2IQ5JT7STC","short_pith_number":"pith:TI5CMCFK","schema_version":"1.0","canonical_sha256":"9a3a2608aa4760707019d221d4cff298af68a3c186d156bb3843446bec6c710d","source":{"kind":"arxiv","id":"1804.10930","version":1},"attestation_state":"computed","paper":{"title":"A QPTAS for Gapless MEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shilpa Garg, Tobias M\\\"omke","submitted_at":"2018-04-29T13:45:54Z","abstract_excerpt":"We consider the problem Minimum Error Correction (MEC). A MEC instance is an n x m matrix M with entries from {0,1,-}. Feasible solutions are composed of two binary m-bit strings, together with an assignment of each row of M to one of the two strings. The objective is to minimize the number of mismatches (errors) where the row has a value that differs from the assigned solution string. The symbol \"-\" is a wildcard that matches both 0 and 1. A MEC instance is gapless, if in each row of M all binary entries are consecutive.\n  Gapless-MEC is a relevant problem in computational biology, and it is "},"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":"1804.10930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T13:45:54Z","cross_cats_sorted":[],"title_canon_sha256":"2e222088cb44a6b8a7e3b4e67a48c6ec2a48e9464565249d69f10b1c4731c780","abstract_canon_sha256":"ac3b8cced475e9b7ca8c29809b6744194804e7e432c3c78951fb564dc1347133"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:15.147220Z","signature_b64":"k+26J/bRVt0UdonIx8ZLWyCR9brOQj11GSDjoD+tTNT5JBCwonSXrnBHffM4BX7fCNMPUM5vShE47HDizviwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a3a2608aa4760707019d221d4cff298af68a3c186d156bb3843446bec6c710d","last_reissued_at":"2026-05-18T00:17:15.146594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:15.146594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A QPTAS for Gapless MEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shilpa Garg, Tobias M\\\"omke","submitted_at":"2018-04-29T13:45:54Z","abstract_excerpt":"We consider the problem Minimum Error Correction (MEC). A MEC instance is an n x m matrix M with entries from {0,1,-}. Feasible solutions are composed of two binary m-bit strings, together with an assignment of each row of M to one of the two strings. The objective is to minimize the number of mismatches (errors) where the row has a value that differs from the assigned solution string. The symbol \"-\" is a wildcard that matches both 0 and 1. A MEC instance is gapless, if in each row of M all binary entries are consecutive.\n  Gapless-MEC is a relevant problem in computational biology, and it is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10930","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.10930","created_at":"2026-05-18T00:17:15.146680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10930v1","created_at":"2026-05-18T00:17:15.146680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10930","created_at":"2026-05-18T00:17:15.146680+00:00"},{"alias_kind":"pith_short_12","alias_value":"TI5CMCFKI5QH","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TI5CMCFKI5QHA4AZ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TI5CMCFK","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/TI5CMCFKI5QHA4AZ2IQ5JT7STC","json":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC.json","graph_json":"https://pith.science/api/pith-number/TI5CMCFKI5QHA4AZ2IQ5JT7STC/graph.json","events_json":"https://pith.science/api/pith-number/TI5CMCFKI5QHA4AZ2IQ5JT7STC/events.json","paper":"https://pith.science/paper/TI5CMCFK"},"agent_actions":{"view_html":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC","download_json":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC.json","view_paper":"https://pith.science/paper/TI5CMCFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10930&json=true","fetch_graph":"https://pith.science/api/pith-number/TI5CMCFKI5QHA4AZ2IQ5JT7STC/graph.json","fetch_events":"https://pith.science/api/pith-number/TI5CMCFKI5QHA4AZ2IQ5JT7STC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/action/storage_attestation","attest_author":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/action/author_attestation","sign_citation":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/action/citation_signature","submit_replication":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/action/replication_record"}},"created_at":"2026-05-18T00:17:15.146680+00:00","updated_at":"2026-05-18T00:17:15.146680+00:00"}