{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6Z5K2IWVZF5ZXNVPFPTDE7KOVM","short_pith_number":"pith:6Z5K2IWV","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"},"canonical_sha256":"f67aad22d5c97b9bb6af2be6327d4eab1118ec52dd0256485eff749daa3bca99","source":{"kind":"arxiv","id":"1207.1500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1500","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1500v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1500","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"6Z5K2IWVZF5Z","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6Z5K2IWVZF5ZXNVP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6Z5K2IWV","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6Z5K2IWVZF5ZXNVPFPTDE7KOVM","target":"record","payload":{"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"},"canonical_sha256":"f67aad22d5c97b9bb6af2be6327d4eab1118ec52dd0256485eff749daa3bca99","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"},"source_kind":"arxiv","source_id":"1207.1500","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3a+FfdCyVBNZfERZqBYltvvyfGBJH2ss+gOCf5K2tvtgC+vmlJDrAdnkQEubR3N3/+7ndgS6K2MBgOvC4JiWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:52:27.244964Z"},"content_sha256":"37dd303ea36c3ed748fb1a64da47f76ca37b1baa3c71c73f1d368a685655e845","schema_version":"1.0","event_id":"sha256:37dd303ea36c3ed748fb1a64da47f76ca37b1baa3c71c73f1d368a685655e845"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6Z5K2IWVZF5ZXNVPFPTDE7KOVM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zTtT2/q2n8twIHfqs73NjMDMDV8hkVx7VvWLq3PMy/CMeLxf17QWgSepHdZA9XinDH5FppKy8HV4W56NJDtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:52:27.245347Z"},"content_sha256":"d9dd8cc8739b4e4f50c42b026c132607d794244567bd986dba5ceab924fa092c","schema_version":"1.0","event_id":"sha256:d9dd8cc8739b4e4f50c42b026c132607d794244567bd986dba5ceab924fa092c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/bundle.json","state_url":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T17:52:27Z","links":{"resolver":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM","bundle":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/bundle.json","state":"https://pith.science/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Z5K2IWVZF5ZXNVPFPTDE7KOVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6Z5K2IWVZF5ZXNVPFPTDE7KOVM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f390595650b500d388f30d0088171751b5a492b0df5dfbbc44dc7ed737b911c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-06T01:16:15Z","title_canon_sha256":"b8929e600b3aaebf3bc96343a143bd24ac1e6bbe03583e21528061964ccf195a"},"schema_version":"1.0","source":{"id":"1207.1500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1500","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1500v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1500","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"6Z5K2IWVZF5Z","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6Z5K2IWVZF5ZXNVP","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6Z5K2IWV","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:d9dd8cc8739b4e4f50c42b026c132607d794244567bd986dba5ceab924fa092c","target":"graph","created_at":"2026-05-18T03:51:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Cynthia Rodr\\'iguez, Dolores Lara, Francisco Zaragoza, Gelasio Salazar, Jes\\'us Lea\\~nos, Luis F. Barba, Ruy Fabila-Monroy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-06T01:16:15Z","title":"The Erd\\H{o}s-S\\'os Conjecture for Geometric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1500","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:37dd303ea36c3ed748fb1a64da47f76ca37b1baa3c71c73f1d368a685655e845","target":"record","created_at":"2026-05-18T03:51:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f390595650b500d388f30d0088171751b5a492b0df5dfbbc44dc7ed737b911c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-06T01:16:15Z","title_canon_sha256":"b8929e600b3aaebf3bc96343a143bd24ac1e6bbe03583e21528061964ccf195a"},"schema_version":"1.0","source":{"id":"1207.1500","kind":"arxiv","version":1}},"canonical_sha256":"f67aad22d5c97b9bb6af2be6327d4eab1118ec52dd0256485eff749daa3bca99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f67aad22d5c97b9bb6af2be6327d4eab1118ec52dd0256485eff749daa3bca99","first_computed_at":"2026-05-18T03:51:37.002626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.002626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ePs6BFLVfDECum9BepWmr9/rUpSBhjiIITRvvDG8eVDWtF8VSiMPJzq4Z2yCJxYF98i5OGmPz9rKTQqIHXMWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.003095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37dd303ea36c3ed748fb1a64da47f76ca37b1baa3c71c73f1d368a685655e845","sha256:d9dd8cc8739b4e4f50c42b026c132607d794244567bd986dba5ceab924fa092c"],"state_sha256":"f12900d900e81af76a7898e3f589119d2ef675742557063c0ee56529b2500c99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iyd71AFEp9X6qSCU2wJo5+2ehVWeGRsuLE/gV2mVkvKuo2reGw+EnuuiV3YjZ1b/HOnEjNl7l/lGk2l4QWoOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:52:27.247481Z","bundle_sha256":"48e1c58983fc714d10975b7d8004cf5c44fe2874d97b6982b7ec51f5bf4e6080"}}