{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SGKJSFCTIQ64Q5P5SQPODV76IO","short_pith_number":"pith:SGKJSFCT","canonical_record":{"source":{"id":"1507.01859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-07T16:20:20Z","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"title_canon_sha256":"9147eb9296ff9b923b68ff2ada35a143fde33ef8525838c73d0ec18b20d69822","abstract_canon_sha256":"93a6e0960d03d4ca0852e7120964ab4b1537a44a25154c8329b54427dcc75c6e"},"schema_version":"1.0"},"canonical_sha256":"9194991453443dc875fd941ee1d7fe43bfe5f6165ef4cc48dc45446455a0bf83","source":{"kind":"arxiv","id":"1507.01859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01859","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01859v1","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01859","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"SGKJSFCTIQ64","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SGKJSFCTIQ64Q5P5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SGKJSFCT","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SGKJSFCTIQ64Q5P5SQPODV76IO","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-07T16:20:20Z","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"title_canon_sha256":"9147eb9296ff9b923b68ff2ada35a143fde33ef8525838c73d0ec18b20d69822","abstract_canon_sha256":"93a6e0960d03d4ca0852e7120964ab4b1537a44a25154c8329b54427dcc75c6e"},"schema_version":"1.0"},"canonical_sha256":"9194991453443dc875fd941ee1d7fe43bfe5f6165ef4cc48dc45446455a0bf83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:30.763026Z","signature_b64":"eZgY9wW3SfPcnQJxq2m09VpWgmkk6IVFfuaZA+gUmPnVovi8Zt/X1vPLoISjM8qKZhITeam2qr/0P0c8uQJ4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9194991453443dc875fd941ee1d7fe43bfe5f6165ef4cc48dc45446455a0bf83","last_reissued_at":"2026-05-18T01:12:30.762704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:30.762704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01859","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:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlVt0wMrme38eb69ARlgtskYD45Od6EF7v61ecQ0VsaWvaq0Pl3YskASLkhbKq9xhdG+j98jFb7L42y+UFhTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:53:39.836613Z"},"content_sha256":"e3fd19d7d1aa8f627ea5a24c0fa311f7ed30d924e77c925eaa1b3b3d932eb445","schema_version":"1.0","event_id":"sha256:e3fd19d7d1aa8f627ea5a24c0fa311f7ed30d924e77c925eaa1b3b3d932eb445"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SGKJSFCTIQ64Q5P5SQPODV76IO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A stochastic approximation algorithm for stochastic semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Bruno Gaujal, Panayotis Mertikopoulos","submitted_at":"2015-07-07T16:20:20Z","abstract_excerpt":"Motivated by applications to multi-antenna wireless networks, we propose a distributed and asynchronous algorithm for stochastic semidefinite programming. This algorithm is a stochastic approximation of a continous- time matrix exponential scheme regularized by the addition of an entropy-like term to the problem's objective function. We show that the resulting algorithm converges almost surely to an $\\varepsilon$-approximation of the optimal solution requiring only an unbiased estimate of the gradient of the problem's stochastic objective. When applied to throughput maximization in wireless mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01859","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:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spGJBUwk9uCFIVlmFnAUCU5co0URBBGKuOnFzsUgnvvZZYQufS1YSfRmny2sBFzVvQQhP9Yc5Xg03FSeoPQpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:53:39.836966Z"},"content_sha256":"accdca0e10179ccbfb3599b8d00bf131fe78972b7c9a911f625af6b9e4c833fb","schema_version":"1.0","event_id":"sha256:accdca0e10179ccbfb3599b8d00bf131fe78972b7c9a911f625af6b9e4c833fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGKJSFCTIQ64Q5P5SQPODV76IO/bundle.json","state_url":"https://pith.science/pith/SGKJSFCTIQ64Q5P5SQPODV76IO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGKJSFCTIQ64Q5P5SQPODV76IO/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-22T21:53:39Z","links":{"resolver":"https://pith.science/pith/SGKJSFCTIQ64Q5P5SQPODV76IO","bundle":"https://pith.science/pith/SGKJSFCTIQ64Q5P5SQPODV76IO/bundle.json","state":"https://pith.science/pith/SGKJSFCTIQ64Q5P5SQPODV76IO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGKJSFCTIQ64Q5P5SQPODV76IO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SGKJSFCTIQ64Q5P5SQPODV76IO","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":"93a6e0960d03d4ca0852e7120964ab4b1537a44a25154c8329b54427dcc75c6e","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-07T16:20:20Z","title_canon_sha256":"9147eb9296ff9b923b68ff2ada35a143fde33ef8525838c73d0ec18b20d69822"},"schema_version":"1.0","source":{"id":"1507.01859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01859","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01859v1","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01859","created_at":"2026-05-18T01:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"SGKJSFCTIQ64","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SGKJSFCTIQ64Q5P5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SGKJSFCT","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:accdca0e10179ccbfb3599b8d00bf131fe78972b7c9a911f625af6b9e4c833fb","target":"graph","created_at":"2026-05-18T01:12:30Z","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":"Motivated by applications to multi-antenna wireless networks, we propose a distributed and asynchronous algorithm for stochastic semidefinite programming. This algorithm is a stochastic approximation of a continous- time matrix exponential scheme regularized by the addition of an entropy-like term to the problem's objective function. We show that the resulting algorithm converges almost surely to an $\\varepsilon$-approximation of the optimal solution requiring only an unbiased estimate of the gradient of the problem's stochastic objective. When applied to throughput maximization in wireless mu","authors_text":"Bruno Gaujal, Panayotis Mertikopoulos","cross_cats":["cs.GT","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-07T16:20:20Z","title":"A stochastic approximation algorithm for stochastic semidefinite programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01859","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:e3fd19d7d1aa8f627ea5a24c0fa311f7ed30d924e77c925eaa1b3b3d932eb445","target":"record","created_at":"2026-05-18T01:12:30Z","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":"93a6e0960d03d4ca0852e7120964ab4b1537a44a25154c8329b54427dcc75c6e","cross_cats_sorted":["cs.GT","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-07T16:20:20Z","title_canon_sha256":"9147eb9296ff9b923b68ff2ada35a143fde33ef8525838c73d0ec18b20d69822"},"schema_version":"1.0","source":{"id":"1507.01859","kind":"arxiv","version":1}},"canonical_sha256":"9194991453443dc875fd941ee1d7fe43bfe5f6165ef4cc48dc45446455a0bf83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9194991453443dc875fd941ee1d7fe43bfe5f6165ef4cc48dc45446455a0bf83","first_computed_at":"2026-05-18T01:12:30.762704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:30.762704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eZgY9wW3SfPcnQJxq2m09VpWgmkk6IVFfuaZA+gUmPnVovi8Zt/X1vPLoISjM8qKZhITeam2qr/0P0c8uQJ4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:30.763026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3fd19d7d1aa8f627ea5a24c0fa311f7ed30d924e77c925eaa1b3b3d932eb445","sha256:accdca0e10179ccbfb3599b8d00bf131fe78972b7c9a911f625af6b9e4c833fb"],"state_sha256":"cccad846c61d5207d000f5326883a1df9984ba1b52146b4686f19310f6e9cfa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UOv3Dck0cJFrLacAUY8t8uA7bojxArAj0Y8dPNzqA2RaQrpPZro3mEFen51VZv3iSiD7u2VJhCqFfNlkctW/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:53:39.838936Z","bundle_sha256":"90d387f3bb53bb214a2d671e098c1d5bbe63f07cd1bd97bf0268be944714937e"}}