{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A6APPSI2QKFNF4SFGFHDJOKVU4","short_pith_number":"pith:A6APPSI2","schema_version":"1.0","canonical_sha256":"0780f7c91a828ad2f245314e34b955a72e8412a79e4a3c3caf0883bb1d4a9922","source":{"kind":"arxiv","id":"1311.0042","version":1},"attestation_state":"computed","paper":{"title":"Optimization with Discrete Simultaneous Perturbation Stochastic Approximation Using Noisy Loss Function Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Qi Wang","submitted_at":"2013-10-31T21:49:44Z","abstract_excerpt":"Discrete stochastic optimization considers the problem of minimizing (or maximizing) loss functions defined on discrete sets, where only noisy measurements of the loss functions are available. The discrete stochastic optimization problem is widely applicable in practice, and many algorithms have been considered to solve this kind of optimization problem. Motivated by the efficient algorithm of simultaneous perturbation stochastic approximation (SPSA) for continuous stochastic optimization problems, we introduce the middle point discrete simultaneous perturbation stochastic approximation (DSPSA"},"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":"1311.0042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-31T21:49:44Z","cross_cats_sorted":[],"title_canon_sha256":"9cb8fe5b8c8bef8479c41b123b8d4cd771471b0725deaea9dea75026ab9015fb","abstract_canon_sha256":"17319120093f922311172d574755b8da5e1336eff1be9e084c0e3b67c400da71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:16.201993Z","signature_b64":"6CQmWF9D4tCRTILNEab2xdWum6RLX0k0GK4bbBUaLkSwYWHSEY8hCV8xE/n2iL9Oe110ZHozQ17w7iD2GhPeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0780f7c91a828ad2f245314e34b955a72e8412a79e4a3c3caf0883bb1d4a9922","last_reissued_at":"2026-05-18T03:08:16.201441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:16.201441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization with Discrete Simultaneous Perturbation Stochastic Approximation Using Noisy Loss Function Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Qi Wang","submitted_at":"2013-10-31T21:49:44Z","abstract_excerpt":"Discrete stochastic optimization considers the problem of minimizing (or maximizing) loss functions defined on discrete sets, where only noisy measurements of the loss functions are available. The discrete stochastic optimization problem is widely applicable in practice, and many algorithms have been considered to solve this kind of optimization problem. Motivated by the efficient algorithm of simultaneous perturbation stochastic approximation (SPSA) for continuous stochastic optimization problems, we introduce the middle point discrete simultaneous perturbation stochastic approximation (DSPSA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0042","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":"1311.0042","created_at":"2026-05-18T03:08:16.201532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0042v1","created_at":"2026-05-18T03:08:16.201532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0042","created_at":"2026-05-18T03:08:16.201532+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6APPSI2QKFN","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6APPSI2QKFNF4SF","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6APPSI2","created_at":"2026-05-18T12:27:38.830355+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/A6APPSI2QKFNF4SFGFHDJOKVU4","json":"https://pith.science/pith/A6APPSI2QKFNF4SFGFHDJOKVU4.json","graph_json":"https://pith.science/api/pith-number/A6APPSI2QKFNF4SFGFHDJOKVU4/graph.json","events_json":"https://pith.science/api/pith-number/A6APPSI2QKFNF4SFGFHDJOKVU4/events.json","paper":"https://pith.science/paper/A6APPSI2"},"agent_actions":{"view_html":"https://pith.science/pith/A6APPSI2QKFNF4SFGFHDJOKVU4","download_json":"https://pith.science/pith/A6APPSI2QKFNF4SFGFHDJOKVU4.json","view_paper":"https://pith.science/paper/A6APPSI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0042&json=true","fetch_graph":"https://pith.science/api/pith-number/A6APPSI2QKFNF4SFGFHDJOKVU4/graph.json","fetch_events":"https://pith.science/api/pith-number/A6APPSI2QKFNF4SFGFHDJOKVU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6APPSI2QKFNF4SFGFHDJOKVU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6APPSI2QKFNF4SFGFHDJOKVU4/action/storage_attestation","attest_author":"https://pith.science/pith/A6APPSI2QKFNF4SFGFHDJOKVU4/action/author_attestation","sign_citation":"https://pith.science/pith/A6APPSI2QKFNF4SFGFHDJOKVU4/action/citation_signature","submit_replication":"https://pith.science/pith/A6APPSI2QKFNF4SFGFHDJOKVU4/action/replication_record"}},"created_at":"2026-05-18T03:08:16.201532+00:00","updated_at":"2026-05-18T03:08:16.201532+00:00"}