{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IGN2M4T7KYUNPEXUQMYXMHVMIC","short_pith_number":"pith:IGN2M4T7","canonical_record":{"source":{"id":"1705.09566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T13:01:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"45bf7e2769594f1bb8280b772e6a38856ca1172da980491cad9c655609d038dc","abstract_canon_sha256":"fcd66e9612e25a76228c989c3aeba85eb472df82ab1a29faea829eefe6c79c5a"},"schema_version":"1.0"},"canonical_sha256":"419ba6727f5628d792f48331761eac409da14b4b7f6d786890f6a52c632c7130","source":{"kind":"arxiv","id":"1705.09566","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09566","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09566v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09566","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"IGN2M4T7KYUN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IGN2M4T7KYUNPEXU","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IGN2M4T7","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IGN2M4T7KYUNPEXUQMYXMHVMIC","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T13:01:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"45bf7e2769594f1bb8280b772e6a38856ca1172da980491cad9c655609d038dc","abstract_canon_sha256":"fcd66e9612e25a76228c989c3aeba85eb472df82ab1a29faea829eefe6c79c5a"},"schema_version":"1.0"},"canonical_sha256":"419ba6727f5628d792f48331761eac409da14b4b7f6d786890f6a52c632c7130","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.349849Z","signature_b64":"z1iH+DDJJ8STldA9N0y1AQlfGHprrH8so+36PRk6w6FRRudNgC9Dmd5TKRxIGRf031AKsjmVKZqEur4Ew2KvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"419ba6727f5628d792f48331761eac409da14b4b7f6d786890f6a52c632c7130","last_reissued_at":"2026-05-18T00:43:38.349459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.349459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09566","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:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cLHNE9dVR/uFYIv723klUQ3K8/5DCrHdmrSdEjHu8SrzzCqUj/xyAdSezcFyjMb+0eQRKSv76Q5bKlOj9UWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:57:46.747888Z"},"content_sha256":"67fbe0f06fbc129bf678bb31dd5be762173d5419f675bf73f2a7c41bd92fe80e","schema_version":"1.0","event_id":"sha256:67fbe0f06fbc129bf678bb31dd5be762173d5419f675bf73f2a7c41bd92fe80e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IGN2M4T7KYUNPEXUQMYXMHVMIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rational Fair Consensus in the GOSSIP Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.GT","authors_text":"Andrea Clementi, Giacomo Scornavacca, Guido Proietti, Luciano Gual\\`a","submitted_at":"2017-05-26T13:01:31Z","abstract_excerpt":"The \\emph{rational fair consensus problem} can be informally defined as follows. Consider a network of $n$ (selfish) \\emph{rational agents}, each of them initially supporting a \\emph{color} chosen from a finite set $ \\Sigma$. The goal is to design a protocol that leads the network to a stable monochromatic configuration (i.e. a consensus) such that the probability that the winning color is $c$ is equal to the fraction of the agents that initially support $c$, for any $c \\in \\Sigma$. Furthermore, this fairness property must be guaranteed (with high probability) even in presence of any fixed \\em"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09566","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:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+eV9tfDGpMVvPN/87P+ydRD55Z7uhCW6iUhWMuBKe7w5JO1rLpyPKxvVNTkxeCaWIlVKg+4KNkLu71PCJj2bCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:57:46.748233Z"},"content_sha256":"5831a05448425e74df2c81ccef28a306b84a005fee95563ecb70f3ae19eadfdf","schema_version":"1.0","event_id":"sha256:5831a05448425e74df2c81ccef28a306b84a005fee95563ecb70f3ae19eadfdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGN2M4T7KYUNPEXUQMYXMHVMIC/bundle.json","state_url":"https://pith.science/pith/IGN2M4T7KYUNPEXUQMYXMHVMIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGN2M4T7KYUNPEXUQMYXMHVMIC/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-28T03:57:46Z","links":{"resolver":"https://pith.science/pith/IGN2M4T7KYUNPEXUQMYXMHVMIC","bundle":"https://pith.science/pith/IGN2M4T7KYUNPEXUQMYXMHVMIC/bundle.json","state":"https://pith.science/pith/IGN2M4T7KYUNPEXUQMYXMHVMIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGN2M4T7KYUNPEXUQMYXMHVMIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IGN2M4T7KYUNPEXUQMYXMHVMIC","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":"fcd66e9612e25a76228c989c3aeba85eb472df82ab1a29faea829eefe6c79c5a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T13:01:31Z","title_canon_sha256":"45bf7e2769594f1bb8280b772e6a38856ca1172da980491cad9c655609d038dc"},"schema_version":"1.0","source":{"id":"1705.09566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09566","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09566v1","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09566","created_at":"2026-05-18T00:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"IGN2M4T7KYUN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IGN2M4T7KYUNPEXU","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IGN2M4T7","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:5831a05448425e74df2c81ccef28a306b84a005fee95563ecb70f3ae19eadfdf","target":"graph","created_at":"2026-05-18T00:43:38Z","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":"The \\emph{rational fair consensus problem} can be informally defined as follows. Consider a network of $n$ (selfish) \\emph{rational agents}, each of them initially supporting a \\emph{color} chosen from a finite set $ \\Sigma$. The goal is to design a protocol that leads the network to a stable monochromatic configuration (i.e. a consensus) such that the probability that the winning color is $c$ is equal to the fraction of the agents that initially support $c$, for any $c \\in \\Sigma$. Furthermore, this fairness property must be guaranteed (with high probability) even in presence of any fixed \\em","authors_text":"Andrea Clementi, Giacomo Scornavacca, Guido Proietti, Luciano Gual\\`a","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T13:01:31Z","title":"Rational Fair Consensus in the GOSSIP Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09566","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:67fbe0f06fbc129bf678bb31dd5be762173d5419f675bf73f2a7c41bd92fe80e","target":"record","created_at":"2026-05-18T00:43:38Z","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":"fcd66e9612e25a76228c989c3aeba85eb472df82ab1a29faea829eefe6c79c5a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T13:01:31Z","title_canon_sha256":"45bf7e2769594f1bb8280b772e6a38856ca1172da980491cad9c655609d038dc"},"schema_version":"1.0","source":{"id":"1705.09566","kind":"arxiv","version":1}},"canonical_sha256":"419ba6727f5628d792f48331761eac409da14b4b7f6d786890f6a52c632c7130","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"419ba6727f5628d792f48331761eac409da14b4b7f6d786890f6a52c632c7130","first_computed_at":"2026-05-18T00:43:38.349459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:38.349459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z1iH+DDJJ8STldA9N0y1AQlfGHprrH8so+36PRk6w6FRRudNgC9Dmd5TKRxIGRf031AKsjmVKZqEur4Ew2KvAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:38.349849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09566","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67fbe0f06fbc129bf678bb31dd5be762173d5419f675bf73f2a7c41bd92fe80e","sha256:5831a05448425e74df2c81ccef28a306b84a005fee95563ecb70f3ae19eadfdf"],"state_sha256":"cd4fe2dce4383668cd7a27691f2ee96984f22324aa5b86c68ab3b88c5ee23d0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9aWNkLNJFgs3p56zpKgzDce7eNrTLClQRG2n4Kd9qSWr9TitiCAKogRrktZdWyPpbAw2rwURex6+j8OJTnFWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:57:46.750166Z","bundle_sha256":"ad50764593005a46f52d241ec79c71dadfc6743d8c922766291beeccf1e90349"}}