{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:USUOWQLZX4KBJKCFWKDJCFIUHR","short_pith_number":"pith:USUOWQLZ","schema_version":"1.0","canonical_sha256":"a4a8eb4179bf1414a845b2869115143c5721d18ddb5befb117a7e84df2401133","source":{"kind":"arxiv","id":"0810.4908","version":2},"attestation_state":"computed","paper":{"title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.CO"],"primary_cat":"math.PR","authors_text":"Abraham D. Flaxman, David B. Wilson, Omer Angel","submitted_at":"2008-10-27T19:15:31Z","abstract_excerpt":"In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity. We consider spanning trees constrained to have depth bounded by k from a specified root. We prove that if k > log_2 log n+omega(1), where omega(1) is any function going to infinity with n, then the minimum bounded-depth spanning tree still has weight tending to zeta(3) as n -> infinity, and that if k < log_2 log n, then the weight is doubly-exponentially large in log_2 lo"},"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":"0810.4908","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-10-27T19:15:31Z","cross_cats_sorted":["cond-mat.stat-mech","math.CO"],"title_canon_sha256":"9b4cb4d4e08a9844d77fe55a746b3a2119770458e76e70c4682cc4afe772df94","abstract_canon_sha256":"5f03c19597be6aa098207c07e34052c116e08d64a579c245ad880d2c8666b9d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:06.392326Z","signature_b64":"GhfgYpavvL1/3nvj7vOykC/OgCsJee3SrvFoObUK/HhVKZa3eRMkb8o2P6mKi1KmbjT5g13opiHrME+K9TonBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4a8eb4179bf1414a845b2869115143c5721d18ddb5befb117a7e84df2401133","last_reissued_at":"2026-05-18T03:54:06.391782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:06.391782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.CO"],"primary_cat":"math.PR","authors_text":"Abraham D. Flaxman, David B. Wilson, Omer Angel","submitted_at":"2008-10-27T19:15:31Z","abstract_excerpt":"In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity. We consider spanning trees constrained to have depth bounded by k from a specified root. We prove that if k > log_2 log n+omega(1), where omega(1) is any function going to infinity with n, then the minimum bounded-depth spanning tree still has weight tending to zeta(3) as n -> infinity, and that if k < log_2 log n, then the weight is doubly-exponentially large in log_2 lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.4908","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":"0810.4908","created_at":"2026-05-18T03:54:06.391867+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.4908v2","created_at":"2026-05-18T03:54:06.391867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.4908","created_at":"2026-05-18T03:54:06.391867+00:00"},{"alias_kind":"pith_short_12","alias_value":"USUOWQLZX4KB","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"USUOWQLZX4KBJKCF","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"USUOWQLZ","created_at":"2026-05-18T12:25:58.018023+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/USUOWQLZX4KBJKCFWKDJCFIUHR","json":"https://pith.science/pith/USUOWQLZX4KBJKCFWKDJCFIUHR.json","graph_json":"https://pith.science/api/pith-number/USUOWQLZX4KBJKCFWKDJCFIUHR/graph.json","events_json":"https://pith.science/api/pith-number/USUOWQLZX4KBJKCFWKDJCFIUHR/events.json","paper":"https://pith.science/paper/USUOWQLZ"},"agent_actions":{"view_html":"https://pith.science/pith/USUOWQLZX4KBJKCFWKDJCFIUHR","download_json":"https://pith.science/pith/USUOWQLZX4KBJKCFWKDJCFIUHR.json","view_paper":"https://pith.science/paper/USUOWQLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.4908&json=true","fetch_graph":"https://pith.science/api/pith-number/USUOWQLZX4KBJKCFWKDJCFIUHR/graph.json","fetch_events":"https://pith.science/api/pith-number/USUOWQLZX4KBJKCFWKDJCFIUHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USUOWQLZX4KBJKCFWKDJCFIUHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USUOWQLZX4KBJKCFWKDJCFIUHR/action/storage_attestation","attest_author":"https://pith.science/pith/USUOWQLZX4KBJKCFWKDJCFIUHR/action/author_attestation","sign_citation":"https://pith.science/pith/USUOWQLZX4KBJKCFWKDJCFIUHR/action/citation_signature","submit_replication":"https://pith.science/pith/USUOWQLZX4KBJKCFWKDJCFIUHR/action/replication_record"}},"created_at":"2026-05-18T03:54:06.391867+00:00","updated_at":"2026-05-18T03:54:06.391867+00:00"}