{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MPPHSAYLSSDQVNCH6744A5HFVN","short_pith_number":"pith:MPPHSAYL","canonical_record":{"source":{"id":"1411.4282","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-16T17:29:04Z","cross_cats_sorted":[],"title_canon_sha256":"a95941b30817a8e0c27cde73ae88c15d30a12e8629e0757c6c5c2d710f057e31","abstract_canon_sha256":"0534feb8601363d4799f3aaec8f51f2ca6a7e0d226ab2ba5314403946c2fa228"},"schema_version":"1.0"},"canonical_sha256":"63de79030b94870ab447f7f9c074e5ab6a431858602037d01f989a27bbe8dcef","source":{"kind":"arxiv","id":"1411.4282","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4282","created_at":"2026-05-18T01:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4282v5","created_at":"2026-05-18T01:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4282","created_at":"2026-05-18T01:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"MPPHSAYLSSDQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MPPHSAYLSSDQVNCH","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MPPHSAYL","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MPPHSAYLSSDQVNCH6744A5HFVN","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4282","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-16T17:29:04Z","cross_cats_sorted":[],"title_canon_sha256":"a95941b30817a8e0c27cde73ae88c15d30a12e8629e0757c6c5c2d710f057e31","abstract_canon_sha256":"0534feb8601363d4799f3aaec8f51f2ca6a7e0d226ab2ba5314403946c2fa228"},"schema_version":"1.0"},"canonical_sha256":"63de79030b94870ab447f7f9c074e5ab6a431858602037d01f989a27bbe8dcef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:16.078625Z","signature_b64":"DFTuVmH0rl3oAneQzp7rc3BIOwZMokCxiTQi4gln8XvI3kd8Z5C0PfU+vokZgmTE5eHtug/uVUWvpeAAfoQ3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63de79030b94870ab447f7f9c074e5ab6a431858602037d01f989a27bbe8dcef","last_reissued_at":"2026-05-18T01:25:16.078171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:16.078171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4282","source_version":5,"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-18T01:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lnfSLiHDZxEQwsuAWGDgXKLkwBDvU17cYGRCNwFN3m3eF70OJxGci9mlSb0NAthzsI2NecAYu6b3UGSm1DHrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:57:33.854857Z"},"content_sha256":"3c49f16f8346a97a9390071a8bfe155a1978793f63a89e20f076ee155db949db","schema_version":"1.0","event_id":"sha256:3c49f16f8346a97a9390071a8bfe155a1978793f63a89e20f076ee155db949db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MPPHSAYLSSDQVNCH6744A5HFVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Supervised PageRank with 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":"2014-11-16T17:29:04Z","abstract_excerpt":"In this paper, we consider a problem of learning supervised PageRank models, which can account for some properties not considered by classical approaches such as the classical PageRank algorithm. Due to huge hidden dimension of the optimization problem we use random gradient-free methods to solve it. We prove a convergence theorem and estimate the number of arithmetic operations needed to solve it with a given accuracy. We find the best settings of the gradient-free optimization method in terms of the number of arithmetic operations needed to achieve given accuracy of the objective. In the pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4282","kind":"arxiv","version":5},"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-18T01:25:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIGq5xxDOuVbWdDi8Z7fTfeK5ttYySSUQ3/rGYYrCJQCo1T1UsPBtAGdIpwVjcG7lN0PTsBclerwhflQIhsSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:57:33.855211Z"},"content_sha256":"fb2432c77efbb57d32b1e82887681f6d96380d30bfec64954214f1482f82dd8f","schema_version":"1.0","event_id":"sha256:fb2432c77efbb57d32b1e82887681f6d96380d30bfec64954214f1482f82dd8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPPHSAYLSSDQVNCH6744A5HFVN/bundle.json","state_url":"https://pith.science/pith/MPPHSAYLSSDQVNCH6744A5HFVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPPHSAYLSSDQVNCH6744A5HFVN/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-05-27T22:57:33Z","links":{"resolver":"https://pith.science/pith/MPPHSAYLSSDQVNCH6744A5HFVN","bundle":"https://pith.science/pith/MPPHSAYLSSDQVNCH6744A5HFVN/bundle.json","state":"https://pith.science/pith/MPPHSAYLSSDQVNCH6744A5HFVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPPHSAYLSSDQVNCH6744A5HFVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MPPHSAYLSSDQVNCH6744A5HFVN","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":"0534feb8601363d4799f3aaec8f51f2ca6a7e0d226ab2ba5314403946c2fa228","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-16T17:29:04Z","title_canon_sha256":"a95941b30817a8e0c27cde73ae88c15d30a12e8629e0757c6c5c2d710f057e31"},"schema_version":"1.0","source":{"id":"1411.4282","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4282","created_at":"2026-05-18T01:25:16Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4282v5","created_at":"2026-05-18T01:25:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4282","created_at":"2026-05-18T01:25:16Z"},{"alias_kind":"pith_short_12","alias_value":"MPPHSAYLSSDQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MPPHSAYLSSDQVNCH","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MPPHSAYL","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:fb2432c77efbb57d32b1e82887681f6d96380d30bfec64954214f1482f82dd8f","target":"graph","created_at":"2026-05-18T01:25:16Z","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":"In this paper, we consider a problem of learning supervised PageRank models, which can account for some properties not considered by classical approaches such as the classical PageRank algorithm. Due to huge hidden dimension of the optimization problem we use random gradient-free methods to solve it. We prove a convergence theorem and estimate the number of arithmetic operations needed to solve it with a given accuracy. We find the best settings of the gradient-free optimization method in terms of the number of arithmetic operations needed to achieve given accuracy of the objective. In the pap","authors_text":"Aleksey Tikhonov, Alexander Gasnikov, Andrey Raigorodskii, Gleb Gusev, Lev Bogolubsky, Maxim Zhukovskii, Pavel Dvurechensky, Yurii Nesterov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-16T17:29:04Z","title":"Learning Supervised PageRank with Gradient-Free Optimization Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4282","kind":"arxiv","version":5},"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:3c49f16f8346a97a9390071a8bfe155a1978793f63a89e20f076ee155db949db","target":"record","created_at":"2026-05-18T01:25:16Z","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":"0534feb8601363d4799f3aaec8f51f2ca6a7e0d226ab2ba5314403946c2fa228","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-16T17:29:04Z","title_canon_sha256":"a95941b30817a8e0c27cde73ae88c15d30a12e8629e0757c6c5c2d710f057e31"},"schema_version":"1.0","source":{"id":"1411.4282","kind":"arxiv","version":5}},"canonical_sha256":"63de79030b94870ab447f7f9c074e5ab6a431858602037d01f989a27bbe8dcef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63de79030b94870ab447f7f9c074e5ab6a431858602037d01f989a27bbe8dcef","first_computed_at":"2026-05-18T01:25:16.078171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:16.078171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DFTuVmH0rl3oAneQzp7rc3BIOwZMokCxiTQi4gln8XvI3kd8Z5C0PfU+vokZgmTE5eHtug/uVUWvpeAAfoQ3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:16.078625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4282","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c49f16f8346a97a9390071a8bfe155a1978793f63a89e20f076ee155db949db","sha256:fb2432c77efbb57d32b1e82887681f6d96380d30bfec64954214f1482f82dd8f"],"state_sha256":"aa810045fc4136897edb7bf4646a483303d588d628064d5686d5282415bda4df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/ZuUWs8JM8g24fnolJsPxg1wXTiQRJnc46iP1DyPYk8rpu5tWFNWrA3QovQnSRo/V7eTZrqVENJNS07oFkyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:57:33.857856Z","bundle_sha256":"01db97abbce0e3e1921c1a21e75747e6d5235983ff45b2cb97446cda9e53f933"}}