{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5S2NHU2PDNEKCON7DNXQOACIPF","short_pith_number":"pith:5S2NHU2P","schema_version":"1.0","canonical_sha256":"ecb4d3d34f1b48a139bf1b6f070048797a6bedf0d4ad07fceaf912e9672f9e32","source":{"kind":"arxiv","id":"1105.1062","version":2},"attestation_state":"computed","paper":{"title":"Universal Emergence of PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","nlin.CD"],"primary_cat":"cs.IR","authors_text":"B. Georgeot, D. L. Shepelyansky, K. M. Frahm","submitted_at":"2011-05-05T13:12:51Z","abstract_excerpt":"The PageRank algorithm enables to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter $\\alpha \\in ]0,1[$. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of PageRank vector at its emergence when $\\alpha \\rightarrow 1$. The whole network can be divided into a core part and a group of invariant subspaces. For $ \\alpha \\rightarrow 1$ the PageRank converges to a universal power law distribution on the invariant su"},"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":"1105.1062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2011-05-05T13:12:51Z","cross_cats_sorted":["cond-mat.stat-mech","nlin.CD"],"title_canon_sha256":"9c8f8865d658d969e19a292e8deb3a9251ccdb7c6c7cef281a36a385e2039781","abstract_canon_sha256":"32dfe4ebe5c28e21c13066a167634252352e78042309724cb57885e88c061fd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:44.208230Z","signature_b64":"f5KnavgNcZDFUAW1UxndzRbvWAeG7sTrdJpNUiSoqnJOt2pl9imgbrt3CMvG6ArkVppAEQr55fo1YebL75/2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb4d3d34f1b48a139bf1b6f070048797a6bedf0d4ad07fceaf912e9672f9e32","last_reissued_at":"2026-05-18T04:09:44.207607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:44.207607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Emergence of PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","nlin.CD"],"primary_cat":"cs.IR","authors_text":"B. Georgeot, D. L. Shepelyansky, K. M. Frahm","submitted_at":"2011-05-05T13:12:51Z","abstract_excerpt":"The PageRank algorithm enables to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter $\\alpha \\in ]0,1[$. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of PageRank vector at its emergence when $\\alpha \\rightarrow 1$. The whole network can be divided into a core part and a group of invariant subspaces. For $ \\alpha \\rightarrow 1$ the PageRank converges to a universal power law distribution on the invariant su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1062","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":"1105.1062","created_at":"2026-05-18T04:09:44.207698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1062v2","created_at":"2026-05-18T04:09:44.207698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1062","created_at":"2026-05-18T04:09:44.207698+00:00"},{"alias_kind":"pith_short_12","alias_value":"5S2NHU2PDNEK","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5S2NHU2PDNEKCON7","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5S2NHU2P","created_at":"2026-05-18T12:26:20.644004+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/5S2NHU2PDNEKCON7DNXQOACIPF","json":"https://pith.science/pith/5S2NHU2PDNEKCON7DNXQOACIPF.json","graph_json":"https://pith.science/api/pith-number/5S2NHU2PDNEKCON7DNXQOACIPF/graph.json","events_json":"https://pith.science/api/pith-number/5S2NHU2PDNEKCON7DNXQOACIPF/events.json","paper":"https://pith.science/paper/5S2NHU2P"},"agent_actions":{"view_html":"https://pith.science/pith/5S2NHU2PDNEKCON7DNXQOACIPF","download_json":"https://pith.science/pith/5S2NHU2PDNEKCON7DNXQOACIPF.json","view_paper":"https://pith.science/paper/5S2NHU2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1062&json=true","fetch_graph":"https://pith.science/api/pith-number/5S2NHU2PDNEKCON7DNXQOACIPF/graph.json","fetch_events":"https://pith.science/api/pith-number/5S2NHU2PDNEKCON7DNXQOACIPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5S2NHU2PDNEKCON7DNXQOACIPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5S2NHU2PDNEKCON7DNXQOACIPF/action/storage_attestation","attest_author":"https://pith.science/pith/5S2NHU2PDNEKCON7DNXQOACIPF/action/author_attestation","sign_citation":"https://pith.science/pith/5S2NHU2PDNEKCON7DNXQOACIPF/action/citation_signature","submit_replication":"https://pith.science/pith/5S2NHU2PDNEKCON7DNXQOACIPF/action/replication_record"}},"created_at":"2026-05-18T04:09:44.207698+00:00","updated_at":"2026-05-18T04:09:44.207698+00:00"}