{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IOJXQFHDFIC2XHTP6LSCL2R6LS","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":"cd4b7550035d054299631042ec509be032da64d9928b1cbe92ba10397676edf4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-03T00:52:06Z","title_canon_sha256":"7c1364afa795185d5987e256fb8cb9cef1e5683e735aa4be425305a3f7ce0ab6"},"schema_version":"1.0","source":{"id":"2506.02346","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02346","created_at":"2026-07-05T11:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02346v1","created_at":"2026-07-05T11:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02346","created_at":"2026-07-05T11:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"IOJXQFHDFIC2","created_at":"2026-07-05T11:14:36Z"},{"alias_kind":"pith_short_16","alias_value":"IOJXQFHDFIC2XHTP","created_at":"2026-07-05T11:14:36Z"},{"alias_kind":"pith_short_8","alias_value":"IOJXQFHD","created_at":"2026-07-05T11:14:36Z"}],"graph_snapshots":[{"event_id":"sha256:70823c8e81bbba0c45086e734be6fe5ce331843451a1cd6d3b93a718b5794768","target":"graph","created_at":"2026-07-05T11:14:36Z","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/2506.02346/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Carlos Segura, J.A. Alejandro-Soto, Joel Antonio Trejo-Sanchez","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-03T00:52:06Z","title":"A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02346","kind":"arxiv","version":1},"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:0b4a1275766eb3b8c2528fab3cb12aa0936bff131ca3dc0fde7950b7d42a6c21","target":"record","created_at":"2026-07-05T11:14:36Z","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":"cd4b7550035d054299631042ec509be032da64d9928b1cbe92ba10397676edf4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-03T00:52:06Z","title_canon_sha256":"7c1364afa795185d5987e256fb8cb9cef1e5683e735aa4be425305a3f7ce0ab6"},"schema_version":"1.0","source":{"id":"2506.02346","kind":"arxiv","version":1}},"canonical_sha256":"43937814e32a05ab9e6ff2e425ea3e5caf7e3bda7c5440c2c34de2ceecb0a530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43937814e32a05ab9e6ff2e425ea3e5caf7e3bda7c5440c2c34de2ceecb0a530","first_computed_at":"2026-07-05T11:14:36.770866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:36.770866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x9e9rnCZoyfS5v3G7Lpmd8OEv+hd7H5siPpZf3HdOP0NKKaiHST21U38YyDljbpBw8Wwjmn5gwHVzdXEAkXhAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:36.771353Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.02346","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b4a1275766eb3b8c2528fab3cb12aa0936bff131ca3dc0fde7950b7d42a6c21","sha256:70823c8e81bbba0c45086e734be6fe5ce331843451a1cd6d3b93a718b5794768"],"state_sha256":"c0747b5bebfdcfff9c6686c0e293aea49ad81e6a7726a55edf32aefba755ebf0"}