{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B6HL5WF5GDGHARCQKV6BP3XJ6W","short_pith_number":"pith:B6HL5WF5","schema_version":"1.0","canonical_sha256":"0f8ebed8bd30cc704450557c17eee9f58e87ee2be08b91cfb6148dff304a65ae","source":{"kind":"arxiv","id":"1407.8031","version":1},"attestation_state":"computed","paper":{"title":"Genus Distributions of cubic series-parallel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jonathan L. Gross, Michal Kotrb\\v{c}\\'ik, Timothy Sun","submitted_at":"2014-07-30T13:13:10Z","abstract_excerpt":"We derive a quadratic-time algorithm for the genus distribution of any 3-regular, biconnected series-parallel graph, which we extend to any biconnected series-parallel graph of maximum degree at most 3. Since the biconnected components of every graph of treewidth 2 are series-parallel graphs, this yields, by use of bar-amalgamation, a quadratic-time algorithm for every graph of treewidth at most 2 and maximum degree at most 3."},"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":"1407.8031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-30T13:13:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c48faeb46b81b4f58791858fb3c7050d641e5abcda6e6f425e23c21a3135fabe","abstract_canon_sha256":"4939ab2306af4a4f539adf357264b4f357bede0b8a18ccdfa21417a4c78d273f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:13.782944Z","signature_b64":"v668ZMu98x6XpCf+cNGgcK5PDoWNb4uEtnAzokv16IEIlQ2p1OTZw48aXsXOYvvbSI9WeVRJF7uvP4KeHUHGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f8ebed8bd30cc704450557c17eee9f58e87ee2be08b91cfb6148dff304a65ae","last_reissued_at":"2026-05-18T02:46:13.781892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:13.781892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genus Distributions of cubic series-parallel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jonathan L. Gross, Michal Kotrb\\v{c}\\'ik, Timothy Sun","submitted_at":"2014-07-30T13:13:10Z","abstract_excerpt":"We derive a quadratic-time algorithm for the genus distribution of any 3-regular, biconnected series-parallel graph, which we extend to any biconnected series-parallel graph of maximum degree at most 3. Since the biconnected components of every graph of treewidth 2 are series-parallel graphs, this yields, by use of bar-amalgamation, a quadratic-time algorithm for every graph of treewidth at most 2 and maximum degree at most 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8031","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":"1407.8031","created_at":"2026-05-18T02:46:13.782001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.8031v1","created_at":"2026-05-18T02:46:13.782001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8031","created_at":"2026-05-18T02:46:13.782001+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6HL5WF5GDGH","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6HL5WF5GDGHARCQ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6HL5WF5","created_at":"2026-05-18T12:28:22.404517+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/B6HL5WF5GDGHARCQKV6BP3XJ6W","json":"https://pith.science/pith/B6HL5WF5GDGHARCQKV6BP3XJ6W.json","graph_json":"https://pith.science/api/pith-number/B6HL5WF5GDGHARCQKV6BP3XJ6W/graph.json","events_json":"https://pith.science/api/pith-number/B6HL5WF5GDGHARCQKV6BP3XJ6W/events.json","paper":"https://pith.science/paper/B6HL5WF5"},"agent_actions":{"view_html":"https://pith.science/pith/B6HL5WF5GDGHARCQKV6BP3XJ6W","download_json":"https://pith.science/pith/B6HL5WF5GDGHARCQKV6BP3XJ6W.json","view_paper":"https://pith.science/paper/B6HL5WF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.8031&json=true","fetch_graph":"https://pith.science/api/pith-number/B6HL5WF5GDGHARCQKV6BP3XJ6W/graph.json","fetch_events":"https://pith.science/api/pith-number/B6HL5WF5GDGHARCQKV6BP3XJ6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6HL5WF5GDGHARCQKV6BP3XJ6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6HL5WF5GDGHARCQKV6BP3XJ6W/action/storage_attestation","attest_author":"https://pith.science/pith/B6HL5WF5GDGHARCQKV6BP3XJ6W/action/author_attestation","sign_citation":"https://pith.science/pith/B6HL5WF5GDGHARCQKV6BP3XJ6W/action/citation_signature","submit_replication":"https://pith.science/pith/B6HL5WF5GDGHARCQKV6BP3XJ6W/action/replication_record"}},"created_at":"2026-05-18T02:46:13.782001+00:00","updated_at":"2026-05-18T02:46:13.782001+00:00"}