{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VYQTAS4S62FBNFMZ23DHPTEYTG","short_pith_number":"pith:VYQTAS4S","schema_version":"1.0","canonical_sha256":"ae21304b92f68a169599d6c677cc98999e09096206b61a4823948b3bb7e03497","source":{"kind":"arxiv","id":"1711.01977","version":1},"attestation_state":"computed","paper":{"title":"Distributed Multi-resource Allocation with Little Communication Overhead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Fabian Wirth, Jia Yuan Yu, Robert Shorten, Syed Eqbal Alam","submitted_at":"2017-11-06T16:02:41Z","abstract_excerpt":"We propose a distributed algorithm to solve a special distributed multi-resource allocation problem with no direct inter-agent communication. We do so by extending a recently introduced additive-increase multiplicative-decrease (AIMD) algorithm, which only uses very little communication between the system and agents. Namely, a control unit broadcasts a one-bit signal to agents whenever one of the allocated resources exceeds capacity. Agents then respond to this signal in a probabilistic manner. In the proposed algorithm, each agent is unaware of the resource allocation of other agents. We also"},"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":"1711.01977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T16:02:41Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"11973624424586ba5942cffc3a658afb5a6289c2bcc03e189bf8cfdbe4e62ac6","abstract_canon_sha256":"05cddbbc3b4628382b8040c04ad3ca23e6faf5bbed5464012692d5338303b2ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:16.425408Z","signature_b64":"kW+HACzJMA/Wj8ILYlRQBkZ9WhiYFfT1bOcLN1ooJ8uYhoHR5ZcBUeaUD983rfwQg3dB3gIBIVuvErKrT6BGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae21304b92f68a169599d6c677cc98999e09096206b61a4823948b3bb7e03497","last_reissued_at":"2026-05-18T00:31:16.424920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:16.424920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Multi-resource Allocation with Little Communication Overhead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Fabian Wirth, Jia Yuan Yu, Robert Shorten, Syed Eqbal Alam","submitted_at":"2017-11-06T16:02:41Z","abstract_excerpt":"We propose a distributed algorithm to solve a special distributed multi-resource allocation problem with no direct inter-agent communication. We do so by extending a recently introduced additive-increase multiplicative-decrease (AIMD) algorithm, which only uses very little communication between the system and agents. Namely, a control unit broadcasts a one-bit signal to agents whenever one of the allocated resources exceeds capacity. Agents then respond to this signal in a probabilistic manner. In the proposed algorithm, each agent is unaware of the resource allocation of other agents. We also"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01977","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01977","created_at":"2026-05-18T00:31:16.425005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01977v1","created_at":"2026-05-18T00:31:16.425005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01977","created_at":"2026-05-18T00:31:16.425005+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYQTAS4S62FB","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYQTAS4S62FBNFMZ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYQTAS4S","created_at":"2026-05-18T12:31:49.984773+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/VYQTAS4S62FBNFMZ23DHPTEYTG","json":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG.json","graph_json":"https://pith.science/api/pith-number/VYQTAS4S62FBNFMZ23DHPTEYTG/graph.json","events_json":"https://pith.science/api/pith-number/VYQTAS4S62FBNFMZ23DHPTEYTG/events.json","paper":"https://pith.science/paper/VYQTAS4S"},"agent_actions":{"view_html":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG","download_json":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG.json","view_paper":"https://pith.science/paper/VYQTAS4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01977&json=true","fetch_graph":"https://pith.science/api/pith-number/VYQTAS4S62FBNFMZ23DHPTEYTG/graph.json","fetch_events":"https://pith.science/api/pith-number/VYQTAS4S62FBNFMZ23DHPTEYTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/action/storage_attestation","attest_author":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/action/author_attestation","sign_citation":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/action/citation_signature","submit_replication":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/action/replication_record"}},"created_at":"2026-05-18T00:31:16.425005+00:00","updated_at":"2026-05-18T00:31:16.425005+00:00"}