{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6FKD5T6Q3MUOZVTBBN6HMLHG76","short_pith_number":"pith:6FKD5T6Q","canonical_record":{"source":{"id":"1701.02560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T12:48:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4136b1cef49afb6ab12b44b1598613a9228a9d912ca8e3e0416f51c863b0cbc7","abstract_canon_sha256":"7364c36c8ecf9f15940afc3d64384186c48da159183ce0e89a128ee2119726bd"},"schema_version":"1.0"},"canonical_sha256":"f1543ecfd0db28ecd6610b7c762ce6ffb46bd6fb82741e4393499b9fe57d51aa","source":{"kind":"arxiv","id":"1701.02560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02560","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02560v1","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02560","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"6FKD5T6Q3MUO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6FKD5T6Q3MUOZVTB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6FKD5T6Q","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6FKD5T6Q3MUOZVTBBN6HMLHG76","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T12:48:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4136b1cef49afb6ab12b44b1598613a9228a9d912ca8e3e0416f51c863b0cbc7","abstract_canon_sha256":"7364c36c8ecf9f15940afc3d64384186c48da159183ce0e89a128ee2119726bd"},"schema_version":"1.0"},"canonical_sha256":"f1543ecfd0db28ecd6610b7c762ce6ffb46bd6fb82741e4393499b9fe57d51aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.984972Z","signature_b64":"3PwU7kbNYkWpL7WNWMIY9R1E5h5GJmV0Q0fMVDEXclt5rfntXiJej4OIBxaJpfhLJh5rtBeIPJGTCrQYQVIKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1543ecfd0db28ecd6610b7c762ce6ffb46bd6fb82741e4393499b9fe57d51aa","last_reissued_at":"2026-05-18T00:53:03.984338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.984338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02560","source_version":1,"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-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xoqlnf5n8voGfDa4i7WqlJEQ/kITeLMEGbxYDs+S5TjjAAYvRdOLNjODcuHkgFnyxdcY6zAEoEc9DEIUJbNrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:19:32.579522Z"},"content_sha256":"086cae875a72438eb27e440167f0168dcd380d741d7f662f41d9dba80163e72b","schema_version":"1.0","event_id":"sha256:086cae875a72438eb27e440167f0168dcd380d741d7f662f41d9dba80163e72b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6FKD5T6Q3MUOZVTBBN6HMLHG76","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time Complexity Analysis of a Distributed Stochastic Optimization in a Non-Stationary Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. N. Bharath, P. Vaishali","submitted_at":"2017-01-10T12:48:33Z","abstract_excerpt":"In this paper, we consider a distributed stochastic optimization problem where the goal is to minimize the time average of a cost function subject to a set of constraints on the time averages of related stochastic processes called penalties. We assume that the state of the system is evolving in an independent and non-stationary fashion and the \"common information\" available at each node is distributed and delayed. Such stochastic optimization is an integral part of many important problems in wireless networks such as scheduling, routing, resource allocation and crowd sensing. We propose an app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02560","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"},"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-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5k+EAMjYwKFWQ6MKVOnBRLA76xAMPac/Ms4iONl8BCEESUmI+8ZYI8tpTRNVgcCIzZ5BCz/uuSBOvNMjorsHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:19:32.580201Z"},"content_sha256":"1ff157a5ea242b4aaa342efccd51585d08426bd71389992e03b3e64b34519d4e","schema_version":"1.0","event_id":"sha256:1ff157a5ea242b4aaa342efccd51585d08426bd71389992e03b3e64b34519d4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FKD5T6Q3MUOZVTBBN6HMLHG76/bundle.json","state_url":"https://pith.science/pith/6FKD5T6Q3MUOZVTBBN6HMLHG76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FKD5T6Q3MUOZVTBBN6HMLHG76/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-06-06T15:19:32Z","links":{"resolver":"https://pith.science/pith/6FKD5T6Q3MUOZVTBBN6HMLHG76","bundle":"https://pith.science/pith/6FKD5T6Q3MUOZVTBBN6HMLHG76/bundle.json","state":"https://pith.science/pith/6FKD5T6Q3MUOZVTBBN6HMLHG76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FKD5T6Q3MUOZVTBBN6HMLHG76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6FKD5T6Q3MUOZVTBBN6HMLHG76","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":"7364c36c8ecf9f15940afc3d64384186c48da159183ce0e89a128ee2119726bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T12:48:33Z","title_canon_sha256":"4136b1cef49afb6ab12b44b1598613a9228a9d912ca8e3e0416f51c863b0cbc7"},"schema_version":"1.0","source":{"id":"1701.02560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02560","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02560v1","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02560","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"6FKD5T6Q3MUO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6FKD5T6Q3MUOZVTB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6FKD5T6Q","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:1ff157a5ea242b4aaa342efccd51585d08426bd71389992e03b3e64b34519d4e","target":"graph","created_at":"2026-05-18T00:53:03Z","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":"In this paper, we consider a distributed stochastic optimization problem where the goal is to minimize the time average of a cost function subject to a set of constraints on the time averages of related stochastic processes called penalties. We assume that the state of the system is evolving in an independent and non-stationary fashion and the \"common information\" available at each node is distributed and delayed. Such stochastic optimization is an integral part of many important problems in wireless networks such as scheduling, routing, resource allocation and crowd sensing. We propose an app","authors_text":"B. N. Bharath, P. Vaishali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T12:48:33Z","title":"Time Complexity Analysis of a Distributed Stochastic Optimization in a Non-Stationary Environment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02560","kind":"arxiv","version":1},"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:086cae875a72438eb27e440167f0168dcd380d741d7f662f41d9dba80163e72b","target":"record","created_at":"2026-05-18T00:53:03Z","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":"7364c36c8ecf9f15940afc3d64384186c48da159183ce0e89a128ee2119726bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-10T12:48:33Z","title_canon_sha256":"4136b1cef49afb6ab12b44b1598613a9228a9d912ca8e3e0416f51c863b0cbc7"},"schema_version":"1.0","source":{"id":"1701.02560","kind":"arxiv","version":1}},"canonical_sha256":"f1543ecfd0db28ecd6610b7c762ce6ffb46bd6fb82741e4393499b9fe57d51aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1543ecfd0db28ecd6610b7c762ce6ffb46bd6fb82741e4393499b9fe57d51aa","first_computed_at":"2026-05-18T00:53:03.984338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:03.984338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3PwU7kbNYkWpL7WNWMIY9R1E5h5GJmV0Q0fMVDEXclt5rfntXiJej4OIBxaJpfhLJh5rtBeIPJGTCrQYQVIKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:03.984972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:086cae875a72438eb27e440167f0168dcd380d741d7f662f41d9dba80163e72b","sha256:1ff157a5ea242b4aaa342efccd51585d08426bd71389992e03b3e64b34519d4e"],"state_sha256":"d9203e2f816f1acbb80a51bc555de3c2c0e0827f6a306c44ae06dc64eac897da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/8+/A5Xhy0FuD1r07lcB1O3wlZR0WyGkcQQk+KT3wfbyJ5Xr6j5kb73qRlm/Vcu/7JmA3O4SRL+FHFvt40xDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:19:32.583901Z","bundle_sha256":"03d8fb9ebb1c37aa8f2c498819a2acf36713dbe272f8cf7157ee635665677bac"}}