{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SZ3PLDWDWBCFSVZTLEXBREKG6L","short_pith_number":"pith:SZ3PLDWD","schema_version":"1.0","canonical_sha256":"9676f58ec3b044595733592e189146f2d91d10027974ff8181e2e316cd8d0128","source":{"kind":"arxiv","id":"2505.16818","version":1},"attestation_state":"computed","paper":{"title":"Spanning trees of bounded degree in random geometric graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG","math.PR"],"primary_cat":"math.CO","authors_text":"Dawid Ignasiak, Lyuben Lichev, Michael Anastos, Sahar Diskin, Yetong Sha","submitted_at":"2025-05-22T15:54:17Z","abstract_excerpt":"We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs, and confirms a conjecture of Espuny D\\'iaz, Lichev, Mitsche, and Wesolek. Our proof is algorithmic and adapts to other families of graphs, in particular graphs with bounded genus or tree-width."},"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":"2505.16818","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-22T15:54:17Z","cross_cats_sorted":["math.MG","math.PR"],"title_canon_sha256":"489352db093d766d0c7b715d97a65967bcc4a11a624d4083a44c41090dc61456","abstract_canon_sha256":"ea199836acc0dfec04eca97d4d3b3c219ec84b0506f09668cd454945614b15c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:41.734288Z","signature_b64":"+gQkIARerBBO8j4X0macDb5Ztj9hCq8TiMpcKUtPj0edO9c6YVKEzPRdRrgx5sOxb/g31WQqFPJb3gTAoEgkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9676f58ec3b044595733592e189146f2d91d10027974ff8181e2e316cd8d0128","last_reissued_at":"2026-07-05T11:07:41.733766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:41.733766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning trees of bounded degree in random geometric graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG","math.PR"],"primary_cat":"math.CO","authors_text":"Dawid Ignasiak, Lyuben Lichev, Michael Anastos, Sahar Diskin, Yetong Sha","submitted_at":"2025-05-22T15:54:17Z","abstract_excerpt":"We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs, and confirms a conjecture of Espuny D\\'iaz, Lichev, Mitsche, and Wesolek. Our proof is algorithmic and adapts to other families of graphs, in particular graphs with bounded genus or tree-width."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.16818","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.16818/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.16818","created_at":"2026-07-05T11:07:41.733838+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.16818v1","created_at":"2026-07-05T11:07:41.733838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16818","created_at":"2026-07-05T11:07:41.733838+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZ3PLDWDWBCF","created_at":"2026-07-05T11:07:41.733838+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZ3PLDWDWBCFSVZT","created_at":"2026-07-05T11:07:41.733838+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZ3PLDWD","created_at":"2026-07-05T11:07:41.733838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.06358","citing_title":"Universality in random graphs via optimal linking systems: trees and beyond","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L","json":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L.json","graph_json":"https://pith.science/api/pith-number/SZ3PLDWDWBCFSVZTLEXBREKG6L/graph.json","events_json":"https://pith.science/api/pith-number/SZ3PLDWDWBCFSVZTLEXBREKG6L/events.json","paper":"https://pith.science/paper/SZ3PLDWD"},"agent_actions":{"view_html":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L","download_json":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L.json","view_paper":"https://pith.science/paper/SZ3PLDWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.16818&json=true","fetch_graph":"https://pith.science/api/pith-number/SZ3PLDWDWBCFSVZTLEXBREKG6L/graph.json","fetch_events":"https://pith.science/api/pith-number/SZ3PLDWDWBCFSVZTLEXBREKG6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/action/storage_attestation","attest_author":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/action/author_attestation","sign_citation":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/action/citation_signature","submit_replication":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/action/replication_record"}},"created_at":"2026-07-05T11:07:41.733838+00:00","updated_at":"2026-07-05T11:07:41.733838+00:00"}