{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TUQHGZSW2T57YMPPMJN6SJJZQW","short_pith_number":"pith:TUQHGZSW","schema_version":"1.0","canonical_sha256":"9d20736656d4fbfc31ef625be9253985a9ed031060fafa404c55c9202d8f4d5c","source":{"kind":"arxiv","id":"1104.2486","version":4},"attestation_state":"computed","paper":{"title":"Dynamic Programming for Graphs on Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Ignasi Sau, Juanjo Ru\\'e","submitted_at":"2011-04-13T13:32:08Z","abstract_excerpt":"We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic programming runs in 2^{O(k log k)} n steps. Our approach combines tools from topological graph theory and analytic combinatorics. In particular, we introduce a new type of branch decomposition called \"surface cut decomposition\", generalizing sphere cut decompositions of planar graphs introduced by Seymour and Thomas, which has nice combinatorial properties. Namely, t"},"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":"1104.2486","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-13T13:32:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"555363632e8d6fa795e24f212132d5f4823cfc5c87cf020d93d2b370ad1dfd57","abstract_canon_sha256":"549aecd6d496472e5c3f94e57a188a8da5c1e9838f9c76002db0e3106da7f712"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:09.390407Z","signature_b64":"pAL6xcYTl6lp2X36nDb0cYRXvrwDpodMZbbSfcRAaKJr5p1BqpLxibm0iROdddnbqjnngXwqtP0WH7BtqicWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d20736656d4fbfc31ef625be9253985a9ed031060fafa404c55c9202d8f4d5c","last_reissued_at":"2026-05-18T02:22:09.389768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:09.389768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Programming for Graphs on Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Ignasi Sau, Juanjo Ru\\'e","submitted_at":"2011-04-13T13:32:08Z","abstract_excerpt":"We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic programming runs in 2^{O(k log k)} n steps. Our approach combines tools from topological graph theory and analytic combinatorics. In particular, we introduce a new type of branch decomposition called \"surface cut decomposition\", generalizing sphere cut decompositions of planar graphs introduced by Seymour and Thomas, which has nice combinatorial properties. Namely, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2486","kind":"arxiv","version":4},"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":"1104.2486","created_at":"2026-05-18T02:22:09.389874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2486v4","created_at":"2026-05-18T02:22:09.389874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2486","created_at":"2026-05-18T02:22:09.389874+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUQHGZSW2T57","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUQHGZSW2T57YMPP","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUQHGZSW","created_at":"2026-05-18T12:26:42.757692+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/TUQHGZSW2T57YMPPMJN6SJJZQW","json":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW.json","graph_json":"https://pith.science/api/pith-number/TUQHGZSW2T57YMPPMJN6SJJZQW/graph.json","events_json":"https://pith.science/api/pith-number/TUQHGZSW2T57YMPPMJN6SJJZQW/events.json","paper":"https://pith.science/paper/TUQHGZSW"},"agent_actions":{"view_html":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW","download_json":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW.json","view_paper":"https://pith.science/paper/TUQHGZSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2486&json=true","fetch_graph":"https://pith.science/api/pith-number/TUQHGZSW2T57YMPPMJN6SJJZQW/graph.json","fetch_events":"https://pith.science/api/pith-number/TUQHGZSW2T57YMPPMJN6SJJZQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/action/storage_attestation","attest_author":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/action/author_attestation","sign_citation":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/action/citation_signature","submit_replication":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/action/replication_record"}},"created_at":"2026-05-18T02:22:09.389874+00:00","updated_at":"2026-05-18T02:22:09.389874+00:00"}