{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FPF4UA5RTUPEIN4QRZC6NC6NS2","short_pith_number":"pith:FPF4UA5R","canonical_record":{"source":{"id":"1703.08931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T05:09:06Z","cross_cats_sorted":[],"title_canon_sha256":"ba8b8009c3168bb524dbfd814891101ec32ad4ddc1f5c1fb4133ed86970e6b54","abstract_canon_sha256":"e59c6380d54accd9d6f635090be859541ed9307ae7e69c80bd147cf4627e7dc0"},"schema_version":"1.0"},"canonical_sha256":"2bcbca03b19d1e4437908e45e68bcd96b0efe2c995b2eca871231b7e0e65f239","source":{"kind":"arxiv","id":"1703.08931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08931","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08931v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08931","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"FPF4UA5RTUPE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FPF4UA5RTUPEIN4Q","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FPF4UA5R","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FPF4UA5RTUPEIN4QRZC6NC6NS2","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T05:09:06Z","cross_cats_sorted":[],"title_canon_sha256":"ba8b8009c3168bb524dbfd814891101ec32ad4ddc1f5c1fb4133ed86970e6b54","abstract_canon_sha256":"e59c6380d54accd9d6f635090be859541ed9307ae7e69c80bd147cf4627e7dc0"},"schema_version":"1.0"},"canonical_sha256":"2bcbca03b19d1e4437908e45e68bcd96b0efe2c995b2eca871231b7e0e65f239","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.142614Z","signature_b64":"lN7ZX8CF7ZdOkqEy0nGUWGHgTGhIh33dhT6F4gA4/A34vmu4IjjLhoue+E4rDnwnPIdKjlp41de9TCLUtX1nDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bcbca03b19d1e4437908e45e68bcd96b0efe2c995b2eca871231b7e0e65f239","last_reissued_at":"2026-05-18T00:47:55.142159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.142159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08931","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:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEvhUNvKvs6SDK+ZalOZLwTGFbJLP2GKmWdqHKC69uQT7bofQpxz4gHOMw/8vGTp9TBh3+Py4diH/lYjlZbnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:11:57.280264Z"},"content_sha256":"5468e111f1d38b75b46ebb1cadde330cf596d31ed2acbf3582d324283c82512d","schema_version":"1.0","event_id":"sha256:5468e111f1d38b75b46ebb1cadde330cf596d31ed2acbf3582d324283c82512d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FPF4UA5RTUPEIN4QRZC6NC6NS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Palindromic Decompositions with Gaps and Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Mai Alzamel, Micha{\\l} Adamczyk, Panagiotis Charalampopoulos","submitted_at":"2017-03-27T05:09:06Z","abstract_excerpt":"Identifying palindromes in sequences has been an interesting line of research in combinatorics on words and also in computational biology, after the discovery of the relation of palindromes in the DNA sequence with the HIV virus. Efficient algorithms for the factorization of sequences into palindromes and maximal palindromes have been devised in recent years. We extend these studies by allowing gaps in decompositions and errors in palindromes, and also imposing a lower bound to the length of acceptable palindromes.\n  We first present an algorithm for obtaining a palindromic decomposition of a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08931","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:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5lBUr4xlPw3W6c6RashbHsdcGLnS5UGNSvEOcUHYdLXH2UHN+9RTXaO3KKFW82f9zf8lbWfhFRF9uYO8nJzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:11:57.280633Z"},"content_sha256":"a3df65a4f42332bc687cfe3a72e915b511d63dd2460216f539147ca5d87ef517","schema_version":"1.0","event_id":"sha256:a3df65a4f42332bc687cfe3a72e915b511d63dd2460216f539147ca5d87ef517"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPF4UA5RTUPEIN4QRZC6NC6NS2/bundle.json","state_url":"https://pith.science/pith/FPF4UA5RTUPEIN4QRZC6NC6NS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPF4UA5RTUPEIN4QRZC6NC6NS2/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-06-04T14:11:57Z","links":{"resolver":"https://pith.science/pith/FPF4UA5RTUPEIN4QRZC6NC6NS2","bundle":"https://pith.science/pith/FPF4UA5RTUPEIN4QRZC6NC6NS2/bundle.json","state":"https://pith.science/pith/FPF4UA5RTUPEIN4QRZC6NC6NS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPF4UA5RTUPEIN4QRZC6NC6NS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FPF4UA5RTUPEIN4QRZC6NC6NS2","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":"e59c6380d54accd9d6f635090be859541ed9307ae7e69c80bd147cf4627e7dc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T05:09:06Z","title_canon_sha256":"ba8b8009c3168bb524dbfd814891101ec32ad4ddc1f5c1fb4133ed86970e6b54"},"schema_version":"1.0","source":{"id":"1703.08931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08931","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08931v1","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08931","created_at":"2026-05-18T00:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"FPF4UA5RTUPE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FPF4UA5RTUPEIN4Q","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FPF4UA5R","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:a3df65a4f42332bc687cfe3a72e915b511d63dd2460216f539147ca5d87ef517","target":"graph","created_at":"2026-05-18T00:47:55Z","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":"Identifying palindromes in sequences has been an interesting line of research in combinatorics on words and also in computational biology, after the discovery of the relation of palindromes in the DNA sequence with the HIV virus. Efficient algorithms for the factorization of sequences into palindromes and maximal palindromes have been devised in recent years. We extend these studies by allowing gaps in decompositions and errors in palindromes, and also imposing a lower bound to the length of acceptable palindromes.\n  We first present an algorithm for obtaining a palindromic decomposition of a ","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Mai Alzamel, Micha{\\l} Adamczyk, Panagiotis Charalampopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T05:09:06Z","title":"Palindromic Decompositions with Gaps and Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08931","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:5468e111f1d38b75b46ebb1cadde330cf596d31ed2acbf3582d324283c82512d","target":"record","created_at":"2026-05-18T00:47:55Z","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":"e59c6380d54accd9d6f635090be859541ed9307ae7e69c80bd147cf4627e7dc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T05:09:06Z","title_canon_sha256":"ba8b8009c3168bb524dbfd814891101ec32ad4ddc1f5c1fb4133ed86970e6b54"},"schema_version":"1.0","source":{"id":"1703.08931","kind":"arxiv","version":1}},"canonical_sha256":"2bcbca03b19d1e4437908e45e68bcd96b0efe2c995b2eca871231b7e0e65f239","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bcbca03b19d1e4437908e45e68bcd96b0efe2c995b2eca871231b7e0e65f239","first_computed_at":"2026-05-18T00:47:55.142159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:55.142159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lN7ZX8CF7ZdOkqEy0nGUWGHgTGhIh33dhT6F4gA4/A34vmu4IjjLhoue+E4rDnwnPIdKjlp41de9TCLUtX1nDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:55.142614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5468e111f1d38b75b46ebb1cadde330cf596d31ed2acbf3582d324283c82512d","sha256:a3df65a4f42332bc687cfe3a72e915b511d63dd2460216f539147ca5d87ef517"],"state_sha256":"7fc0397f2a00f2b3f9559f98d970140cca5532285995eb8b5755b19b1af5142f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvkyzXoGQ2eDSky6pe6XECFukRNUrkiNbwpmo/YQIpVF/Wtp17g6feFO5sgcf6iSY7QswuOtn4JVsWbCGXL3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:11:57.282620Z","bundle_sha256":"a8de5beda12884ce04ae811dfb72a2a178047eddde184ad8909661d5a54d3c53"}}