{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6YNVDXX2DHMMVVTVCRJR5HPGOJ","short_pith_number":"pith:6YNVDXX2","schema_version":"1.0","canonical_sha256":"f61b51defa19d8cad67514531e9de6726675ed438364c228ff7428062f86858e","source":{"kind":"arxiv","id":"1312.4101","version":1},"attestation_state":"computed","paper":{"title":"Trees and co-trees with constant maximum degree in planar 3-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Therese Biedl","submitted_at":"2013-12-15T02:45:07Z","abstract_excerpt":"This paper considers the conjecture by Gr\\\"unbaum that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 3. Here, the co-tree of $T$ is the spanning tree of the dual obtained by taking the duals of the non-tree edges. While Gr\\\"unbaum's conjecture remains open, we show that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 5. It can be found in linear time."},"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":"1312.4101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-15T02:45:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7b783dd862643ecd860a04df4f16aaedbb7720e2c5d1c431c33ca1adc3d9d3b5","abstract_canon_sha256":"dedb295fd10ea676b0ddef75cf4077258cb0974ada0f3764998f3a98f01590b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:35.722645Z","signature_b64":"k0/w4pWlUddbVDJv5Dxud239u2pEbVoOrqEsTvi3guR8fTT1pT7cdC3IA3IQ0pfi3b8QC20OsKKFIq5qCW/3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f61b51defa19d8cad67514531e9de6726675ed438364c228ff7428062f86858e","last_reissued_at":"2026-05-18T03:04:35.721695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:35.721695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trees and co-trees with constant maximum degree in planar 3-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Therese Biedl","submitted_at":"2013-12-15T02:45:07Z","abstract_excerpt":"This paper considers the conjecture by Gr\\\"unbaum that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 3. Here, the co-tree of $T$ is the spanning tree of the dual obtained by taking the duals of the non-tree edges. While Gr\\\"unbaum's conjecture remains open, we show that every planar 3-connected graph has a spanning tree $T$ such that both $T$ and its co-tree have maximum degree at most 5. It can be found in linear time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4101","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":"1312.4101","created_at":"2026-05-18T03:04:35.721859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4101v1","created_at":"2026-05-18T03:04:35.721859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4101","created_at":"2026-05-18T03:04:35.721859+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YNVDXX2DHMM","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YNVDXX2DHMMVVTV","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YNVDXX2","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.29743","citing_title":"3-packings in Triangulations: Algorithms, bounds, and Complexity","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6YNVDXX2DHMMVVTVCRJR5HPGOJ","json":"https://pith.science/pith/6YNVDXX2DHMMVVTVCRJR5HPGOJ.json","graph_json":"https://pith.science/api/pith-number/6YNVDXX2DHMMVVTVCRJR5HPGOJ/graph.json","events_json":"https://pith.science/api/pith-number/6YNVDXX2DHMMVVTVCRJR5HPGOJ/events.json","paper":"https://pith.science/paper/6YNVDXX2"},"agent_actions":{"view_html":"https://pith.science/pith/6YNVDXX2DHMMVVTVCRJR5HPGOJ","download_json":"https://pith.science/pith/6YNVDXX2DHMMVVTVCRJR5HPGOJ.json","view_paper":"https://pith.science/paper/6YNVDXX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4101&json=true","fetch_graph":"https://pith.science/api/pith-number/6YNVDXX2DHMMVVTVCRJR5HPGOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6YNVDXX2DHMMVVTVCRJR5HPGOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YNVDXX2DHMMVVTVCRJR5HPGOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YNVDXX2DHMMVVTVCRJR5HPGOJ/action/storage_attestation","attest_author":"https://pith.science/pith/6YNVDXX2DHMMVVTVCRJR5HPGOJ/action/author_attestation","sign_citation":"https://pith.science/pith/6YNVDXX2DHMMVVTVCRJR5HPGOJ/action/citation_signature","submit_replication":"https://pith.science/pith/6YNVDXX2DHMMVVTVCRJR5HPGOJ/action/replication_record"}},"created_at":"2026-05-18T03:04:35.721859+00:00","updated_at":"2026-05-18T03:04:35.721859+00:00"}