{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YDOINKROBG223YA72UTT2P4BDZ","short_pith_number":"pith:YDOINKRO","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"},"canonical_sha256":"c0dc86aa2e09b5ade01fd5273d3f811e620fa88c00cd3d1783e9e181a6b6ed21","source":{"kind":"arxiv","id":"2106.08195","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.08195","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"2106.08195v1","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08195","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"YDOINKROBG22","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"pith_short_16","alias_value":"YDOINKROBG223YA7","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"pith_short_8","alias_value":"YDOINKRO","created_at":"2026-07-05T02:49:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YDOINKROBG223YA72UTT2P4BDZ","target":"record","payload":{"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"},"canonical_sha256":"c0dc86aa2e09b5ade01fd5273d3f811e620fa88c00cd3d1783e9e181a6b6ed21","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"},"source_kind":"arxiv","source_id":"2106.08195","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-05T02:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmLARHD0msm+dfo8J/bqtFllJuFzjWCyg6FMHa2+bQnUQmxcItH9ze3UzWvXMdKAJyRkuW93daTqLjxv/FpbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:54:14.726714Z"},"content_sha256":"8de54109449f3d0e1129bbc94ead39aac74032f152b59cd3c7c1b22bcf72232c","schema_version":"1.0","event_id":"sha256:8de54109449f3d0e1129bbc94ead39aac74032f152b59cd3c7c1b22bcf72232c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YDOINKROBG223YA72UTT2P4BDZ","target":"graph","payload":{"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"},"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-05T02:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/LsAU+q9EBqWi6A8Iph7SmjSwpH0sSQhIi1l3UB01KoYqP3DtUXR8QOA1gjJpsTS3/kqlACYRY41cxwiosaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:54:14.727657Z"},"content_sha256":"bb5f58cf5b07060d2b7d71708241783eacbd0ac1b38683ecf2cc0143602142d1","schema_version":"1.0","event_id":"sha256:bb5f58cf5b07060d2b7d71708241783eacbd0ac1b38683ecf2cc0143602142d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ/bundle.json","state_url":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDOINKROBG223YA72UTT2P4BDZ/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-09T00:54:14Z","links":{"resolver":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ","bundle":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ/bundle.json","state":"https://pith.science/pith/YDOINKROBG223YA72UTT2P4BDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDOINKROBG223YA72UTT2P4BDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YDOINKROBG223YA72UTT2P4BDZ","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":"1abed27b2253ed7c4c48b9a25761ec60cfcd503f22f5441296ce7c4b54c8343e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-15T14:49:52Z","title_canon_sha256":"f7265a610696182b1bbf6b6c95df51c0416df45461328a6ebaff85c61fb540cb"},"schema_version":"1.0","source":{"id":"2106.08195","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.08195","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"2106.08195v1","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08195","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"YDOINKROBG22","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"pith_short_16","alias_value":"YDOINKROBG223YA7","created_at":"2026-07-05T02:49:38Z"},{"alias_kind":"pith_short_8","alias_value":"YDOINKRO","created_at":"2026-07-05T02:49:38Z"}],"graph_snapshots":[{"event_id":"sha256:bb5f58cf5b07060d2b7d71708241783eacbd0ac1b38683ecf2cc0143602142d1","target":"graph","created_at":"2026-07-05T02:49:38Z","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/2106.08195/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Debarati Das, Karl Bringmann, Vincent Cohen-Addad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-15T14:49:52Z","title":"A Linear-Time $n^{0.4}$-Approximation for Longest Common Subsequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08195","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:8de54109449f3d0e1129bbc94ead39aac74032f152b59cd3c7c1b22bcf72232c","target":"record","created_at":"2026-07-05T02:49:38Z","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":"1abed27b2253ed7c4c48b9a25761ec60cfcd503f22f5441296ce7c4b54c8343e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-06-15T14:49:52Z","title_canon_sha256":"f7265a610696182b1bbf6b6c95df51c0416df45461328a6ebaff85c61fb540cb"},"schema_version":"1.0","source":{"id":"2106.08195","kind":"arxiv","version":1}},"canonical_sha256":"c0dc86aa2e09b5ade01fd5273d3f811e620fa88c00cd3d1783e9e181a6b6ed21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0dc86aa2e09b5ade01fd5273d3f811e620fa88c00cd3d1783e9e181a6b6ed21","first_computed_at":"2026-07-05T02:49:38.420469Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:49:38.420469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HRmBk5nJdReBChl8b3ERSP8u56TSz+YTUuAmRYLinF94U+qfcqb0k7kCTDcXTQFIShqR5gidKGPQPRFOqqPACA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:49:38.420904Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.08195","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8de54109449f3d0e1129bbc94ead39aac74032f152b59cd3c7c1b22bcf72232c","sha256:bb5f58cf5b07060d2b7d71708241783eacbd0ac1b38683ecf2cc0143602142d1"],"state_sha256":"2607ec667a74fb497942223baefed47fa2c0f2651b35e6c4da140883968ca243"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qv4rM7Af2GoUql8apIHmhlnvb/wpee4YLVbHdZdOpopVBEC9mVbMMNIP2XTeUI1c3ckGnW1MSNUOQP0Lsf6XBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:54:14.757997Z","bundle_sha256":"e640f62132f6a8f1e977cd15c4455046bc4324c37d133b50eb295bd9b427ae6c"}}