{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JEM4AC6BFALUPRAJCSO57SSN3N","short_pith_number":"pith:JEM4AC6B","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"},"canonical_sha256":"4919c00bc1281747c409149ddfca4ddb7dce5fbdbf153262dfa089cd08498088","source":{"kind":"arxiv","id":"1709.09990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09990","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09990v1","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09990","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"JEM4AC6BFALU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JEM4AC6BFALUPRAJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JEM4AC6B","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JEM4AC6BFALUPRAJCSO57SSN3N","target":"record","payload":{"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"},"canonical_sha256":"4919c00bc1281747c409149ddfca4ddb7dce5fbdbf153262dfa089cd08498088","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"},"source_kind":"arxiv","source_id":"1709.09990","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fRIKcEy7Ez6N4SsoC1Wt0kZjzn1OgHxJbO4aSnyeIDgP5Qp5OVYX5ET+p1viLyBZTxC0v6QYsYVmFheaFQXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:23:59.153417Z"},"content_sha256":"7d83764fec16b69abcb54f08b95848cbd58425ee66bf98ec698df9f8237aaab4","schema_version":"1.0","event_id":"sha256:7d83764fec16b69abcb54f08b95848cbd58425ee66bf98ec698df9f8237aaab4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JEM4AC6BFALUPRAJCSO57SSN3N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxGpxj4m2swdyNmVYzNtXCFCUTNSY/6NPMbhVhl1dT1CY5noxv6zLbNoU7icEAwXu06kc1li69/T5IvueUfwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:23:59.153809Z"},"content_sha256":"4f16d4142c1a588a32dcd19768042611fd4ca7ee8b5939c6e248db75c2fd43be","schema_version":"1.0","event_id":"sha256:4f16d4142c1a588a32dcd19768042611fd4ca7ee8b5939c6e248db75c2fd43be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N/bundle.json","state_url":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEM4AC6BFALUPRAJCSO57SSN3N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T18:23:59Z","links":{"resolver":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N","bundle":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N/bundle.json","state":"https://pith.science/pith/JEM4AC6BFALUPRAJCSO57SSN3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEM4AC6BFALUPRAJCSO57SSN3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JEM4AC6BFALUPRAJCSO57SSN3N","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":"b7160ad37660309897dfb3e6d3bd8958d57d33ee59867bda0b3b1a5a820357a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-09-28T14:34:55Z","title_canon_sha256":"40496d76872d2bce25363a7a5da01a985a6b8b2b7fac74777b887b886b808c4a"},"schema_version":"1.0","source":{"id":"1709.09990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.09990","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.09990v1","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09990","created_at":"2026-05-18T00:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"JEM4AC6BFALU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JEM4AC6BFALUPRAJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JEM4AC6B","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:4f16d4142c1a588a32dcd19768042611fd4ca7ee8b5939c6e248db75c2fd43be","target":"graph","created_at":"2026-05-18T00:34:06Z","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 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","authors_text":"Hans L. Bodlaender, Tom C. van der Zanden","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-09-28T14:34:55Z","title":"Computing Treewidth on the GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09990","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:7d83764fec16b69abcb54f08b95848cbd58425ee66bf98ec698df9f8237aaab4","target":"record","created_at":"2026-05-18T00:34:06Z","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":"b7160ad37660309897dfb3e6d3bd8958d57d33ee59867bda0b3b1a5a820357a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2017-09-28T14:34:55Z","title_canon_sha256":"40496d76872d2bce25363a7a5da01a985a6b8b2b7fac74777b887b886b808c4a"},"schema_version":"1.0","source":{"id":"1709.09990","kind":"arxiv","version":1}},"canonical_sha256":"4919c00bc1281747c409149ddfca4ddb7dce5fbdbf153262dfa089cd08498088","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4919c00bc1281747c409149ddfca4ddb7dce5fbdbf153262dfa089cd08498088","first_computed_at":"2026-05-18T00:34:06.002008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:06.002008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+7tXWIoV6pXkSf5BXHJS7npGuGDyrq3bvS/n+ltUlM8udjx9Akl+Dv/DPhV98eSJAgO6W77gQgW39ur37x/SCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:06.002749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.09990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d83764fec16b69abcb54f08b95848cbd58425ee66bf98ec698df9f8237aaab4","sha256:4f16d4142c1a588a32dcd19768042611fd4ca7ee8b5939c6e248db75c2fd43be"],"state_sha256":"23c7debcafb5ef7b620b4bf88bb410bef76cf24f8dfb8e9fcf7f4144e8b727a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cmm6PKUwObkMsMCp4HYv4CNO6AjOg62NWImLcwTeDTzPVQ0Q5vY+ukzqelFOdkVcFkPwDEXyjqGXF2Obn6aDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:23:59.156887Z","bundle_sha256":"66f95387f9e19a714bd866c1779b6d410925c2107f8544864f0cdc2734cf96c0"}}