{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JYLK664COFBUKGAMRCXVN6VASC","short_pith_number":"pith:JYLK664C","schema_version":"1.0","canonical_sha256":"4e16af7b82714345180c88af56faa090a8fcfdbf82b33dc017e5cb661855d13c","source":{"kind":"arxiv","id":"1004.3392","version":1},"attestation_state":"computed","paper":{"title":"Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Siamak Tazari","submitted_at":"2010-04-20T09:54:55Z","abstract_excerpt":"We improve the running time of the general algorithmic technique known as Baker's approach (1994) on H-minor-free graphs from O(n^{f(|H|)}) to O(f(|H|) n^{O(1)}). The numerous applications include e.g. a 2-approximation for coloring and PTASes for various problems such as dominating set and max-cut, where we obtain similar improvements.\n On classes of odd-minor-free graphs, which have gained significant attention in recent time, we obtain a similar acceleration for a variant of the structural decomposition theorem proved by Demaine et al. (2010). We use these algorithms to derive faster 2-appr"},"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":"1004.3392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-20T09:54:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e39fb860417f1f03145665b1e5d22e1b9181a5b36c823e3275b3e103b48bc2e7","abstract_canon_sha256":"952968a5b2e44869729996f89a969cc5e809fbb2195d94fe5e3a34928e9e1896"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:56.311228Z","signature_b64":"+TSpDx32ZzXIhCIx4+hY1G0wSQ7J2jjQ4lXsYCz/T65WOL82IWbJUB2tB5BWLhTvIewiJcpZagRSDn67gcQ0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e16af7b82714345180c88af56faa090a8fcfdbf82b33dc017e5cb661855d13c","last_reissued_at":"2026-05-18T02:07:56.310550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:56.310550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Siamak Tazari","submitted_at":"2010-04-20T09:54:55Z","abstract_excerpt":"We improve the running time of the general algorithmic technique known as Baker's approach (1994) on H-minor-free graphs from O(n^{f(|H|)}) to O(f(|H|) n^{O(1)}). The numerous applications include e.g. a 2-approximation for coloring and PTASes for various problems such as dominating set and max-cut, where we obtain similar improvements.\n On classes of odd-minor-free graphs, which have gained significant attention in recent time, we obtain a similar acceleration for a variant of the structural decomposition theorem proved by Demaine et al. (2010). We use these algorithms to derive faster 2-appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3392","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":"1004.3392","created_at":"2026-05-18T02:07:56.310669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.3392v1","created_at":"2026-05-18T02:07:56.310669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3392","created_at":"2026-05-18T02:07:56.310669+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYLK664COFBU","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYLK664COFBUKGAM","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYLK664C","created_at":"2026-05-18T12:26:09.077623+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/JYLK664COFBUKGAMRCXVN6VASC","json":"https://pith.science/pith/JYLK664COFBUKGAMRCXVN6VASC.json","graph_json":"https://pith.science/api/pith-number/JYLK664COFBUKGAMRCXVN6VASC/graph.json","events_json":"https://pith.science/api/pith-number/JYLK664COFBUKGAMRCXVN6VASC/events.json","paper":"https://pith.science/paper/JYLK664C"},"agent_actions":{"view_html":"https://pith.science/pith/JYLK664COFBUKGAMRCXVN6VASC","download_json":"https://pith.science/pith/JYLK664COFBUKGAMRCXVN6VASC.json","view_paper":"https://pith.science/paper/JYLK664C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.3392&json=true","fetch_graph":"https://pith.science/api/pith-number/JYLK664COFBUKGAMRCXVN6VASC/graph.json","fetch_events":"https://pith.science/api/pith-number/JYLK664COFBUKGAMRCXVN6VASC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYLK664COFBUKGAMRCXVN6VASC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYLK664COFBUKGAMRCXVN6VASC/action/storage_attestation","attest_author":"https://pith.science/pith/JYLK664COFBUKGAMRCXVN6VASC/action/author_attestation","sign_citation":"https://pith.science/pith/JYLK664COFBUKGAMRCXVN6VASC/action/citation_signature","submit_replication":"https://pith.science/pith/JYLK664COFBUKGAMRCXVN6VASC/action/replication_record"}},"created_at":"2026-05-18T02:07:56.310669+00:00","updated_at":"2026-05-18T02:07:56.310669+00:00"}