{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D433GF43ILMCZHU4J4SESAPBTK","short_pith_number":"pith:D433GF43","schema_version":"1.0","canonical_sha256":"1f37b3179b42d82c9e9c4f244901e19aaf61ecac441abdc82691e57f6845c305","source":{"kind":"arxiv","id":"2411.16918","version":3},"attestation_state":"computed","paper":{"title":"Optimized 2-Approximation of Treewidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mahdi Belbasi, Martin F\\\"urer, Medha Kumar","submitted_at":"2024-11-25T20:44:15Z","abstract_excerpt":"This paper presents a linear FPT algorithm to find a tree decomposition with a 2-approximation of the treewidth with a significantly smaller exponential dependence on the treewidth. The algorithm runs in time $O(\\text{poly}(k) 81^k n)$, compared to Korhonen's running time of $O(\\text{poly}(k) 1782^k n)$ = $O(2^{10.8k} n)$."},"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":"2411.16918","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-25T20:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"80505ef4ed98f3044126ad142189296286d952a746b89380625466e875ce63e2","abstract_canon_sha256":"0a87341a40f6f4e9aef159589bc77759007b3a3433fd73d9b7108ff5d0fa8745"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:20.960278Z","signature_b64":"QoRjClpHgfuJHIpUtzv2QSnKDkax451CWL4P2TT2JOsJHS7m5zyeE1ZDsjbyOgGUNDFzIoV6TLZ0NLmv8rvFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f37b3179b42d82c9e9c4f244901e19aaf61ecac441abdc82691e57f6845c305","last_reissued_at":"2026-07-05T11:32:20.959804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:20.959804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimized 2-Approximation of Treewidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mahdi Belbasi, Martin F\\\"urer, Medha Kumar","submitted_at":"2024-11-25T20:44:15Z","abstract_excerpt":"This paper presents a linear FPT algorithm to find a tree decomposition with a 2-approximation of the treewidth with a significantly smaller exponential dependence on the treewidth. The algorithm runs in time $O(\\text{poly}(k) 81^k n)$, compared to Korhonen's running time of $O(\\text{poly}(k) 1782^k n)$ = $O(2^{10.8k} n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16918","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/2411.16918/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":"2411.16918","created_at":"2026-07-05T11:32:20.959859+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16918v3","created_at":"2026-07-05T11:32:20.959859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16918","created_at":"2026-07-05T11:32:20.959859+00:00"},{"alias_kind":"pith_short_12","alias_value":"D433GF43ILMC","created_at":"2026-07-05T11:32:20.959859+00:00"},{"alias_kind":"pith_short_16","alias_value":"D433GF43ILMCZHU4","created_at":"2026-07-05T11:32:20.959859+00:00"},{"alias_kind":"pith_short_8","alias_value":"D433GF43","created_at":"2026-07-05T11:32:20.959859+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/D433GF43ILMCZHU4J4SESAPBTK","json":"https://pith.science/pith/D433GF43ILMCZHU4J4SESAPBTK.json","graph_json":"https://pith.science/api/pith-number/D433GF43ILMCZHU4J4SESAPBTK/graph.json","events_json":"https://pith.science/api/pith-number/D433GF43ILMCZHU4J4SESAPBTK/events.json","paper":"https://pith.science/paper/D433GF43"},"agent_actions":{"view_html":"https://pith.science/pith/D433GF43ILMCZHU4J4SESAPBTK","download_json":"https://pith.science/pith/D433GF43ILMCZHU4J4SESAPBTK.json","view_paper":"https://pith.science/paper/D433GF43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16918&json=true","fetch_graph":"https://pith.science/api/pith-number/D433GF43ILMCZHU4J4SESAPBTK/graph.json","fetch_events":"https://pith.science/api/pith-number/D433GF43ILMCZHU4J4SESAPBTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D433GF43ILMCZHU4J4SESAPBTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D433GF43ILMCZHU4J4SESAPBTK/action/storage_attestation","attest_author":"https://pith.science/pith/D433GF43ILMCZHU4J4SESAPBTK/action/author_attestation","sign_citation":"https://pith.science/pith/D433GF43ILMCZHU4J4SESAPBTK/action/citation_signature","submit_replication":"https://pith.science/pith/D433GF43ILMCZHU4J4SESAPBTK/action/replication_record"}},"created_at":"2026-07-05T11:32:20.959859+00:00","updated_at":"2026-07-05T11:32:20.959859+00:00"}