{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:U37YZUR4TIOTOZBIMSQCKBTFRF","short_pith_number":"pith:U37YZUR4","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"},"canonical_sha256":"a6ff8cd23c9a1d37642864a0250665894ea441da68d269622f89f7133f80e873","source":{"kind":"arxiv","id":"2011.05365","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.05365","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"2011.05365v3","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05365","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"U37YZUR4TIOT","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"pith_short_16","alias_value":"U37YZUR4TIOTOZBI","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"pith_short_8","alias_value":"U37YZUR4","created_at":"2026-07-05T06:50:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:U37YZUR4TIOTOZBIMSQCKBTFRF","target":"record","payload":{"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"},"canonical_sha256":"a6ff8cd23c9a1d37642864a0250665894ea441da68d269622f89f7133f80e873","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"},"source_kind":"arxiv","source_id":"2011.05365","source_version":3,"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-07-05T06:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxTpdT3mKX9WIJ2Cdz86CkanQC/uoC5Q5sPEmAweqjoklbqLwOuqEPJhaunsEpc+4gY9fLgw77tLeFYQnm7cCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:46:19.320338Z"},"content_sha256":"ceb8bf789659a6696dbe6ef36c1951946302c7e088ad43987171a2979a7ef939","schema_version":"1.0","event_id":"sha256:ceb8bf789659a6696dbe6ef36c1951946302c7e088ad43987171a2979a7ef939"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:U37YZUR4TIOTOZBIMSQCKBTFRF","target":"graph","payload":{"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"},"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-07-05T06:50:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNRqEY64I6N7+gswMOEmEFjW0G7AM38F1uKtkH33hJv7H0m2rnMry8k2l/kkPXR53aNT0f0//sPyK997AkN/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:46:19.320840Z"},"content_sha256":"bf4f7dec4747d804424e186a7ffeda5ac940ac72ffedd51414f88a0d619b202e","schema_version":"1.0","event_id":"sha256:bf4f7dec4747d804424e186a7ffeda5ac940ac72ffedd51414f88a0d619b202e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/bundle.json","state_url":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/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-08-15T21:46:19Z","links":{"resolver":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF","bundle":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/bundle.json","state":"https://pith.science/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U37YZUR4TIOTOZBIMSQCKBTFRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:U37YZUR4TIOTOZBIMSQCKBTFRF","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":"4e4010f9ee066c16bfab87e729e434ed085e850c2b9afeabdd2514867afb061e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-10T19:35:02Z","title_canon_sha256":"78410b6245acef460d83155b76da42c1ff9be5c91a50e95e22ecd9a9de205e18"},"schema_version":"1.0","source":{"id":"2011.05365","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.05365","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"arxiv_version","alias_value":"2011.05365v3","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05365","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"pith_short_12","alias_value":"U37YZUR4TIOT","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"pith_short_16","alias_value":"U37YZUR4TIOTOZBI","created_at":"2026-07-05T06:50:08Z"},{"alias_kind":"pith_short_8","alias_value":"U37YZUR4","created_at":"2026-07-05T06:50:08Z"}],"graph_snapshots":[{"event_id":"sha256:bf4f7dec4747d804424e186a7ffeda5ac940ac72ffedd51414f88a0d619b202e","target":"graph","created_at":"2026-07-05T06:50:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.05365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Guanghao Ye, Sally Dong, Yin Tat Lee","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-10T19:35:02Z","title":"A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05365","kind":"arxiv","version":3},"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:ceb8bf789659a6696dbe6ef36c1951946302c7e088ad43987171a2979a7ef939","target":"record","created_at":"2026-07-05T06:50:08Z","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":"4e4010f9ee066c16bfab87e729e434ed085e850c2b9afeabdd2514867afb061e","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-10T19:35:02Z","title_canon_sha256":"78410b6245acef460d83155b76da42c1ff9be5c91a50e95e22ecd9a9de205e18"},"schema_version":"1.0","source":{"id":"2011.05365","kind":"arxiv","version":3}},"canonical_sha256":"a6ff8cd23c9a1d37642864a0250665894ea441da68d269622f89f7133f80e873","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6ff8cd23c9a1d37642864a0250665894ea441da68d269622f89f7133f80e873","first_computed_at":"2026-07-05T06:50:08.847248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:50:08.847248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TSi1dcDqkCxjUSzTiZoi31dkXcH35+HGfZeCG7aCZwjIKb1vXjCJ2cnaoyXJC4MoRdhS/qoqVvyrtMCQvRBhDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:50:08.847807Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.05365","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ceb8bf789659a6696dbe6ef36c1951946302c7e088ad43987171a2979a7ef939","sha256:bf4f7dec4747d804424e186a7ffeda5ac940ac72ffedd51414f88a0d619b202e"],"state_sha256":"f432ba9a18ede0ada69059ead85132032ee59ddd3353dbd8fb7b98cd85bbf781"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TeskAq2/ZWMFTUYaeSApnTKVVCIxQiETieP7M+FzqHvmUP/12U0Fw2K+QSGBRv1FKMAzatadb4j4wxx0OIqgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T21:46:19.325292Z","bundle_sha256":"504ee9c4138e47cf880380aca03d6301770fff861701a17a810f0b5fc62d7d10"}}