{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6Z5K2IWVZF5ZXNVPFPTDE7KOVM","short_pith_number":"pith:6Z5K2IWV","schema_version":"1.0","canonical_sha256":"f67aad22d5c97b9bb6af2be6327d4eab1118ec52dd0256485eff749daa3bca99","source":{"kind":"arxiv","id":"1207.1500","version":1},"attestation_state":"computed","paper":{"title":"The Erd\\H{o}s-S\\'os Conjecture for Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cynthia Rodr\\'iguez, Dolores Lara, Francisco Zaragoza, Gelasio Salazar, Jes\\'us Lea\\~nos, Luis F. Barba, Ruy Fabila-Monroy","submitted_at":"2012-07-06T01:16:15Z","abstract_excerpt":"Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that $(1/2)\\frac{n^2}{k-1}-\\frac{n}{2}\\le f(n,k) \\le 2 \\frac{n(n-2)}{k-2}$. For the case when $k=n$, we show that $2 \\le f(n,n) \\le 3$. For the case when $k=n$ and $G$ is a geometric graph on a set of points in convex position, we show that at least three edges must be removed."},"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":"1207.1500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-06T01:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"b8929e600b3aaebf3bc96343a143bd24ac1e6bbe03583e21528061964ccf195a","abstract_canon_sha256":"f390595650b500d388f30d0088171751b5a492b0df5dfbbc44dc7ed737b911c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.003095Z","signature_b64":"ePs6BFLVfDECum9BepWmr9/rUpSBhjiIITRvvDG8eVDWtF8VSiMPJzq4Z2yCJxYF98i5OGmPz9rKTQqIHXMWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f67aad22d5c97b9bb6af2be6327d4eab1118ec52dd0256485eff749daa3bca99","last_reissued_at":"2026-05-18T03:51:37.002626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.002626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Erd\\H{o}s-S\\'os Conjecture for Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cynthia Rodr\\'iguez, Dolores Lara, Francisco Zaragoza, Gelasio Salazar, Jes\\'us Lea\\~nos, Luis F. Barba, Ruy Fabila-Monroy","submitted_at":"2012-07-06T01:16:15Z","abstract_excerpt":"Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that $(1/2)\\frac{n^2}{k-1}-\\frac{n}{2}\\le f(n,k) \\le 2 \\frac{n(n-2)}{k-2}$. For the case when $k=n$, we show that $2 \\le f(n,n) \\le 3$. For the case when $k=n$ and $G$ is a geometric graph on a set of points in convex position, we show that at least three edges must be removed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1500","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":"1207.1500","created_at":"2026-05-18T03:51:37.002692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1500v1","created_at":"2026-05-18T03:51:37.002692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1500","created_at":"2026-05-18T03:51:37.002692+00:00"},{"alias_kind":"pith_short_12","alias_value":"6Z5K2IWVZF5Z","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6Z5K2IWVZF5ZXNVP","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6Z5K2IWV","created_at":"2026-05-18T12:26:56.085431+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/6Z5K2IWVZF5ZXNVPFPTDE7KOVM","json":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM.json","graph_json":"https://pith.science/api/pith-number/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/graph.json","events_json":"https://pith.science/api/pith-number/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/events.json","paper":"https://pith.science/paper/6Z5K2IWV"},"agent_actions":{"view_html":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM","download_json":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM.json","view_paper":"https://pith.science/paper/6Z5K2IWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1500&json=true","fetch_graph":"https://pith.science/api/pith-number/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/graph.json","fetch_events":"https://pith.science/api/pith-number/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/action/storage_attestation","attest_author":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/action/author_attestation","sign_citation":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/action/citation_signature","submit_replication":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/action/replication_record"}},"created_at":"2026-05-18T03:51:37.002692+00:00","updated_at":"2026-05-18T03:51:37.002692+00:00"}