{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:KP7RWO4QJDISPI22IACNL5PUKY","short_pith_number":"pith:KP7RWO4Q","schema_version":"1.0","canonical_sha256":"53ff1b3b9048d127a35a4004d5f5f456228f90c73a7b84f17d742cbe8eec715c","source":{"kind":"arxiv","id":"cond-mat/0409648","version":1},"attestation_state":"computed","paper":{"title":"\"Winner takes it all\": strongest node rule for evolution of scale free networks","license":"","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"H. Stefancic, V. Zlatic","submitted_at":"2004-09-24T14:20:54Z","abstract_excerpt":"We study a novel model for evolution of complex networks. We introduce information filtering for reduction of the number of available nodes to a randomly chosen sample, as stochastic component of evolution. New nodes are attached to the nodes that have maximal degree in the sample, which is a deterministic component of network evolution process. This fact is a novel for evolution of scale free networks and depicts a possible new route for modeling network growth. We present both simulational and theoretical results for network evolution. The obtained degree distributions exhibit an obvious pow"},"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/0409648","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2004-09-24T14:20:54Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"09ebc4746d0646f1dc62a868e7a0e61a9d530a30d53cf11766793fa4f5df0186","abstract_canon_sha256":"78cad8e84a590c506576e6bd5d149e1c009f11afa5d14b569871d0ace1750591"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:47:05.945618Z","signature_b64":"/feUXneMNmVyiRa8lSDKVg9AIg6Ypyoc8MyAkN9Pg530cQ644Xp9RZogG721lPhJvTDnNotxf28e4bOOVk+aCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53ff1b3b9048d127a35a4004d5f5f456228f90c73a7b84f17d742cbe8eec715c","last_reissued_at":"2026-07-04T16:47:05.945259Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:47:05.945259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"\"Winner takes it all\": strongest node rule for evolution of scale free networks","license":"","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"H. Stefancic, V. Zlatic","submitted_at":"2004-09-24T14:20:54Z","abstract_excerpt":"We study a novel model for evolution of complex networks. We introduce information filtering for reduction of the number of available nodes to a randomly chosen sample, as stochastic component of evolution. New nodes are attached to the nodes that have maximal degree in the sample, which is a deterministic component of network evolution process. This fact is a novel for evolution of scale free networks and depicts a possible new route for modeling network growth. We present both simulational and theoretical results for network evolution. The obtained degree distributions exhibit an obvious pow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0409648","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cond-mat/0409648/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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/0409648","created_at":"2026-07-04T16:47:05.945326+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0409648v1","created_at":"2026-07-04T16:47:05.945326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0409648","created_at":"2026-07-04T16:47:05.945326+00:00"},{"alias_kind":"pith_short_12","alias_value":"KP7RWO4QJDIS","created_at":"2026-07-04T16:47:05.945326+00:00"},{"alias_kind":"pith_short_16","alias_value":"KP7RWO4QJDISPI22","created_at":"2026-07-04T16:47:05.945326+00:00"},{"alias_kind":"pith_short_8","alias_value":"KP7RWO4Q","created_at":"2026-07-04T16:47:05.945326+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/KP7RWO4QJDISPI22IACNL5PUKY","json":"https://pith.science/pith/KP7RWO4QJDISPI22IACNL5PUKY.json","graph_json":"https://pith.science/api/pith-number/KP7RWO4QJDISPI22IACNL5PUKY/graph.json","events_json":"https://pith.science/api/pith-number/KP7RWO4QJDISPI22IACNL5PUKY/events.json","paper":"https://pith.science/paper/KP7RWO4Q"},"agent_actions":{"view_html":"https://pith.science/pith/KP7RWO4QJDISPI22IACNL5PUKY","download_json":"https://pith.science/pith/KP7RWO4QJDISPI22IACNL5PUKY.json","view_paper":"https://pith.science/paper/KP7RWO4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0409648&json=true","fetch_graph":"https://pith.science/api/pith-number/KP7RWO4QJDISPI22IACNL5PUKY/graph.json","fetch_events":"https://pith.science/api/pith-number/KP7RWO4QJDISPI22IACNL5PUKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KP7RWO4QJDISPI22IACNL5PUKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KP7RWO4QJDISPI22IACNL5PUKY/action/storage_attestation","attest_author":"https://pith.science/pith/KP7RWO4QJDISPI22IACNL5PUKY/action/author_attestation","sign_citation":"https://pith.science/pith/KP7RWO4QJDISPI22IACNL5PUKY/action/citation_signature","submit_replication":"https://pith.science/pith/KP7RWO4QJDISPI22IACNL5PUKY/action/replication_record"}},"created_at":"2026-07-04T16:47:05.945326+00:00","updated_at":"2026-07-04T16:47:05.945326+00:00"}