{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EGAIBPXPHRBQYCZKPTNNK5SH4F","short_pith_number":"pith:EGAIBPXP","schema_version":"1.0","canonical_sha256":"218080beef3c430c0b2a7cdad57647e15acf976b92006b2c03695634ae1fb851","source":{"kind":"arxiv","id":"1803.02385","version":2},"attestation_state":"computed","paper":{"title":"Packing Plane Spanning Trees into a Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Alfredo Garc\\'ia","submitted_at":"2018-03-06T19:11:36Z","abstract_excerpt":"Let $P$ be a set of $n$ points in the plane in general position. We show that at least $\\lfloor n/3\\rfloor$ plane spanning trees can be packed into the complete geometric graph on $P$. This improves the previous best known lower bound $\\Omega\\left(\\sqrt{n}\\right)$. Towards our proof of this lower bound we show that the center of a set of points, in the $d$-dimensional space in general position, is of dimension either $0$ or $d$."},"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":"1803.02385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-06T19:11:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b5e006077839070807ff57655ffc4b667faa9e325a87c8937754690cdbc2414e","abstract_canon_sha256":"bc1e06bddcc470aaf9365502592960ac3ea2bf62268b7168a7e7abea6beb132b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:53.336974Z","signature_b64":"WP0wWXrwPZ3dSezfb1oBDmcNAWH+bzvhIoK40Ll7yvQDqH/L7l6FFoSIW2sojJuGxMVeRlaUaa4Lgf9xf0/mBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"218080beef3c430c0b2a7cdad57647e15acf976b92006b2c03695634ae1fb851","last_reissued_at":"2026-05-17T23:52:53.336105Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:53.336105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing Plane Spanning Trees into a Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Ahmad Biniaz, Alfredo Garc\\'ia","submitted_at":"2018-03-06T19:11:36Z","abstract_excerpt":"Let $P$ be a set of $n$ points in the plane in general position. We show that at least $\\lfloor n/3\\rfloor$ plane spanning trees can be packed into the complete geometric graph on $P$. This improves the previous best known lower bound $\\Omega\\left(\\sqrt{n}\\right)$. Towards our proof of this lower bound we show that the center of a set of points, in the $d$-dimensional space in general position, is of dimension either $0$ or $d$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02385","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.02385","created_at":"2026-05-17T23:52:53.336343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02385v2","created_at":"2026-05-17T23:52:53.336343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02385","created_at":"2026-05-17T23:52:53.336343+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGAIBPXPHRBQ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGAIBPXPHRBQYCZK","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGAIBPXP","created_at":"2026-05-18T12:32:22.470017+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/EGAIBPXPHRBQYCZKPTNNK5SH4F","json":"https://pith.science/pith/EGAIBPXPHRBQYCZKPTNNK5SH4F.json","graph_json":"https://pith.science/api/pith-number/EGAIBPXPHRBQYCZKPTNNK5SH4F/graph.json","events_json":"https://pith.science/api/pith-number/EGAIBPXPHRBQYCZKPTNNK5SH4F/events.json","paper":"https://pith.science/paper/EGAIBPXP"},"agent_actions":{"view_html":"https://pith.science/pith/EGAIBPXPHRBQYCZKPTNNK5SH4F","download_json":"https://pith.science/pith/EGAIBPXPHRBQYCZKPTNNK5SH4F.json","view_paper":"https://pith.science/paper/EGAIBPXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02385&json=true","fetch_graph":"https://pith.science/api/pith-number/EGAIBPXPHRBQYCZKPTNNK5SH4F/graph.json","fetch_events":"https://pith.science/api/pith-number/EGAIBPXPHRBQYCZKPTNNK5SH4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGAIBPXPHRBQYCZKPTNNK5SH4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGAIBPXPHRBQYCZKPTNNK5SH4F/action/storage_attestation","attest_author":"https://pith.science/pith/EGAIBPXPHRBQYCZKPTNNK5SH4F/action/author_attestation","sign_citation":"https://pith.science/pith/EGAIBPXPHRBQYCZKPTNNK5SH4F/action/citation_signature","submit_replication":"https://pith.science/pith/EGAIBPXPHRBQYCZKPTNNK5SH4F/action/replication_record"}},"created_at":"2026-05-17T23:52:53.336343+00:00","updated_at":"2026-05-17T23:52:53.336343+00:00"}