{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:A2O6CBLTIOVDA6UBN3G62PK6PP","short_pith_number":"pith:A2O6CBLT","schema_version":"1.0","canonical_sha256":"069de1057343aa307a816ecded3d5e7bd09152c37ff0ea77fec169cd76eaec10","source":{"kind":"arxiv","id":"1511.07974","version":2},"attestation_state":"computed","paper":{"title":"Distributed Resource Allocation Over Random Networks Based on Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jinlong Lei, Peng Yi, Yiguang Hong","submitted_at":"2015-11-25T07:06:59Z","abstract_excerpt":"In this paper, a stochastic approximation (SA) based distributed algorithm is proposed to solve the resource allocation (RA) with uncertainties. In this problem, a group of agents cooperatively optimize a separable optimization problem with a linear network resource constraint and allocation feasibility constraints, where the global objective function is the sum of agents' local objective functions. Each agent can only get noisy observations of its local function's gradient and its local resource, which cannot be shared by other agents or transmitted to a center. Moreover, there are communicat"},"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":"1511.07974","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-25T07:06:59Z","cross_cats_sorted":[],"title_canon_sha256":"db095ba7931e9a4de2b8203206bf7bfc52b921e9fbbe651a64083fd9084639c5","abstract_canon_sha256":"ec2b71ac185d306f9511d38ec04e4e72f3ade3d3bc8b84bc4bd8cf95535d770c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:53.570920Z","signature_b64":"TX4gPE7P9T9fu2y0khDCt8G8OYXfk2NEpe9Vm7Ol4exgR7VY8sc8KL/xHlcTG02bxBe+WKg8EOdnk6jDrnNyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"069de1057343aa307a816ecded3d5e7bd09152c37ff0ea77fec169cd76eaec10","last_reissued_at":"2026-05-18T01:00:53.570229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:53.570229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Resource Allocation Over Random Networks Based on Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jinlong Lei, Peng Yi, Yiguang Hong","submitted_at":"2015-11-25T07:06:59Z","abstract_excerpt":"In this paper, a stochastic approximation (SA) based distributed algorithm is proposed to solve the resource allocation (RA) with uncertainties. In this problem, a group of agents cooperatively optimize a separable optimization problem with a linear network resource constraint and allocation feasibility constraints, where the global objective function is the sum of agents' local objective functions. Each agent can only get noisy observations of its local function's gradient and its local resource, which cannot be shared by other agents or transmitted to a center. Moreover, there are communicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07974","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":"1511.07974","created_at":"2026-05-18T01:00:53.570366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07974v2","created_at":"2026-05-18T01:00:53.570366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07974","created_at":"2026-05-18T01:00:53.570366+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2O6CBLTIOVD","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2O6CBLTIOVDA6UB","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2O6CBLT","created_at":"2026-05-18T12:29:10.953037+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/A2O6CBLTIOVDA6UBN3G62PK6PP","json":"https://pith.science/pith/A2O6CBLTIOVDA6UBN3G62PK6PP.json","graph_json":"https://pith.science/api/pith-number/A2O6CBLTIOVDA6UBN3G62PK6PP/graph.json","events_json":"https://pith.science/api/pith-number/A2O6CBLTIOVDA6UBN3G62PK6PP/events.json","paper":"https://pith.science/paper/A2O6CBLT"},"agent_actions":{"view_html":"https://pith.science/pith/A2O6CBLTIOVDA6UBN3G62PK6PP","download_json":"https://pith.science/pith/A2O6CBLTIOVDA6UBN3G62PK6PP.json","view_paper":"https://pith.science/paper/A2O6CBLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07974&json=true","fetch_graph":"https://pith.science/api/pith-number/A2O6CBLTIOVDA6UBN3G62PK6PP/graph.json","fetch_events":"https://pith.science/api/pith-number/A2O6CBLTIOVDA6UBN3G62PK6PP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2O6CBLTIOVDA6UBN3G62PK6PP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2O6CBLTIOVDA6UBN3G62PK6PP/action/storage_attestation","attest_author":"https://pith.science/pith/A2O6CBLTIOVDA6UBN3G62PK6PP/action/author_attestation","sign_citation":"https://pith.science/pith/A2O6CBLTIOVDA6UBN3G62PK6PP/action/citation_signature","submit_replication":"https://pith.science/pith/A2O6CBLTIOVDA6UBN3G62PK6PP/action/replication_record"}},"created_at":"2026-05-18T01:00:53.570366+00:00","updated_at":"2026-05-18T01:00:53.570366+00:00"}