{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VYQTAS4S62FBNFMZ23DHPTEYTG","short_pith_number":"pith:VYQTAS4S","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"},"canonical_sha256":"ae21304b92f68a169599d6c677cc98999e09096206b61a4823948b3bb7e03497","source":{"kind":"arxiv","id":"1711.01977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01977","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01977v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01977","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"VYQTAS4S62FB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VYQTAS4S62FBNFMZ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VYQTAS4S","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VYQTAS4S62FBNFMZ23DHPTEYTG","target":"record","payload":{"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"},"canonical_sha256":"ae21304b92f68a169599d6c677cc98999e09096206b61a4823948b3bb7e03497","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"},"source_kind":"arxiv","source_id":"1711.01977","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-18T00:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1S29v+5rb4hKj9u4J27xjlnD4gwb+lfMhJ305iZRCtvTBlmyyvGHSEyqFsZcQIPqPxGvGi3qGUN++Rt9rinBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:02:19.330947Z"},"content_sha256":"0444012c4b4616a71df408b56cfb5753da7415f6444506f4514ff81924c82d31","schema_version":"1.0","event_id":"sha256:0444012c4b4616a71df408b56cfb5753da7415f6444506f4514ff81924c82d31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VYQTAS4S62FBNFMZ23DHPTEYTG","target":"graph","payload":{"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"},"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-18T00:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VzwRcuGJcCRRsxgOQcJrs/kBsJAqyRmukQRFn73uCH3hbI3GbXFzwI8lQL5WoGOxCDqKfvmbUo/kgr3WK+zhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:02:19.331651Z"},"content_sha256":"f9833c7104253fd350d0eb68d0df1c9074209cefbaf5ec78957baa20f97696b1","schema_version":"1.0","event_id":"sha256:f9833c7104253fd350d0eb68d0df1c9074209cefbaf5ec78957baa20f97696b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/bundle.json","state_url":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/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-08T16:02:19Z","links":{"resolver":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG","bundle":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/bundle.json","state":"https://pith.science/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYQTAS4S62FBNFMZ23DHPTEYTG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VYQTAS4S62FBNFMZ23DHPTEYTG","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":"05cddbbc3b4628382b8040c04ad3ca23e6faf5bbed5464012692d5338303b2ee","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T16:02:41Z","title_canon_sha256":"11973624424586ba5942cffc3a658afb5a6289c2bcc03e189bf8cfdbe4e62ac6"},"schema_version":"1.0","source":{"id":"1711.01977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01977","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01977v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01977","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"VYQTAS4S62FB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VYQTAS4S62FBNFMZ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VYQTAS4S","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:f9833c7104253fd350d0eb68d0df1c9074209cefbaf5ec78957baa20f97696b1","target":"graph","created_at":"2026-05-18T00:31:16Z","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":"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","authors_text":"Fabian Wirth, Jia Yuan Yu, Robert Shorten, Syed Eqbal Alam","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T16:02:41Z","title":"Distributed Multi-resource Allocation with Little Communication Overhead"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01977","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:0444012c4b4616a71df408b56cfb5753da7415f6444506f4514ff81924c82d31","target":"record","created_at":"2026-05-18T00:31:16Z","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":"05cddbbc3b4628382b8040c04ad3ca23e6faf5bbed5464012692d5338303b2ee","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T16:02:41Z","title_canon_sha256":"11973624424586ba5942cffc3a658afb5a6289c2bcc03e189bf8cfdbe4e62ac6"},"schema_version":"1.0","source":{"id":"1711.01977","kind":"arxiv","version":1}},"canonical_sha256":"ae21304b92f68a169599d6c677cc98999e09096206b61a4823948b3bb7e03497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae21304b92f68a169599d6c677cc98999e09096206b61a4823948b3bb7e03497","first_computed_at":"2026-05-18T00:31:16.424920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:16.424920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kW+HACzJMA/Wj8ILYlRQBkZ9WhiYFfT1bOcLN1ooJ8uYhoHR5ZcBUeaUD983rfwQg3dB3gIBIVuvErKrT6BGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:16.425408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0444012c4b4616a71df408b56cfb5753da7415f6444506f4514ff81924c82d31","sha256:f9833c7104253fd350d0eb68d0df1c9074209cefbaf5ec78957baa20f97696b1"],"state_sha256":"f6af38c935e6452f9d2d2d75daa105cc004da3009c978cb7fa12c7617b84c1d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yc7tTdcdgdux8h1/+BWPXcM+tcdhZzbwgyBjAALv4UzjPIMBFktdsFs1OCrG2UXi7vul3OsnuMJgkuh7VT3lAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:02:19.335347Z","bundle_sha256":"11bd844ca280918ff24b27374d91d9df9b9a06c2571e01049860b70d5cf46f97"}}