{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QDE3RFRLOZFRZ3N6OJK3DWQSJX","short_pith_number":"pith:QDE3RFRL","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"},"canonical_sha256":"80c9b8962b764b1cedbe7255b1da124dcb71cb03649af0d43641d80d1ad02f13","source":{"kind":"arxiv","id":"1704.01302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01302","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01302v1","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01302","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"QDE3RFRLOZFR","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QDE3RFRLOZFRZ3N6","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QDE3RFRL","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QDE3RFRLOZFRZ3N6OJK3DWQSJX","target":"record","payload":{"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"},"canonical_sha256":"80c9b8962b764b1cedbe7255b1da124dcb71cb03649af0d43641d80d1ad02f13","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"},"source_kind":"arxiv","source_id":"1704.01302","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OLRjvFj1OfYm9dhPcz6N6zRwsjFoZEzUP46/HEYjt66pK0AEk6/YDcPjQd0+FJOlW8oBVRokK2VbQmKkwYjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:43:58.590750Z"},"content_sha256":"8f00c023f3c6bef840401d698264a1ba3ba5f53b6cb0c8d5068befa92b72bca2","schema_version":"1.0","event_id":"sha256:8f00c023f3c6bef840401d698264a1ba3ba5f53b6cb0c8d5068befa92b72bca2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QDE3RFRLOZFRZ3N6OJK3DWQSJX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nf0I5qe5lLnKHnaM1vgpEh3nS0KV9zrArMMQhuS01YLSjk7kPtD92UB3zRPx67NveNMnB90ic9hM+aVy0HBVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:43:58.591108Z"},"content_sha256":"761d5e3c636055fb0d51ecb1c2b5f983d72e93e2c56d1fb210f2a3fc16d4b963","schema_version":"1.0","event_id":"sha256:761d5e3c636055fb0d51ecb1c2b5f983d72e93e2c56d1fb210f2a3fc16d4b963"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/bundle.json","state_url":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T11:43:58Z","links":{"resolver":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX","bundle":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/bundle.json","state":"https://pith.science/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDE3RFRLOZFRZ3N6OJK3DWQSJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QDE3RFRLOZFRZ3N6OJK3DWQSJX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b69e41186cfb91557a55c992b7f0ec3dd402ac73fc54e90c5d1c02c57b2b20e1","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-04-05T08:15:54Z","title_canon_sha256":"0a62df5c1bfa0477afed7bb0d7a0444ad122d0020e9fc4dc734afea9af8d3e1b"},"schema_version":"1.0","source":{"id":"1704.01302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01302","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01302v1","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01302","created_at":"2026-05-18T00:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"QDE3RFRLOZFR","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QDE3RFRLOZFRZ3N6","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QDE3RFRL","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:761d5e3c636055fb0d51ecb1c2b5f983d72e93e2c56d1fb210f2a3fc16d4b963","target":"graph","created_at":"2026-05-18T00:46:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Natalia Markovich","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-04-05T08:15:54Z","title":"Extremes in Random Graphs Models of Complex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01302","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8f00c023f3c6bef840401d698264a1ba3ba5f53b6cb0c8d5068befa92b72bca2","target":"record","created_at":"2026-05-18T00:46:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b69e41186cfb91557a55c992b7f0ec3dd402ac73fc54e90c5d1c02c57b2b20e1","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-04-05T08:15:54Z","title_canon_sha256":"0a62df5c1bfa0477afed7bb0d7a0444ad122d0020e9fc4dc734afea9af8d3e1b"},"schema_version":"1.0","source":{"id":"1704.01302","kind":"arxiv","version":1}},"canonical_sha256":"80c9b8962b764b1cedbe7255b1da124dcb71cb03649af0d43641d80d1ad02f13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80c9b8962b764b1cedbe7255b1da124dcb71cb03649af0d43641d80d1ad02f13","first_computed_at":"2026-05-18T00:46:58.514312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:58.514312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LdbH5DRmEVwQYr4YBpUYgENsuTQgk0tJEBjY79hgJDFgQ5H0N4XoBdPEEZt7AAXUFtigfo1pqEOOBDmRAjYkCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:58.514789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f00c023f3c6bef840401d698264a1ba3ba5f53b6cb0c8d5068befa92b72bca2","sha256:761d5e3c636055fb0d51ecb1c2b5f983d72e93e2c56d1fb210f2a3fc16d4b963"],"state_sha256":"9e8efe129c99d3f89a257efff43899934f0cb32626fa51e6fd275042d0d0e851"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Zs2yhXTvSOusY1QXBUJGpPYQiyRQSLy0D5SVa8LPbIa9II1CYi594kEKefkUOM2YXCMSKf4FpdRwoRwrunGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T11:43:58.593056Z","bundle_sha256":"ff7053e6f49b2d4fcb38a6b475602ad824d79fd0e1b9bb1e32a7839f54a452cc"}}