{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7IZPDJM5M6DHBWNBWE3WKVJG2V","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":"007d354cfaff25b4d23de8714ee17e49914b0f7228ab13b12ed6251aa90f2b9d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-19T15:43:05Z","title_canon_sha256":"20d8d495a92373d052d9da3334039e5f2a408b7eb36cfa7dbeffd26405d28683"},"schema_version":"1.0","source":{"id":"1005.3477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.3477","created_at":"2026-05-18T02:23:56Z"},{"alias_kind":"arxiv_version","alias_value":"1005.3477v1","created_at":"2026-05-18T02:23:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.3477","created_at":"2026-05-18T02:23:56Z"},{"alias_kind":"pith_short_12","alias_value":"7IZPDJM5M6DH","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7IZPDJM5M6DHBWNB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7IZPDJM5","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:47f18c9038b2ad1cde04319209c493b52ba6f211f8177740e3d3056a9b6adf90","target":"graph","created_at":"2026-05-18T02:23:56Z","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 give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized series-parallel graph. Note that the class of generalized seriesparallel graphs includes all outerplanar graphs. We can perform the counting in time $O(m\\Delta^3)$, where $\\Delta$ is the maximum degree of the graph with $m$ edges. We use $O(m\\Delta^2 \\log \\Delta)$ bits to store intermediate values during our computations. To date, these are the first known polyno","authors_text":"Mary Cryan, Prasad Chebolu, Russell Martin","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-19T15:43:05Z","title":"Exact counting of Euler Tours for generalized series-parallel graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.3477","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:f0abdb7d07fa2cf5efc6e93d43996698fda6c268562355d30064e5817308a1b6","target":"record","created_at":"2026-05-18T02:23:56Z","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":"007d354cfaff25b4d23de8714ee17e49914b0f7228ab13b12ed6251aa90f2b9d","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-19T15:43:05Z","title_canon_sha256":"20d8d495a92373d052d9da3334039e5f2a408b7eb36cfa7dbeffd26405d28683"},"schema_version":"1.0","source":{"id":"1005.3477","kind":"arxiv","version":1}},"canonical_sha256":"fa32f1a59d678670d9a1b137655526d57b8b7a8afa368991e1d019c861f84efc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa32f1a59d678670d9a1b137655526d57b8b7a8afa368991e1d019c861f84efc","first_computed_at":"2026-05-18T02:23:56.522479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:56.522479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vQOORvUxMLdzbxYg+x//ThPyCJGvMXpb/KVVw4SOJUwYfnySt+EGs/asIbXScmqTZyVnF2RBLPYyUdxn2J+mCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:56.523049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.3477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0abdb7d07fa2cf5efc6e93d43996698fda6c268562355d30064e5817308a1b6","sha256:47f18c9038b2ad1cde04319209c493b52ba6f211f8177740e3d3056a9b6adf90"],"state_sha256":"7210350f59a05cf445ec4fb0adee52fb45f8515323f854b5b9364f32be2366fa"}