{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UCFYWRZUNWDSD2ET5NQHOFJD26","short_pith_number":"pith:UCFYWRZU","canonical_record":{"source":{"id":"1011.5994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-11-27T19:06:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5b0bfb166de750c5e36e785c5cb8bf0b4f0a090c81bd1dbadfe202ee419b431f","abstract_canon_sha256":"809414a80ebdff4eb24d24542f4b5b1d4ebfdd5dc0d39e8eefae46df6a7c70f5"},"schema_version":"1.0"},"canonical_sha256":"a08b8b47346d8721e893eb60771523d79f719e1391a7cdc3499448137c044c17","source":{"kind":"arxiv","id":"1011.5994","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5994","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5994v1","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5994","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"UCFYWRZUNWDS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UCFYWRZUNWDSD2ET","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UCFYWRZU","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UCFYWRZUNWDSD2ET5NQHOFJD26","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-11-27T19:06:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5b0bfb166de750c5e36e785c5cb8bf0b4f0a090c81bd1dbadfe202ee419b431f","abstract_canon_sha256":"809414a80ebdff4eb24d24542f4b5b1d4ebfdd5dc0d39e8eefae46df6a7c70f5"},"schema_version":"1.0"},"canonical_sha256":"a08b8b47346d8721e893eb60771523d79f719e1391a7cdc3499448137c044c17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:37.723513Z","signature_b64":"Ndq7Or5pMlG6JpX1nqxroX0QTNMUaQe94Jk/aMR62Vq4dVol9j8CrHs/2WyWIVSFUsWsRoa9eyGxdm76yVy1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a08b8b47346d8721e893eb60771523d79f719e1391a7cdc3499448137c044c17","last_reissued_at":"2026-05-18T04:34:37.723074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:37.723074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5994","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-05-18T04:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdkeUOVQivhxtFss19vqYNBFx4DElcPsRIkyWFLIGrLMz8uNELJVxWgTSJXIjV95myh4V8Z6d7A7HumspSW7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:14:19.582194Z"},"content_sha256":"615f813d48a00f8f09c89d1f6cd2a0f33fa6226a3639ba3b70788f809ea1f1f4","schema_version":"1.0","event_id":"sha256:615f813d48a00f8f09c89d1f6cd2a0f33fa6226a3639ba3b70788f809ea1f1f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UCFYWRZUNWDSD2ET5NQHOFJD26","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flooding in Weighted Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Hamed Amini, Marc Lelarge, Moez Draief","submitted_at":"2010-11-27T19:06:40Z","abstract_excerpt":"In this paper, we study the impact of edge weights on distances in diluted random graphs. We interpret these weights as delays, and take them as i.i.d exponential random variables. We analyze the weighted flooding time defined as the minimum time needed to reach all nodes from one uniformly chosen node, and the weighted diameter corresponding to the largest distance between any pair of vertices. Under some regularity conditions on the degree sequence of the random graph, we show that these quantities grow as the logarithm of $n$, when the size of the graph $n$ tends to infinity. We also derive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5994","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":""},"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-18T04:34:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJaw9beEtg3Pm6wxu2GtjuYszBs3rs+rmUrcJ2wGpmYJo7diAZBCd8uhJYgixPIp2g50Hxu7NW7hsjlzfN5TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:14:19.582554Z"},"content_sha256":"aa3163e937ecd6103c5f5dd3dc29fef2ca1d026db06935f8847107d3b60b7ab8","schema_version":"1.0","event_id":"sha256:aa3163e937ecd6103c5f5dd3dc29fef2ca1d026db06935f8847107d3b60b7ab8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCFYWRZUNWDSD2ET5NQHOFJD26/bundle.json","state_url":"https://pith.science/pith/UCFYWRZUNWDSD2ET5NQHOFJD26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCFYWRZUNWDSD2ET5NQHOFJD26/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-04T01:14:19Z","links":{"resolver":"https://pith.science/pith/UCFYWRZUNWDSD2ET5NQHOFJD26","bundle":"https://pith.science/pith/UCFYWRZUNWDSD2ET5NQHOFJD26/bundle.json","state":"https://pith.science/pith/UCFYWRZUNWDSD2ET5NQHOFJD26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCFYWRZUNWDSD2ET5NQHOFJD26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UCFYWRZUNWDSD2ET5NQHOFJD26","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":"809414a80ebdff4eb24d24542f4b5b1d4ebfdd5dc0d39e8eefae46df6a7c70f5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-11-27T19:06:40Z","title_canon_sha256":"5b0bfb166de750c5e36e785c5cb8bf0b4f0a090c81bd1dbadfe202ee419b431f"},"schema_version":"1.0","source":{"id":"1011.5994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5994","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5994v1","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5994","created_at":"2026-05-18T04:34:37Z"},{"alias_kind":"pith_short_12","alias_value":"UCFYWRZUNWDS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UCFYWRZUNWDSD2ET","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UCFYWRZU","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:aa3163e937ecd6103c5f5dd3dc29fef2ca1d026db06935f8847107d3b60b7ab8","target":"graph","created_at":"2026-05-18T04:34:37Z","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":"In this paper, we study the impact of edge weights on distances in diluted random graphs. We interpret these weights as delays, and take them as i.i.d exponential random variables. We analyze the weighted flooding time defined as the minimum time needed to reach all nodes from one uniformly chosen node, and the weighted diameter corresponding to the largest distance between any pair of vertices. Under some regularity conditions on the degree sequence of the random graph, we show that these quantities grow as the logarithm of $n$, when the size of the graph $n$ tends to infinity. We also derive","authors_text":"Hamed Amini, Marc Lelarge, Moez Draief","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-11-27T19:06:40Z","title":"Flooding in Weighted Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5994","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:615f813d48a00f8f09c89d1f6cd2a0f33fa6226a3639ba3b70788f809ea1f1f4","target":"record","created_at":"2026-05-18T04:34:37Z","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":"809414a80ebdff4eb24d24542f4b5b1d4ebfdd5dc0d39e8eefae46df6a7c70f5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-11-27T19:06:40Z","title_canon_sha256":"5b0bfb166de750c5e36e785c5cb8bf0b4f0a090c81bd1dbadfe202ee419b431f"},"schema_version":"1.0","source":{"id":"1011.5994","kind":"arxiv","version":1}},"canonical_sha256":"a08b8b47346d8721e893eb60771523d79f719e1391a7cdc3499448137c044c17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a08b8b47346d8721e893eb60771523d79f719e1391a7cdc3499448137c044c17","first_computed_at":"2026-05-18T04:34:37.723074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:37.723074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ndq7Or5pMlG6JpX1nqxroX0QTNMUaQe94Jk/aMR62Vq4dVol9j8CrHs/2WyWIVSFUsWsRoa9eyGxdm76yVy1DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:37.723513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:615f813d48a00f8f09c89d1f6cd2a0f33fa6226a3639ba3b70788f809ea1f1f4","sha256:aa3163e937ecd6103c5f5dd3dc29fef2ca1d026db06935f8847107d3b60b7ab8"],"state_sha256":"d74e0f29362ee6f628f09f9305427723f12a3ef3526e5932a63aca68445be092"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SbOWX1w1RM0Yq7TYfy8opS5UoBlThgDFx+bCPgKI3k2vr1Ia6GaPkYQ/qAk7blZNr5f6UA/C65yMsBWrYM+jCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:14:19.584549Z","bundle_sha256":"3eee6cb775e7c60c8f4916be83d401a540a912e4a301f0654eadb39dad76028b"}}