{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:4MFX7WYXI3HS6YI32BKPGRRE44","short_pith_number":"pith:4MFX7WYX","canonical_record":{"source":{"id":"2011.08119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-16T17:31:51Z","cross_cats_sorted":["cs.CC","q-bio.GN"],"title_canon_sha256":"650e26f05232ab95e635b62d777d5e7f70ad1e59223a48a4fbb048ab2fc1424d","abstract_canon_sha256":"7c441b5615b0bd6c02c9f7478a3b561905d1e25f72fd26d469dd58feeddc0d57"},"schema_version":"1.0"},"canonical_sha256":"e30b7fdb1746cf2f611bd054f34624e72941f2fdc2c5fde139f929aaae4661b5","source":{"kind":"arxiv","id":"2011.08119","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.08119","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"2011.08119v2","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.08119","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"4MFX7WYXI3HS","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"pith_short_16","alias_value":"4MFX7WYXI3HS6YI3","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"pith_short_8","alias_value":"4MFX7WYX","created_at":"2026-07-05T02:51:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:4MFX7WYXI3HS6YI32BKPGRRE44","target":"record","payload":{"canonical_record":{"source":{"id":"2011.08119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-16T17:31:51Z","cross_cats_sorted":["cs.CC","q-bio.GN"],"title_canon_sha256":"650e26f05232ab95e635b62d777d5e7f70ad1e59223a48a4fbb048ab2fc1424d","abstract_canon_sha256":"7c441b5615b0bd6c02c9f7478a3b561905d1e25f72fd26d469dd58feeddc0d57"},"schema_version":"1.0"},"canonical_sha256":"e30b7fdb1746cf2f611bd054f34624e72941f2fdc2c5fde139f929aaae4661b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:11.583368Z","signature_b64":"WpbWyL7bcTTJ0yeZLB6BCOYnfkl8+XLU7xk887pc4NHGqpXxao+s/mfXdslvuKDwdN7yN3v+7+4p9HUtC5LACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e30b7fdb1746cf2f611bd054f34624e72941f2fdc2c5fde139f929aaae4661b5","last_reissued_at":"2026-07-05T02:51:11.582949Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:11.582949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.08119","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-07-05T02:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tX9MV5Oj18bQyOSYpk8oPa60wiBp9dOGpVMYKnGr158moqYAyZLznU5aP2ZneEzG2sIhuaLJXb2SJyfcJxMfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:45:15.928101Z"},"content_sha256":"766b6c9dd0386cab1ff1f35bab4225a48fc0f00bc6b44a0dacf7152cc14ee08a","schema_version":"1.0","event_id":"sha256:766b6c9dd0386cab1ff1f35bab4225a48fc0f00bc6b44a0dacf7152cc14ee08a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:4MFX7WYXI3HS6YI32BKPGRRE44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Longest Run Subsequence Problem: Further Complexity Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Florian Sikora, Riccardo Dondi","submitted_at":"2020-11-16T17:31:51Z","abstract_excerpt":"Longest Run Subsequence is a problem introduced recently in the context of the scaffolding phase of genome assembly (Schrinner et al., WABI 2020). The problem asks for a maximum length subsequence of a given string that contains at most one run for each symbol (a run is a maximum substring of consecutive identical symbols). The problem has been shown to be NP-hard and to be fixed-parameter tractable when the parameter is the size of the alphabet on which the input string is defined. In this paper we further investigate the complexity of the problem and we show that it is fixed-parameter tracta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.08119","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.08119/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJO7VDuUa5cwVeFo+sQThYnhH455PP8GTo5Nub3yCci30VPuozd7k6SAufZilKXMlsknitka7Kk2IMtYiJ4yBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T12:45:15.928977Z"},"content_sha256":"c4c49758a058150d1377c730a56b3b08d928661438a8f10b5352ab1665697357","schema_version":"1.0","event_id":"sha256:c4c49758a058150d1377c730a56b3b08d928661438a8f10b5352ab1665697357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MFX7WYXI3HS6YI32BKPGRRE44/bundle.json","state_url":"https://pith.science/pith/4MFX7WYXI3HS6YI32BKPGRRE44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MFX7WYXI3HS6YI32BKPGRRE44/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-08-04T12:45:15Z","links":{"resolver":"https://pith.science/pith/4MFX7WYXI3HS6YI32BKPGRRE44","bundle":"https://pith.science/pith/4MFX7WYXI3HS6YI32BKPGRRE44/bundle.json","state":"https://pith.science/pith/4MFX7WYXI3HS6YI32BKPGRRE44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MFX7WYXI3HS6YI32BKPGRRE44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:4MFX7WYXI3HS6YI32BKPGRRE44","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":"7c441b5615b0bd6c02c9f7478a3b561905d1e25f72fd26d469dd58feeddc0d57","cross_cats_sorted":["cs.CC","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-16T17:31:51Z","title_canon_sha256":"650e26f05232ab95e635b62d777d5e7f70ad1e59223a48a4fbb048ab2fc1424d"},"schema_version":"1.0","source":{"id":"2011.08119","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.08119","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"2011.08119v2","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.08119","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"4MFX7WYXI3HS","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"pith_short_16","alias_value":"4MFX7WYXI3HS6YI3","created_at":"2026-07-05T02:51:11Z"},{"alias_kind":"pith_short_8","alias_value":"4MFX7WYX","created_at":"2026-07-05T02:51:11Z"}],"graph_snapshots":[{"event_id":"sha256:c4c49758a058150d1377c730a56b3b08d928661438a8f10b5352ab1665697357","target":"graph","created_at":"2026-07-05T02:51:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.08119/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Longest Run Subsequence is a problem introduced recently in the context of the scaffolding phase of genome assembly (Schrinner et al., WABI 2020). The problem asks for a maximum length subsequence of a given string that contains at most one run for each symbol (a run is a maximum substring of consecutive identical symbols). The problem has been shown to be NP-hard and to be fixed-parameter tractable when the parameter is the size of the alphabet on which the input string is defined. In this paper we further investigate the complexity of the problem and we show that it is fixed-parameter tracta","authors_text":"Florian Sikora, Riccardo Dondi","cross_cats":["cs.CC","q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-16T17:31:51Z","title":"The Longest Run Subsequence Problem: Further Complexity Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.08119","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:766b6c9dd0386cab1ff1f35bab4225a48fc0f00bc6b44a0dacf7152cc14ee08a","target":"record","created_at":"2026-07-05T02:51:11Z","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":"7c441b5615b0bd6c02c9f7478a3b561905d1e25f72fd26d469dd58feeddc0d57","cross_cats_sorted":["cs.CC","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-16T17:31:51Z","title_canon_sha256":"650e26f05232ab95e635b62d777d5e7f70ad1e59223a48a4fbb048ab2fc1424d"},"schema_version":"1.0","source":{"id":"2011.08119","kind":"arxiv","version":2}},"canonical_sha256":"e30b7fdb1746cf2f611bd054f34624e72941f2fdc2c5fde139f929aaae4661b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e30b7fdb1746cf2f611bd054f34624e72941f2fdc2c5fde139f929aaae4661b5","first_computed_at":"2026-07-05T02:51:11.582949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:51:11.582949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WpbWyL7bcTTJ0yeZLB6BCOYnfkl8+XLU7xk887pc4NHGqpXxao+s/mfXdslvuKDwdN7yN3v+7+4p9HUtC5LACA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:51:11.583368Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.08119","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:766b6c9dd0386cab1ff1f35bab4225a48fc0f00bc6b44a0dacf7152cc14ee08a","sha256:c4c49758a058150d1377c730a56b3b08d928661438a8f10b5352ab1665697357"],"state_sha256":"7637135b362a4d258bb8bef7e6d84b1a4bf9f410472bf9a262cb7901d26bc2ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HhHKake2U1BZ1IsGk4yZNEQU0/br8lo3J1Zf4upnPiDrDxs/rOcbk2/zQ4YHaG1+wwePydQlh466+IRbQUlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T12:45:15.934869Z","bundle_sha256":"558b015b1b76b826ab0a78fbc2021c145a17f93be0136e68cf65846b96881107"}}