{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LAN6KPQ4DKBWYZQNVPIJJT6ANS","short_pith_number":"pith:LAN6KPQ4","schema_version":"1.0","canonical_sha256":"581be53e1c1a836c660dabd094cfc06ca99b0164d0780616a9c8f9f0fa7d140f","source":{"kind":"arxiv","id":"1411.3444","version":2},"attestation_state":"computed","paper":{"title":"Growing Scale-free Networks by a Mediation-Driven Attachment Rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Kamrul Hassan, Liana Islam","submitted_at":"2014-11-13T04:46:40Z","abstract_excerpt":"We propose a model that generates a new class of networks exhibiting power-law degree distribution with a spectrum of exponents depending on the number of links ($m$) with which incoming nodes join the existing network. Unlike the Barab\\'{a}si-Albert (BA) model, each new node first picks an existing node at random, and connects not with this but with $m$ of its neighbors also picked at random. Counterintuitively enough, such a mediation-driven attachment rule results not only in preferential but super-preferential attachment, albeit in disguise. We show that for small $m$, the dynamics of our "},"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":"1411.3444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-11-13T04:46:40Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI"],"title_canon_sha256":"16b6f0c634e0d5ddcff492cbc953a481faa7f0a9b3e7ed6611ea2f735606e89c","abstract_canon_sha256":"f2e35f877963a97e8508cdd97654a3f84c3a330d64871176efe9b97c3d3134f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:40.302828Z","signature_b64":"uSWv1F1DbmQueKbw/W8IjhJuRJGjuviMH30sV1hmLZdrKuzqiL6JEjZwQhgPRLj2UgBWvffUxZRBhL4Mu8nCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"581be53e1c1a836c660dabd094cfc06ca99b0164d0780616a9c8f9f0fa7d140f","last_reissued_at":"2026-05-18T00:26:40.302160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:40.302160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Growing Scale-free Networks by a Mediation-Driven Attachment Rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Kamrul Hassan, Liana Islam","submitted_at":"2014-11-13T04:46:40Z","abstract_excerpt":"We propose a model that generates a new class of networks exhibiting power-law degree distribution with a spectrum of exponents depending on the number of links ($m$) with which incoming nodes join the existing network. Unlike the Barab\\'{a}si-Albert (BA) model, each new node first picks an existing node at random, and connects not with this but with $m$ of its neighbors also picked at random. Counterintuitively enough, such a mediation-driven attachment rule results not only in preferential but super-preferential attachment, albeit in disguise. We show that for small $m$, the dynamics of our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3444","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":"1411.3444","created_at":"2026-05-18T00:26:40.302268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3444v2","created_at":"2026-05-18T00:26:40.302268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3444","created_at":"2026-05-18T00:26:40.302268+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAN6KPQ4DKBW","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAN6KPQ4DKBWYZQN","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAN6KPQ4","created_at":"2026-05-18T12:28:35.611951+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/LAN6KPQ4DKBWYZQNVPIJJT6ANS","json":"https://pith.science/pith/LAN6KPQ4DKBWYZQNVPIJJT6ANS.json","graph_json":"https://pith.science/api/pith-number/LAN6KPQ4DKBWYZQNVPIJJT6ANS/graph.json","events_json":"https://pith.science/api/pith-number/LAN6KPQ4DKBWYZQNVPIJJT6ANS/events.json","paper":"https://pith.science/paper/LAN6KPQ4"},"agent_actions":{"view_html":"https://pith.science/pith/LAN6KPQ4DKBWYZQNVPIJJT6ANS","download_json":"https://pith.science/pith/LAN6KPQ4DKBWYZQNVPIJJT6ANS.json","view_paper":"https://pith.science/paper/LAN6KPQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3444&json=true","fetch_graph":"https://pith.science/api/pith-number/LAN6KPQ4DKBWYZQNVPIJJT6ANS/graph.json","fetch_events":"https://pith.science/api/pith-number/LAN6KPQ4DKBWYZQNVPIJJT6ANS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAN6KPQ4DKBWYZQNVPIJJT6ANS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAN6KPQ4DKBWYZQNVPIJJT6ANS/action/storage_attestation","attest_author":"https://pith.science/pith/LAN6KPQ4DKBWYZQNVPIJJT6ANS/action/author_attestation","sign_citation":"https://pith.science/pith/LAN6KPQ4DKBWYZQNVPIJJT6ANS/action/citation_signature","submit_replication":"https://pith.science/pith/LAN6KPQ4DKBWYZQNVPIJJT6ANS/action/replication_record"}},"created_at":"2026-05-18T00:26:40.302268+00:00","updated_at":"2026-05-18T00:26:40.302268+00:00"}