{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DMGDHS5MON4MTQ3NRCNJMVCAFA","short_pith_number":"pith:DMGDHS5M","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"},"canonical_sha256":"1b0c33cbac7378c9c36d889a965440280c186262ef4f962cbfcc4b9ce5562208","source":{"kind":"arxiv","id":"1703.00941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00941","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00941v1","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00941","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"DMGDHS5MON4M","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DMGDHS5MON4MTQ3N","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DMGDHS5M","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DMGDHS5MON4MTQ3NRCNJMVCAFA","target":"record","payload":{"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"},"canonical_sha256":"1b0c33cbac7378c9c36d889a965440280c186262ef4f962cbfcc4b9ce5562208","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"},"source_kind":"arxiv","source_id":"1703.00941","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:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EN4O+1QhMB1Y2LNmX2H3sWx3uspf+tu7fB3pa/qzeFkzq0DsQREVCr8bZAOXbezyj7MU3pZCw5Bu47cautsbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:21:30.647814Z"},"content_sha256":"09e2e71a731eec27e817a34ca53e02d9b2becbed30f012d20b0f79b7810aacd5","schema_version":"1.0","event_id":"sha256:09e2e71a731eec27e817a34ca53e02d9b2becbed30f012d20b0f79b7810aacd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DMGDHS5MON4MTQ3NRCNJMVCAFA","target":"graph","payload":{"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"},"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:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UU/3eFodS8wVKYQUZ6FZ++zy7w37Y32kgnUFaw+vYRpOF8Nbc4gemxfGKUZyPfoW2ZE7dVXPkuw9ZiWZtWKLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:21:30.648214Z"},"content_sha256":"3dba941bc3b9144feddb65b936f29f079355ea49e045ce496e2ad8fb2bfbb9f3","schema_version":"1.0","event_id":"sha256:3dba941bc3b9144feddb65b936f29f079355ea49e045ce496e2ad8fb2bfbb9f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/bundle.json","state_url":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/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-25T18:21:30Z","links":{"resolver":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA","bundle":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/bundle.json","state":"https://pith.science/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMGDHS5MON4MTQ3NRCNJMVCAFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DMGDHS5MON4MTQ3NRCNJMVCAFA","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":"12efdac6458f3b938ec77126ccfd0aa116473e08dc6c7c5adfbb1160408fbf4c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-02T20:25:04Z","title_canon_sha256":"88db2c67d6762478fcc19328e2bb81d87e8732e9f8060b44810fc480afd1a233"},"schema_version":"1.0","source":{"id":"1703.00941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00941","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00941v1","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00941","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"DMGDHS5MON4M","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DMGDHS5MON4MTQ3N","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DMGDHS5M","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:3dba941bc3b9144feddb65b936f29f079355ea49e045ce496e2ad8fb2bfbb9f3","target":"graph","created_at":"2026-05-18T00:49:37Z","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":"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","authors_text":"Marvin K\\\"unnemann, Ramamohan Paturi, Stefan Schneider","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-02T20:25:04Z","title":"On the Fine-grained Complexity of One-Dimensional Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00941","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:09e2e71a731eec27e817a34ca53e02d9b2becbed30f012d20b0f79b7810aacd5","target":"record","created_at":"2026-05-18T00:49:37Z","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":"12efdac6458f3b938ec77126ccfd0aa116473e08dc6c7c5adfbb1160408fbf4c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-02T20:25:04Z","title_canon_sha256":"88db2c67d6762478fcc19328e2bb81d87e8732e9f8060b44810fc480afd1a233"},"schema_version":"1.0","source":{"id":"1703.00941","kind":"arxiv","version":1}},"canonical_sha256":"1b0c33cbac7378c9c36d889a965440280c186262ef4f962cbfcc4b9ce5562208","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b0c33cbac7378c9c36d889a965440280c186262ef4f962cbfcc4b9ce5562208","first_computed_at":"2026-05-18T00:49:37.511719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:37.511719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FvvO7f9nmSzD0QU09vOxv1gw3u1OTS9lPxqOEX+4WKcMedrL5F+yIOMnuWw3dMDmobi5Ki86Aogll007VCt4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:37.512355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09e2e71a731eec27e817a34ca53e02d9b2becbed30f012d20b0f79b7810aacd5","sha256:3dba941bc3b9144feddb65b936f29f079355ea49e045ce496e2ad8fb2bfbb9f3"],"state_sha256":"84b635aec9dc1d9f7c051117f11139cee3a336246d8743f09c5476cdc86aa62d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3I9Bv8joLpuSPFszTtNbEk6te02ebWUivrOhDZ2oBM64OGMD+geaRhLfUuG+dhm9YIEQV5B6Hq/n40Z+RNujDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:21:30.651487Z","bundle_sha256":"e75f52f006ade6528c4c64cce50353bdd391f5d4e838b165ecc010b63a28434f"}}