{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B7VEJ54O7WDAN65R2ZXZTERKOK","short_pith_number":"pith:B7VEJ54O","schema_version":"1.0","canonical_sha256":"0fea44f78efd8606fbb1d66f99922a729a64f5492bfe7121be381357994d4f6d","source":{"kind":"arxiv","id":"1802.04475","version":1},"attestation_state":"computed","paper":{"title":"Graph-Based Ascent Algorithms for Function Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC","stat.ML"],"primary_cat":"cs.SI","authors_text":"Muni Sreenivas Pydi, Po-Ling Loh, Varun Jog","submitted_at":"2018-02-13T06:31:15Z","abstract_excerpt":"We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of the graph along a path, and the next iterate is chosen from the neighbors of the current iterate with probability distribution determined by the function values at the current iterate and its neighbors. We study two algorithms corresponding to a Metropolis-Hastings random walk with different transition kernels: (i) The first algorithm is an exponentially wei"},"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":"1802.04475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-02-13T06:31:15Z","cross_cats_sorted":["cs.NA","math.OC","stat.ML"],"title_canon_sha256":"39b3b30b53b4ca88761f211f6527a6109bfc3dd3886e4b10fa458cf47a74080a","abstract_canon_sha256":"cfc1401ed35389773982f8068e689478f569fc4191a405bceafc818f221d9a1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:44.102288Z","signature_b64":"FFNifqTfHuSa04I8t+G/wqzLlowuBRFugHa4/IPYWiOxhF/sUAFu+yFk3e+y0lh47EM7Ngtm2ExIwzaDcmnGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fea44f78efd8606fbb1d66f99922a729a64f5492bfe7121be381357994d4f6d","last_reissued_at":"2026-05-18T00:23:44.101821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:44.101821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Based Ascent Algorithms for Function Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC","stat.ML"],"primary_cat":"cs.SI","authors_text":"Muni Sreenivas Pydi, Po-Ling Loh, Varun Jog","submitted_at":"2018-02-13T06:31:15Z","abstract_excerpt":"We study the problem of finding the maximum of a function defined on the nodes of a connected graph. The goal is to identify a node where the function obtains its maximum. We focus on local iterative algorithms, which traverse the nodes of the graph along a path, and the next iterate is chosen from the neighbors of the current iterate with probability distribution determined by the function values at the current iterate and its neighbors. We study two algorithms corresponding to a Metropolis-Hastings random walk with different transition kernels: (i) The first algorithm is an exponentially wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04475","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":"1802.04475","created_at":"2026-05-18T00:23:44.101883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04475v1","created_at":"2026-05-18T00:23:44.101883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04475","created_at":"2026-05-18T00:23:44.101883+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7VEJ54O7WDA","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7VEJ54O7WDAN65R","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7VEJ54O","created_at":"2026-05-18T12:32:13.499390+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/B7VEJ54O7WDAN65R2ZXZTERKOK","json":"https://pith.science/pith/B7VEJ54O7WDAN65R2ZXZTERKOK.json","graph_json":"https://pith.science/api/pith-number/B7VEJ54O7WDAN65R2ZXZTERKOK/graph.json","events_json":"https://pith.science/api/pith-number/B7VEJ54O7WDAN65R2ZXZTERKOK/events.json","paper":"https://pith.science/paper/B7VEJ54O"},"agent_actions":{"view_html":"https://pith.science/pith/B7VEJ54O7WDAN65R2ZXZTERKOK","download_json":"https://pith.science/pith/B7VEJ54O7WDAN65R2ZXZTERKOK.json","view_paper":"https://pith.science/paper/B7VEJ54O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04475&json=true","fetch_graph":"https://pith.science/api/pith-number/B7VEJ54O7WDAN65R2ZXZTERKOK/graph.json","fetch_events":"https://pith.science/api/pith-number/B7VEJ54O7WDAN65R2ZXZTERKOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7VEJ54O7WDAN65R2ZXZTERKOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7VEJ54O7WDAN65R2ZXZTERKOK/action/storage_attestation","attest_author":"https://pith.science/pith/B7VEJ54O7WDAN65R2ZXZTERKOK/action/author_attestation","sign_citation":"https://pith.science/pith/B7VEJ54O7WDAN65R2ZXZTERKOK/action/citation_signature","submit_replication":"https://pith.science/pith/B7VEJ54O7WDAN65R2ZXZTERKOK/action/replication_record"}},"created_at":"2026-05-18T00:23:44.101883+00:00","updated_at":"2026-05-18T00:23:44.101883+00:00"}