{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IOJXQFHDFIC2XHTP6LSCL2R6LS","short_pith_number":"pith:IOJXQFHD","schema_version":"1.0","canonical_sha256":"43937814e32a05ab9e6ff2e425ea3e5caf7e3bda7c5440c2c34de2ceecb0a530","source":{"kind":"arxiv","id":"2506.02346","version":1},"attestation_state":"computed","paper":{"title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carlos Segura, J.A. Alejandro-Soto, Joel Antonio Trejo-Sanchez","submitted_at":"2025-06-03T00:52:06Z","abstract_excerpt":"This work proposes \\textsc{H-Td}, a practical linear-time algorithm for computing an optimal-width tree decomposition of Halin graphs. Unlike state-of-the-art methods based on reduction rules or separators, \\textsc{H-Td} exploits the structural properties of Halin graphs. Although two theoretical linear-time algorithms exist that can be applied to graphs of treewidth three, no practical implementation has been made publicly available. Furthermore, extending reduction-based approaches to partial $k$-trees with $k > 3$ results in increasingly complex rules that are challenging to implement. This"},"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":"2506.02346","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-03T00:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"7c1364afa795185d5987e256fb8cb9cef1e5683e735aa4be425305a3f7ce0ab6","abstract_canon_sha256":"cd4b7550035d054299631042ec509be032da64d9928b1cbe92ba10397676edf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:36.771353Z","signature_b64":"x9e9rnCZoyfS5v3G7Lpmd8OEv+hd7H5siPpZf3HdOP0NKKaiHST21U38YyDljbpBw8Wwjmn5gwHVzdXEAkXhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43937814e32a05ab9e6ff2e425ea3e5caf7e3bda7c5440c2c34de2ceecb0a530","last_reissued_at":"2026-07-05T11:14:36.770866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:36.770866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carlos Segura, J.A. Alejandro-Soto, Joel Antonio Trejo-Sanchez","submitted_at":"2025-06-03T00:52:06Z","abstract_excerpt":"This work proposes \\textsc{H-Td}, a practical linear-time algorithm for computing an optimal-width tree decomposition of Halin graphs. Unlike state-of-the-art methods based on reduction rules or separators, \\textsc{H-Td} exploits the structural properties of Halin graphs. Although two theoretical linear-time algorithms exist that can be applied to graphs of treewidth three, no practical implementation has been made publicly available. Furthermore, extending reduction-based approaches to partial $k$-trees with $k > 3$ results in increasingly complex rules that are challenging to implement. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02346","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.02346/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":"2506.02346","created_at":"2026-07-05T11:14:36.770925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.02346v1","created_at":"2026-07-05T11:14:36.770925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02346","created_at":"2026-07-05T11:14:36.770925+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOJXQFHDFIC2","created_at":"2026-07-05T11:14:36.770925+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOJXQFHDFIC2XHTP","created_at":"2026-07-05T11:14:36.770925+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOJXQFHD","created_at":"2026-07-05T11:14:36.770925+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/IOJXQFHDFIC2XHTP6LSCL2R6LS","json":"https://pith.science/pith/IOJXQFHDFIC2XHTP6LSCL2R6LS.json","graph_json":"https://pith.science/api/pith-number/IOJXQFHDFIC2XHTP6LSCL2R6LS/graph.json","events_json":"https://pith.science/api/pith-number/IOJXQFHDFIC2XHTP6LSCL2R6LS/events.json","paper":"https://pith.science/paper/IOJXQFHD"},"agent_actions":{"view_html":"https://pith.science/pith/IOJXQFHDFIC2XHTP6LSCL2R6LS","download_json":"https://pith.science/pith/IOJXQFHDFIC2XHTP6LSCL2R6LS.json","view_paper":"https://pith.science/paper/IOJXQFHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.02346&json=true","fetch_graph":"https://pith.science/api/pith-number/IOJXQFHDFIC2XHTP6LSCL2R6LS/graph.json","fetch_events":"https://pith.science/api/pith-number/IOJXQFHDFIC2XHTP6LSCL2R6LS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOJXQFHDFIC2XHTP6LSCL2R6LS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOJXQFHDFIC2XHTP6LSCL2R6LS/action/storage_attestation","attest_author":"https://pith.science/pith/IOJXQFHDFIC2XHTP6LSCL2R6LS/action/author_attestation","sign_citation":"https://pith.science/pith/IOJXQFHDFIC2XHTP6LSCL2R6LS/action/citation_signature","submit_replication":"https://pith.science/pith/IOJXQFHDFIC2XHTP6LSCL2R6LS/action/replication_record"}},"created_at":"2026-07-05T11:14:36.770925+00:00","updated_at":"2026-07-05T11:14:36.770925+00:00"}