{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F5Y2M2JBUY5F5G6RCZNELO5FES","short_pith_number":"pith:F5Y2M2JB","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"},"canonical_sha256":"2f71a66921a63a5e9bd1165a45bba52490adc440e7d64bc45cda50a124a68f7e","source":{"kind":"arxiv","id":"1304.7727","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7727","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7727v2","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7727","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"F5Y2M2JBUY5F","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F5Y2M2JBUY5F5G6R","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F5Y2M2JB","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F5Y2M2JBUY5F5G6RCZNELO5FES","target":"record","payload":{"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"},"canonical_sha256":"2f71a66921a63a5e9bd1165a45bba52490adc440e7d64bc45cda50a124a68f7e","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"},"source_kind":"arxiv","source_id":"1304.7727","source_version":2,"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-18T03:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKmUBtfYSc4KyxG4drXwqwePJkJCoj1r0twCkDWV89DfF3ioJNbX68rJbCFar/9FuNA/14hmry1MQ4B+ta7KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:26:58.365773Z"},"content_sha256":"7eb92077c8fc65cb8af3ed7b77d2b72ac1ed58adefcdc6f188addbc4048c79c6","schema_version":"1.0","event_id":"sha256:7eb92077c8fc65cb8af3ed7b77d2b72ac1ed58adefcdc6f188addbc4048c79c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F5Y2M2JBUY5F5G6RCZNELO5FES","target":"graph","payload":{"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"},"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-18T03:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWWESm0YPFMv39VwuvvxRPEHMRQdlF1INP/PjUMxOagN7Y6aBrbGHXHQ73uYA+GBcVBPnRRHAybCSZjH6rvmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:26:58.366132Z"},"content_sha256":"b29bf421d6142546a3a3c4a0a67d4533434dcf55c9e13fc64e14b48147d69810","schema_version":"1.0","event_id":"sha256:b29bf421d6142546a3a3c4a0a67d4533434dcf55c9e13fc64e14b48147d69810"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/bundle.json","state_url":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/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-30T05:26:58Z","links":{"resolver":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES","bundle":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/bundle.json","state":"https://pith.science/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5Y2M2JBUY5F5G6RCZNELO5FES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F5Y2M2JBUY5F5G6RCZNELO5FES","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":"2763902ab0b595ee59ef34ab6df8f1d6ffad0982587411213f3a579d030434c6","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-29T18:04:25Z","title_canon_sha256":"ccca00a5e79fbdbda828174e1c38efbcfb1425622dbc3c225c9aaee7094a821d"},"schema_version":"1.0","source":{"id":"1304.7727","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7727","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7727v2","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7727","created_at":"2026-05-18T03:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"F5Y2M2JBUY5F","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"F5Y2M2JBUY5F5G6R","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"F5Y2M2JB","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:b29bf421d6142546a3a3c4a0a67d4533434dcf55c9e13fc64e14b48147d69810","target":"graph","created_at":"2026-05-18T03:26:08Z","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":"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","authors_text":"Michael J. Neely","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-29T18:04:25Z","title":"Distributed stochastic optimization via correlated scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7727","kind":"arxiv","version":2},"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:7eb92077c8fc65cb8af3ed7b77d2b72ac1ed58adefcdc6f188addbc4048c79c6","target":"record","created_at":"2026-05-18T03:26:08Z","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":"2763902ab0b595ee59ef34ab6df8f1d6ffad0982587411213f3a579d030434c6","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-29T18:04:25Z","title_canon_sha256":"ccca00a5e79fbdbda828174e1c38efbcfb1425622dbc3c225c9aaee7094a821d"},"schema_version":"1.0","source":{"id":"1304.7727","kind":"arxiv","version":2}},"canonical_sha256":"2f71a66921a63a5e9bd1165a45bba52490adc440e7d64bc45cda50a124a68f7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f71a66921a63a5e9bd1165a45bba52490adc440e7d64bc45cda50a124a68f7e","first_computed_at":"2026-05-18T03:26:08.493137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:08.493137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U+Ic/7LTYHd8ooydu9CGo9eDHrEmMJkANE1AcyyPG0eKfURbugYJjSNGP5/Kig7om+T/zf4xJ0BForkaY0tGCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:08.493718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7727","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7eb92077c8fc65cb8af3ed7b77d2b72ac1ed58adefcdc6f188addbc4048c79c6","sha256:b29bf421d6142546a3a3c4a0a67d4533434dcf55c9e13fc64e14b48147d69810"],"state_sha256":"d759dbb7585dc913898bdbdbf9e87f8a4539584972094ffa07788eeb974999ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EnQE5UJ96imO+C/ySd5XuuA5aOPQ7qBv61tIoqI/ujIBbYHSoaIPbZjbpzbfMU/ozxmwHAHq2I4HzLqGblmzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:26:58.368082Z","bundle_sha256":"7101e5c6ada9530b2578019c5b74a954f0ee64c9263a6ea493b4861ea11eaff5"}}