{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YZ5LYDAAO4CBKHZOBA32VYHKBB","short_pith_number":"pith:YZ5LYDAA","canonical_record":{"source":{"id":"1506.02288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T17:40:23Z","cross_cats_sorted":[],"title_canon_sha256":"3ef926506083eff151bf4cb427969eca0ae7ff90d801862b16c1593a8e757013","abstract_canon_sha256":"ba2ace704f645969ebdddb6afaf463d4a2c20d7051672007149c06cb0af7fc53"},"schema_version":"1.0"},"canonical_sha256":"c67abc0c007704151f2e0837aae0ea0859c4f1dfe4e733789a2ee39ab4cc8a5c","source":{"kind":"arxiv","id":"1506.02288","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02288","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02288v1","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02288","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"pith_short_12","alias_value":"YZ5LYDAAO4CB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YZ5LYDAAO4CBKHZO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YZ5LYDAA","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YZ5LYDAAO4CBKHZOBA32VYHKBB","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T17:40:23Z","cross_cats_sorted":[],"title_canon_sha256":"3ef926506083eff151bf4cb427969eca0ae7ff90d801862b16c1593a8e757013","abstract_canon_sha256":"ba2ace704f645969ebdddb6afaf463d4a2c20d7051672007149c06cb0af7fc53"},"schema_version":"1.0"},"canonical_sha256":"c67abc0c007704151f2e0837aae0ea0859c4f1dfe4e733789a2ee39ab4cc8a5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:51.600671Z","signature_b64":"fNESGDn7CVaJkJ+qQ532QV49ITBryfdCxlg4gD0iN6Ft9N62j/QnmGzt5s7p4lC0YsLd+bFe5kj1m4O9ncj6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c67abc0c007704151f2e0837aae0ea0859c4f1dfe4e733789a2ee39ab4cc8a5c","last_reissued_at":"2026-05-18T01:55:51.599991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:51.599991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02288","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-18T01:55:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CmObp7zJuNsNvlPveXaVk8M1uDnL92j386kxQjFxuN6o1fgOK9LU9qcmAnbss9Z9bf9658a85B3vT5S6E6iaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:08:47.200906Z"},"content_sha256":"e47e8b10e0d550ffb8e636490d57880b66282feb5148821cbe6327a42416a3e6","schema_version":"1.0","event_id":"sha256:e47e8b10e0d550ffb8e636490d57880b66282feb5148821cbe6327a42416a3e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YZ5LYDAAO4CBKHZOBA32VYHKBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust and Tuneable Family of Gossiping Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chris Blondia, Vincenzo De Florio","submitted_at":"2015-06-07T17:40:23Z","abstract_excerpt":"We present a family of gossiping algorithms whose members share the same structure though they vary their performance in function of a combinatorial parameter. We show that such parameter may be considered as a \"knob\" controlling the amount of communication parallelism characterizing the algorithms. After this we introduce procedures to operate the knob and choose parameters matching the amount of communication channels currently provided by the available communication system(s). In so doing we provide a robust mechanism to tune the production of requests for communication after the current op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02288","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-18T01:55:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hjf3MIewSRRqAID/S5h5SNNU8Q67CHISkzbvkbXcqz0p+uJ5XWQAZzCeWJ4Cd14xyfn+dY6+B9SLBgtw+GreDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T18:08:47.201259Z"},"content_sha256":"70c6a0eb89adeb5941fdbde51c1f8605ea49aadf46af8fa45432c2bb56f2df78","schema_version":"1.0","event_id":"sha256:70c6a0eb89adeb5941fdbde51c1f8605ea49aadf46af8fa45432c2bb56f2df78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZ5LYDAAO4CBKHZOBA32VYHKBB/bundle.json","state_url":"https://pith.science/pith/YZ5LYDAAO4CBKHZOBA32VYHKBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZ5LYDAAO4CBKHZOBA32VYHKBB/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-22T18:08:47Z","links":{"resolver":"https://pith.science/pith/YZ5LYDAAO4CBKHZOBA32VYHKBB","bundle":"https://pith.science/pith/YZ5LYDAAO4CBKHZOBA32VYHKBB/bundle.json","state":"https://pith.science/pith/YZ5LYDAAO4CBKHZOBA32VYHKBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZ5LYDAAO4CBKHZOBA32VYHKBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YZ5LYDAAO4CBKHZOBA32VYHKBB","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":"ba2ace704f645969ebdddb6afaf463d4a2c20d7051672007149c06cb0af7fc53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T17:40:23Z","title_canon_sha256":"3ef926506083eff151bf4cb427969eca0ae7ff90d801862b16c1593a8e757013"},"schema_version":"1.0","source":{"id":"1506.02288","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02288","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02288v1","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02288","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"pith_short_12","alias_value":"YZ5LYDAAO4CB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YZ5LYDAAO4CBKHZO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YZ5LYDAA","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:70c6a0eb89adeb5941fdbde51c1f8605ea49aadf46af8fa45432c2bb56f2df78","target":"graph","created_at":"2026-05-18T01:55:51Z","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 present a family of gossiping algorithms whose members share the same structure though they vary their performance in function of a combinatorial parameter. We show that such parameter may be considered as a \"knob\" controlling the amount of communication parallelism characterizing the algorithms. After this we introduce procedures to operate the knob and choose parameters matching the amount of communication channels currently provided by the available communication system(s). In so doing we provide a robust mechanism to tune the production of requests for communication after the current op","authors_text":"Chris Blondia, Vincenzo De Florio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T17:40:23Z","title":"Robust and Tuneable Family of Gossiping Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02288","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:e47e8b10e0d550ffb8e636490d57880b66282feb5148821cbe6327a42416a3e6","target":"record","created_at":"2026-05-18T01:55:51Z","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":"ba2ace704f645969ebdddb6afaf463d4a2c20d7051672007149c06cb0af7fc53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-06-07T17:40:23Z","title_canon_sha256":"3ef926506083eff151bf4cb427969eca0ae7ff90d801862b16c1593a8e757013"},"schema_version":"1.0","source":{"id":"1506.02288","kind":"arxiv","version":1}},"canonical_sha256":"c67abc0c007704151f2e0837aae0ea0859c4f1dfe4e733789a2ee39ab4cc8a5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c67abc0c007704151f2e0837aae0ea0859c4f1dfe4e733789a2ee39ab4cc8a5c","first_computed_at":"2026-05-18T01:55:51.599991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:51.599991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fNESGDn7CVaJkJ+qQ532QV49ITBryfdCxlg4gD0iN6Ft9N62j/QnmGzt5s7p4lC0YsLd+bFe5kj1m4O9ncj6AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:51.600671Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02288","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e47e8b10e0d550ffb8e636490d57880b66282feb5148821cbe6327a42416a3e6","sha256:70c6a0eb89adeb5941fdbde51c1f8605ea49aadf46af8fa45432c2bb56f2df78"],"state_sha256":"af57d7c180070a19af59531007e33599c131a5fc724f490f1f70039097af5fb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WruaYXZPKsl7wCYhS95Qs0GYi5sHIu+hkR7jYUMZXiW3M+4O7sKeJsepCGqmov28uv5L5Ligh+kt/6/rNceeDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T18:08:47.203247Z","bundle_sha256":"e8ce0cd5cb4d5dc7e8144ba9b22ff354104c07c8e762377942b34934b249fb11"}}