{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LR5QYZWJWATMWGCLNG5UBUNZRR","short_pith_number":"pith:LR5QYZWJ","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"},"canonical_sha256":"5c7b0c66c9b026cb184b69bb40d1b98c7750aab9f7590a1194bda71d4974ec71","source":{"kind":"arxiv","id":"1507.04282","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04282","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04282v3","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04282","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"LR5QYZWJWATM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LR5QYZWJWATMWGCL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LR5QYZWJ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LR5QYZWJWATMWGCLNG5UBUNZRR","target":"record","payload":{"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"},"canonical_sha256":"5c7b0c66c9b026cb184b69bb40d1b98c7750aab9f7590a1194bda71d4974ec71","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"},"source_kind":"arxiv","source_id":"1507.04282","source_version":3,"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-18T01:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nt2SMeck/zono1wIX+Jc+gA5PUstT0y0PSL8EM680aq1OoVf+ZDJv/YNArw3O4wsrfHbzE/GQyUhQhESNwJ9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:34:11.295182Z"},"content_sha256":"b548cc5940b8e372fe203693f26f7956c433aca5f44329bba31787b7bc06ab39","schema_version":"1.0","event_id":"sha256:b548cc5940b8e372fe203693f26f7956c433aca5f44329bba31787b7bc06ab39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LR5QYZWJWATMWGCLNG5UBUNZRR","target":"graph","payload":{"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"},"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-18T01:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMu4k5tL36uZOyrnFj0rWnV7MLaGAwXEz/TQPwHg0It+LT4yoksWN/lf2R+6BDX6mXvmdbtn5ixmAsdHknwdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:34:11.295545Z"},"content_sha256":"c772978efd8498de4eaac6e429f75e298dc2887fd58d8fe53d854a8a4e8f77b1","schema_version":"1.0","event_id":"sha256:c772978efd8498de4eaac6e429f75e298dc2887fd58d8fe53d854a8a4e8f77b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/bundle.json","state_url":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/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-25T17:34:11Z","links":{"resolver":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR","bundle":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/bundle.json","state":"https://pith.science/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LR5QYZWJWATMWGCLNG5UBUNZRR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LR5QYZWJWATMWGCLNG5UBUNZRR","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":"c4cdeb6ebbd2c8acba7bc0dde46c4c89c9ae52d736a73920d591cb685b17b529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-15T16:23:57Z","title_canon_sha256":"30cf89679f98f008a0718f84f79f94c58d16c0ec61f951a61683353d02301eaa"},"schema_version":"1.0","source":{"id":"1507.04282","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04282","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04282v3","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04282","created_at":"2026-05-18T01:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"LR5QYZWJWATM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LR5QYZWJWATMWGCL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LR5QYZWJ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:c772978efd8498de4eaac6e429f75e298dc2887fd58d8fe53d854a8a4e8f77b1","target":"graph","created_at":"2026-05-18T01:36:42Z","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":"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","authors_text":"A. Davidson, A. Ganesh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-15T16:23:57Z","title":"Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04282","kind":"arxiv","version":3},"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:b548cc5940b8e372fe203693f26f7956c433aca5f44329bba31787b7bc06ab39","target":"record","created_at":"2026-05-18T01:36:42Z","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":"c4cdeb6ebbd2c8acba7bc0dde46c4c89c9ae52d736a73920d591cb685b17b529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-15T16:23:57Z","title_canon_sha256":"30cf89679f98f008a0718f84f79f94c58d16c0ec61f951a61683353d02301eaa"},"schema_version":"1.0","source":{"id":"1507.04282","kind":"arxiv","version":3}},"canonical_sha256":"5c7b0c66c9b026cb184b69bb40d1b98c7750aab9f7590a1194bda71d4974ec71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c7b0c66c9b026cb184b69bb40d1b98c7750aab9f7590a1194bda71d4974ec71","first_computed_at":"2026-05-18T01:36:42.942572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:42.942572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"umUC0bSwH6//N8rMcz4DAtnw/HTbHWtQDooF0oEImf/XA8qmhdz8KiQ0rHHszfpIFAUo26BgLBmSlZuiINh4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:42.943223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04282","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b548cc5940b8e372fe203693f26f7956c433aca5f44329bba31787b7bc06ab39","sha256:c772978efd8498de4eaac6e429f75e298dc2887fd58d8fe53d854a8a4e8f77b1"],"state_sha256":"04a96895426c5ca5425254276eb01f2a3972fa9ad0de6994fbb0a47c44c27111"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1lUQALRZODW266/UpMsRb1cJTHm3jFYqo69W2KIaoySRU338EzQy8PnshCkwIl75my16faKf0Cc5dy1On3zYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:34:11.297411Z","bundle_sha256":"dcee862bb7e8eb1b548658ecfa6d69a27ea0d092a6e4fdd4aace8a8b28555103"}}