{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YDOINKROBG223YA72UTT2P4BDZ","short_pith_number":"pith:YDOINKRO","schema_version":"1.0","canonical_sha256":"c0dc86aa2e09b5ade01fd5273d3f811e620fa88c00cd3d1783e9e181a6b6ed21","source":{"kind":"arxiv","id":"2106.08195","version":1},"attestation_state":"computed","paper":{"title":"A Linear-Time $n^{0.4}$-Approximation for Longest Common Subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debarati Das, Karl Bringmann, Vincent Cohen-Addad","submitted_at":"2021-06-15T14:49:52Z","abstract_excerpt":"We consider the classic problem of computing the Longest Common Subsequence (LCS) of two strings of length $n$. While a simple quadratic algorithm has been known for the problem for more than 40 years, no faster algorithm has been found despite an extensive effort. The lack of progress on the problem has recently been explained by Abboud, Backurs, and Vassilevska Williams [FOCS'15] and Bringmann and K\\\"unnemann [FOCS'15] who proved that there is no subquadratic algorithm unless the Strong Exponential Time Hypothesis fails. This has led the community to look for subquadratic approximation algor"},"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":"2106.08195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-15T14:49:52Z","cross_cats_sorted":[],"title_canon_sha256":"f7265a610696182b1bbf6b6c95df51c0416df45461328a6ebaff85c61fb540cb","abstract_canon_sha256":"1abed27b2253ed7c4c48b9a25761ec60cfcd503f22f5441296ce7c4b54c8343e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:38.420904Z","signature_b64":"HRmBk5nJdReBChl8b3ERSP8u56TSz+YTUuAmRYLinF94U+qfcqb0k7kCTDcXTQFIShqR5gidKGPQPRFOqqPACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0dc86aa2e09b5ade01fd5273d3f811e620fa88c00cd3d1783e9e181a6b6ed21","last_reissued_at":"2026-07-05T02:49:38.420469Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:38.420469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear-Time $n^{0.4}$-Approximation for Longest Common Subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debarati Das, Karl Bringmann, Vincent Cohen-Addad","submitted_at":"2021-06-15T14:49:52Z","abstract_excerpt":"We consider the classic problem of computing the Longest Common Subsequence (LCS) of two strings of length $n$. While a simple quadratic algorithm has been known for the problem for more than 40 years, no faster algorithm has been found despite an extensive effort. The lack of progress on the problem has recently been explained by Abboud, Backurs, and Vassilevska Williams [FOCS'15] and Bringmann and K\\\"unnemann [FOCS'15] who proved that there is no subquadratic algorithm unless the Strong Exponential Time Hypothesis fails. This has led the community to look for subquadratic approximation algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08195","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/2106.08195/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2106.08195","created_at":"2026-07-05T02:49:38.420530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.08195v1","created_at":"2026-07-05T02:49:38.420530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08195","created_at":"2026-07-05T02:49:38.420530+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDOINKROBG22","created_at":"2026-07-05T02:49:38.420530+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDOINKROBG223YA7","created_at":"2026-07-05T02:49:38.420530+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDOINKRO","created_at":"2026-07-05T02:49:38.420530+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/YDOINKROBG223YA72UTT2P4BDZ","json":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ.json","graph_json":"https://pith.science/api/pith-number/YDOINKROBG223YA72UTT2P4BDZ/graph.json","events_json":"https://pith.science/api/pith-number/YDOINKROBG223YA72UTT2P4BDZ/events.json","paper":"https://pith.science/paper/YDOINKRO"},"agent_actions":{"view_html":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ","download_json":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ.json","view_paper":"https://pith.science/paper/YDOINKRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.08195&json=true","fetch_graph":"https://pith.science/api/pith-number/YDOINKROBG223YA72UTT2P4BDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YDOINKROBG223YA72UTT2P4BDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ/action/storage_attestation","attest_author":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ/action/author_attestation","sign_citation":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ/action/citation_signature","submit_replication":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ/action/replication_record"}},"created_at":"2026-07-05T02:49:38.420530+00:00","updated_at":"2026-07-05T02:49:38.420530+00:00"}