{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Q25LNKJNYHD2N522YEHEFRYYWA","short_pith_number":"pith:Q25LNKJN","schema_version":"1.0","canonical_sha256":"86bab6a92dc1c7a6f75ac10e42c718b03468fded084f6afd1ef739db0d0bd6ce","source":{"kind":"arxiv","id":"1305.6429","version":3},"attestation_state":"computed","paper":{"title":"Super-star networks: Growing optimal scale-free networks via likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"nlin.AO","authors_text":"Kevin Judd, Michael Small, Thomas Stemler, Yingying Li","submitted_at":"2013-05-28T09:40:34Z","abstract_excerpt":"Preferential attachment --- by which new nodes attach to existing nodes with probability proportional to the existing nodes' degree --- has become the standard growth model for scale-free networks, where the asymptotic probability of a node having degree $k$ is proportional to $k^{-\\gamma}$. However, the motivation for this model is entirely ad hoc. We use exact likelihood arguments and show that the optimal way to build a scale-free network is to attach most new links to nodes of low degree. Curiously, this leads to a scale-free networks with a single dominant hub: a star-like structure we ca"},"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":"1305.6429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2013-05-28T09:40:34Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"84280f5cca6c2309ac04f93e2463dd378ef2146dcfffa73e4b9ceba36f531543","abstract_canon_sha256":"359c14783c1ae6172e56edfc642a2994e67c1bb23bc3c0dc2d2cd923d20dd05e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:58.961467Z","signature_b64":"zaH7PZDp35d3+WMmJFBvswrnolAK7eC6a/R0A55PIMC1km1PgB8Zx/Ax3YHcaz+nDTRzfldva8sKsebCAYBICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86bab6a92dc1c7a6f75ac10e42c718b03468fded084f6afd1ef739db0d0bd6ce","last_reissued_at":"2026-05-18T02:37:58.961096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:58.961096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-star networks: Growing optimal scale-free networks via likelihood","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"nlin.AO","authors_text":"Kevin Judd, Michael Small, Thomas Stemler, Yingying Li","submitted_at":"2013-05-28T09:40:34Z","abstract_excerpt":"Preferential attachment --- by which new nodes attach to existing nodes with probability proportional to the existing nodes' degree --- has become the standard growth model for scale-free networks, where the asymptotic probability of a node having degree $k$ is proportional to $k^{-\\gamma}$. However, the motivation for this model is entirely ad hoc. We use exact likelihood arguments and show that the optimal way to build a scale-free network is to attach most new links to nodes of low degree. Curiously, this leads to a scale-free networks with a single dominant hub: a star-like structure we ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6429","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":"1305.6429","created_at":"2026-05-18T02:37:58.961154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6429v3","created_at":"2026-05-18T02:37:58.961154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6429","created_at":"2026-05-18T02:37:58.961154+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q25LNKJNYHD2","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q25LNKJNYHD2N522","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q25LNKJN","created_at":"2026-05-18T12:27:57.521954+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/Q25LNKJNYHD2N522YEHEFRYYWA","json":"https://pith.science/pith/Q25LNKJNYHD2N522YEHEFRYYWA.json","graph_json":"https://pith.science/api/pith-number/Q25LNKJNYHD2N522YEHEFRYYWA/graph.json","events_json":"https://pith.science/api/pith-number/Q25LNKJNYHD2N522YEHEFRYYWA/events.json","paper":"https://pith.science/paper/Q25LNKJN"},"agent_actions":{"view_html":"https://pith.science/pith/Q25LNKJNYHD2N522YEHEFRYYWA","download_json":"https://pith.science/pith/Q25LNKJNYHD2N522YEHEFRYYWA.json","view_paper":"https://pith.science/paper/Q25LNKJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6429&json=true","fetch_graph":"https://pith.science/api/pith-number/Q25LNKJNYHD2N522YEHEFRYYWA/graph.json","fetch_events":"https://pith.science/api/pith-number/Q25LNKJNYHD2N522YEHEFRYYWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q25LNKJNYHD2N522YEHEFRYYWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q25LNKJNYHD2N522YEHEFRYYWA/action/storage_attestation","attest_author":"https://pith.science/pith/Q25LNKJNYHD2N522YEHEFRYYWA/action/author_attestation","sign_citation":"https://pith.science/pith/Q25LNKJNYHD2N522YEHEFRYYWA/action/citation_signature","submit_replication":"https://pith.science/pith/Q25LNKJNYHD2N522YEHEFRYYWA/action/replication_record"}},"created_at":"2026-05-18T02:37:58.961154+00:00","updated_at":"2026-05-18T02:37:58.961154+00:00"}