{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DMGDHS5MON4MTQ3NRCNJMVCAFA","short_pith_number":"pith:DMGDHS5M","schema_version":"1.0","canonical_sha256":"1b0c33cbac7378c9c36d889a965440280c186262ef4f962cbfcc4b9ce5562208","source":{"kind":"arxiv","id":"1703.00941","version":1},"attestation_state":"computed","paper":{"title":"On the Fine-grained Complexity of One-Dimensional Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Marvin K\\\"unnemann, Ramamohan Paturi, Stefan Schneider","submitted_at":"2017-03-02T20:25:04Z","abstract_excerpt":"In this paper, we investigate the complexity of one-dimensional dynamic programming, or more specifically, of the Least-Weight Subsequence (LWS) problem: Given a sequence of $n$ data items together with weights for every pair of the items, the task is to determine a subsequence $S$ minimizing the total weight of the pairs adjacent in $S$. A large number of natural problems can be formulated as LWS problems, yielding obvious $O(n^2)$-time solutions.\n  In many interesting instances, the $O(n^2)$-many weights can be succinctly represented. Yet except for near-linear time algorithms for some speci"},"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":"1703.00941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-02T20:25:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"88db2c67d6762478fcc19328e2bb81d87e8732e9f8060b44810fc480afd1a233","abstract_canon_sha256":"12efdac6458f3b938ec77126ccfd0aa116473e08dc6c7c5adfbb1160408fbf4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:37.512355Z","signature_b64":"FvvO7f9nmSzD0QU09vOxv1gw3u1OTS9lPxqOEX+4WKcMedrL5F+yIOMnuWw3dMDmobi5Ki86Aogll007VCt4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b0c33cbac7378c9c36d889a965440280c186262ef4f962cbfcc4b9ce5562208","last_reissued_at":"2026-05-18T00:49:37.511719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:37.511719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Fine-grained Complexity of One-Dimensional Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Marvin K\\\"unnemann, Ramamohan Paturi, Stefan Schneider","submitted_at":"2017-03-02T20:25:04Z","abstract_excerpt":"In this paper, we investigate the complexity of one-dimensional dynamic programming, or more specifically, of the Least-Weight Subsequence (LWS) problem: Given a sequence of $n$ data items together with weights for every pair of the items, the task is to determine a subsequence $S$ minimizing the total weight of the pairs adjacent in $S$. A large number of natural problems can be formulated as LWS problems, yielding obvious $O(n^2)$-time solutions.\n  In many interesting instances, the $O(n^2)$-many weights can be succinctly represented. Yet except for near-linear time algorithms for some speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00941","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":"1703.00941","created_at":"2026-05-18T00:49:37.511806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00941v1","created_at":"2026-05-18T00:49:37.511806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00941","created_at":"2026-05-18T00:49:37.511806+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMGDHS5MON4M","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMGDHS5MON4MTQ3N","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMGDHS5M","created_at":"2026-05-18T12:31:10.602751+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/DMGDHS5MON4MTQ3NRCNJMVCAFA","json":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA.json","graph_json":"https://pith.science/api/pith-number/DMGDHS5MON4MTQ3NRCNJMVCAFA/graph.json","events_json":"https://pith.science/api/pith-number/DMGDHS5MON4MTQ3NRCNJMVCAFA/events.json","paper":"https://pith.science/paper/DMGDHS5M"},"agent_actions":{"view_html":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA","download_json":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA.json","view_paper":"https://pith.science/paper/DMGDHS5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00941&json=true","fetch_graph":"https://pith.science/api/pith-number/DMGDHS5MON4MTQ3NRCNJMVCAFA/graph.json","fetch_events":"https://pith.science/api/pith-number/DMGDHS5MON4MTQ3NRCNJMVCAFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/action/storage_attestation","attest_author":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/action/author_attestation","sign_citation":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/action/citation_signature","submit_replication":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/action/replication_record"}},"created_at":"2026-05-18T00:49:37.511806+00:00","updated_at":"2026-05-18T00:49:37.511806+00:00"}