{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TUQHGZSW2T57YMPPMJN6SJJZQW","short_pith_number":"pith:TUQHGZSW","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"},"canonical_sha256":"9d20736656d4fbfc31ef625be9253985a9ed031060fafa404c55c9202d8f4d5c","source":{"kind":"arxiv","id":"1104.2486","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2486","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2486v4","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2486","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"TUQHGZSW2T57","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TUQHGZSW2T57YMPP","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TUQHGZSW","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TUQHGZSW2T57YMPPMJN6SJJZQW","target":"record","payload":{"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"},"canonical_sha256":"9d20736656d4fbfc31ef625be9253985a9ed031060fafa404c55c9202d8f4d5c","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"},"source_kind":"arxiv","source_id":"1104.2486","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2ct/xQVEQbSHlwgUAmMeZ5UTwdzM+3zJ7yZZKXTu+6533nEga9i+B+lopJKfDe7Kw6XAQpVMNSYiwsmRmlcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:04:57.957121Z"},"content_sha256":"ca278b2b0e46486135c1f14998c95d1d2ec37a28ff9db76a2c1f13ea2e9ee7d6","schema_version":"1.0","event_id":"sha256:ca278b2b0e46486135c1f14998c95d1d2ec37a28ff9db76a2c1f13ea2e9ee7d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TUQHGZSW2T57YMPPMJN6SJJZQW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNidyWy2nu5doqor5df9Vq22toJYs+o18RK/8rZrBEkkgnAmYrXixxW2X7UKIOUKmbLgMj4yLBYYljHBowXrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:04:57.957773Z"},"content_sha256":"6f50d68316d284aeab01c52cbb97fbe7ae94a3b69e147a6d3da15ef29b1c6b58","schema_version":"1.0","event_id":"sha256:6f50d68316d284aeab01c52cbb97fbe7ae94a3b69e147a6d3da15ef29b1c6b58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/bundle.json","state_url":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T08:04:57Z","links":{"resolver":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW","bundle":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/bundle.json","state":"https://pith.science/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUQHGZSW2T57YMPPMJN6SJJZQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TUQHGZSW2T57YMPPMJN6SJJZQW","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":"549aecd6d496472e5c3f94e57a188a8da5c1e9838f9c76002db0e3106da7f712","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-13T13:32:08Z","title_canon_sha256":"555363632e8d6fa795e24f212132d5f4823cfc5c87cf020d93d2b370ad1dfd57"},"schema_version":"1.0","source":{"id":"1104.2486","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2486","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2486v4","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2486","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"TUQHGZSW2T57","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TUQHGZSW2T57YMPP","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TUQHGZSW","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:6f50d68316d284aeab01c52cbb97fbe7ae94a3b69e147a6d3da15ef29b1c6b58","target":"graph","created_at":"2026-05-18T02:22:09Z","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 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","authors_text":"Dimitrios M. Thilikos, Ignasi Sau, Juanjo Ru\\'e","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-13T13:32:08Z","title":"Dynamic Programming for Graphs on Surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2486","kind":"arxiv","version":4},"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:ca278b2b0e46486135c1f14998c95d1d2ec37a28ff9db76a2c1f13ea2e9ee7d6","target":"record","created_at":"2026-05-18T02:22:09Z","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":"549aecd6d496472e5c3f94e57a188a8da5c1e9838f9c76002db0e3106da7f712","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-13T13:32:08Z","title_canon_sha256":"555363632e8d6fa795e24f212132d5f4823cfc5c87cf020d93d2b370ad1dfd57"},"schema_version":"1.0","source":{"id":"1104.2486","kind":"arxiv","version":4}},"canonical_sha256":"9d20736656d4fbfc31ef625be9253985a9ed031060fafa404c55c9202d8f4d5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d20736656d4fbfc31ef625be9253985a9ed031060fafa404c55c9202d8f4d5c","first_computed_at":"2026-05-18T02:22:09.389768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:09.389768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pAL6xcYTl6lp2X36nDb0cYRXvrwDpodMZbbSfcRAaKJr5p1BqpLxibm0iROdddnbqjnngXwqtP0WH7BtqicWAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:09.390407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2486","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca278b2b0e46486135c1f14998c95d1d2ec37a28ff9db76a2c1f13ea2e9ee7d6","sha256:6f50d68316d284aeab01c52cbb97fbe7ae94a3b69e147a6d3da15ef29b1c6b58"],"state_sha256":"0326413776811ca61ffcb95d98c9557483f406605a38784f95184dad4d5b4926"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8GEuE7KRPxfQwo1n4/pQ8Rgd9YWBVcmrkv9x9t0AZTzlCbOBQ+aSY1e7t8ByOl3U0fyocUq7GCjZ/ms1wKEWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:04:57.960587Z","bundle_sha256":"1a2c18503b2b62166832d2af757d6f2e1042d567dcab414039b5c359b32e3ef6"}}