{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TXA52PVTFM5UKY5FX5QGZTAEO6","short_pith_number":"pith:TXA52PVT","schema_version":"1.0","canonical_sha256":"9dc1dd3eb32b3b4563a5bf606ccc04779cf59cdc0520a13e3eb971168ca61037","source":{"kind":"arxiv","id":"1603.00717","version":1},"attestation_state":"computed","paper":{"title":"Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksey Tikhonov, Alexander Gasnikov, Andrey Raigorodskii, Gleb Gusev, Lev Bogolubsky, Maxim Zhukovskii, Pavel Dvurechensky, Yurii Nesterov","submitted_at":"2016-03-02T14:06:34Z","abstract_excerpt":"In this paper, we consider a non-convex loss-minimization problem of learning Supervised PageRank models, which can account for some properties not considered by classical approaches such as the classical PageRank model. We propose gradient-based and random gradient-free methods to solve this problem. Our algorithms are based on the concept of an inexact oracle and unlike the state state-of-the-art gradient-based method we manage to provide theoretically the convergence rate guarantees for both of them. In particular, under the assumption of local convexity of the loss function, our random gra"},"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":"1603.00717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-02T14:06:34Z","cross_cats_sorted":[],"title_canon_sha256":"c5f5716fc1cc272ac3ec3232f9db9ff4a1ff8007280eeb57a3c9e4682aab956c","abstract_canon_sha256":"a1f01222d8868ca00352f9d3c2172e5688276fbed9ddd077f7aacac4e9e59979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:43.120498Z","signature_b64":"OSWbzSf/oCdfdR78eMGn6yGsGQQWXLkDKVOpnX4UuOhCSfHtTmDEpjxvqZQvQXWDlHN97CsvuyxqebH4fKvmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dc1dd3eb32b3b4563a5bf606ccc04779cf59cdc0520a13e3eb971168ca61037","last_reissued_at":"2026-05-18T01:19:43.119881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:43.119881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aleksey Tikhonov, Alexander Gasnikov, Andrey Raigorodskii, Gleb Gusev, Lev Bogolubsky, Maxim Zhukovskii, Pavel Dvurechensky, Yurii Nesterov","submitted_at":"2016-03-02T14:06:34Z","abstract_excerpt":"In this paper, we consider a non-convex loss-minimization problem of learning Supervised PageRank models, which can account for some properties not considered by classical approaches such as the classical PageRank model. We propose gradient-based and random gradient-free methods to solve this problem. Our algorithms are based on the concept of an inexact oracle and unlike the state state-of-the-art gradient-based method we manage to provide theoretically the convergence rate guarantees for both of them. In particular, under the assumption of local convexity of the loss function, our random gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00717","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":"1603.00717","created_at":"2026-05-18T01:19:43.119990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00717v1","created_at":"2026-05-18T01:19:43.119990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00717","created_at":"2026-05-18T01:19:43.119990+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXA52PVTFM5U","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXA52PVTFM5UKY5F","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXA52PVT","created_at":"2026-05-18T12:30:46.583412+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/TXA52PVTFM5UKY5FX5QGZTAEO6","json":"https://pith.science/pith/TXA52PVTFM5UKY5FX5QGZTAEO6.json","graph_json":"https://pith.science/api/pith-number/TXA52PVTFM5UKY5FX5QGZTAEO6/graph.json","events_json":"https://pith.science/api/pith-number/TXA52PVTFM5UKY5FX5QGZTAEO6/events.json","paper":"https://pith.science/paper/TXA52PVT"},"agent_actions":{"view_html":"https://pith.science/pith/TXA52PVTFM5UKY5FX5QGZTAEO6","download_json":"https://pith.science/pith/TXA52PVTFM5UKY5FX5QGZTAEO6.json","view_paper":"https://pith.science/paper/TXA52PVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00717&json=true","fetch_graph":"https://pith.science/api/pith-number/TXA52PVTFM5UKY5FX5QGZTAEO6/graph.json","fetch_events":"https://pith.science/api/pith-number/TXA52PVTFM5UKY5FX5QGZTAEO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXA52PVTFM5UKY5FX5QGZTAEO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXA52PVTFM5UKY5FX5QGZTAEO6/action/storage_attestation","attest_author":"https://pith.science/pith/TXA52PVTFM5UKY5FX5QGZTAEO6/action/author_attestation","sign_citation":"https://pith.science/pith/TXA52PVTFM5UKY5FX5QGZTAEO6/action/citation_signature","submit_replication":"https://pith.science/pith/TXA52PVTFM5UKY5FX5QGZTAEO6/action/replication_record"}},"created_at":"2026-05-18T01:19:43.119990+00:00","updated_at":"2026-05-18T01:19:43.119990+00:00"}