{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7OQZSJATZGR52E7UVR45NIR6FT","short_pith_number":"pith:7OQZSJAT","schema_version":"1.0","canonical_sha256":"fba1992413c9a3dd13f4ac79d6a23e2ccbb6d7b3ecbd3215cdef7157052c8a4c","source":{"kind":"arxiv","id":"2508.21414","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Online Feedback Optimization for Networks of Non-Compliant Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrey Bernstein, Caio Kalil Lauand","submitted_at":"2025-08-29T08:33:52Z","abstract_excerpt":"In several applications of online optimization to networked systems such as power grids and robotic networks, information about the system model and its disturbances is not generally available. Within the optimization community, increasing interest has been devoted to the framework of online feedback optimization (OFO), which aims to address these challenges by leveraging real-time input-output measurements to empower online optimization. We extend the OFO framework to a stochastic setting, allowing the subsystems comprising the network (the $\\textit{agents}$) to be $\\textit{non-compliant}$. T"},"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":"2508.21414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-29T08:33:52Z","cross_cats_sorted":[],"title_canon_sha256":"067bb9c3d4d1b7b0904f4bac19822b08e05b89f0a044631990f27e41339b434c","abstract_canon_sha256":"795b5d56800ff46c3a6555194208ff28b6fe6a93e34d84fd0ad42d5aab8c5e11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:34.504927Z","signature_b64":"xnVjMna9wp88g5mPJKn65a6B4cqXT89TuOb8NU2P2c3u26aCqjrFgsYDnwNK5P5OSO6ksskZoTQwmhoSmIl5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fba1992413c9a3dd13f4ac79d6a23e2ccbb6d7b3ecbd3215cdef7157052c8a4c","last_reissued_at":"2026-07-05T12:01:34.504415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:34.504415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Online Feedback Optimization for Networks of Non-Compliant Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrey Bernstein, Caio Kalil Lauand","submitted_at":"2025-08-29T08:33:52Z","abstract_excerpt":"In several applications of online optimization to networked systems such as power grids and robotic networks, information about the system model and its disturbances is not generally available. Within the optimization community, increasing interest has been devoted to the framework of online feedback optimization (OFO), which aims to address these challenges by leveraging real-time input-output measurements to empower online optimization. We extend the OFO framework to a stochastic setting, allowing the subsystems comprising the network (the $\\textit{agents}$) to be $\\textit{non-compliant}$. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21414","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.21414/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.21414","created_at":"2026-07-05T12:01:34.504476+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.21414v1","created_at":"2026-07-05T12:01:34.504476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21414","created_at":"2026-07-05T12:01:34.504476+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OQZSJATZGR5","created_at":"2026-07-05T12:01:34.504476+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OQZSJATZGR52E7U","created_at":"2026-07-05T12:01:34.504476+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OQZSJAT","created_at":"2026-07-05T12:01:34.504476+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19284","citing_title":"Projected Stochastic Gradient Descent with Decision Dependent Distributions: Extended Version","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7OQZSJATZGR52E7UVR45NIR6FT","json":"https://pith.science/pith/7OQZSJATZGR52E7UVR45NIR6FT.json","graph_json":"https://pith.science/api/pith-number/7OQZSJATZGR52E7UVR45NIR6FT/graph.json","events_json":"https://pith.science/api/pith-number/7OQZSJATZGR52E7UVR45NIR6FT/events.json","paper":"https://pith.science/paper/7OQZSJAT"},"agent_actions":{"view_html":"https://pith.science/pith/7OQZSJATZGR52E7UVR45NIR6FT","download_json":"https://pith.science/pith/7OQZSJATZGR52E7UVR45NIR6FT.json","view_paper":"https://pith.science/paper/7OQZSJAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.21414&json=true","fetch_graph":"https://pith.science/api/pith-number/7OQZSJATZGR52E7UVR45NIR6FT/graph.json","fetch_events":"https://pith.science/api/pith-number/7OQZSJATZGR52E7UVR45NIR6FT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OQZSJATZGR52E7UVR45NIR6FT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OQZSJATZGR52E7UVR45NIR6FT/action/storage_attestation","attest_author":"https://pith.science/pith/7OQZSJATZGR52E7UVR45NIR6FT/action/author_attestation","sign_citation":"https://pith.science/pith/7OQZSJATZGR52E7UVR45NIR6FT/action/citation_signature","submit_replication":"https://pith.science/pith/7OQZSJATZGR52E7UVR45NIR6FT/action/replication_record"}},"created_at":"2026-07-05T12:01:34.504476+00:00","updated_at":"2026-07-05T12:01:34.504476+00:00"}