{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:OFC6ADBNKKDDZ44BO364RMKSCY","short_pith_number":"pith:OFC6ADBN","schema_version":"1.0","canonical_sha256":"7145e00c2d52863cf38176fdc8b15216361b90edd786b4ec277efdc95f971429","source":{"kind":"arxiv","id":"cond-mat/9810119","version":4},"attestation_state":"computed","paper":{"title":"Mean-Field Approximations to the Longest Common Subsequence Problem","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"J. Boutet de Monvel","submitted_at":"1998-10-09T14:09:04Z","abstract_excerpt":"The Longest Common Subsequence (LCS) problem is a fundamental problem of sequence comparison. A natural approximation to this problem is a model in which every pairs of letters of two ``sequences'' are matched independently of the other pairs with probability 1/S, $S$ representing the size of the alphabet. This model is analogous to a mean field version of the LCS problem, which can be solved with a cavity approach (Eur. Phys. J. B 7-2(1999),pp. 293-308). We refine here this approximation by incorporating in a systematic way correlations among the matches in the cavity calculation. We obtain 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":"cond-mat/9810119","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"1998-10-09T14:09:04Z","cross_cats_sorted":[],"title_canon_sha256":"e42e456371aa8f6f7917e306137c72987bdaebf52aa576bfb465ae23824a08da","abstract_canon_sha256":"1bece3875bb95c211f968d2b40fe3eff552817aab164a5c4598a993e853525d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:06.909442Z","signature_b64":"U45djDJ7Lahn5/frvnS8pvDXwP6LVg2SmvT5vl6qzVIdVUsbdgR1ynhRIbcr4y1ONtySAbrxgMMXt2LuI3MLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7145e00c2d52863cf38176fdc8b15216361b90edd786b4ec277efdc95f971429","last_reissued_at":"2026-05-18T01:07:06.908993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:06.908993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mean-Field Approximations to the Longest Common Subsequence Problem","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"J. Boutet de Monvel","submitted_at":"1998-10-09T14:09:04Z","abstract_excerpt":"The Longest Common Subsequence (LCS) problem is a fundamental problem of sequence comparison. A natural approximation to this problem is a model in which every pairs of letters of two ``sequences'' are matched independently of the other pairs with probability 1/S, $S$ representing the size of the alphabet. This model is analogous to a mean field version of the LCS problem, which can be solved with a cavity approach (Eur. Phys. J. B 7-2(1999),pp. 293-308). We refine here this approximation by incorporating in a systematic way correlations among the matches in the cavity calculation. We obtain a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/9810119","kind":"arxiv","version":4},"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":"cond-mat/9810119","created_at":"2026-05-18T01:07:06.909070+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/9810119v4","created_at":"2026-05-18T01:07:06.909070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/9810119","created_at":"2026-05-18T01:07:06.909070+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFC6ADBNKKDD","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFC6ADBNKKDDZ44B","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFC6ADBN","created_at":"2026-05-18T12:25:49.038998+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/OFC6ADBNKKDDZ44BO364RMKSCY","json":"https://pith.science/pith/OFC6ADBNKKDDZ44BO364RMKSCY.json","graph_json":"https://pith.science/api/pith-number/OFC6ADBNKKDDZ44BO364RMKSCY/graph.json","events_json":"https://pith.science/api/pith-number/OFC6ADBNKKDDZ44BO364RMKSCY/events.json","paper":"https://pith.science/paper/OFC6ADBN"},"agent_actions":{"view_html":"https://pith.science/pith/OFC6ADBNKKDDZ44BO364RMKSCY","download_json":"https://pith.science/pith/OFC6ADBNKKDDZ44BO364RMKSCY.json","view_paper":"https://pith.science/paper/OFC6ADBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/9810119&json=true","fetch_graph":"https://pith.science/api/pith-number/OFC6ADBNKKDDZ44BO364RMKSCY/graph.json","fetch_events":"https://pith.science/api/pith-number/OFC6ADBNKKDDZ44BO364RMKSCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFC6ADBNKKDDZ44BO364RMKSCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFC6ADBNKKDDZ44BO364RMKSCY/action/storage_attestation","attest_author":"https://pith.science/pith/OFC6ADBNKKDDZ44BO364RMKSCY/action/author_attestation","sign_citation":"https://pith.science/pith/OFC6ADBNKKDDZ44BO364RMKSCY/action/citation_signature","submit_replication":"https://pith.science/pith/OFC6ADBNKKDDZ44BO364RMKSCY/action/replication_record"}},"created_at":"2026-05-18T01:07:06.909070+00:00","updated_at":"2026-05-18T01:07:06.909070+00:00"}