{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:F5Y2M2JBUY5F5G6RCZNELO5FES","short_pith_number":"pith:F5Y2M2JB","schema_version":"1.0","canonical_sha256":"2f71a66921a63a5e9bd1165a45bba52490adc440e7d64bc45cda50a124a68f7e","source":{"kind":"arxiv","id":"1304.7727","version":2},"attestation_state":"computed","paper":{"title":"Distributed stochastic optimization via correlated scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Michael J. Neely","submitted_at":"2013-04-29T18:04:25Z","abstract_excerpt":"This paper considers a problem where multiple users make repeated decisions based on their own observed events. The events and decisions at each time step determine the values of a utility function and a collection of penalty functions. The goal is to make distributed decisions over time to maximize time average utility subject to time average constraints on the penalties. An example is a collection of power constrained sensor nodes that repeatedly report their own observations to a fusion center. Maximum time average utility is fundamentally reduced because users do not know the events observ"},"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":"1304.7727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-29T18:04:25Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"ccca00a5e79fbdbda828174e1c38efbcfb1425622dbc3c225c9aaee7094a821d","abstract_canon_sha256":"2763902ab0b595ee59ef34ab6df8f1d6ffad0982587411213f3a579d030434c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:08.493718Z","signature_b64":"U+Ic/7LTYHd8ooydu9CGo9eDHrEmMJkANE1AcyyPG0eKfURbugYJjSNGP5/Kig7om+T/zf4xJ0BForkaY0tGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f71a66921a63a5e9bd1165a45bba52490adc440e7d64bc45cda50a124a68f7e","last_reissued_at":"2026-05-18T03:26:08.493137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:08.493137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed stochastic optimization via correlated scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Michael J. Neely","submitted_at":"2013-04-29T18:04:25Z","abstract_excerpt":"This paper considers a problem where multiple users make repeated decisions based on their own observed events. The events and decisions at each time step determine the values of a utility function and a collection of penalty functions. The goal is to make distributed decisions over time to maximize time average utility subject to time average constraints on the penalties. An example is a collection of power constrained sensor nodes that repeatedly report their own observations to a fusion center. Maximum time average utility is fundamentally reduced because users do not know the events observ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7727","kind":"arxiv","version":2},"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":"1304.7727","created_at":"2026-05-18T03:26:08.493215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7727v2","created_at":"2026-05-18T03:26:08.493215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7727","created_at":"2026-05-18T03:26:08.493215+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5Y2M2JBUY5F","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5Y2M2JBUY5F5G6R","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5Y2M2JB","created_at":"2026-05-18T12:27:43.054852+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/F5Y2M2JBUY5F5G6RCZNELO5FES","json":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES.json","graph_json":"https://pith.science/api/pith-number/F5Y2M2JBUY5F5G6RCZNELO5FES/graph.json","events_json":"https://pith.science/api/pith-number/F5Y2M2JBUY5F5G6RCZNELO5FES/events.json","paper":"https://pith.science/paper/F5Y2M2JB"},"agent_actions":{"view_html":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES","download_json":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES.json","view_paper":"https://pith.science/paper/F5Y2M2JB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7727&json=true","fetch_graph":"https://pith.science/api/pith-number/F5Y2M2JBUY5F5G6RCZNELO5FES/graph.json","fetch_events":"https://pith.science/api/pith-number/F5Y2M2JBUY5F5G6RCZNELO5FES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/action/storage_attestation","attest_author":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/action/author_attestation","sign_citation":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/action/citation_signature","submit_replication":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/action/replication_record"}},"created_at":"2026-05-18T03:26:08.493215+00:00","updated_at":"2026-05-18T03:26:08.493215+00:00"}