{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OHJJEWMTEDBUN7PVD4GEJLB2T7","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":"4eeb42ddd7cdd52294167a20a94dfc9abbe78607e4451339d67530c5d3e96e52","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-10T16:22:23Z","title_canon_sha256":"0003547453cd8bae9f000a66d1f0110606bba8adf700f6d0ee01626c8e6d948c"},"schema_version":"1.0","source":{"id":"1301.2253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2253","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2253v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2253","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"OHJJEWMTEDBU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OHJJEWMTEDBUN7PV","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OHJJEWMT","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:ec5b30d82ea8792a53d891b38e767e8449aae39b46e883aaef2fe84d9d9ec2d6","target":"graph","created_at":"2026-05-18T03:36:45Z","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"},"paper":{"abstract_excerpt":"We present four novel approximation algorithms for finding  triangulation of minimum treewidth. Two of the algorithms improve on the  running times of algorithms by Robertson and Seymour, and Becker and   Geiger that approximate the optimum by factors  of 4 and 3 2/3, respectively.  A third algorithm is faster than  those but gives an approximation factor of 4 1/2. The last  algorithm is yet faster, producing factor-O(lg/k) approximations  in polynomial time.  Finding triangulations of minimum treewidth for graphs is central to  many problems in computer science.  Real-world problems in  artif","authors_text":"Eyal Amir","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-10T16:22:23Z","title":"Efficient Approximation for Triangulation of Minimum Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2253","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:e311156c60312d80baa3a258abca2eb7bcd11600c2c49519d1b96390665d3173","target":"record","created_at":"2026-05-18T03:36:45Z","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":"4eeb42ddd7cdd52294167a20a94dfc9abbe78607e4451339d67530c5d3e96e52","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-10T16:22:23Z","title_canon_sha256":"0003547453cd8bae9f000a66d1f0110606bba8adf700f6d0ee01626c8e6d948c"},"schema_version":"1.0","source":{"id":"1301.2253","kind":"arxiv","version":1}},"canonical_sha256":"71d292599320c346fdf51f0c44ac3a9fced5a720d76308f533c8910051fa6045","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71d292599320c346fdf51f0c44ac3a9fced5a720d76308f533c8910051fa6045","first_computed_at":"2026-05-18T03:36:45.871627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:45.871627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y0OldlWBZCE9ozg9gDgiZD+T3xKIDwpUviflAcImQplIR/v2l6N8xMiHZ0G3U5TihexzeYumoy6ZlvR4hhW1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:45.872343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e311156c60312d80baa3a258abca2eb7bcd11600c2c49519d1b96390665d3173","sha256:ec5b30d82ea8792a53d891b38e767e8449aae39b46e883aaef2fe84d9d9ec2d6"],"state_sha256":"4468f59c06b5beb1f3a04b8ac9a018f1ed55b4169caafe78edb470fcfaa91606"}