{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YKECDKKDHY4UVXR5LXRZZG2TES","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":"880f56106f8ab2be478b3bd4a1f71920f17032169c21e9abed2398cd5a65dd97","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-06T09:08:45Z","title_canon_sha256":"2a6e94fb241ee547d41faf9ab76abe93fe5cdf9199c86efd33891f83bc3e2b3e"},"schema_version":"1.0","source":{"id":"2503.04228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.04228","created_at":"2026-07-05T10:25:32Z"},{"alias_kind":"arxiv_version","alias_value":"2503.04228v1","created_at":"2026-07-05T10:25:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.04228","created_at":"2026-07-05T10:25:32Z"},{"alias_kind":"pith_short_12","alias_value":"YKECDKKDHY4U","created_at":"2026-07-05T10:25:32Z"},{"alias_kind":"pith_short_16","alias_value":"YKECDKKDHY4UVXR5","created_at":"2026-07-05T10:25:32Z"},{"alias_kind":"pith_short_8","alias_value":"YKECDKKD","created_at":"2026-07-05T10:25:32Z"}],"graph_snapshots":[{"event_id":"sha256:bdd01960cc25b1b3d43723c9844f56d3af3aeb63bce9e9d8285fb2a5100f5a6c","target":"graph","created_at":"2026-07-05T10:25:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.04228/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $A$ is \"apex\" if $A-z$ is planar for some vertex $z\\in V(A)$. Eppstein [Algorithmica, 2000] showed that for a minor-closed class $\\mathcal{G}$, the graphs in $\\mathcal{G}$ with bounded radius have bounded treewidth if and only if some apex graph is not in $\\mathcal{G}$. In particular, for every apex graph $A$ and integer $r$, there is a minimum integer $g(A,r)$ such that every $A$-minor-free graph with radius $r$ has treewidth at most $g(A,r)$. We show that if $t=|V(A)|$ then $g(A,r)\\in O^\\ast(r^9t^{18})$ which is the first upper bound on $g(A,r)$ with polynomial dependence on both $r$","authors_text":"David R. Wood, Kevin Hendrey","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-06T09:08:45Z","title":"Polynomial Bounds in the Apex Minor Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.04228","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:c39ebc2fc896947181abd72690bb48ffadb9df42b4c22f20e295c74d00d1725c","target":"record","created_at":"2026-07-05T10:25:32Z","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":"880f56106f8ab2be478b3bd4a1f71920f17032169c21e9abed2398cd5a65dd97","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-06T09:08:45Z","title_canon_sha256":"2a6e94fb241ee547d41faf9ab76abe93fe5cdf9199c86efd33891f83bc3e2b3e"},"schema_version":"1.0","source":{"id":"2503.04228","kind":"arxiv","version":1}},"canonical_sha256":"c28821a9433e394ade3d5de39c9b5324b73c7301885cc6283179d804b6feacfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c28821a9433e394ade3d5de39c9b5324b73c7301885cc6283179d804b6feacfd","first_computed_at":"2026-07-05T10:25:32.834531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:25:32.834531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ucr9M5BBURwDwdcMgn+V2grO7KVXr8nRXgGi/fQnUixn4Ze7nQ+wOHc1BDnzb/uxmPEwUvl+gvNdSKPjOJ4tDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:25:32.835713Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.04228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c39ebc2fc896947181abd72690bb48ffadb9df42b4c22f20e295c74d00d1725c","sha256:bdd01960cc25b1b3d43723c9844f56d3af3aeb63bce9e9d8285fb2a5100f5a6c"],"state_sha256":"9168b14e8a480ee520108253b68a996d229a5282a7c8c5849e565d7fcc34f363"}