{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MSWOVMALMDRNFFW23SLQIOEAAV","short_pith_number":"pith:MSWOVMAL","schema_version":"1.0","canonical_sha256":"64aceab00b60e2d296dadc97043880057a52817080cdfa739aa2aef89b30e751","source":{"kind":"arxiv","id":"1903.03756","version":1},"attestation_state":"computed","paper":{"title":"Two-Hop Walks Indicate PageRank Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ying Tang","submitted_at":"2019-03-09T07:54:10Z","abstract_excerpt":"This paper shows that pairwise PageRank orders emerge from two-hop walks. The main tool used here refers to a specially designed sign-mirror function and a parameter curve, whose low-order derivative information implies pairwise PageRank orders with high probability. We study the pairwise correct rate by placing the Google matrix $\\textbf{G}$ in a probabilistic framework, where $\\textbf{G}$ may be equipped with different random ensembles for model-generated or real-world networks with sparse, small-world, scale-free features, the proof of which is mixed by mathematical and numerical evidence. "},"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":"1903.03756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-09T07:54:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8be85c83a227bfe58dce965853b8e00193df864b423817833dc81ff4bf534f14","abstract_canon_sha256":"9e1e0418d517b9317bf6e62d7274a2b0d8caf5da42743abb8327e2f1a40d107b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:41.027485Z","signature_b64":"kSmRLYDaD0+Y0ddRc1ANmNkEgQehcQwnFYNLdkgAFMs9KX3VG1jvSa4JPo7aCmQNbjdOnuIRgxT56Te9/pbiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64aceab00b60e2d296dadc97043880057a52817080cdfa739aa2aef89b30e751","last_reissued_at":"2026-05-17T23:51:41.026597Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:41.026597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Hop Walks Indicate PageRank Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ying Tang","submitted_at":"2019-03-09T07:54:10Z","abstract_excerpt":"This paper shows that pairwise PageRank orders emerge from two-hop walks. The main tool used here refers to a specially designed sign-mirror function and a parameter curve, whose low-order derivative information implies pairwise PageRank orders with high probability. We study the pairwise correct rate by placing the Google matrix $\\textbf{G}$ in a probabilistic framework, where $\\textbf{G}$ may be equipped with different random ensembles for model-generated or real-world networks with sparse, small-world, scale-free features, the proof of which is mixed by mathematical and numerical evidence. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03756","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":"1903.03756","created_at":"2026-05-17T23:51:41.026754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03756v1","created_at":"2026-05-17T23:51:41.026754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03756","created_at":"2026-05-17T23:51:41.026754+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSWOVMALMDRN","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSWOVMALMDRNFFW2","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSWOVMAL","created_at":"2026-05-18T12:33:24.271573+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/MSWOVMALMDRNFFW23SLQIOEAAV","json":"https://pith.science/pith/MSWOVMALMDRNFFW23SLQIOEAAV.json","graph_json":"https://pith.science/api/pith-number/MSWOVMALMDRNFFW23SLQIOEAAV/graph.json","events_json":"https://pith.science/api/pith-number/MSWOVMALMDRNFFW23SLQIOEAAV/events.json","paper":"https://pith.science/paper/MSWOVMAL"},"agent_actions":{"view_html":"https://pith.science/pith/MSWOVMALMDRNFFW23SLQIOEAAV","download_json":"https://pith.science/pith/MSWOVMALMDRNFFW23SLQIOEAAV.json","view_paper":"https://pith.science/paper/MSWOVMAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03756&json=true","fetch_graph":"https://pith.science/api/pith-number/MSWOVMALMDRNFFW23SLQIOEAAV/graph.json","fetch_events":"https://pith.science/api/pith-number/MSWOVMALMDRNFFW23SLQIOEAAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSWOVMALMDRNFFW23SLQIOEAAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSWOVMALMDRNFFW23SLQIOEAAV/action/storage_attestation","attest_author":"https://pith.science/pith/MSWOVMALMDRNFFW23SLQIOEAAV/action/author_attestation","sign_citation":"https://pith.science/pith/MSWOVMALMDRNFFW23SLQIOEAAV/action/citation_signature","submit_replication":"https://pith.science/pith/MSWOVMALMDRNFFW23SLQIOEAAV/action/replication_record"}},"created_at":"2026-05-17T23:51:41.026754+00:00","updated_at":"2026-05-17T23:51:41.026754+00:00"}