{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TI5CMCFKI5QHA4AZ2IQ5JT7STC","short_pith_number":"pith:TI5CMCFK","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"},"canonical_sha256":"9a3a2608aa4760707019d221d4cff298af68a3c186d156bb3843446bec6c710d","source":{"kind":"arxiv","id":"1804.10930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10930","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10930v1","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10930","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"TI5CMCFKI5QH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TI5CMCFKI5QHA4AZ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TI5CMCFK","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TI5CMCFKI5QHA4AZ2IQ5JT7STC","target":"record","payload":{"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"},"canonical_sha256":"9a3a2608aa4760707019d221d4cff298af68a3c186d156bb3843446bec6c710d","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"},"source_kind":"arxiv","source_id":"1804.10930","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-18T00:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDx/o2VC2YEfvFsBD88S8d5dc2X+yWxlvM7kK0vOnus2kcPWbhVqXOf/GmnLgVP4W9K+X2NUxceZMMOEhHd5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:20:11.641605Z"},"content_sha256":"4b236f0ccd5816bb17ac9c2baff87fa0222cc38c9c6a5d590aedd7bc5dd890ef","schema_version":"1.0","event_id":"sha256:4b236f0ccd5816bb17ac9c2baff87fa0222cc38c9c6a5d590aedd7bc5dd890ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TI5CMCFKI5QHA4AZ2IQ5JT7STC","target":"graph","payload":{"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"},"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:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLF5VFygkbGellpaelkrkQeVcr8GGg+TGFtz8RemRhWJNG2JawdBl5l4GD0NaF5FVMuTQ68onix/hUirzXTEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T08:20:11.642313Z"},"content_sha256":"998afc696465b434854cf4d09d89a6d4e91f33f2b1bdaec9a5a74936ffaaf2b5","schema_version":"1.0","event_id":"sha256:998afc696465b434854cf4d09d89a6d4e91f33f2b1bdaec9a5a74936ffaaf2b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/bundle.json","state_url":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/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-24T08:20:11Z","links":{"resolver":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC","bundle":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/bundle.json","state":"https://pith.science/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TI5CMCFKI5QHA4AZ2IQ5JT7STC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TI5CMCFKI5QHA4AZ2IQ5JT7STC","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":"ac3b8cced475e9b7ca8c29809b6744194804e7e432c3c78951fb564dc1347133","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T13:45:54Z","title_canon_sha256":"2e222088cb44a6b8a7e3b4e67a48c6ec2a48e9464565249d69f10b1c4731c780"},"schema_version":"1.0","source":{"id":"1804.10930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10930","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10930v1","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10930","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"TI5CMCFKI5QH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TI5CMCFKI5QHA4AZ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TI5CMCFK","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:998afc696465b434854cf4d09d89a6d4e91f33f2b1bdaec9a5a74936ffaaf2b5","target":"graph","created_at":"2026-05-18T00:17:15Z","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 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 ","authors_text":"Shilpa Garg, Tobias M\\\"omke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T13:45:54Z","title":"A QPTAS for Gapless MEC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10930","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:4b236f0ccd5816bb17ac9c2baff87fa0222cc38c9c6a5d590aedd7bc5dd890ef","target":"record","created_at":"2026-05-18T00:17:15Z","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":"ac3b8cced475e9b7ca8c29809b6744194804e7e432c3c78951fb564dc1347133","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-29T13:45:54Z","title_canon_sha256":"2e222088cb44a6b8a7e3b4e67a48c6ec2a48e9464565249d69f10b1c4731c780"},"schema_version":"1.0","source":{"id":"1804.10930","kind":"arxiv","version":1}},"canonical_sha256":"9a3a2608aa4760707019d221d4cff298af68a3c186d156bb3843446bec6c710d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a3a2608aa4760707019d221d4cff298af68a3c186d156bb3843446bec6c710d","first_computed_at":"2026-05-18T00:17:15.146594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:15.146594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k+26J/bRVt0UdonIx8ZLWyCR9brOQj11GSDjoD+tTNT5JBCwonSXrnBHffM4BX7fCNMPUM5vShE47HDizviwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:15.147220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b236f0ccd5816bb17ac9c2baff87fa0222cc38c9c6a5d590aedd7bc5dd890ef","sha256:998afc696465b434854cf4d09d89a6d4e91f33f2b1bdaec9a5a74936ffaaf2b5"],"state_sha256":"371e71f62dc5a7482199029f2dcf781f17b66a84f4d0c2283fc9fc05e8e4cffb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E69VVINjIrmRE4oWvu+zboJWQptwLFOGCMgvLsGrh05+224LmQvRxdLPx0EJUIC+GEajoYPtpZXQkqVXJlHBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T08:20:11.645976Z","bundle_sha256":"ab271080eded38153e22cd28cdb62a6cbee82beb39b771f5d342532b44012d32"}}