{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2JQRIJ73J7JRJU4W2QPH2EKZJK","short_pith_number":"pith:2JQRIJ73","canonical_record":{"source":{"id":"1802.06532","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T07:10:15Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ed60acdbfea384993388fb4ce4256ff2ddb703ee774cc792f680597344622e5f","abstract_canon_sha256":"e7613926766d90072445b19d811eae7b09a2ad5775da1ae2b89596d8e90e0625"},"schema_version":"1.0"},"canonical_sha256":"d2611427fb4fd314d396d41e7d11594a98d7089161a84dafa5bd6afd20af9d44","source":{"kind":"arxiv","id":"1802.06532","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06532","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06532v3","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06532","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"2JQRIJ73J7JR","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2JQRIJ73J7JRJU4W","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2JQRIJ73","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2JQRIJ73J7JRJU4W2QPH2EKZJK","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06532","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T07:10:15Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"ed60acdbfea384993388fb4ce4256ff2ddb703ee774cc792f680597344622e5f","abstract_canon_sha256":"e7613926766d90072445b19d811eae7b09a2ad5775da1ae2b89596d8e90e0625"},"schema_version":"1.0"},"canonical_sha256":"d2611427fb4fd314d396d41e7d11594a98d7089161a84dafa5bd6afd20af9d44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:07.832742Z","signature_b64":"ruy425yWlUJpVDQq5rDU7hJ7ft7HABMx04gY5jBUoA5xmEGbm9pTAgvz8PnXxr5MKVO0WcRBgtolRZI/0VUKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2611427fb4fd314d396d41e7d11594a98d7089161a84dafa5bd6afd20af9d44","last_reissued_at":"2026-05-18T00:16:07.832063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:07.832063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06532","source_version":3,"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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GF4q3DkCvZ2h7p8T4DEj6Q7vzEZcNVmw01a9YZb95suElHCV1Q2iipwRpDmbc28JuF3lQYKDYkEMBdZ9biSyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:24:12.262586Z"},"content_sha256":"ead9e95f46a29df8ec68f2b8a6f0aacd3a4603673b70f62698ff61d5824608e6","schema_version":"1.0","event_id":"sha256:ead9e95f46a29df8ec68f2b8a6f0aacd3a4603673b70f62698ff61d5824608e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2JQRIJ73J7JRJU4W2QPH2EKZJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrepancy Analysis of a New Randomized Diffusion Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Takeharu Shiraga","submitted_at":"2018-02-19T07:10:15Z","abstract_excerpt":"For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this paper is concerned with the ability of natural diffusion-based iterative algorithms: at each discrete and synchronous time step on an algorithm, each vertex is allowed to distribute its loads to each neighbor (including itself) without occurring negative loads or using the information of previous time steps.\n  In this setting, this paper presents a new {\\em rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06532","kind":"arxiv","version":3},"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:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CKq9xQGfHDHoZXI1lqa4Rh1RZk5+nFxhpd6ssag3PtY2+huxSa5/C7ZzgpIW86JY2CV4ztig8bzJCDT8E1zJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:24:12.263255Z"},"content_sha256":"839ec1624017fd82655013e3993838a5ca2f04f4acb3234c53b5cd16d4ae6a8e","schema_version":"1.0","event_id":"sha256:839ec1624017fd82655013e3993838a5ca2f04f4acb3234c53b5cd16d4ae6a8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JQRIJ73J7JRJU4W2QPH2EKZJK/bundle.json","state_url":"https://pith.science/pith/2JQRIJ73J7JRJU4W2QPH2EKZJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JQRIJ73J7JRJU4W2QPH2EKZJK/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-26T03:24:12Z","links":{"resolver":"https://pith.science/pith/2JQRIJ73J7JRJU4W2QPH2EKZJK","bundle":"https://pith.science/pith/2JQRIJ73J7JRJU4W2QPH2EKZJK/bundle.json","state":"https://pith.science/pith/2JQRIJ73J7JRJU4W2QPH2EKZJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JQRIJ73J7JRJU4W2QPH2EKZJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2JQRIJ73J7JRJU4W2QPH2EKZJK","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":"e7613926766d90072445b19d811eae7b09a2ad5775da1ae2b89596d8e90e0625","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T07:10:15Z","title_canon_sha256":"ed60acdbfea384993388fb4ce4256ff2ddb703ee774cc792f680597344622e5f"},"schema_version":"1.0","source":{"id":"1802.06532","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06532","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06532v3","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06532","created_at":"2026-05-18T00:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"2JQRIJ73J7JR","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2JQRIJ73J7JRJU4W","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2JQRIJ73","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:839ec1624017fd82655013e3993838a5ca2f04f4acb3234c53b5cd16d4ae6a8e","target":"graph","created_at":"2026-05-18T00:16:07Z","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":"For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this paper is concerned with the ability of natural diffusion-based iterative algorithms: at each discrete and synchronous time step on an algorithm, each vertex is allowed to distribute its loads to each neighbor (including itself) without occurring negative loads or using the information of previous time steps.\n  In this setting, this paper presents a new {\\em rand","authors_text":"Takeharu Shiraga","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T07:10:15Z","title":"Discrepancy Analysis of a New Randomized Diffusion Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06532","kind":"arxiv","version":3},"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:ead9e95f46a29df8ec68f2b8a6f0aacd3a4603673b70f62698ff61d5824608e6","target":"record","created_at":"2026-05-18T00:16:07Z","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":"e7613926766d90072445b19d811eae7b09a2ad5775da1ae2b89596d8e90e0625","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-19T07:10:15Z","title_canon_sha256":"ed60acdbfea384993388fb4ce4256ff2ddb703ee774cc792f680597344622e5f"},"schema_version":"1.0","source":{"id":"1802.06532","kind":"arxiv","version":3}},"canonical_sha256":"d2611427fb4fd314d396d41e7d11594a98d7089161a84dafa5bd6afd20af9d44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2611427fb4fd314d396d41e7d11594a98d7089161a84dafa5bd6afd20af9d44","first_computed_at":"2026-05-18T00:16:07.832063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:07.832063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ruy425yWlUJpVDQq5rDU7hJ7ft7HABMx04gY5jBUoA5xmEGbm9pTAgvz8PnXxr5MKVO0WcRBgtolRZI/0VUKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:07.832742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06532","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ead9e95f46a29df8ec68f2b8a6f0aacd3a4603673b70f62698ff61d5824608e6","sha256:839ec1624017fd82655013e3993838a5ca2f04f4acb3234c53b5cd16d4ae6a8e"],"state_sha256":"b464509192eaad7584febdc8be20f9414e3d7cf53e7149007e5da746d1f4fa10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWzOvNwTKtdZX5pSUPfFxGWq92cC8UeRqCFEs/kkYAIt39nO1rww+el04UMS1HEBMtbs9EN0ihzOhkIhPmwJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:24:12.265980Z","bundle_sha256":"1c4d9ca8ed5a75f26634418a7bb7f745cabcc09137d5987f634f830b48fd107e"}}