{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AFLEARPE5GWXFJGSGXO2HH2LQN","short_pith_number":"pith:AFLEARPE","schema_version":"1.0","canonical_sha256":"01564045e4e9ad72a4d235dda39f4b835161612cb410afa43a406acab7623c7b","source":{"kind":"arxiv","id":"1706.08581","version":1},"attestation_state":"computed","paper":{"title":"Treewidth Bounds for Planar Graphs Using Three-Sided Brambles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett C. Smith, Karen L. Collins","submitted_at":"2017-06-26T20:15:26Z","abstract_excerpt":"Square grids play a pivotal role in Robertson and Seymour's work on graph minors as planar obstructions to small treewidth. We introduce a three-sided bramble in a plane graph called a net, which generalizes the standard bramble of crosses in a square grid. We then characterize any minimal cover of a net as a tree drawn in the plane.\n  We use nets in an $O(n^3)$ time algorithm that computes both upper and lower bounds on the bramble number (hence treewidth) of any planar graph. Let $G$ be a planar graph, $BN(G)$ be its bramble number and $\\lambda(G)$ be the largest order of any net in a subgra"},"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":"1706.08581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-26T20:15:26Z","cross_cats_sorted":[],"title_canon_sha256":"ef9ce4cc4401fc5eb9829f2f877ad50046a3f71eefe9ae15ecc0e7fb91098184","abstract_canon_sha256":"f136fb751b8e9318991f34366322dec9756818e58baac7176c0689e5b876d0c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.659135Z","signature_b64":"fn0ynMm9V+djDuwgkmezTWEY/m7ChYVq/S+umjGQUzZ8aK7KFxzFN8jGfGCy9ixASxZ/gXgmLFM7+Pezp8atCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01564045e4e9ad72a4d235dda39f4b835161612cb410afa43a406acab7623c7b","last_reissued_at":"2026-05-18T00:41:31.658542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.658542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Treewidth Bounds for Planar Graphs Using Three-Sided Brambles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brett C. Smith, Karen L. Collins","submitted_at":"2017-06-26T20:15:26Z","abstract_excerpt":"Square grids play a pivotal role in Robertson and Seymour's work on graph minors as planar obstructions to small treewidth. We introduce a three-sided bramble in a plane graph called a net, which generalizes the standard bramble of crosses in a square grid. We then characterize any minimal cover of a net as a tree drawn in the plane.\n  We use nets in an $O(n^3)$ time algorithm that computes both upper and lower bounds on the bramble number (hence treewidth) of any planar graph. Let $G$ be a planar graph, $BN(G)$ be its bramble number and $\\lambda(G)$ be the largest order of any net in a subgra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08581","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":"1706.08581","created_at":"2026-05-18T00:41:31.658656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08581v1","created_at":"2026-05-18T00:41:31.658656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08581","created_at":"2026-05-18T00:41:31.658656+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFLEARPE5GWX","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFLEARPE5GWXFJGS","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFLEARPE","created_at":"2026-05-18T12:31:05.417338+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/AFLEARPE5GWXFJGSGXO2HH2LQN","json":"https://pith.science/pith/AFLEARPE5GWXFJGSGXO2HH2LQN.json","graph_json":"https://pith.science/api/pith-number/AFLEARPE5GWXFJGSGXO2HH2LQN/graph.json","events_json":"https://pith.science/api/pith-number/AFLEARPE5GWXFJGSGXO2HH2LQN/events.json","paper":"https://pith.science/paper/AFLEARPE"},"agent_actions":{"view_html":"https://pith.science/pith/AFLEARPE5GWXFJGSGXO2HH2LQN","download_json":"https://pith.science/pith/AFLEARPE5GWXFJGSGXO2HH2LQN.json","view_paper":"https://pith.science/paper/AFLEARPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08581&json=true","fetch_graph":"https://pith.science/api/pith-number/AFLEARPE5GWXFJGSGXO2HH2LQN/graph.json","fetch_events":"https://pith.science/api/pith-number/AFLEARPE5GWXFJGSGXO2HH2LQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFLEARPE5GWXFJGSGXO2HH2LQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFLEARPE5GWXFJGSGXO2HH2LQN/action/storage_attestation","attest_author":"https://pith.science/pith/AFLEARPE5GWXFJGSGXO2HH2LQN/action/author_attestation","sign_citation":"https://pith.science/pith/AFLEARPE5GWXFJGSGXO2HH2LQN/action/citation_signature","submit_replication":"https://pith.science/pith/AFLEARPE5GWXFJGSGXO2HH2LQN/action/replication_record"}},"created_at":"2026-05-18T00:41:31.658656+00:00","updated_at":"2026-05-18T00:41:31.658656+00:00"}