{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:C5VXBSKX2GLFD5ICL2YJI7JUYA","short_pith_number":"pith:C5VXBSKX","schema_version":"1.0","canonical_sha256":"176b70c957d19651f5025eb0947d34c0077525c7892f7127d31c67535e4bda53","source":{"kind":"arxiv","id":"2309.04683","version":2},"attestation_state":"computed","paper":{"title":"Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ethan Turok, Hantao Yu, Hengzhi Zhang, Josh Alman","submitted_at":"2023-09-09T04:40:32Z","abstract_excerpt":"Generalizing work of K\\\"unnemann, Paturi, and Schneider [ICALP 2017], we study a wide class of high-dimensional dynamic programming (DP) problems in which one must find the shortest path between two points in a high-dimensional grid given a tensor of transition costs between nodes in the grid. This captures many classical problems which are solved using DP such as the knapsack problem, the airplane refueling problem, and the minimal-weight polygon triangulation problem. We observe that for many of these problems, the tensor naturally has low tensor rank or low slice rank.\n  We then give new al"},"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":"2309.04683","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-09-09T04:40:32Z","cross_cats_sorted":[],"title_canon_sha256":"8d8fc26805a21e1634078bc49830af0ee9698da126136786a4179853df444121","abstract_canon_sha256":"75757f00c1baf5d9293bfc81918cad3c6d2c40057eaec5f9d56fabab4eb02f68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:28.396683Z","signature_b64":"LYbaavmrts/RUSHdGMbBeHr00B+LvfQJUI44Aqv62WQyP2xBIVuP5HS95NPseI2fnYYSexxzD4fTUNsA8yaECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"176b70c957d19651f5025eb0947d34c0077525c7892f7127d31c67535e4bda53","last_reissued_at":"2026-07-05T07:29:28.396189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:28.396189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ethan Turok, Hantao Yu, Hengzhi Zhang, Josh Alman","submitted_at":"2023-09-09T04:40:32Z","abstract_excerpt":"Generalizing work of K\\\"unnemann, Paturi, and Schneider [ICALP 2017], we study a wide class of high-dimensional dynamic programming (DP) problems in which one must find the shortest path between two points in a high-dimensional grid given a tensor of transition costs between nodes in the grid. This captures many classical problems which are solved using DP such as the knapsack problem, the airplane refueling problem, and the minimal-weight polygon triangulation problem. We observe that for many of these problems, the tensor naturally has low tensor rank or low slice rank.\n  We then give new al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.04683","kind":"arxiv","version":2},"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/2309.04683/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":"2309.04683","created_at":"2026-07-05T07:29:28.396237+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.04683v2","created_at":"2026-07-05T07:29:28.396237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.04683","created_at":"2026-07-05T07:29:28.396237+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5VXBSKX2GLF","created_at":"2026-07-05T07:29:28.396237+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5VXBSKX2GLFD5IC","created_at":"2026-07-05T07:29:28.396237+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5VXBSKX","created_at":"2026-07-05T07:29:28.396237+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14676","citing_title":"Depth-first search for tensor rank and border rank over finite fields","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5VXBSKX2GLFD5ICL2YJI7JUYA","json":"https://pith.science/pith/C5VXBSKX2GLFD5ICL2YJI7JUYA.json","graph_json":"https://pith.science/api/pith-number/C5VXBSKX2GLFD5ICL2YJI7JUYA/graph.json","events_json":"https://pith.science/api/pith-number/C5VXBSKX2GLFD5ICL2YJI7JUYA/events.json","paper":"https://pith.science/paper/C5VXBSKX"},"agent_actions":{"view_html":"https://pith.science/pith/C5VXBSKX2GLFD5ICL2YJI7JUYA","download_json":"https://pith.science/pith/C5VXBSKX2GLFD5ICL2YJI7JUYA.json","view_paper":"https://pith.science/paper/C5VXBSKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.04683&json=true","fetch_graph":"https://pith.science/api/pith-number/C5VXBSKX2GLFD5ICL2YJI7JUYA/graph.json","fetch_events":"https://pith.science/api/pith-number/C5VXBSKX2GLFD5ICL2YJI7JUYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5VXBSKX2GLFD5ICL2YJI7JUYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5VXBSKX2GLFD5ICL2YJI7JUYA/action/storage_attestation","attest_author":"https://pith.science/pith/C5VXBSKX2GLFD5ICL2YJI7JUYA/action/author_attestation","sign_citation":"https://pith.science/pith/C5VXBSKX2GLFD5ICL2YJI7JUYA/action/citation_signature","submit_replication":"https://pith.science/pith/C5VXBSKX2GLFD5ICL2YJI7JUYA/action/replication_record"}},"created_at":"2026-07-05T07:29:28.396237+00:00","updated_at":"2026-07-05T07:29:28.396237+00:00"}