{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UQTJXQ23C3DCE5OKH6VSZHXCCS","short_pith_number":"pith:UQTJXQ23","canonical_record":{"source":{"id":"2410.12031","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-15T20:02:15Z","cross_cats_sorted":[],"title_canon_sha256":"546e8d4eb692d6d0f4461d2b619270269417d8037ad041d1587c3326c2b75655","abstract_canon_sha256":"9e03bd75ef502dcc626ecf6751e82f4415624abc7649ad4fb51b11318acb940a"},"schema_version":"1.0"},"canonical_sha256":"a4269bc35b16c62275ca3fab2c9ee21495372ce2c002471afb019345e5988757","source":{"kind":"arxiv","id":"2410.12031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.12031","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"2410.12031v1","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12031","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"UQTJXQ23C3DC","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"pith_short_16","alias_value":"UQTJXQ23C3DCE5OK","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"pith_short_8","alias_value":"UQTJXQ23","created_at":"2026-07-05T09:21:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UQTJXQ23C3DCE5OKH6VSZHXCCS","target":"record","payload":{"canonical_record":{"source":{"id":"2410.12031","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-15T20:02:15Z","cross_cats_sorted":[],"title_canon_sha256":"546e8d4eb692d6d0f4461d2b619270269417d8037ad041d1587c3326c2b75655","abstract_canon_sha256":"9e03bd75ef502dcc626ecf6751e82f4415624abc7649ad4fb51b11318acb940a"},"schema_version":"1.0"},"canonical_sha256":"a4269bc35b16c62275ca3fab2c9ee21495372ce2c002471afb019345e5988757","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:13.085663Z","signature_b64":"63VFZm+YBYi4sJzeSTVMc4mPjQAIPP0PdIAPc6AbJ/oEX/kLxkRROI27/AnAbQopph3HTWBcBmz9ZRf2CKdtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4269bc35b16c62275ca3fab2c9ee21495372ce2c002471afb019345e5988757","last_reissued_at":"2026-07-05T09:21:13.085100Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:13.085100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.12031","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-07-05T09:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pCKtgaaTReX1pi1nss7aPcksPhbXp2ThaTFNF5a+jCwZtERDIxDiVX/X4tnvgvPrVsF+E5YDK6TH3pID3n62Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:08:11.277966Z"},"content_sha256":"44c97032273ea0682ff52555bbb5981f562fa9ccb2c58f89f6347cf414a668ff","schema_version":"1.0","event_id":"sha256:44c97032273ea0682ff52555bbb5981f562fa9ccb2c58f89f6347cf414a668ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UQTJXQ23C3DCE5OKH6VSZHXCCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aleksandar Kartelj, Ana Nikolikj, Christian Blum, Jaume Reixach, Marko Djukanovi\\'c, Tome Eftimov","submitted_at":"2024-10-15T20:02:15Z","abstract_excerpt":"This paper addresses the Restricted Longest Common Subsequence (RLCS) problem, an extension of the well-known Longest Common Subsequence (LCS) problem. This problem has significant applications in bioinformatics, particularly for identifying similarities and discovering mutual patterns and important motifs among DNA, RNA, and protein sequences. Building on recent advancements in solving this problem through a general search framework, this paper introduces two novel heuristic approaches designed to enhance the search process by steering it towards promising regions in the search space. The fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12031","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.12031/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-05T09:21:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aLBEU/I34gLXXtLhnl0Bay1fcV4AjkOYgRYCFbE+ZJkclvBfRQixPV96sUgLhdloHXRzPxwqJ847cmjmQ1cnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:08:11.278999Z"},"content_sha256":"574c7a478a0fda3c85b30ab90bc04122373e000118dc79f27976bcdb862202c4","schema_version":"1.0","event_id":"sha256:574c7a478a0fda3c85b30ab90bc04122373e000118dc79f27976bcdb862202c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQTJXQ23C3DCE5OKH6VSZHXCCS/bundle.json","state_url":"https://pith.science/pith/UQTJXQ23C3DCE5OKH6VSZHXCCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQTJXQ23C3DCE5OKH6VSZHXCCS/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-06T21:08:11Z","links":{"resolver":"https://pith.science/pith/UQTJXQ23C3DCE5OKH6VSZHXCCS","bundle":"https://pith.science/pith/UQTJXQ23C3DCE5OKH6VSZHXCCS/bundle.json","state":"https://pith.science/pith/UQTJXQ23C3DCE5OKH6VSZHXCCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQTJXQ23C3DCE5OKH6VSZHXCCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UQTJXQ23C3DCE5OKH6VSZHXCCS","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":"9e03bd75ef502dcc626ecf6751e82f4415624abc7649ad4fb51b11318acb940a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-15T20:02:15Z","title_canon_sha256":"546e8d4eb692d6d0f4461d2b619270269417d8037ad041d1587c3326c2b75655"},"schema_version":"1.0","source":{"id":"2410.12031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.12031","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"arxiv_version","alias_value":"2410.12031v1","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.12031","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"pith_short_12","alias_value":"UQTJXQ23C3DC","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"pith_short_16","alias_value":"UQTJXQ23C3DCE5OK","created_at":"2026-07-05T09:21:13Z"},{"alias_kind":"pith_short_8","alias_value":"UQTJXQ23","created_at":"2026-07-05T09:21:13Z"}],"graph_snapshots":[{"event_id":"sha256:574c7a478a0fda3c85b30ab90bc04122373e000118dc79f27976bcdb862202c4","target":"graph","created_at":"2026-07-05T09:21:13Z","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/2410.12031/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper addresses the Restricted Longest Common Subsequence (RLCS) problem, an extension of the well-known Longest Common Subsequence (LCS) problem. This problem has significant applications in bioinformatics, particularly for identifying similarities and discovering mutual patterns and important motifs among DNA, RNA, and protein sequences. Building on recent advancements in solving this problem through a general search framework, this paper introduces two novel heuristic approaches designed to enhance the search process by steering it towards promising regions in the search space. The fir","authors_text":"Aleksandar Kartelj, Ana Nikolikj, Christian Blum, Jaume Reixach, Marko Djukanovi\\'c, Tome Eftimov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-15T20:02:15Z","title":"A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.12031","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:44c97032273ea0682ff52555bbb5981f562fa9ccb2c58f89f6347cf414a668ff","target":"record","created_at":"2026-07-05T09:21:13Z","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":"9e03bd75ef502dcc626ecf6751e82f4415624abc7649ad4fb51b11318acb940a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-15T20:02:15Z","title_canon_sha256":"546e8d4eb692d6d0f4461d2b619270269417d8037ad041d1587c3326c2b75655"},"schema_version":"1.0","source":{"id":"2410.12031","kind":"arxiv","version":1}},"canonical_sha256":"a4269bc35b16c62275ca3fab2c9ee21495372ce2c002471afb019345e5988757","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4269bc35b16c62275ca3fab2c9ee21495372ce2c002471afb019345e5988757","first_computed_at":"2026-07-05T09:21:13.085100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:21:13.085100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"63VFZm+YBYi4sJzeSTVMc4mPjQAIPP0PdIAPc6AbJ/oEX/kLxkRROI27/AnAbQopph3HTWBcBmz9ZRf2CKdtAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:21:13.085663Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.12031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44c97032273ea0682ff52555bbb5981f562fa9ccb2c58f89f6347cf414a668ff","sha256:574c7a478a0fda3c85b30ab90bc04122373e000118dc79f27976bcdb862202c4"],"state_sha256":"39725a4aaa2bc60de1b50a6b8cb234fa3d8fb64b0143ee4e7e781f2d1c6efa62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"brfICUXIo0VVJOvwpF8BqDJgxPRqVxgbsGaEmRIp0kC1r0NfaY4B6rDwKmFw7zuxEy55mrfIwwf8+pYDFpIVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:08:11.286677Z","bundle_sha256":"81e33f9c2029e8aca83a491625ba0f20c6c166886f387f326f2c81a6f81aacc1"}}