{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LR5QYZWJWATMWGCLNG5UBUNZRR","short_pith_number":"pith:LR5QYZWJ","schema_version":"1.0","canonical_sha256":"5c7b0c66c9b026cb184b69bb40d1b98c7750aab9f7590a1194bda71d4974ec71","source":{"kind":"arxiv","id":"1507.04282","version":3},"attestation_state":"computed","paper":{"title":"Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. Davidson, A. Ganesh","submitted_at":"2015-07-15T16:23:57Z","abstract_excerpt":"Consider the complete graph on $n$ vertices, with edge weights drawn independently from the exponential distribution with unit mean. Janson showed that the typical distance between two vertices scales as $\\log{n}/n$, whereas the diameter (maximum distance between any two vertices) scales as $3\\log{n}/n$. Bollob\\'{a}s et al. showed that, for any fixed k, the weight of the Steiner tree connecting $k$ typical vertices scales as $(k-1)\\log{n}/n$, which recovers Janson's result for $k=2$. We extend this result to show that the worst case $k$-Steiner tree, over all choices of $k$ vertices, has weigh"},"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":"1507.04282","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-15T16:23:57Z","cross_cats_sorted":[],"title_canon_sha256":"30cf89679f98f008a0718f84f79f94c58d16c0ec61f951a61683353d02301eaa","abstract_canon_sha256":"c4cdeb6ebbd2c8acba7bc0dde46c4c89c9ae52d736a73920d591cb685b17b529"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:42.943223Z","signature_b64":"umUC0bSwH6//N8rMcz4DAtnw/HTbHWtQDooF0oEImf/XA8qmhdz8KiQ0rHHszfpIFAUo26BgLBmSlZuiINh4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c7b0c66c9b026cb184b69bb40d1b98c7750aab9f7590a1194bda71d4974ec71","last_reissued_at":"2026-05-18T01:36:42.942572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:42.942572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. Davidson, A. Ganesh","submitted_at":"2015-07-15T16:23:57Z","abstract_excerpt":"Consider the complete graph on $n$ vertices, with edge weights drawn independently from the exponential distribution with unit mean. Janson showed that the typical distance between two vertices scales as $\\log{n}/n$, whereas the diameter (maximum distance between any two vertices) scales as $3\\log{n}/n$. Bollob\\'{a}s et al. showed that, for any fixed k, the weight of the Steiner tree connecting $k$ typical vertices scales as $(k-1)\\log{n}/n$, which recovers Janson's result for $k=2$. We extend this result to show that the worst case $k$-Steiner tree, over all choices of $k$ vertices, has weigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04282","kind":"arxiv","version":3},"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":"1507.04282","created_at":"2026-05-18T01:36:42.942672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04282v3","created_at":"2026-05-18T01:36:42.942672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04282","created_at":"2026-05-18T01:36:42.942672+00:00"},{"alias_kind":"pith_short_12","alias_value":"LR5QYZWJWATM","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LR5QYZWJWATMWGCL","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LR5QYZWJ","created_at":"2026-05-18T12:29:29.992203+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/LR5QYZWJWATMWGCLNG5UBUNZRR","json":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR.json","graph_json":"https://pith.science/api/pith-number/LR5QYZWJWATMWGCLNG5UBUNZRR/graph.json","events_json":"https://pith.science/api/pith-number/LR5QYZWJWATMWGCLNG5UBUNZRR/events.json","paper":"https://pith.science/paper/LR5QYZWJ"},"agent_actions":{"view_html":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR","download_json":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR.json","view_paper":"https://pith.science/paper/LR5QYZWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04282&json=true","fetch_graph":"https://pith.science/api/pith-number/LR5QYZWJWATMWGCLNG5UBUNZRR/graph.json","fetch_events":"https://pith.science/api/pith-number/LR5QYZWJWATMWGCLNG5UBUNZRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/action/storage_attestation","attest_author":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/action/author_attestation","sign_citation":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/action/citation_signature","submit_replication":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/action/replication_record"}},"created_at":"2026-05-18T01:36:42.942672+00:00","updated_at":"2026-05-18T01:36:42.942672+00:00"}