{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KKOZPCURQG3DOKVKCNBMQR7QCJ","short_pith_number":"pith:KKOZPCUR","canonical_record":{"source":{"id":"1507.07850","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-28T17:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"0c6230bcb7e252d0cb7a57b0c95715f83a767e42a4ee49ad01f2898f65c65290","abstract_canon_sha256":"638f22117ac03719acb1574c76106ed741df9eb5759480274e8518c1dfcc5db0"},"schema_version":"1.0"},"canonical_sha256":"529d978a9181b6372aaa1342c847f0124ca401b4d4aad6f6595ed8f4f0f60bd2","source":{"kind":"arxiv","id":"1507.07850","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07850","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07850v4","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07850","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"KKOZPCURQG3D","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KKOZPCURQG3DOKVK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KKOZPCUR","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KKOZPCURQG3DOKVKCNBMQR7QCJ","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07850","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-28T17:03:57Z","cross_cats_sorted":[],"title_canon_sha256":"0c6230bcb7e252d0cb7a57b0c95715f83a767e42a4ee49ad01f2898f65c65290","abstract_canon_sha256":"638f22117ac03719acb1574c76106ed741df9eb5759480274e8518c1dfcc5db0"},"schema_version":"1.0"},"canonical_sha256":"529d978a9181b6372aaa1342c847f0124ca401b4d4aad6f6595ed8f4f0f60bd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:34.914065Z","signature_b64":"KKzRr5g0Canmw9X6InkGw8xG9xDba84dS9hpIOYvTAJuGylS+PUKCYIbM0Ce4qMunFjDQiZvDy5EhiYJGGO5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"529d978a9181b6372aaa1342c847f0124ca401b4d4aad6f6595ed8f4f0f60bd2","last_reissued_at":"2026-05-18T01:12:34.913706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:34.913706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07850","source_version":4,"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-18T01:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyA1X4nr1n8HHtU5BABi5sQgaNCA/2Mq/ONz5xqSo94AcUKFkGBHVOkfhEM3aHwFwTVwgybnGMnk8RX8Sa4uCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:56:07.172954Z"},"content_sha256":"dd76c4e2ebcdf1419cca83f79ac9c673563df66ff2400ae56e172b6ad9f89efb","schema_version":"1.0","event_id":"sha256:dd76c4e2ebcdf1419cca83f79ac9c673563df66ff2400ae56e172b6ad9f89efb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KKOZPCURQG3DOKVKCNBMQR7QCJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Resource Allocation on Dynamic Networks in Quadratic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Thinh T. Doan","submitted_at":"2015-07-28T17:03:57Z","abstract_excerpt":"We consider the problem of allocating a fixed amount of resource among nodes in a network when each node suffers a cost which is a convex function of the amount of resource allocated to it. We propose a new deterministic and distributed protocol for this problem. Our main result is that the associated convergence time for the global objective scales quadratically in the number of nodes on any sequence of time-varying undirected graphs satisfying a long-term connectivity condition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07850","kind":"arxiv","version":4},"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-18T01:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Lz+cPankBwZRxMvHQGhebmbVU+qax+FqSjMv7/4ZHaXMdQzCDiUw7hwp5fLxIqy02GErFZDvEQNy/A7xBfPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:56:07.173695Z"},"content_sha256":"e44283123da8a9b61e3994de0ce924301b2baac91fac7dc960d814bd922aac10","schema_version":"1.0","event_id":"sha256:e44283123da8a9b61e3994de0ce924301b2baac91fac7dc960d814bd922aac10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKOZPCURQG3DOKVKCNBMQR7QCJ/bundle.json","state_url":"https://pith.science/pith/KKOZPCURQG3DOKVKCNBMQR7QCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKOZPCURQG3DOKVKCNBMQR7QCJ/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-05-31T22:56:07Z","links":{"resolver":"https://pith.science/pith/KKOZPCURQG3DOKVKCNBMQR7QCJ","bundle":"https://pith.science/pith/KKOZPCURQG3DOKVKCNBMQR7QCJ/bundle.json","state":"https://pith.science/pith/KKOZPCURQG3DOKVKCNBMQR7QCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKOZPCURQG3DOKVKCNBMQR7QCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KKOZPCURQG3DOKVKCNBMQR7QCJ","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":"638f22117ac03719acb1574c76106ed741df9eb5759480274e8518c1dfcc5db0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-28T17:03:57Z","title_canon_sha256":"0c6230bcb7e252d0cb7a57b0c95715f83a767e42a4ee49ad01f2898f65c65290"},"schema_version":"1.0","source":{"id":"1507.07850","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07850","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07850v4","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07850","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"KKOZPCURQG3D","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KKOZPCURQG3DOKVK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KKOZPCUR","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:e44283123da8a9b61e3994de0ce924301b2baac91fac7dc960d814bd922aac10","target":"graph","created_at":"2026-05-18T01:12:34Z","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 consider the problem of allocating a fixed amount of resource among nodes in a network when each node suffers a cost which is a convex function of the amount of resource allocated to it. We propose a new deterministic and distributed protocol for this problem. Our main result is that the associated convergence time for the global objective scales quadratically in the number of nodes on any sequence of time-varying undirected graphs satisfying a long-term connectivity condition.","authors_text":"Alex Olshevsky, Thinh T. Doan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-28T17:03:57Z","title":"Distributed Resource Allocation on Dynamic Networks in Quadratic Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07850","kind":"arxiv","version":4},"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:dd76c4e2ebcdf1419cca83f79ac9c673563df66ff2400ae56e172b6ad9f89efb","target":"record","created_at":"2026-05-18T01:12:34Z","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":"638f22117ac03719acb1574c76106ed741df9eb5759480274e8518c1dfcc5db0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-28T17:03:57Z","title_canon_sha256":"0c6230bcb7e252d0cb7a57b0c95715f83a767e42a4ee49ad01f2898f65c65290"},"schema_version":"1.0","source":{"id":"1507.07850","kind":"arxiv","version":4}},"canonical_sha256":"529d978a9181b6372aaa1342c847f0124ca401b4d4aad6f6595ed8f4f0f60bd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"529d978a9181b6372aaa1342c847f0124ca401b4d4aad6f6595ed8f4f0f60bd2","first_computed_at":"2026-05-18T01:12:34.913706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:34.913706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KKzRr5g0Canmw9X6InkGw8xG9xDba84dS9hpIOYvTAJuGylS+PUKCYIbM0Ce4qMunFjDQiZvDy5EhiYJGGO5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:34.914065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07850","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd76c4e2ebcdf1419cca83f79ac9c673563df66ff2400ae56e172b6ad9f89efb","sha256:e44283123da8a9b61e3994de0ce924301b2baac91fac7dc960d814bd922aac10"],"state_sha256":"5203e2c4d7a4547bd69c8b6fc08ab9b8c64b5a6c53c4c29fac99954927190a66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twww4NnQVqW3uA572dqOrggWiIMAfjX4OVNHuy8CWzSZ0Cq97egxLgcLZwPGgoRXdKRjdaaqIx69rhlbsAgfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:56:07.177847Z","bundle_sha256":"53127c7fb4a12208dd0118d724fe0f7f7852d630510022a7bd712e935c4987ce"}}