{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EQYB53KB57NAB5FM3HE2K6RAHR","short_pith_number":"pith:EQYB53KB","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"},"canonical_sha256":"24301eed41efda00f4acd9c9a57a203c6d26b193bc24688ff9785c0efd08e40b","source":{"kind":"arxiv","id":"1807.10860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10860","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10860v1","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10860","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"EQYB53KB57NA","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"pith_short_16","alias_value":"EQYB53KB57NAB5FM","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"pith_short_8","alias_value":"EQYB53KB","created_at":"2026-06-04T19:12:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EQYB53KB57NAB5FM3HE2K6RAHR","target":"record","payload":{"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"},"canonical_sha256":"24301eed41efda00f4acd9c9a57a203c6d26b193bc24688ff9785c0efd08e40b","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"},"source_kind":"arxiv","source_id":"1807.10860","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-06-04T19:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwRdebQGDBMAkAwnMHrdeKAUWCeyCoeoRmWwDqRF3dhM/nffvWR93DSmr1SsJuwNuSgqZ7IUdTSy8VU8dQEyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:36:31.149789Z"},"content_sha256":"4ad8ff3f6033123d928c8561831ea9829850fe6395ecd7958fe3e551fb629a17","schema_version":"1.0","event_id":"sha256:4ad8ff3f6033123d928c8561831ea9829850fe6395ecd7958fe3e551fb629a17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EQYB53KB57NAB5FM3HE2K6RAHR","target":"graph","payload":{"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"},"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-06-04T19:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHY5TeOdtzHyiNHo1YMscfpmMTOWqGei8ZTXvPlxge9++pkR88RZCbWPMWBbahGHDfij4mxoQHuxdwIZA1KzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:36:31.150591Z"},"content_sha256":"714e519ae461530a624370a3ca6d8b42af6469c9a3f30c143c6067f8aeb6cb57","schema_version":"1.0","event_id":"sha256:714e519ae461530a624370a3ca6d8b42af6469c9a3f30c143c6067f8aeb6cb57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR/bundle.json","state_url":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQYB53KB57NAB5FM3HE2K6RAHR/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-07T21:36:31Z","links":{"resolver":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR","bundle":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR/bundle.json","state":"https://pith.science/pith/EQYB53KB57NAB5FM3HE2K6RAHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQYB53KB57NAB5FM3HE2K6RAHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EQYB53KB57NAB5FM3HE2K6RAHR","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":"fc75055a9e6b2985ce7602df3e14de0ae92b7d8fe5ed0d71efb45183542d7565","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-07-28T00:02:51Z","title_canon_sha256":"ed30ba89638b3d00b644d60f5b9e2fbab38b66d6fb9b7289d35dd9be9ef38397"},"schema_version":"1.0","source":{"id":"1807.10860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10860","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10860v1","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10860","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"EQYB53KB57NA","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"pith_short_16","alias_value":"EQYB53KB57NAB5FM","created_at":"2026-06-04T19:12:09Z"},{"alias_kind":"pith_short_8","alias_value":"EQYB53KB","created_at":"2026-06-04T19:12:09Z"}],"graph_snapshots":[{"event_id":"sha256:714e519ae461530a624370a3ca6d8b42af6469c9a3f30c143c6067f8aeb6cb57","target":"graph","created_at":"2026-06-04T19:12:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1807.10860/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fabian Wirth, Jia Yuan Yu, Robert Shorten, Syed Eqbal Alam","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-07-28T00:02:51Z","title":"Communication-efficient Distributed Multi-resource Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10860","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:4ad8ff3f6033123d928c8561831ea9829850fe6395ecd7958fe3e551fb629a17","target":"record","created_at":"2026-06-04T19:12:09Z","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":"fc75055a9e6b2985ce7602df3e14de0ae92b7d8fe5ed0d71efb45183542d7565","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2018-07-28T00:02:51Z","title_canon_sha256":"ed30ba89638b3d00b644d60f5b9e2fbab38b66d6fb9b7289d35dd9be9ef38397"},"schema_version":"1.0","source":{"id":"1807.10860","kind":"arxiv","version":1}},"canonical_sha256":"24301eed41efda00f4acd9c9a57a203c6d26b193bc24688ff9785c0efd08e40b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24301eed41efda00f4acd9c9a57a203c6d26b193bc24688ff9785c0efd08e40b","first_computed_at":"2026-06-04T19:12:09.677739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T19:12:09.677739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YNz5SzL0sYXcrmg90GoX5jUnor5xyepqM0k5UZMWjzL7X8JZSj/+QwgvbygbSlIXfYFQTtySS0lP8Seb803DBw==","signature_status":"signed_v1","signed_at":"2026-06-04T19:12:09.678171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ad8ff3f6033123d928c8561831ea9829850fe6395ecd7958fe3e551fb629a17","sha256:714e519ae461530a624370a3ca6d8b42af6469c9a3f30c143c6067f8aeb6cb57"],"state_sha256":"9066b11df3569baf5baf40cbf5f2cec2d254a1cb0488ceefcdf78c98006375f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75oec+BbozgobSWPO4antpok5Xk8bd2ScTatZqc7LlUFKZ4R0KkjF0UDms7+c+zDJ45KNebUsd3j/hdUokx6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:36:31.153178Z","bundle_sha256":"4a9302310efaec5bd7ebbbdd5b633940e4f3d6ab61f24a9999003d3e768b28da"}}