{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ITCIT4RJ53R3TFS4F6QXBAL4CK","short_pith_number":"pith:ITCIT4RJ","canonical_record":{"source":{"id":"1305.7112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-30T13:55:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"00368f004fc9b6ea509533641c3fba2880f760d5c2c02e1b8b6ed8627cd87ce9","abstract_canon_sha256":"a7b913e74a0a3d826a12f8dd63d55ab52b89bf5dced80fdb2e501760347d18fe"},"schema_version":"1.0"},"canonical_sha256":"44c489f229eee3b9965c2fa170817c12a81db49593b3d5e2b2d1f18ac2fc51b3","source":{"kind":"arxiv","id":"1305.7112","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7112","created_at":"2026-05-18T01:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7112v2","created_at":"2026-05-18T01:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7112","created_at":"2026-05-18T01:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"ITCIT4RJ53R3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"ITCIT4RJ53R3TFS4","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"ITCIT4RJ","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ITCIT4RJ53R3TFS4F6QXBAL4CK","target":"record","payload":{"canonical_record":{"source":{"id":"1305.7112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-30T13:55:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"00368f004fc9b6ea509533641c3fba2880f760d5c2c02e1b8b6ed8627cd87ce9","abstract_canon_sha256":"a7b913e74a0a3d826a12f8dd63d55ab52b89bf5dced80fdb2e501760347d18fe"},"schema_version":"1.0"},"canonical_sha256":"44c489f229eee3b9965c2fa170817c12a81db49593b3d5e2b2d1f18ac2fc51b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:37.125176Z","signature_b64":"SGLQmDI0ZENVnVsdqqaFnEs2jI+EuNonTvjTYpXqtMr/bK0CU0ko9l9uPBZgHtnRAq9VerA3+MqwvD35ftOdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44c489f229eee3b9965c2fa170817c12a81db49593b3d5e2b2d1f18ac2fc51b3","last_reissued_at":"2026-05-18T01:27:37.124525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:37.124525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.7112","source_version":2,"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-18T01:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/3Jy6xwHt8OXEgAAI1VQHstmAY75fZdIFGmU+SaJg2uUwDyIXkhOT0tyyXplFPUIyQVbWhvLgwgcUHwMStkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:39:00.080386Z"},"content_sha256":"2b88be442e22fcf12a2a106fff0f65702cf32dd216749591e65715c2df71e2df","schema_version":"1.0","event_id":"sha256:2b88be442e22fcf12a2a106fff0f65702cf32dd216749591e65715c2df71e2df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ITCIT4RJ53R3TFS4F6QXBAL4CK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Polynomial Exclusion of Planar Graph Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dimitrios M. Thilikos, Jean-Florent Raymond","submitted_at":"2013-05-30T13:55:29Z","abstract_excerpt":"The celebrated grid exclusion theorem states that for every $h$-vertex planar graph $H$, there is a constant $c_{h}$ such that if a graph $G$ does not contain $H$ as a minor then $G$ has treewidth at most $c_{h}$. We are looking for patterns of $H$ where this bound can become a low degree polynomial. We provide such bounds for the following parameterized graphs: the wheel ($c_{h}=O(h)$), the double wheel ($c_{h}=O(h^2\\cdot \\log^{2} h)$), any graph of pathwidth at most 2 ($c_{h}=O(h^{2})$), and the yurt graph ($c_{h}=O(h^{4})$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7112","kind":"arxiv","version":2},"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-18T01:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REEEq2soEg+92/5lF5XLr3Aa54bYsSt52/RGFsl9Zg4tQQTBTz5GNVFduIv2Ia9+MSxxx/uBjKTArdyvQR2+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:39:00.081082Z"},"content_sha256":"46169c926c869cc8a8785519b6fcc2c2d139ecdababc7d5d8f3a67f7706c811e","schema_version":"1.0","event_id":"sha256:46169c926c869cc8a8785519b6fcc2c2d139ecdababc7d5d8f3a67f7706c811e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITCIT4RJ53R3TFS4F6QXBAL4CK/bundle.json","state_url":"https://pith.science/pith/ITCIT4RJ53R3TFS4F6QXBAL4CK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITCIT4RJ53R3TFS4F6QXBAL4CK/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-25T19:39:00Z","links":{"resolver":"https://pith.science/pith/ITCIT4RJ53R3TFS4F6QXBAL4CK","bundle":"https://pith.science/pith/ITCIT4RJ53R3TFS4F6QXBAL4CK/bundle.json","state":"https://pith.science/pith/ITCIT4RJ53R3TFS4F6QXBAL4CK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITCIT4RJ53R3TFS4F6QXBAL4CK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ITCIT4RJ53R3TFS4F6QXBAL4CK","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":"a7b913e74a0a3d826a12f8dd63d55ab52b89bf5dced80fdb2e501760347d18fe","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-30T13:55:29Z","title_canon_sha256":"00368f004fc9b6ea509533641c3fba2880f760d5c2c02e1b8b6ed8627cd87ce9"},"schema_version":"1.0","source":{"id":"1305.7112","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7112","created_at":"2026-05-18T01:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7112v2","created_at":"2026-05-18T01:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7112","created_at":"2026-05-18T01:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"ITCIT4RJ53R3","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"ITCIT4RJ53R3TFS4","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"ITCIT4RJ","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:46169c926c869cc8a8785519b6fcc2c2d139ecdababc7d5d8f3a67f7706c811e","target":"graph","created_at":"2026-05-18T01:27:37Z","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":"The celebrated grid exclusion theorem states that for every $h$-vertex planar graph $H$, there is a constant $c_{h}$ such that if a graph $G$ does not contain $H$ as a minor then $G$ has treewidth at most $c_{h}$. We are looking for patterns of $H$ where this bound can become a low degree polynomial. We provide such bounds for the following parameterized graphs: the wheel ($c_{h}=O(h)$), the double wheel ($c_{h}=O(h^2\\cdot \\log^{2} h)$), any graph of pathwidth at most 2 ($c_{h}=O(h^{2})$), and the yurt graph ($c_{h}=O(h^{4})$).","authors_text":"Dimitrios M. Thilikos, Jean-Florent Raymond","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-30T13:55:29Z","title":"Low Polynomial Exclusion of Planar Graph Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7112","kind":"arxiv","version":2},"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:2b88be442e22fcf12a2a106fff0f65702cf32dd216749591e65715c2df71e2df","target":"record","created_at":"2026-05-18T01:27:37Z","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":"a7b913e74a0a3d826a12f8dd63d55ab52b89bf5dced80fdb2e501760347d18fe","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-30T13:55:29Z","title_canon_sha256":"00368f004fc9b6ea509533641c3fba2880f760d5c2c02e1b8b6ed8627cd87ce9"},"schema_version":"1.0","source":{"id":"1305.7112","kind":"arxiv","version":2}},"canonical_sha256":"44c489f229eee3b9965c2fa170817c12a81db49593b3d5e2b2d1f18ac2fc51b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44c489f229eee3b9965c2fa170817c12a81db49593b3d5e2b2d1f18ac2fc51b3","first_computed_at":"2026-05-18T01:27:37.124525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:37.124525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SGLQmDI0ZENVnVsdqqaFnEs2jI+EuNonTvjTYpXqtMr/bK0CU0ko9l9uPBZgHtnRAq9VerA3+MqwvD35ftOdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:37.125176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.7112","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b88be442e22fcf12a2a106fff0f65702cf32dd216749591e65715c2df71e2df","sha256:46169c926c869cc8a8785519b6fcc2c2d139ecdababc7d5d8f3a67f7706c811e"],"state_sha256":"c451496b26a03910977ada3cb5b68719e08018b0e9bb8d9e4b745ea42ea7942d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ByIeTa5/VHnWsqU7pACJo8/72iqK31x4Ewi9cBG/MOEs4llm38qS7ffphIKXguX4dDlV8XvhpiAXLfznGNm3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:39:00.084849Z","bundle_sha256":"553b57eb2a4bdfe493ae354ab4eec8e82e3494a8219bc2b65f341cbf3c59211c"}}