{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y6WQC7WB5QI3XWJHVBKJ5BVXGW","short_pith_number":"pith:Y6WQC7WB","canonical_record":{"source":{"id":"1803.00938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T16:26:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e8d2636c2d018bdc835f8418164f42cdca13b8052ac40a2be4f04f50746c1a51","abstract_canon_sha256":"e309f7d4c5d10c8635f8abdec8df0263c6a1cda7720038fdb340bec0afff0cdb"},"schema_version":"1.0"},"canonical_sha256":"c7ad017ec1ec11bbd927a8549e86b735a323e362144bca0eb27070bd5876a82b","source":{"kind":"arxiv","id":"1803.00938","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00938","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00938v1","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00938","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"Y6WQC7WB5QI3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y6WQC7WB5QI3XWJH","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y6WQC7WB","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y6WQC7WB5QI3XWJHVBKJ5BVXGW","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T16:26:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e8d2636c2d018bdc835f8418164f42cdca13b8052ac40a2be4f04f50746c1a51","abstract_canon_sha256":"e309f7d4c5d10c8635f8abdec8df0263c6a1cda7720038fdb340bec0afff0cdb"},"schema_version":"1.0"},"canonical_sha256":"c7ad017ec1ec11bbd927a8549e86b735a323e362144bca0eb27070bd5876a82b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:07.414342Z","signature_b64":"Pr0m0n+7o4DbnX+IXYfQW49cXBa+nFl8Los47F7B4ZOlAk1sZh9Xr/0w8yWm4r0UALpmIdG+q/mbD1GJzb7RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7ad017ec1ec11bbd927a8549e86b735a323e362144bca0eb27070bd5876a82b","last_reissued_at":"2026-05-18T00:22:07.413637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:07.413637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00938","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-05-18T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWxBjfA3h7fc4xy177rDq8PKRShr1cUxbeyabhELkGJwVRWF/pXN+XDU6Urze341jhFkWUFFjc91ZEDvdWe6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:44:39.764657Z"},"content_sha256":"f1b8f43caa6a29e7ead95c7479b5ac703257e8e282c76eb0fb37196d03f05ca7","schema_version":"1.0","event_id":"sha256:f1b8f43caa6a29e7ead95c7479b5ac703257e8e282c76eb0fb37196d03f05ca7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y6WQC7WB5QI3XWJHVBKJ5BVXGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multivariate Fine-Grained Complexity of Longest Common Subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Karl Bringmann, Marvin K\\\"unnemann","submitted_at":"2018-03-02T16:26:13Z","abstract_excerpt":"We revisit the classic combinatorial pattern matching problem of finding a longest common subsequence (LCS). For strings $x$ and $y$ of length $n$, a textbook algorithm solves LCS in time $O(n^2)$, but although much effort has been spent, no $O(n^{2-\\varepsilon})$-time algorithm is known. Recent work indeed shows that such an algorithm would refute the Strong Exponential Time Hypothesis (SETH) [Abboud, Backurs, Vassilevska Williams + Bringmann, K\\\"unnemann FOCS'15].\n  Despite the quadratic-time barrier, for over 40 years an enduring scientific interest continued to produce fast algorithms for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00938","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"},"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-05-18T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1xd5FYWFakUBT4uEbZEXOOV6n5i3k5i1N9hzrsNmFCxm4qHxVDQACKr5iGUKEiidXrwi1hKyCHQMWrs1tzo6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:44:39.765014Z"},"content_sha256":"af130c61cdcbb01fe312eda31a1844432d077204250eae212a5c4ee46ab0e786","schema_version":"1.0","event_id":"sha256:af130c61cdcbb01fe312eda31a1844432d077204250eae212a5c4ee46ab0e786"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6WQC7WB5QI3XWJHVBKJ5BVXGW/bundle.json","state_url":"https://pith.science/pith/Y6WQC7WB5QI3XWJHVBKJ5BVXGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6WQC7WB5QI3XWJHVBKJ5BVXGW/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-05-29T20:44:39Z","links":{"resolver":"https://pith.science/pith/Y6WQC7WB5QI3XWJHVBKJ5BVXGW","bundle":"https://pith.science/pith/Y6WQC7WB5QI3XWJHVBKJ5BVXGW/bundle.json","state":"https://pith.science/pith/Y6WQC7WB5QI3XWJHVBKJ5BVXGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6WQC7WB5QI3XWJHVBKJ5BVXGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y6WQC7WB5QI3XWJHVBKJ5BVXGW","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":"e309f7d4c5d10c8635f8abdec8df0263c6a1cda7720038fdb340bec0afff0cdb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T16:26:13Z","title_canon_sha256":"e8d2636c2d018bdc835f8418164f42cdca13b8052ac40a2be4f04f50746c1a51"},"schema_version":"1.0","source":{"id":"1803.00938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00938","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00938v1","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00938","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"Y6WQC7WB5QI3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y6WQC7WB5QI3XWJH","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y6WQC7WB","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:af130c61cdcbb01fe312eda31a1844432d077204250eae212a5c4ee46ab0e786","target":"graph","created_at":"2026-05-18T00:22:07Z","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"},"paper":{"abstract_excerpt":"We revisit the classic combinatorial pattern matching problem of finding a longest common subsequence (LCS). For strings $x$ and $y$ of length $n$, a textbook algorithm solves LCS in time $O(n^2)$, but although much effort has been spent, no $O(n^{2-\\varepsilon})$-time algorithm is known. Recent work indeed shows that such an algorithm would refute the Strong Exponential Time Hypothesis (SETH) [Abboud, Backurs, Vassilevska Williams + Bringmann, K\\\"unnemann FOCS'15].\n  Despite the quadratic-time barrier, for over 40 years an enduring scientific interest continued to produce fast algorithms for ","authors_text":"Karl Bringmann, Marvin K\\\"unnemann","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T16:26:13Z","title":"Multivariate Fine-Grained Complexity of Longest Common Subsequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00938","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:f1b8f43caa6a29e7ead95c7479b5ac703257e8e282c76eb0fb37196d03f05ca7","target":"record","created_at":"2026-05-18T00:22:07Z","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":"e309f7d4c5d10c8635f8abdec8df0263c6a1cda7720038fdb340bec0afff0cdb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T16:26:13Z","title_canon_sha256":"e8d2636c2d018bdc835f8418164f42cdca13b8052ac40a2be4f04f50746c1a51"},"schema_version":"1.0","source":{"id":"1803.00938","kind":"arxiv","version":1}},"canonical_sha256":"c7ad017ec1ec11bbd927a8549e86b735a323e362144bca0eb27070bd5876a82b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7ad017ec1ec11bbd927a8549e86b735a323e362144bca0eb27070bd5876a82b","first_computed_at":"2026-05-18T00:22:07.413637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:07.413637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pr0m0n+7o4DbnX+IXYfQW49cXBa+nFl8Los47F7B4ZOlAk1sZh9Xr/0w8yWm4r0UALpmIdG+q/mbD1GJzb7RBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:07.414342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1b8f43caa6a29e7ead95c7479b5ac703257e8e282c76eb0fb37196d03f05ca7","sha256:af130c61cdcbb01fe312eda31a1844432d077204250eae212a5c4ee46ab0e786"],"state_sha256":"7bf62043264ffcb80be95abaade476c8aec71005341b67141c3063babfb81415"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bL8lm7dmJKM1LghV1uyRDhGhWgOCGyAFAAF8j9CCVsXjKeJqzCTFLvPAYSYl49jIm6seFvSnpl04mmz1cjXFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T20:44:39.767233Z","bundle_sha256":"918abfa819bd8e333eddf984870a7cfc4bd63e35d1e7afe4fae7e46875ca16ce"}}