{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:U37YZUR4TIOTOZBIMSQCKBTFRF","short_pith_number":"pith:U37YZUR4","schema_version":"1.0","canonical_sha256":"a6ff8cd23c9a1d37642864a0250665894ea441da68d269622f89f7133f80e873","source":{"kind":"arxiv","id":"2011.05365","version":3},"attestation_state":"computed","paper":{"title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Guanghao Ye, Sally Dong, Yin Tat Lee","submitted_at":"2020-11-10T19:35:02Z","abstract_excerpt":"Arising from structural graph theory, treewidth has become a focus of study in fixed-parameter tractable algorithms in various communities including combinatorics, integer-linear programming, and numerical analysis. Many NP-hard problems are known to be solvable in $\\widetilde{O}(n \\cdot 2^{O(\\mathrm{tw})})$ time, where $\\mathrm{tw}$ is the treewidth of the input graph. Analogously, many problems in P should be solvable in $\\widetilde{O}(n \\cdot \\mathrm{tw}^{O(1)})$ time; however, due to the lack of appropriate tools, only a few such results are currently known. [Fom+18] conjectured this to ho"},"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":"2011.05365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-10T19:35:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"78410b6245acef460d83155b76da42c1ff9be5c91a50e95e22ecd9a9de205e18","abstract_canon_sha256":"4e4010f9ee066c16bfab87e729e434ed085e850c2b9afeabdd2514867afb061e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:50:08.847807Z","signature_b64":"TSi1dcDqkCxjUSzTiZoi31dkXcH35+HGfZeCG7aCZwjIKb1vXjCJ2cnaoyXJC4MoRdhS/qoqVvyrtMCQvRBhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6ff8cd23c9a1d37642864a0250665894ea441da68d269622f89f7133f80e873","last_reissued_at":"2026-07-05T06:50:08.847248Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:50:08.847248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Guanghao Ye, Sally Dong, Yin Tat Lee","submitted_at":"2020-11-10T19:35:02Z","abstract_excerpt":"Arising from structural graph theory, treewidth has become a focus of study in fixed-parameter tractable algorithms in various communities including combinatorics, integer-linear programming, and numerical analysis. Many NP-hard problems are known to be solvable in $\\widetilde{O}(n \\cdot 2^{O(\\mathrm{tw})})$ time, where $\\mathrm{tw}$ is the treewidth of the input graph. Analogously, many problems in P should be solvable in $\\widetilde{O}(n \\cdot \\mathrm{tw}^{O(1)})$ time; however, due to the lack of appropriate tools, only a few such results are currently known. [Fom+18] conjectured this to ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05365","kind":"arxiv","version":3},"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/2011.05365/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":"2011.05365","created_at":"2026-07-05T06:50:08.847307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.05365v3","created_at":"2026-07-05T06:50:08.847307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05365","created_at":"2026-07-05T06:50:08.847307+00:00"},{"alias_kind":"pith_short_12","alias_value":"U37YZUR4TIOT","created_at":"2026-07-05T06:50:08.847307+00:00"},{"alias_kind":"pith_short_16","alias_value":"U37YZUR4TIOTOZBI","created_at":"2026-07-05T06:50:08.847307+00:00"},{"alias_kind":"pith_short_8","alias_value":"U37YZUR4","created_at":"2026-07-05T06:50:08.847307+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.12441","citing_title":"Numerical Pruning for Efficient Autoregressive Models","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF","json":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF.json","graph_json":"https://pith.science/api/pith-number/U37YZUR4TIOTOZBIMSQCKBTFRF/graph.json","events_json":"https://pith.science/api/pith-number/U37YZUR4TIOTOZBIMSQCKBTFRF/events.json","paper":"https://pith.science/paper/U37YZUR4"},"agent_actions":{"view_html":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF","download_json":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF.json","view_paper":"https://pith.science/paper/U37YZUR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.05365&json=true","fetch_graph":"https://pith.science/api/pith-number/U37YZUR4TIOTOZBIMSQCKBTFRF/graph.json","fetch_events":"https://pith.science/api/pith-number/U37YZUR4TIOTOZBIMSQCKBTFRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/action/storage_attestation","attest_author":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/action/author_attestation","sign_citation":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/action/citation_signature","submit_replication":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/action/replication_record"}},"created_at":"2026-07-05T06:50:08.847307+00:00","updated_at":"2026-07-05T06:50:08.847307+00:00"}