{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6ZIEWTSNPOCENCWAVPPRINB6V3","short_pith_number":"pith:6ZIEWTSN","schema_version":"1.0","canonical_sha256":"f6504b4e4d7b84468ac0abdf14343eaeff02e6c0f50ce335cf59c589ff70c362","source":{"kind":"arxiv","id":"1707.05440","version":1},"attestation_state":"computed","paper":{"title":"Packing Plane Spanning Trees and Paths in Complete Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Pilz, Bettina Speckmann, Emo Welzl, Maarten L\\\"offler, Marc van Kreveld, Matias Korman, Oswin Aichholzer, Thomas Hackl","submitted_at":"2017-07-18T02:22:08Z","abstract_excerpt":"We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph $GK_n$ on any set $S$ of $n$ points in general position in the plane? We show that this number is in $\\Omega(\\sqrt{n})$. Further, we consider variants of this problem by bounding the diameter and the degree of the trees (in particular considering spanning paths)."},"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":"1707.05440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-07-18T02:22:08Z","cross_cats_sorted":[],"title_canon_sha256":"6ede0f4ea885546c953063def2ce691213707dc4496be0c0417d47844f0d918d","abstract_canon_sha256":"0356ccae22a7212792b64bfeffa69ec857a32d59295faaa76a75b5a8e205f648"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:02.339037Z","signature_b64":"GSa5bK9IJMLXmsUgu5nHtkQRbTryHxR4HsTCBqd6u3B6JquxPBFBQtCfm+SYF5378G9XRjgTF0VnreoHdB9eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6504b4e4d7b84468ac0abdf14343eaeff02e6c0f50ce335cf59c589ff70c362","last_reissued_at":"2026-05-18T00:40:02.338461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:02.338461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing Plane Spanning Trees and Paths in Complete Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Pilz, Bettina Speckmann, Emo Welzl, Maarten L\\\"offler, Marc van Kreveld, Matias Korman, Oswin Aichholzer, Thomas Hackl","submitted_at":"2017-07-18T02:22:08Z","abstract_excerpt":"We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph $GK_n$ on any set $S$ of $n$ points in general position in the plane? We show that this number is in $\\Omega(\\sqrt{n})$. Further, we consider variants of this problem by bounding the diameter and the degree of the trees (in particular considering spanning paths)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05440","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":"1707.05440","created_at":"2026-05-18T00:40:02.338545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05440v1","created_at":"2026-05-18T00:40:02.338545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05440","created_at":"2026-05-18T00:40:02.338545+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZIEWTSNPOCE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZIEWTSNPOCENCWA","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZIEWTSN","created_at":"2026-05-18T12:31:03.183658+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/6ZIEWTSNPOCENCWAVPPRINB6V3","json":"https://pith.science/pith/6ZIEWTSNPOCENCWAVPPRINB6V3.json","graph_json":"https://pith.science/api/pith-number/6ZIEWTSNPOCENCWAVPPRINB6V3/graph.json","events_json":"https://pith.science/api/pith-number/6ZIEWTSNPOCENCWAVPPRINB6V3/events.json","paper":"https://pith.science/paper/6ZIEWTSN"},"agent_actions":{"view_html":"https://pith.science/pith/6ZIEWTSNPOCENCWAVPPRINB6V3","download_json":"https://pith.science/pith/6ZIEWTSNPOCENCWAVPPRINB6V3.json","view_paper":"https://pith.science/paper/6ZIEWTSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05440&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZIEWTSNPOCENCWAVPPRINB6V3/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZIEWTSNPOCENCWAVPPRINB6V3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZIEWTSNPOCENCWAVPPRINB6V3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZIEWTSNPOCENCWAVPPRINB6V3/action/storage_attestation","attest_author":"https://pith.science/pith/6ZIEWTSNPOCENCWAVPPRINB6V3/action/author_attestation","sign_citation":"https://pith.science/pith/6ZIEWTSNPOCENCWAVPPRINB6V3/action/citation_signature","submit_replication":"https://pith.science/pith/6ZIEWTSNPOCENCWAVPPRINB6V3/action/replication_record"}},"created_at":"2026-05-18T00:40:02.338545+00:00","updated_at":"2026-05-18T00:40:02.338545+00:00"}