{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CCMCYJCBUQWH7YRJVNBOAA322X","short_pith_number":"pith:CCMCYJCB","schema_version":"1.0","canonical_sha256":"10982c2441a42c7fe229ab42e0037ad5f261cc9a5989ac4d56efbe349925d16c","source":{"kind":"arxiv","id":"1507.06818","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.06818","created_at":"2026-05-18T01:36:21.949483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06818v1","created_at":"2026-05-18T01:36:21.949483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06818","created_at":"2026-05-18T01:36:21.949483+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCMCYJCBUQWH","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCMCYJCBUQWH7YRJ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCMCYJCB","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X","json":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X.json","graph_json":"https://pith.science/api/pith-number/CCMCYJCBUQWH7YRJVNBOAA322X/graph.json","events_json":"https://pith.science/api/pith-number/CCMCYJCBUQWH7YRJVNBOAA322X/events.json","paper":"https://pith.science/paper/CCMCYJCB"},"agent_actions":{"view_html":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X","download_json":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X.json","view_paper":"https://pith.science/paper/CCMCYJCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06818&json=true","fetch_graph":"https://pith.science/api/pith-number/CCMCYJCBUQWH7YRJVNBOAA322X/graph.json","fetch_events":"https://pith.science/api/pith-number/CCMCYJCBUQWH7YRJVNBOAA322X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X/action/storage_attestation","attest_author":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X/action/author_attestation","sign_citation":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X/action/citation_signature","submit_replication":"https://pith.science/pith/CCMCYJCBUQWH7YRJVNBOAA322X/action/replication_record"}},"created_at":"2026-05-18T01:36:21.949483+00:00","updated_at":"2026-05-18T01:36:21.949483+00:00"}