{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QGHPEKRCRX3FSMMLV5LJPGZDHK","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":"3808bf1193bdfea7b752b937bb65bd2e4ba3c4f8356d2bb7b290fc5a3e166c98","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-10-14T10:44:21Z","title_canon_sha256":"9487b02f5f692d43c20f91e825edb7049a52ad021e1b53f23b5e7ce813c7b39b"},"schema_version":"1.0","source":{"id":"1510.04035","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04035","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04035v2","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04035","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"pith_short_12","alias_value":"QGHPEKRCRX3F","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QGHPEKRCRX3FSMML","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QGHPEKRC","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:ea6be0a0340018c6e0e20cc4ad62de0a008a704054a9dd318f54e0a3a15b16c2","target":"graph","created_at":"2026-05-18T01:24:24Z","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 show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel - by proving a $\\#SAC^1$ upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs.\n  Our main technical contribution is to show how (an instance of) dynamic programming on bounded \\emph{clique-width} graphs can be performed efficiently in parallel. Thus we show that the sequential result of Espelage, Gurski and Wanke for efficiently computing Hamiltonian paths in bounded clique-width graphs can be adapted in the parallel setting to count the number of H","authors_text":"Nikhil Balaji, Samir Datta, Venkatesh Ganesan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-10-14T10:44:21Z","title":"Counting Euler Tours in Undirected Bounded Treewidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04035","kind":"arxiv","version":2},"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:31e8e71e9b1313b312a1ed7522c8fae16e6a26840bfbd3f95ab57f76adb0e245","target":"record","created_at":"2026-05-18T01:24:24Z","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":"3808bf1193bdfea7b752b937bb65bd2e4ba3c4f8356d2bb7b290fc5a3e166c98","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-10-14T10:44:21Z","title_canon_sha256":"9487b02f5f692d43c20f91e825edb7049a52ad021e1b53f23b5e7ce813c7b39b"},"schema_version":"1.0","source":{"id":"1510.04035","kind":"arxiv","version":2}},"canonical_sha256":"818ef22a228df659318baf56979b233a9fa7f2c11562546d959d6b69d14ec468","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"818ef22a228df659318baf56979b233a9fa7f2c11562546d959d6b69d14ec468","first_computed_at":"2026-05-18T01:24:24.219351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:24.219351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jiBlM5mCT+OuIBj3x6UAo69G1nb6MDvBekzl+cqwQNE/t6MJfI2oZbF3Vbh4tgW3eeIbASm22n3XWiZcpeT2Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:24.219922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04035","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31e8e71e9b1313b312a1ed7522c8fae16e6a26840bfbd3f95ab57f76adb0e245","sha256:ea6be0a0340018c6e0e20cc4ad62de0a008a704054a9dd318f54e0a3a15b16c2"],"state_sha256":"22adebd7028d32683c16f2fd0edd5176a21a7ec4e15bcc99f5f518610b6abc6b"}