{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QDE3RFRLOZFRZ3N6OJK3DWQSJX","short_pith_number":"pith:QDE3RFRL","schema_version":"1.0","canonical_sha256":"80c9b8962b764b1cedbe7255b1da124dcb71cb03649af0d43641d80d1ad02f13","source":{"kind":"arxiv","id":"1704.01302","version":1},"attestation_state":"computed","paper":{"title":"Extremes in Random Graphs Models of Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Natalia Markovich","submitted_at":"2017-04-05T08:15:54Z","abstract_excerpt":"Regarding the analysis of Web communication, social and complex networks the fast finding of most influential nodes in a network graph constitutes an important research problem. We use two indices of the influence of those nodes, namely, PageRank and a Max-linear model. We consider the PageRank %both as %Galton-Watson branching process and as an autoregressive process with a random number of random coefficients that depend on ranks of incoming nodes and their out-degrees and assume that the coefficients are independent and distributed with regularly varying tail and with the same tail index. T"},"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":"1704.01302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-04-05T08:15:54Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"0a62df5c1bfa0477afed7bb0d7a0444ad122d0020e9fc4dc734afea9af8d3e1b","abstract_canon_sha256":"b69e41186cfb91557a55c992b7f0ec3dd402ac73fc54e90c5d1c02c57b2b20e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:58.514789Z","signature_b64":"LdbH5DRmEVwQYr4YBpUYgENsuTQgk0tJEBjY79hgJDFgQ5H0N4XoBdPEEZt7AAXUFtigfo1pqEOOBDmRAjYkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80c9b8962b764b1cedbe7255b1da124dcb71cb03649af0d43641d80d1ad02f13","last_reissued_at":"2026-05-18T00:46:58.514312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:58.514312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremes in Random Graphs Models of Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Natalia Markovich","submitted_at":"2017-04-05T08:15:54Z","abstract_excerpt":"Regarding the analysis of Web communication, social and complex networks the fast finding of most influential nodes in a network graph constitutes an important research problem. We use two indices of the influence of those nodes, namely, PageRank and a Max-linear model. We consider the PageRank %both as %Galton-Watson branching process and as an autoregressive process with a random number of random coefficients that depend on ranks of incoming nodes and their out-degrees and assume that the coefficients are independent and distributed with regularly varying tail and with the same tail index. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01302","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":"1704.01302","created_at":"2026-05-18T00:46:58.514396+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.01302v1","created_at":"2026-05-18T00:46:58.514396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01302","created_at":"2026-05-18T00:46:58.514396+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDE3RFRLOZFR","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDE3RFRLOZFRZ3N6","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDE3RFRL","created_at":"2026-05-18T12:31:37.085036+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/QDE3RFRLOZFRZ3N6OJK3DWQSJX","json":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX.json","graph_json":"https://pith.science/api/pith-number/QDE3RFRLOZFRZ3N6OJK3DWQSJX/graph.json","events_json":"https://pith.science/api/pith-number/QDE3RFRLOZFRZ3N6OJK3DWQSJX/events.json","paper":"https://pith.science/paper/QDE3RFRL"},"agent_actions":{"view_html":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX","download_json":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX.json","view_paper":"https://pith.science/paper/QDE3RFRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.01302&json=true","fetch_graph":"https://pith.science/api/pith-number/QDE3RFRLOZFRZ3N6OJK3DWQSJX/graph.json","fetch_events":"https://pith.science/api/pith-number/QDE3RFRLOZFRZ3N6OJK3DWQSJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/action/storage_attestation","attest_author":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/action/author_attestation","sign_citation":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/action/citation_signature","submit_replication":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/action/replication_record"}},"created_at":"2026-05-18T00:46:58.514396+00:00","updated_at":"2026-05-18T00:46:58.514396+00:00"}