{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A2DTNQSP3QRH766IHRUB3YJER4","short_pith_number":"pith:A2DTNQSP","schema_version":"1.0","canonical_sha256":"068736c24fdc227ffbc83c681de1248f21be402e153fd8c585feda271cc97ed7","source":{"kind":"arxiv","id":"1310.0185","version":1},"attestation_state":"computed","paper":{"title":"Exact counting of Euler Tours for Graphs of Bounded Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Mary Cryan, Prasad Chebolu, Russell Martin","submitted_at":"2013-10-01T08:35:14Z","abstract_excerpt":"In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs are known to be #P-complete for general graphs (Brightwell and Winkler, (Brightwell and Winkler, 2005). To date, no polynomial-time algorithm for counting Euler tours of any class of graphs is known except for the very special case of series-parallel graphs (which have treewidth 2)."},"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":"1310.0185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-01T08:35:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dd513ae3e1ce3997eba04acb7aa8d32c40899dc2e04ec429ef6b30d2c9c9f41a","abstract_canon_sha256":"56b3d50e56b0ca8c0c1762634890d0a684dc9e165b618fcf6dbdbddba975da7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:45.237197Z","signature_b64":"mwGzDubh3xuP3WF9zVP1xkNaZi1lcplfPqur3DlfpOBhH8ofyI+eidTfzoXha4hz//J7m68ZRur9ojjm62fHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"068736c24fdc227ffbc83c681de1248f21be402e153fd8c585feda271cc97ed7","last_reissued_at":"2026-05-18T03:11:45.236599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:45.236599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact counting of Euler Tours for Graphs of Bounded Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Mary Cryan, Prasad Chebolu, Russell Martin","submitted_at":"2013-10-01T08:35:14Z","abstract_excerpt":"In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs are known to be #P-complete for general graphs (Brightwell and Winkler, (Brightwell and Winkler, 2005). To date, no polynomial-time algorithm for counting Euler tours of any class of graphs is known except for the very special case of series-parallel graphs (which have treewidth 2)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0185","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":"1310.0185","created_at":"2026-05-18T03:11:45.236696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.0185v1","created_at":"2026-05-18T03:11:45.236696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0185","created_at":"2026-05-18T03:11:45.236696+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2DTNQSP3QRH","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2DTNQSP3QRH766I","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2DTNQSP","created_at":"2026-05-18T12:27:38.830355+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/A2DTNQSP3QRH766IHRUB3YJER4","json":"https://pith.science/pith/A2DTNQSP3QRH766IHRUB3YJER4.json","graph_json":"https://pith.science/api/pith-number/A2DTNQSP3QRH766IHRUB3YJER4/graph.json","events_json":"https://pith.science/api/pith-number/A2DTNQSP3QRH766IHRUB3YJER4/events.json","paper":"https://pith.science/paper/A2DTNQSP"},"agent_actions":{"view_html":"https://pith.science/pith/A2DTNQSP3QRH766IHRUB3YJER4","download_json":"https://pith.science/pith/A2DTNQSP3QRH766IHRUB3YJER4.json","view_paper":"https://pith.science/paper/A2DTNQSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.0185&json=true","fetch_graph":"https://pith.science/api/pith-number/A2DTNQSP3QRH766IHRUB3YJER4/graph.json","fetch_events":"https://pith.science/api/pith-number/A2DTNQSP3QRH766IHRUB3YJER4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2DTNQSP3QRH766IHRUB3YJER4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2DTNQSP3QRH766IHRUB3YJER4/action/storage_attestation","attest_author":"https://pith.science/pith/A2DTNQSP3QRH766IHRUB3YJER4/action/author_attestation","sign_citation":"https://pith.science/pith/A2DTNQSP3QRH766IHRUB3YJER4/action/citation_signature","submit_replication":"https://pith.science/pith/A2DTNQSP3QRH766IHRUB3YJER4/action/replication_record"}},"created_at":"2026-05-18T03:11:45.236696+00:00","updated_at":"2026-05-18T03:11:45.236696+00:00"}