{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:EHFDXBX57B2N4JMNT5IDOTU4KH","short_pith_number":"pith:EHFDXBX5","schema_version":"1.0","canonical_sha256":"21ca3b86fdf874de258d9f50374e9c51e32ca7fb511ced0079d0bd29deed248e","source":{"kind":"arxiv","id":"cond-mat/0503598","version":1},"attestation_state":"computed","paper":{"title":"Scale-Free Networks Emerging from Weighted Random Graphs","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"H. Eugene Stanley, Lidia A. Braunstein, Sameet Sreenivasan, Sergey V. Buldyrev, Shlomo Havlin, Tomer Kalisky","submitted_at":"2005-03-24T12:51:17Z","abstract_excerpt":"We study Erd\\\"{o}s-R\\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters) into a single node. We show that this network is scale-free, i.e., the degree distribution is $P(k)\\sim k^{-\\lambda}$ with $\\lambda=2.5$. Our results imply that the minimum spanning tree (MST) in random graphs is composed of percolation clusters, which are interconnected by a set of links that create a scale-free tree with $\\lambda=2.5$. We show that optimizat"},"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":"cond-mat/0503598","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2005-03-24T12:51:17Z","cross_cats_sorted":[],"title_canon_sha256":"f90b5707d1220fb147ddeb6b7b841edc3b9635c62aee426c2ba7362e81b0447e","abstract_canon_sha256":"c0536e6379bfc29bfb890f27335d757d765c5a146bd90a82c2ff6625ac3bed4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:53.463614Z","signature_b64":"ZdHWYYZKYoySktBWYHcUT7Slit41d/Lju5bhqIcGvvHR6qQjd6b54VMfHuFRZwSwAa4HuFkcpw3isPV0hGocBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21ca3b86fdf874de258d9f50374e9c51e32ca7fb511ced0079d0bd29deed248e","last_reissued_at":"2026-05-18T01:39:53.463219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:53.463219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scale-Free Networks Emerging from Weighted Random Graphs","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"H. Eugene Stanley, Lidia A. Braunstein, Sameet Sreenivasan, Sergey V. Buldyrev, Shlomo Havlin, Tomer Kalisky","submitted_at":"2005-03-24T12:51:17Z","abstract_excerpt":"We study Erd\\\"{o}s-R\\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters) into a single node. We show that this network is scale-free, i.e., the degree distribution is $P(k)\\sim k^{-\\lambda}$ with $\\lambda=2.5$. Our results imply that the minimum spanning tree (MST) in random graphs is composed of percolation clusters, which are interconnected by a set of links that create a scale-free tree with $\\lambda=2.5$. We show that optimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0503598","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0503598","created_at":"2026-05-18T01:39:53.463279+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0503598v1","created_at":"2026-05-18T01:39:53.463279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0503598","created_at":"2026-05-18T01:39:53.463279+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHFDXBX57B2N","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHFDXBX57B2N4JMN","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHFDXBX5","created_at":"2026-05-18T12:25:53.335082+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/EHFDXBX57B2N4JMNT5IDOTU4KH","json":"https://pith.science/pith/EHFDXBX57B2N4JMNT5IDOTU4KH.json","graph_json":"https://pith.science/api/pith-number/EHFDXBX57B2N4JMNT5IDOTU4KH/graph.json","events_json":"https://pith.science/api/pith-number/EHFDXBX57B2N4JMNT5IDOTU4KH/events.json","paper":"https://pith.science/paper/EHFDXBX5"},"agent_actions":{"view_html":"https://pith.science/pith/EHFDXBX57B2N4JMNT5IDOTU4KH","download_json":"https://pith.science/pith/EHFDXBX57B2N4JMNT5IDOTU4KH.json","view_paper":"https://pith.science/paper/EHFDXBX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0503598&json=true","fetch_graph":"https://pith.science/api/pith-number/EHFDXBX57B2N4JMNT5IDOTU4KH/graph.json","fetch_events":"https://pith.science/api/pith-number/EHFDXBX57B2N4JMNT5IDOTU4KH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHFDXBX57B2N4JMNT5IDOTU4KH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHFDXBX57B2N4JMNT5IDOTU4KH/action/storage_attestation","attest_author":"https://pith.science/pith/EHFDXBX57B2N4JMNT5IDOTU4KH/action/author_attestation","sign_citation":"https://pith.science/pith/EHFDXBX57B2N4JMNT5IDOTU4KH/action/citation_signature","submit_replication":"https://pith.science/pith/EHFDXBX57B2N4JMNT5IDOTU4KH/action/replication_record"}},"created_at":"2026-05-18T01:39:53.463279+00:00","updated_at":"2026-05-18T01:39:53.463279+00:00"}