{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:MKHQCBYOA4CZW4PYBSRK3K3GSF","short_pith_number":"pith:MKHQCBYO","schema_version":"1.0","canonical_sha256":"628f01070e07059b71f80ca2adab6691474d4fd10c12d851bd1d0d96546ca615","source":{"kind":"arxiv","id":"0912.0368","version":1},"attestation_state":"computed","paper":{"title":"Variants of Constrained Longest Common Subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Gianluca Della Vedova, Paola Bonizzoni, Riccardo Dondi, Yuri Pirola","submitted_at":"2009-12-02T09:14:54Z","abstract_excerpt":"In this work, we consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s1 and s2 over an alphabet A, a set C_s of strings, and a function Co from A to N, the DC-LCS problem consists in finding the longest subsequence s of s1 and s2 such that s is a supersequence of all the strings in Cs and such that the number of occurrences in s of each symbol a in A is upper bounded by Co(a). The DC-LCS problem provides a clear mathematical formulation of a sequence comparison problem in Computational Biology a"},"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":"0912.0368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-02T09:14:54Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"12d32aa0d088d7e1c38d3273f97866a2f518d9e7b9ada2ffce926e52f003f445","abstract_canon_sha256":"71f59da2f12733120195bbf4f527cba2c7f97fd2a5b6a449bd26d25a0c09e160"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:52.233304Z","signature_b64":"Qg8MfDZuyXkEdsLjBa3hd0gfBns0Bm5DPkxFMTtu5XTUokafQ81SyVAhd0Ldolrx5glLTnKw7tD+IqgzP637BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"628f01070e07059b71f80ca2adab6691474d4fd10c12d851bd1d0d96546ca615","last_reissued_at":"2026-05-18T03:06:52.232574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:52.232574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variants of Constrained Longest Common Subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Gianluca Della Vedova, Paola Bonizzoni, Riccardo Dondi, Yuri Pirola","submitted_at":"2009-12-02T09:14:54Z","abstract_excerpt":"In this work, we consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s1 and s2 over an alphabet A, a set C_s of strings, and a function Co from A to N, the DC-LCS problem consists in finding the longest subsequence s of s1 and s2 such that s is a supersequence of all the strings in Cs and such that the number of occurrences in s of each symbol a in A is upper bounded by Co(a). The DC-LCS problem provides a clear mathematical formulation of a sequence comparison problem in Computational Biology a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0368","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":"0912.0368","created_at":"2026-05-18T03:06:52.232689+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.0368v1","created_at":"2026-05-18T03:06:52.232689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0368","created_at":"2026-05-18T03:06:52.232689+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKHQCBYOA4CZ","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKHQCBYOA4CZW4PY","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKHQCBYO","created_at":"2026-05-18T12:26:00.592388+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/MKHQCBYOA4CZW4PYBSRK3K3GSF","json":"https://pith.science/pith/MKHQCBYOA4CZW4PYBSRK3K3GSF.json","graph_json":"https://pith.science/api/pith-number/MKHQCBYOA4CZW4PYBSRK3K3GSF/graph.json","events_json":"https://pith.science/api/pith-number/MKHQCBYOA4CZW4PYBSRK3K3GSF/events.json","paper":"https://pith.science/paper/MKHQCBYO"},"agent_actions":{"view_html":"https://pith.science/pith/MKHQCBYOA4CZW4PYBSRK3K3GSF","download_json":"https://pith.science/pith/MKHQCBYOA4CZW4PYBSRK3K3GSF.json","view_paper":"https://pith.science/paper/MKHQCBYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.0368&json=true","fetch_graph":"https://pith.science/api/pith-number/MKHQCBYOA4CZW4PYBSRK3K3GSF/graph.json","fetch_events":"https://pith.science/api/pith-number/MKHQCBYOA4CZW4PYBSRK3K3GSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKHQCBYOA4CZW4PYBSRK3K3GSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKHQCBYOA4CZW4PYBSRK3K3GSF/action/storage_attestation","attest_author":"https://pith.science/pith/MKHQCBYOA4CZW4PYBSRK3K3GSF/action/author_attestation","sign_citation":"https://pith.science/pith/MKHQCBYOA4CZW4PYBSRK3K3GSF/action/citation_signature","submit_replication":"https://pith.science/pith/MKHQCBYOA4CZW4PYBSRK3K3GSF/action/replication_record"}},"created_at":"2026-05-18T03:06:52.232689+00:00","updated_at":"2026-05-18T03:06:52.232689+00:00"}