{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NLFKQSWHFIWOJLNO2PTNPJC7UG","short_pith_number":"pith:NLFKQSWH","canonical_record":{"source":{"id":"1610.01405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-05T13:19:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e106d456d0c28a39cc6bf4eb3098b8bbceb71f38c83149ee2ebdad48521453d3","abstract_canon_sha256":"66b95fa057ebb4e640f96b78d968580737a3ac719320ec9656bb307058db7cdb"},"schema_version":"1.0"},"canonical_sha256":"6acaa84ac72a2ce4adaed3e6d7a45fa1a34155cd0212942fbbc4de33dee3e0d1","source":{"kind":"arxiv","id":"1610.01405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01405","created_at":"2026-05-18T01:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01405v1","created_at":"2026-05-18T01:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01405","created_at":"2026-05-18T01:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"NLFKQSWHFIWO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NLFKQSWHFIWOJLNO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NLFKQSWH","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NLFKQSWHFIWOJLNO2PTNPJC7UG","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-05T13:19:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e106d456d0c28a39cc6bf4eb3098b8bbceb71f38c83149ee2ebdad48521453d3","abstract_canon_sha256":"66b95fa057ebb4e640f96b78d968580737a3ac719320ec9656bb307058db7cdb"},"schema_version":"1.0"},"canonical_sha256":"6acaa84ac72a2ce4adaed3e6d7a45fa1a34155cd0212942fbbc4de33dee3e0d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:10.937449Z","signature_b64":"laGxG2JhrtkBUkBAELHIT+FO5hn5/D33WzfRBJymAcBvfEe3BZeNQ0h3++ceXPXQT++3OqpiJBHo3AR397fOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6acaa84ac72a2ce4adaed3e6d7a45fa1a34155cd0212942fbbc4de33dee3e0d1","last_reissued_at":"2026-05-18T01:03:10.936940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:10.936940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01405","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-18T01:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRuslzM2l7WfjKvmUaXC56C4/jyhk6XR2GoNGTlnIHEITAy17bdTflJCw8guPqx1unmfTuoODXSrIwD+uwKFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:36:16.486160Z"},"content_sha256":"619ac98a7c11d6b471f7b1c1a46fa45528fa63268b7e4383d974d10cdbca9062","schema_version":"1.0","event_id":"sha256:619ac98a7c11d6b471f7b1c1a46fa45528fa63268b7e4383d974d10cdbca9062"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NLFKQSWHFIWOJLNO2PTNPJC7UG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Probably Approximately Correct Answer to 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, Vaishali P","submitted_at":"2016-10-05T13:19:26Z","abstract_excerpt":"This paper considers 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 a related stochastic processes called penalties. We assume that a delayed information about an event in the system is available as a common information at every user, and the state of the system is evolving in an independent and non-stationary fashion. We show that an approximate Drift-plus-penalty (DPP) algorithm that we propose achieves a time average cost that is within some positive constant epsilon of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01405","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-18T01:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1f1ybib7CHZmX0y8cYhSvMN7H6SdWRGFcvl32XktkXN4twVyrN6tDtpq6gRwO+zSvrK1wzvcsIDw2QEBBpJ0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:36:16.486873Z"},"content_sha256":"ed652ca15b1e94485823343b3983dc95a5418d69649eb8e88f04e722c2f4f041","schema_version":"1.0","event_id":"sha256:ed652ca15b1e94485823343b3983dc95a5418d69649eb8e88f04e722c2f4f041"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLFKQSWHFIWOJLNO2PTNPJC7UG/bundle.json","state_url":"https://pith.science/pith/NLFKQSWHFIWOJLNO2PTNPJC7UG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLFKQSWHFIWOJLNO2PTNPJC7UG/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:36:16Z","links":{"resolver":"https://pith.science/pith/NLFKQSWHFIWOJLNO2PTNPJC7UG","bundle":"https://pith.science/pith/NLFKQSWHFIWOJLNO2PTNPJC7UG/bundle.json","state":"https://pith.science/pith/NLFKQSWHFIWOJLNO2PTNPJC7UG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLFKQSWHFIWOJLNO2PTNPJC7UG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NLFKQSWHFIWOJLNO2PTNPJC7UG","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":"66b95fa057ebb4e640f96b78d968580737a3ac719320ec9656bb307058db7cdb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-05T13:19:26Z","title_canon_sha256":"e106d456d0c28a39cc6bf4eb3098b8bbceb71f38c83149ee2ebdad48521453d3"},"schema_version":"1.0","source":{"id":"1610.01405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01405","created_at":"2026-05-18T01:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01405v1","created_at":"2026-05-18T01:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01405","created_at":"2026-05-18T01:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"NLFKQSWHFIWO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NLFKQSWHFIWOJLNO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NLFKQSWH","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:ed652ca15b1e94485823343b3983dc95a5418d69649eb8e88f04e722c2f4f041","target":"graph","created_at":"2026-05-18T01:03:10Z","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 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 a related stochastic processes called penalties. We assume that a delayed information about an event in the system is available as a common information at every user, and the state of the system is evolving in an independent and non-stationary fashion. We show that an approximate Drift-plus-penalty (DPP) algorithm that we propose achieves a time average cost that is within some positive constant epsilon of t","authors_text":"B. N. Bharath, Vaishali P","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-05T13:19:26Z","title":"A Probably Approximately Correct Answer to Distributed Stochastic Optimization in a Non-stationary Environment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01405","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:619ac98a7c11d6b471f7b1c1a46fa45528fa63268b7e4383d974d10cdbca9062","target":"record","created_at":"2026-05-18T01:03:10Z","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":"66b95fa057ebb4e640f96b78d968580737a3ac719320ec9656bb307058db7cdb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-05T13:19:26Z","title_canon_sha256":"e106d456d0c28a39cc6bf4eb3098b8bbceb71f38c83149ee2ebdad48521453d3"},"schema_version":"1.0","source":{"id":"1610.01405","kind":"arxiv","version":1}},"canonical_sha256":"6acaa84ac72a2ce4adaed3e6d7a45fa1a34155cd0212942fbbc4de33dee3e0d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6acaa84ac72a2ce4adaed3e6d7a45fa1a34155cd0212942fbbc4de33dee3e0d1","first_computed_at":"2026-05-18T01:03:10.936940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:10.936940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"laGxG2JhrtkBUkBAELHIT+FO5hn5/D33WzfRBJymAcBvfEe3BZeNQ0h3++ceXPXQT++3OqpiJBHo3AR397fOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:10.937449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:619ac98a7c11d6b471f7b1c1a46fa45528fa63268b7e4383d974d10cdbca9062","sha256:ed652ca15b1e94485823343b3983dc95a5418d69649eb8e88f04e722c2f4f041"],"state_sha256":"b31f14c50029b3e9ca09235bab9d7a91345e13284d0ab26665721e8b012e5212"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifwF5jyHkgSmcRqYimqAnbKSFHpfZGADo8kOpXsCFOlYluKuMp6uP/8iztdcJP1pBUOMqOfG2OQotOaCHEtMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:36:16.490393Z","bundle_sha256":"72588461c821bebe3f013f1bd28c6d23f3164c22a9b76bdbebcdb54c1df3c527"}}