{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JQLAVWJRE7OVGAMS372UAECAEY","short_pith_number":"pith:JQLAVWJR","schema_version":"1.0","canonical_sha256":"4c160ad93127dd530192dff5401040263b0e73680782fb27408bb3c5c0beb400","source":{"kind":"arxiv","id":"1404.7189","version":1},"attestation_state":"computed","paper":{"title":"It's a Small World for Random Surfers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DM","authors_text":"Abbas Mehrabian, Nick Wormald","submitted_at":"2014-04-28T22:37:42Z","abstract_excerpt":"We prove logarithmic upper bounds for the diameters of the random-surfer Webgraph model and the PageRank-based selection Webgraph model, confirming the small world phenomenon holds for them. In the special case when the generated graph is a tree, we provide close lower and upper bounds for the diameters of both models."},"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":"1404.7189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-28T22:37:42Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"8bc0da19a68f1802ed9c07ef1700829d86c8173ecb508bf1298e5295747bef9a","abstract_canon_sha256":"4b2b46ebcf200457a2c751fe17e42be39c3a1c2768282771e3524a300844561c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:57.309481Z","signature_b64":"fvBY1xWCrM+Hl9DjHuTezgeGFl2zV6wdOGs3SNQcxvwFPexuWCm7MRlQJuMh3oXfC9yO1ijBrg5noCn3SjScBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c160ad93127dd530192dff5401040263b0e73680782fb27408bb3c5c0beb400","last_reissued_at":"2026-05-18T02:52:57.308779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:57.308779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"It's a Small World for Random Surfers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DM","authors_text":"Abbas Mehrabian, Nick Wormald","submitted_at":"2014-04-28T22:37:42Z","abstract_excerpt":"We prove logarithmic upper bounds for the diameters of the random-surfer Webgraph model and the PageRank-based selection Webgraph model, confirming the small world phenomenon holds for them. In the special case when the generated graph is a tree, we provide close lower and upper bounds for the diameters of both models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7189","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":"1404.7189","created_at":"2026-05-18T02:52:57.308880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.7189v1","created_at":"2026-05-18T02:52:57.308880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7189","created_at":"2026-05-18T02:52:57.308880+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQLAVWJRE7OV","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQLAVWJRE7OVGAMS","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQLAVWJR","created_at":"2026-05-18T12:28:35.611951+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/JQLAVWJRE7OVGAMS372UAECAEY","json":"https://pith.science/pith/JQLAVWJRE7OVGAMS372UAECAEY.json","graph_json":"https://pith.science/api/pith-number/JQLAVWJRE7OVGAMS372UAECAEY/graph.json","events_json":"https://pith.science/api/pith-number/JQLAVWJRE7OVGAMS372UAECAEY/events.json","paper":"https://pith.science/paper/JQLAVWJR"},"agent_actions":{"view_html":"https://pith.science/pith/JQLAVWJRE7OVGAMS372UAECAEY","download_json":"https://pith.science/pith/JQLAVWJRE7OVGAMS372UAECAEY.json","view_paper":"https://pith.science/paper/JQLAVWJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.7189&json=true","fetch_graph":"https://pith.science/api/pith-number/JQLAVWJRE7OVGAMS372UAECAEY/graph.json","fetch_events":"https://pith.science/api/pith-number/JQLAVWJRE7OVGAMS372UAECAEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQLAVWJRE7OVGAMS372UAECAEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQLAVWJRE7OVGAMS372UAECAEY/action/storage_attestation","attest_author":"https://pith.science/pith/JQLAVWJRE7OVGAMS372UAECAEY/action/author_attestation","sign_citation":"https://pith.science/pith/JQLAVWJRE7OVGAMS372UAECAEY/action/citation_signature","submit_replication":"https://pith.science/pith/JQLAVWJRE7OVGAMS372UAECAEY/action/replication_record"}},"created_at":"2026-05-18T02:52:57.308880+00:00","updated_at":"2026-05-18T02:52:57.308880+00:00"}