{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NDUJEK57WY5MULFS3JY3GWRPSR","short_pith_number":"pith:NDUJEK57","canonical_record":{"source":{"id":"1703.05045","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-15T09:35:37Z","cross_cats_sorted":["cs.DC","cs.SI"],"title_canon_sha256":"839e3c196e6cf9a3cc8ef5ec70b8957722498b96742849d0f2d463d57ab4d464","abstract_canon_sha256":"2f807eb2cce0c57640879b9b45235f5bf1d8aa9c0a1aa25658135c8f9830635e"},"schema_version":"1.0"},"canonical_sha256":"68e8922bbfb63aca2cb2da71b35a2f9455fd3889ab45e942a6b00dd9fc23b16f","source":{"kind":"arxiv","id":"1703.05045","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05045","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05045v3","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05045","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"NDUJEK57WY5M","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NDUJEK57WY5MULFS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NDUJEK57","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NDUJEK57WY5MULFS3JY3GWRPSR","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05045","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-15T09:35:37Z","cross_cats_sorted":["cs.DC","cs.SI"],"title_canon_sha256":"839e3c196e6cf9a3cc8ef5ec70b8957722498b96742849d0f2d463d57ab4d464","abstract_canon_sha256":"2f807eb2cce0c57640879b9b45235f5bf1d8aa9c0a1aa25658135c8f9830635e"},"schema_version":"1.0"},"canonical_sha256":"68e8922bbfb63aca2cb2da71b35a2f9455fd3889ab45e942a6b00dd9fc23b16f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:49.362853Z","signature_b64":"T6p5zv+J/1OroHjYLjPU8DTKbYJZtbKZ85BrvMWPv0f4io8YKjcMzZB+EWkDzq8Q/X4qb9Z+2def+w+EqLqUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e8922bbfb63aca2cb2da71b35a2f9455fd3889ab45e942a6b00dd9fc23b16f","last_reissued_at":"2026-05-18T00:22:49.362357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:49.362357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05045","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:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ec+ERZfBJu+t1ZyxtIw7b3j08VWlDMXOYNSx+jXHyquYRPATLLnCBp7/LnDjD6Elh4BIyFjldJ3lT6aJejv9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:41:32.219136Z"},"content_sha256":"8b738e7006fc7b1e99e6170b8c4a1031eb5fdef71c368aa41a6d60909c8b0c27","schema_version":"1.0","event_id":"sha256:8b738e7006fc7b1e99e6170b8c4a1031eb5fdef71c368aa41a6d60909c8b0c27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NDUJEK57WY5MULFS3JY3GWRPSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Average whenever you meet: Opportunistic protocols for community detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SI"],"primary_cat":"cs.DM","authors_text":"Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Becchetti, Luca Trevisan, Pasin Manurangsi, Prasad Raghavendra","submitted_at":"2017-03-15T09:35:37Z","abstract_excerpt":"Consider the following asynchronous, opportunistic communication model over a graph $G$: in each round, one edge is activated uniformly and independently at random and (only) its two endpoints can exchange messages and perform local computations. Under this model, we study the following random process: The first time a vertex is an endpoint of an active edge, it chooses a random number, say $\\pm 1$ with probability $1/2$; then, in each round, the two endpoints of the currently active edge update their values to their average. We show that, if $G$ exhibits a two-community structure (for example"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05045","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:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3zEKr8wg3ZlKHKSZZZFg4rA7HVFbQRRBo5j3vovBuNGDHtZXnC+M/6OM4s+nI7qi/IqROyFsfuzIQjVrT53Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:41:32.219822Z"},"content_sha256":"a0eee25aad386680e2ef1b036b81be0a448c6855475a134d86569c990e945b15","schema_version":"1.0","event_id":"sha256:a0eee25aad386680e2ef1b036b81be0a448c6855475a134d86569c990e945b15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDUJEK57WY5MULFS3JY3GWRPSR/bundle.json","state_url":"https://pith.science/pith/NDUJEK57WY5MULFS3JY3GWRPSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDUJEK57WY5MULFS3JY3GWRPSR/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-25T19:41:32Z","links":{"resolver":"https://pith.science/pith/NDUJEK57WY5MULFS3JY3GWRPSR","bundle":"https://pith.science/pith/NDUJEK57WY5MULFS3JY3GWRPSR/bundle.json","state":"https://pith.science/pith/NDUJEK57WY5MULFS3JY3GWRPSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDUJEK57WY5MULFS3JY3GWRPSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NDUJEK57WY5MULFS3JY3GWRPSR","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":"2f807eb2cce0c57640879b9b45235f5bf1d8aa9c0a1aa25658135c8f9830635e","cross_cats_sorted":["cs.DC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-15T09:35:37Z","title_canon_sha256":"839e3c196e6cf9a3cc8ef5ec70b8957722498b96742849d0f2d463d57ab4d464"},"schema_version":"1.0","source":{"id":"1703.05045","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05045","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05045v3","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05045","created_at":"2026-05-18T00:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"NDUJEK57WY5M","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NDUJEK57WY5MULFS","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NDUJEK57","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:a0eee25aad386680e2ef1b036b81be0a448c6855475a134d86569c990e945b15","target":"graph","created_at":"2026-05-18T00:22:49Z","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":"Consider the following asynchronous, opportunistic communication model over a graph $G$: in each round, one edge is activated uniformly and independently at random and (only) its two endpoints can exchange messages and perform local computations. Under this model, we study the following random process: The first time a vertex is an endpoint of an active edge, it chooses a random number, say $\\pm 1$ with probability $1/2$; then, in each round, the two endpoints of the currently active edge update their values to their average. We show that, if $G$ exhibits a two-community structure (for example","authors_text":"Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Becchetti, Luca Trevisan, Pasin Manurangsi, Prasad Raghavendra","cross_cats":["cs.DC","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-15T09:35:37Z","title":"Average whenever you meet: Opportunistic protocols for community detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05045","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:8b738e7006fc7b1e99e6170b8c4a1031eb5fdef71c368aa41a6d60909c8b0c27","target":"record","created_at":"2026-05-18T00:22:49Z","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":"2f807eb2cce0c57640879b9b45235f5bf1d8aa9c0a1aa25658135c8f9830635e","cross_cats_sorted":["cs.DC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-03-15T09:35:37Z","title_canon_sha256":"839e3c196e6cf9a3cc8ef5ec70b8957722498b96742849d0f2d463d57ab4d464"},"schema_version":"1.0","source":{"id":"1703.05045","kind":"arxiv","version":3}},"canonical_sha256":"68e8922bbfb63aca2cb2da71b35a2f9455fd3889ab45e942a6b00dd9fc23b16f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68e8922bbfb63aca2cb2da71b35a2f9455fd3889ab45e942a6b00dd9fc23b16f","first_computed_at":"2026-05-18T00:22:49.362357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:49.362357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T6p5zv+J/1OroHjYLjPU8DTKbYJZtbKZ85BrvMWPv0f4io8YKjcMzZB+EWkDzq8Q/X4qb9Z+2def+w+EqLqUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:49.362853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05045","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b738e7006fc7b1e99e6170b8c4a1031eb5fdef71c368aa41a6d60909c8b0c27","sha256:a0eee25aad386680e2ef1b036b81be0a448c6855475a134d86569c990e945b15"],"state_sha256":"1ce4f73fb1152650f99ddc3025454f788cd0b75bb131b7bbee5e22947608212f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vcsZAZU/yIXWrHBg2Y7DayLgWaMrrk8hG6YcSIqtsew3Gmku8xC+tXEmVletEHu2LRurjgjMYqO8NAm6j5XWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:41:32.222142Z","bundle_sha256":"78833fca0c476be44d3db22cb2329f1b2e1735a580a21dd43237b175f228208c"}}