{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CCMCYJCBUQWH7YRJVNBOAA322X","short_pith_number":"pith:CCMCYJCB","canonical_record":{"source":{"id":"1507.06818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-24T12:08:18Z","cross_cats_sorted":[],"title_canon_sha256":"046c1b7a69e7bf693d704938ab6ea419bcd4044a5232ed75cff919e319521a3b","abstract_canon_sha256":"fdc2425ec7b772650d8edafb7252866e02cb33ab7a3310da502612ddd98600ac"},"schema_version":"1.0"},"canonical_sha256":"10982c2441a42c7fe229ab42e0037ad5f261cc9a5989ac4d56efbe349925d16c","source":{"kind":"arxiv","id":"1507.06818","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06818","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06818v1","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06818","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"CCMCYJCBUQWH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CCMCYJCBUQWH7YRJ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CCMCYJCB","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CCMCYJCBUQWH7YRJVNBOAA322X","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-24T12:08:18Z","cross_cats_sorted":[],"title_canon_sha256":"046c1b7a69e7bf693d704938ab6ea419bcd4044a5232ed75cff919e319521a3b","abstract_canon_sha256":"fdc2425ec7b772650d8edafb7252866e02cb33ab7a3310da502612ddd98600ac"},"schema_version":"1.0"},"canonical_sha256":"10982c2441a42c7fe229ab42e0037ad5f261cc9a5989ac4d56efbe349925d16c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:21.949933Z","signature_b64":"DVy3MFN4uLAS8RBYnDTyk1sp+8MIgTjgv1ldGh8UU8Kvp9GP2mv/OfFOZmZNGz15/Nw+JycLz0goCK6wesuUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10982c2441a42c7fe229ab42e0037ad5f261cc9a5989ac4d56efbe349925d16c","last_reissued_at":"2026-05-18T01:36:21.949405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:21.949405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06818","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:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zzDJGs9J0Uhoho+2yuGhQp26V8Lnkb9QYIv56KehMmZghThgZHm9rEyYdCzAhX4dFMGf893JS2qbwirrsmrPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:50:08.026858Z"},"content_sha256":"2bfc55779cfa389d0a638501b63ccf18f9b2b7cc31844569e7863488f820af17","schema_version":"1.0","event_id":"sha256:2bfc55779cfa389d0a638501b63ccf18f9b2b7cc31844569e7863488f820af17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CCMCYJCBUQWH7YRJVNBOAA322X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local majority dynamics on preferential attachment graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Michel Bode, Mohammed Amin Abdullah, Nikolaos Fountoulakis","submitted_at":"2015-07-24T12:08:18Z","abstract_excerpt":"Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At each time step, each vertex $v$ in $G$ polls $k$ random neighbours and takes the majority colour. If it doesn't have $k$ neighbours, it simply polls all of them, or all less one if the degree of $v$ is even. We study this protocol on the preferential attachment model of Albert and Barab\\'asi, which gives rise to a degree distribution that has roughly power-law $P(x) \\sim \\frac{1}{x^{3}}$, as well as generalisations which give exponents larger than $3$. The setting is as follows: Initially each vertex of $G$ is red in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06818","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:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzXmnaaZ+eAjY1Obg4Bq4Ss28LBV9EBaV79of76x9nbP1PwVDy8wZjKoalPKfCgcan54LSQd8jaSNo1PtiMuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:50:08.027195Z"},"content_sha256":"d1cd46ecf249dc82fecd77e6f58632d833a047a50243e505b42366008009122a","schema_version":"1.0","event_id":"sha256:d1cd46ecf249dc82fecd77e6f58632d833a047a50243e505b42366008009122a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X/bundle.json","state_url":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCMCYJCBUQWH7YRJVNBOAA322X/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-24T17:50:08Z","links":{"resolver":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X","bundle":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X/bundle.json","state":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCMCYJCBUQWH7YRJVNBOAA322X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CCMCYJCBUQWH7YRJVNBOAA322X","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":"fdc2425ec7b772650d8edafb7252866e02cb33ab7a3310da502612ddd98600ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-24T12:08:18Z","title_canon_sha256":"046c1b7a69e7bf693d704938ab6ea419bcd4044a5232ed75cff919e319521a3b"},"schema_version":"1.0","source":{"id":"1507.06818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06818","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06818v1","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06818","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"CCMCYJCBUQWH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CCMCYJCBUQWH7YRJ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CCMCYJCB","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:d1cd46ecf249dc82fecd77e6f58632d833a047a50243e505b42366008009122a","target":"graph","created_at":"2026-05-18T01:36:21Z","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":"Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At each time step, each vertex $v$ in $G$ polls $k$ random neighbours and takes the majority colour. If it doesn't have $k$ neighbours, it simply polls all of them, or all less one if the degree of $v$ is even. We study this protocol on the preferential attachment model of Albert and Barab\\'asi, which gives rise to a degree distribution that has roughly power-law $P(x) \\sim \\frac{1}{x^{3}}$, as well as generalisations which give exponents larger than $3$. The setting is as follows: Initially each vertex of $G$ is red in","authors_text":"Michel Bode, Mohammed Amin Abdullah, Nikolaos Fountoulakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-24T12:08:18Z","title":"Local majority dynamics on preferential attachment graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06818","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:2bfc55779cfa389d0a638501b63ccf18f9b2b7cc31844569e7863488f820af17","target":"record","created_at":"2026-05-18T01:36:21Z","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":"fdc2425ec7b772650d8edafb7252866e02cb33ab7a3310da502612ddd98600ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-24T12:08:18Z","title_canon_sha256":"046c1b7a69e7bf693d704938ab6ea419bcd4044a5232ed75cff919e319521a3b"},"schema_version":"1.0","source":{"id":"1507.06818","kind":"arxiv","version":1}},"canonical_sha256":"10982c2441a42c7fe229ab42e0037ad5f261cc9a5989ac4d56efbe349925d16c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10982c2441a42c7fe229ab42e0037ad5f261cc9a5989ac4d56efbe349925d16c","first_computed_at":"2026-05-18T01:36:21.949405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:21.949405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DVy3MFN4uLAS8RBYnDTyk1sp+8MIgTjgv1ldGh8UU8Kvp9GP2mv/OfFOZmZNGz15/Nw+JycLz0goCK6wesuUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:21.949933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bfc55779cfa389d0a638501b63ccf18f9b2b7cc31844569e7863488f820af17","sha256:d1cd46ecf249dc82fecd77e6f58632d833a047a50243e505b42366008009122a"],"state_sha256":"dd75eaa0fcb049dbd5796773748b6c752fb4a89f91030de3f7bc28731d61e48b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2am2zgESzBS/0Q0l8DxgC/5acgG2MIUjwyZBRK9PHpb6moD4fqMKXlO0AQXYPKrFWiUISQIz5R3OnAuhbZ3oDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:50:08.029099Z","bundle_sha256":"3200f26b636a9b821ccfec51edfa289f54dcdc0b78fb58477e9025e944905aec"}}