{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EQYB53KB57NAB5FM3HE2K6RAHR","short_pith_number":"pith:EQYB53KB","schema_version":"1.0","canonical_sha256":"24301eed41efda00f4acd9c9a57a203c6d26b193bc24688ff9785c0efd08e40b","source":{"kind":"arxiv","id":"1807.10860","version":1},"attestation_state":"computed","paper":{"title":"Communication-efficient Distributed Multi-resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Fabian Wirth, Jia Yuan Yu, Robert Shorten, Syed Eqbal Alam","submitted_at":"2018-07-28T00:02:51Z","abstract_excerpt":"In several smart city applications, multiple resources must be allocated among competing agents that are coupled through such shared resources and are constrained --- either through limitations of communication infrastructure or privacy considerations. We propose a distributed algorithm to solve such distributed multi-resource allocation problems 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 broadcast"},"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":"1807.10860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-07-28T00:02:51Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"ed30ba89638b3d00b644d60f5b9e2fbab38b66d6fb9b7289d35dd9be9ef38397","abstract_canon_sha256":"fc75055a9e6b2985ce7602df3e14de0ae92b7d8fe5ed0d71efb45183542d7565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T19:12:09.678171Z","signature_b64":"YNz5SzL0sYXcrmg90GoX5jUnor5xyepqM0k5UZMWjzL7X8JZSj/+QwgvbygbSlIXfYFQTtySS0lP8Seb803DBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24301eed41efda00f4acd9c9a57a203c6d26b193bc24688ff9785c0efd08e40b","last_reissued_at":"2026-06-04T19:12:09.677739Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T19:12:09.677739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-efficient Distributed Multi-resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Fabian Wirth, Jia Yuan Yu, Robert Shorten, Syed Eqbal Alam","submitted_at":"2018-07-28T00:02:51Z","abstract_excerpt":"In several smart city applications, multiple resources must be allocated among competing agents that are coupled through such shared resources and are constrained --- either through limitations of communication infrastructure or privacy considerations. We propose a distributed algorithm to solve such distributed multi-resource allocation problems 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 broadcast"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10860","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1807.10860/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1807.10860","created_at":"2026-06-04T19:12:09.677802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10860v1","created_at":"2026-06-04T19:12:09.677802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10860","created_at":"2026-06-04T19:12:09.677802+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQYB53KB57NA","created_at":"2026-06-04T19:12:09.677802+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQYB53KB57NAB5FM","created_at":"2026-06-04T19:12:09.677802+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQYB53KB","created_at":"2026-06-04T19:12:09.677802+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/EQYB53KB57NAB5FM3HE2K6RAHR","json":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR.json","graph_json":"https://pith.science/api/pith-number/EQYB53KB57NAB5FM3HE2K6RAHR/graph.json","events_json":"https://pith.science/api/pith-number/EQYB53KB57NAB5FM3HE2K6RAHR/events.json","paper":"https://pith.science/paper/EQYB53KB"},"agent_actions":{"view_html":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR","download_json":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR.json","view_paper":"https://pith.science/paper/EQYB53KB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10860&json=true","fetch_graph":"https://pith.science/api/pith-number/EQYB53KB57NAB5FM3HE2K6RAHR/graph.json","fetch_events":"https://pith.science/api/pith-number/EQYB53KB57NAB5FM3HE2K6RAHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR/action/storage_attestation","attest_author":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR/action/author_attestation","sign_citation":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR/action/citation_signature","submit_replication":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR/action/replication_record"}},"created_at":"2026-06-04T19:12:09.677802+00:00","updated_at":"2026-06-04T19:12:09.677802+00:00"}