{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:47B46WX7GDBG6IDYSPRPCPTOLD","short_pith_number":"pith:47B46WX7","schema_version":"1.0","canonical_sha256":"e7c3cf5aff30c26f207893e2f13e6e58ed6c82b3335e717329a2df84ab578d5e","source":{"kind":"arxiv","id":"1206.4897","version":1},"attestation_state":"computed","paper":{"title":"Robust Eigenvector of a Stochastic Matrix with Application to PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anatoli Juditsky, Boris Polyak","submitted_at":"2012-06-21T14:32:16Z","abstract_excerpt":"We discuss a definition of robust dominant eigenvector of a family of stochastic matrices. Our focus is on application to ranking problems, where the proposed approach can be seen as a robust alternative to the standard PageRank technique. The robust eigenvector computation is reduced to a convex optimization problem. We also propose a simple algorithm for robust eigenvector approximation which can be viewed as a regularized power method with a special stopping rule."},"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":"1206.4897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-06-21T14:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"87c8eb61b32b98490444dc0968f07641aef1ba872ccd0a1e7eade9f0f1d9bcad","abstract_canon_sha256":"d958f60e3661afe369d63695207d50844ffe65d168559f0a6605ac84681bb915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:54.008019Z","signature_b64":"R4uHvAsYUWWx+0l/lNTD60RknxxoAW/4xePgZK37W8sPKvhq7fIk1X8aU1ywtrHRqWWEZislHXLOGZ9qjge/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7c3cf5aff30c26f207893e2f13e6e58ed6c82b3335e717329a2df84ab578d5e","last_reissued_at":"2026-05-18T03:52:54.007278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:54.007278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Eigenvector of a Stochastic Matrix with Application to PageRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anatoli Juditsky, Boris Polyak","submitted_at":"2012-06-21T14:32:16Z","abstract_excerpt":"We discuss a definition of robust dominant eigenvector of a family of stochastic matrices. Our focus is on application to ranking problems, where the proposed approach can be seen as a robust alternative to the standard PageRank technique. The robust eigenvector computation is reduced to a convex optimization problem. We also propose a simple algorithm for robust eigenvector approximation which can be viewed as a regularized power method with a special stopping rule."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4897","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":"1206.4897","created_at":"2026-05-18T03:52:54.007394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4897v1","created_at":"2026-05-18T03:52:54.007394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4897","created_at":"2026-05-18T03:52:54.007394+00:00"},{"alias_kind":"pith_short_12","alias_value":"47B46WX7GDBG","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"47B46WX7GDBG6IDY","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"47B46WX7","created_at":"2026-05-18T12:26:53.410803+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/47B46WX7GDBG6IDYSPRPCPTOLD","json":"https://pith.science/pith/47B46WX7GDBG6IDYSPRPCPTOLD.json","graph_json":"https://pith.science/api/pith-number/47B46WX7GDBG6IDYSPRPCPTOLD/graph.json","events_json":"https://pith.science/api/pith-number/47B46WX7GDBG6IDYSPRPCPTOLD/events.json","paper":"https://pith.science/paper/47B46WX7"},"agent_actions":{"view_html":"https://pith.science/pith/47B46WX7GDBG6IDYSPRPCPTOLD","download_json":"https://pith.science/pith/47B46WX7GDBG6IDYSPRPCPTOLD.json","view_paper":"https://pith.science/paper/47B46WX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4897&json=true","fetch_graph":"https://pith.science/api/pith-number/47B46WX7GDBG6IDYSPRPCPTOLD/graph.json","fetch_events":"https://pith.science/api/pith-number/47B46WX7GDBG6IDYSPRPCPTOLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47B46WX7GDBG6IDYSPRPCPTOLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47B46WX7GDBG6IDYSPRPCPTOLD/action/storage_attestation","attest_author":"https://pith.science/pith/47B46WX7GDBG6IDYSPRPCPTOLD/action/author_attestation","sign_citation":"https://pith.science/pith/47B46WX7GDBG6IDYSPRPCPTOLD/action/citation_signature","submit_replication":"https://pith.science/pith/47B46WX7GDBG6IDYSPRPCPTOLD/action/replication_record"}},"created_at":"2026-05-18T03:52:54.007394+00:00","updated_at":"2026-05-18T03:52:54.007394+00:00"}