{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SZ3PLDWDWBCFSVZTLEXBREKG6L","short_pith_number":"pith:SZ3PLDWD","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"},"canonical_sha256":"9676f58ec3b044595733592e189146f2d91d10027974ff8181e2e316cd8d0128","source":{"kind":"arxiv","id":"2505.16818","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.16818","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"arxiv_version","alias_value":"2505.16818v1","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16818","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"pith_short_12","alias_value":"SZ3PLDWDWBCF","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"pith_short_16","alias_value":"SZ3PLDWDWBCFSVZT","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"pith_short_8","alias_value":"SZ3PLDWD","created_at":"2026-07-05T11:07:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SZ3PLDWDWBCFSVZTLEXBREKG6L","target":"record","payload":{"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"},"canonical_sha256":"9676f58ec3b044595733592e189146f2d91d10027974ff8181e2e316cd8d0128","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"},"source_kind":"arxiv","source_id":"2505.16818","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-07-05T11:07:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZK8UB2m+kqY8xj+oK+KbfN2novEjZdkv/bfC3W4FIhOxqBj0HzZqGduW4ANp5u9pdd2h7xxFYNVCy7v61n01Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:52:19.209959Z"},"content_sha256":"50e7e8613b1fa60207c37855cd667f5cd774a848fe5f8275fcee31e8baba6492","schema_version":"1.0","event_id":"sha256:50e7e8613b1fa60207c37855cd667f5cd774a848fe5f8275fcee31e8baba6492"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SZ3PLDWDWBCFSVZTLEXBREKG6L","target":"graph","payload":{"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"},"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-07-05T11:07:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GjjL9eIOj+a0546p808EFl5DIqJmPICxBTHjCVXkCtY3VN3Zj14C6Sz1pgfSIJ9byMfhUwFHQQfqUReSnSC3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:52:19.210457Z"},"content_sha256":"15104ffc7691ec241f4dee5e70845259373f6b5dcec652cda9439e6ae453f12a","schema_version":"1.0","event_id":"sha256:15104ffc7691ec241f4dee5e70845259373f6b5dcec652cda9439e6ae453f12a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/bundle.json","state_url":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/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-08-07T23:52:19Z","links":{"resolver":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L","bundle":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/bundle.json","state":"https://pith.science/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZ3PLDWDWBCFSVZTLEXBREKG6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SZ3PLDWDWBCFSVZTLEXBREKG6L","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":"ea199836acc0dfec04eca97d4d3b3c219ec84b0506f09668cd454945614b15c1","cross_cats_sorted":["math.MG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-22T15:54:17Z","title_canon_sha256":"489352db093d766d0c7b715d97a65967bcc4a11a624d4083a44c41090dc61456"},"schema_version":"1.0","source":{"id":"2505.16818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.16818","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"arxiv_version","alias_value":"2505.16818v1","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.16818","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"pith_short_12","alias_value":"SZ3PLDWDWBCF","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"pith_short_16","alias_value":"SZ3PLDWDWBCFSVZT","created_at":"2026-07-05T11:07:41Z"},{"alias_kind":"pith_short_8","alias_value":"SZ3PLDWD","created_at":"2026-07-05T11:07:41Z"}],"graph_snapshots":[{"event_id":"sha256:15104ffc7691ec241f4dee5e70845259373f6b5dcec652cda9439e6ae453f12a","target":"graph","created_at":"2026-07-05T11:07:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.16818/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Dawid Ignasiak, Lyuben Lichev, Michael Anastos, Sahar Diskin, Yetong Sha","cross_cats":["math.MG","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-22T15:54:17Z","title":"Spanning trees of bounded degree in random geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.16818","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:50e7e8613b1fa60207c37855cd667f5cd774a848fe5f8275fcee31e8baba6492","target":"record","created_at":"2026-07-05T11:07:41Z","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":"ea199836acc0dfec04eca97d4d3b3c219ec84b0506f09668cd454945614b15c1","cross_cats_sorted":["math.MG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-22T15:54:17Z","title_canon_sha256":"489352db093d766d0c7b715d97a65967bcc4a11a624d4083a44c41090dc61456"},"schema_version":"1.0","source":{"id":"2505.16818","kind":"arxiv","version":1}},"canonical_sha256":"9676f58ec3b044595733592e189146f2d91d10027974ff8181e2e316cd8d0128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9676f58ec3b044595733592e189146f2d91d10027974ff8181e2e316cd8d0128","first_computed_at":"2026-07-05T11:07:41.733766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:07:41.733766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+gQkIARerBBO8j4X0macDb5Ztj9hCq8TiMpcKUtPj0edO9c6YVKEzPRdRrgx5sOxb/g31WQqFPJb3gTAoEgkAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:07:41.734288Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.16818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50e7e8613b1fa60207c37855cd667f5cd774a848fe5f8275fcee31e8baba6492","sha256:15104ffc7691ec241f4dee5e70845259373f6b5dcec652cda9439e6ae453f12a"],"state_sha256":"58506033f994649bcf0b1d0d0649a3575406cd31b9603a54b573c10145b1cb8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5zoy6yBrUmfqAJ583h72jk7uW72UGdKvi6DMbeDReHcHab3PLtkk4ohVtMJkhxZ2PjQoED6Ni6w6wTDBQTiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T23:52:19.216218Z","bundle_sha256":"f78ae9207a4b48420b67aa3389e80077930da166e3296b6c2a8d6e67b91641cc"}}