{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JEM4AC6BFALUPRAJCSO57SSN3N","short_pith_number":"pith:JEM4AC6B","schema_version":"1.0","canonical_sha256":"4919c00bc1281747c409149ddfca4ddb7dce5fbdbf153262dfa089cd08498088","source":{"kind":"arxiv","id":"1709.09990","version":1},"attestation_state":"computed","paper":{"title":"Computing Treewidth on the GPU","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hans L. Bodlaender, Tom C. van der Zanden","submitted_at":"2017-09-28T14:34:55Z","abstract_excerpt":"We present a parallel algorithm for computing the treewidth of a graph on a GPU. We implement this algorithm in OpenCL, and experimentally evaluate its performance. Our algorithm is based on an $O^*(2^{n})$-time algorithm that explores the elimination orderings of the graph using a Held-Karp like dynamic programming approach. We use Bloom filters to detect duplicate solutions.\n  GPU programming presents unique challenges and constraints, such as constraints on the use of memory and the need to limit branch divergence. We experiment with various optimizations to see if it is possible to work ar"},"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":"1709.09990","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-09-28T14:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"40496d76872d2bce25363a7a5da01a985a6b8b2b7fac74777b887b886b808c4a","abstract_canon_sha256":"b7160ad37660309897dfb3e6d3bd8958d57d33ee59867bda0b3b1a5a820357a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:06.002749Z","signature_b64":"+7tXWIoV6pXkSf5BXHJS7npGuGDyrq3bvS/n+ltUlM8udjx9Akl+Dv/DPhV98eSJAgO6W77gQgW39ur37x/SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4919c00bc1281747c409149ddfca4ddb7dce5fbdbf153262dfa089cd08498088","last_reissued_at":"2026-05-18T00:34:06.002008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:06.002008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Treewidth on the GPU","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hans L. Bodlaender, Tom C. van der Zanden","submitted_at":"2017-09-28T14:34:55Z","abstract_excerpt":"We present a parallel algorithm for computing the treewidth of a graph on a GPU. We implement this algorithm in OpenCL, and experimentally evaluate its performance. Our algorithm is based on an $O^*(2^{n})$-time algorithm that explores the elimination orderings of the graph using a Held-Karp like dynamic programming approach. We use Bloom filters to detect duplicate solutions.\n  GPU programming presents unique challenges and constraints, such as constraints on the use of memory and the need to limit branch divergence. We experiment with various optimizations to see if it is possible to work ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09990","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":""},"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":"1709.09990","created_at":"2026-05-18T00:34:06.002138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09990v1","created_at":"2026-05-18T00:34:06.002138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09990","created_at":"2026-05-18T00:34:06.002138+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEM4AC6BFALU","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEM4AC6BFALUPRAJ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEM4AC6B","created_at":"2026-05-18T12:31:24.725408+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/JEM4AC6BFALUPRAJCSO57SSN3N","json":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N.json","graph_json":"https://pith.science/api/pith-number/JEM4AC6BFALUPRAJCSO57SSN3N/graph.json","events_json":"https://pith.science/api/pith-number/JEM4AC6BFALUPRAJCSO57SSN3N/events.json","paper":"https://pith.science/paper/JEM4AC6B"},"agent_actions":{"view_html":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N","download_json":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N.json","view_paper":"https://pith.science/paper/JEM4AC6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09990&json=true","fetch_graph":"https://pith.science/api/pith-number/JEM4AC6BFALUPRAJCSO57SSN3N/graph.json","fetch_events":"https://pith.science/api/pith-number/JEM4AC6BFALUPRAJCSO57SSN3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N/action/storage_attestation","attest_author":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N/action/author_attestation","sign_citation":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N/action/citation_signature","submit_replication":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N/action/replication_record"}},"created_at":"2026-05-18T00:34:06.002138+00:00","updated_at":"2026-05-18T00:34:06.002138+00:00"}