{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QN5EGWEI2HZJCCFCUEHIQM2CT6","short_pith_number":"pith:QN5EGWEI","canonical_record":{"source":{"id":"2508.17557","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-08-24T23:48:37Z","cross_cats_sorted":["cs.MA","cs.SI"],"title_canon_sha256":"c746c0865127195c908f3a177b6a9d1601db3b8581dc6db6234a6513c95dc9b2","abstract_canon_sha256":"dc7544433995334c8aea452094071ba93995b5eff710b0c596dbe53eec2b8d4d"},"schema_version":"1.0"},"canonical_sha256":"837a435888d1f29108a2a10e8833429f97ccbf4a353c694dcc727510a6e478fa","source":{"kind":"arxiv","id":"2508.17557","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.17557","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"2508.17557v5","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.17557","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"QN5EGWEI2HZJ","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"pith_short_16","alias_value":"QN5EGWEI2HZJCCFC","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"pith_short_8","alias_value":"QN5EGWEI","created_at":"2026-07-03T00:16:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QN5EGWEI2HZJCCFCUEHIQM2CT6","target":"record","payload":{"canonical_record":{"source":{"id":"2508.17557","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-08-24T23:48:37Z","cross_cats_sorted":["cs.MA","cs.SI"],"title_canon_sha256":"c746c0865127195c908f3a177b6a9d1601db3b8581dc6db6234a6513c95dc9b2","abstract_canon_sha256":"dc7544433995334c8aea452094071ba93995b5eff710b0c596dbe53eec2b8d4d"},"schema_version":"1.0"},"canonical_sha256":"837a435888d1f29108a2a10e8833429f97ccbf4a353c694dcc727510a6e478fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:16:50.366733Z","signature_b64":"VtXN42F0ombYMbqgHd9qusTgh+4dNXquc//7JIhLzRx5EjSMp/pVU0NzpZkXbILsWQxbTIabIyZig66YKiDKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837a435888d1f29108a2a10e8833429f97ccbf4a353c694dcc727510a6e478fa","last_reissued_at":"2026-07-03T00:16:50.366223Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:16:50.366223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.17557","source_version":5,"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-07-03T00:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImiHMTrZgTfmnnZbZUlKk84yAVy/VMpjbPP+ml4JIvOKJhbb1SFgWdeZPvFZAv5dxODeqpAIrS2o8UUcZ+hOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:06:45.779233Z"},"content_sha256":"af84d42f0b5e821d9dfdc12fed0d00d691af0eb9e0f951c525a215b0425c09ec","schema_version":"1.0","event_id":"sha256:af84d42f0b5e821d9dfdc12fed0d00d691af0eb9e0f951c525a215b0425c09ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QN5EGWEI2HZJCCFCUEHIQM2CT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The price of uncertainty for social consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Even small relative uncertainty in neighbor color counts greatly hinders consensus in social networks.","cross_cats":["cs.MA","cs.SI"],"primary_cat":"cs.GT","authors_text":"Alec Sun, Yunzhe Bai","submitted_at":"2025-08-24T23:48:37Z","abstract_excerpt":"How hard is it to achieve consensus in a social network under uncertainty? In this paper we model this problem as a social graph of agents where each vertex is initially colored red or blue. The goal of the agents is to achieve consensus, which is when the colors of all agents align. Agents attempt to do this locally through steps in which an agent changes their color to the color of the majority of their neighbors. In real life, agents may not know exactly how many of their neighbors are red or blue, which introduces uncertainty into this process. Modeling uncertainty as perturbations of rela"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"even small values of ε greatly hinder the ability to achieve consensus in a social network. We prove theoretically tight upper and lower bounds on the price of uncertainty","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The model of uncertainty as relative multiplicative perturbations of magnitude 1+ε to the exact neighbor color counts, combined with the assumption that agents always follow a strict local majority rule (abstract, paragraph 2).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Proves tight upper and lower bounds showing that even small multiplicative perturbations (1+ε) to neighbor color counts greatly increase the price of uncertainty for reaching consensus in social graphs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Even small relative uncertainty in neighbor color counts greatly hinders consensus in social networks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e669471fa29fe48eb7da5ecf13e8842d9296c8e3412bbdc27711859bff08021a"},"source":{"id":"2508.17557","kind":"arxiv","version":5},"verdict":{"id":"641f17b2-9fc7-405d-99ad-b047c3125f14","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T20:47:32.034393Z","strongest_claim":"even small values of ε greatly hinder the ability to achieve consensus in a social network. We prove theoretically tight upper and lower bounds on the price of uncertainty","one_line_summary":"Proves tight upper and lower bounds showing that even small multiplicative perturbations (1+ε) to neighbor color counts greatly increase the price of uncertainty for reaching consensus in social graphs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The model of uncertainty as relative multiplicative perturbations of magnitude 1+ε to the exact neighbor color counts, combined with the assumption that agents always follow a strict local majority rule (abstract, paragraph 2).","pith_extraction_headline":"Even small relative uncertainty in neighbor color counts greatly hinders consensus in social networks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.17557/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"c27fafa233383f4807717154524fedfb2f1f49cab2c6c22c57d410b726f889b2"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"641f17b2-9fc7-405d-99ad-b047c3125f14"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-03T00:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQmMBrah4xPdzzmi6lw1N3D31KPlGRVXpI1hadYDKpzOdvki1cxw6NlJKLJB+HMJIpPF/thfzbpIC/CAeHRtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:06:45.779802Z"},"content_sha256":"beba17fb4c4873ae70b1dcbe9597451992dc70dfd0d122fbc78cd0ac91b888d9","schema_version":"1.0","event_id":"sha256:beba17fb4c4873ae70b1dcbe9597451992dc70dfd0d122fbc78cd0ac91b888d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QN5EGWEI2HZJCCFCUEHIQM2CT6/bundle.json","state_url":"https://pith.science/pith/QN5EGWEI2HZJCCFCUEHIQM2CT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QN5EGWEI2HZJCCFCUEHIQM2CT6/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-07-03T10:06:45Z","links":{"resolver":"https://pith.science/pith/QN5EGWEI2HZJCCFCUEHIQM2CT6","bundle":"https://pith.science/pith/QN5EGWEI2HZJCCFCUEHIQM2CT6/bundle.json","state":"https://pith.science/pith/QN5EGWEI2HZJCCFCUEHIQM2CT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QN5EGWEI2HZJCCFCUEHIQM2CT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QN5EGWEI2HZJCCFCUEHIQM2CT6","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":"dc7544433995334c8aea452094071ba93995b5eff710b0c596dbe53eec2b8d4d","cross_cats_sorted":["cs.MA","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-08-24T23:48:37Z","title_canon_sha256":"c746c0865127195c908f3a177b6a9d1601db3b8581dc6db6234a6513c95dc9b2"},"schema_version":"1.0","source":{"id":"2508.17557","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.17557","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"2508.17557v5","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.17557","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"QN5EGWEI2HZJ","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"pith_short_16","alias_value":"QN5EGWEI2HZJCCFC","created_at":"2026-07-03T00:16:50Z"},{"alias_kind":"pith_short_8","alias_value":"QN5EGWEI","created_at":"2026-07-03T00:16:50Z"}],"graph_snapshots":[{"event_id":"sha256:beba17fb4c4873ae70b1dcbe9597451992dc70dfd0d122fbc78cd0ac91b888d9","target":"graph","created_at":"2026-07-03T00:16:50Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"even small values of ε greatly hinder the ability to achieve consensus in a social network. We prove theoretically tight upper and lower bounds on the price of uncertainty"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The model of uncertainty as relative multiplicative perturbations of magnitude 1+ε to the exact neighbor color counts, combined with the assumption that agents always follow a strict local majority rule (abstract, paragraph 2)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Proves tight upper and lower bounds showing that even small multiplicative perturbations (1+ε) to neighbor color counts greatly increase the price of uncertainty for reaching consensus in social graphs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Even small relative uncertainty in neighbor color counts greatly hinders consensus in social networks."}],"snapshot_sha256":"e669471fa29fe48eb7da5ecf13e8842d9296c8e3412bbdc27711859bff08021a"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"c27fafa233383f4807717154524fedfb2f1f49cab2c6c22c57d410b726f889b2"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.17557/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"How hard is it to achieve consensus in a social network under uncertainty? In this paper we model this problem as a social graph of agents where each vertex is initially colored red or blue. The goal of the agents is to achieve consensus, which is when the colors of all agents align. Agents attempt to do this locally through steps in which an agent changes their color to the color of the majority of their neighbors. In real life, agents may not know exactly how many of their neighbors are red or blue, which introduces uncertainty into this process. Modeling uncertainty as perturbations of rela","authors_text":"Alec Sun, Yunzhe Bai","cross_cats":["cs.MA","cs.SI"],"headline":"Even small relative uncertainty in neighbor color counts greatly hinders consensus in social networks.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-08-24T23:48:37Z","title":"The price of uncertainty for social consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.17557","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-18T20:47:32.034393Z","id":"641f17b2-9fc7-405d-99ad-b047c3125f14","model_set":{"reader":"grok-4.3"},"one_line_summary":"Proves tight upper and lower bounds showing that even small multiplicative perturbations (1+ε) to neighbor color counts greatly increase the price of uncertainty for reaching consensus in social graphs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Even small relative uncertainty in neighbor color counts greatly hinders consensus in social networks.","strongest_claim":"even small values of ε greatly hinder the ability to achieve consensus in a social network. We prove theoretically tight upper and lower bounds on the price of uncertainty","weakest_assumption":"The model of uncertainty as relative multiplicative perturbations of magnitude 1+ε to the exact neighbor color counts, combined with the assumption that agents always follow a strict local majority rule (abstract, paragraph 2)."}},"verdict_id":"641f17b2-9fc7-405d-99ad-b047c3125f14"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:af84d42f0b5e821d9dfdc12fed0d00d691af0eb9e0f951c525a215b0425c09ec","target":"record","created_at":"2026-07-03T00:16:50Z","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":"dc7544433995334c8aea452094071ba93995b5eff710b0c596dbe53eec2b8d4d","cross_cats_sorted":["cs.MA","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-08-24T23:48:37Z","title_canon_sha256":"c746c0865127195c908f3a177b6a9d1601db3b8581dc6db6234a6513c95dc9b2"},"schema_version":"1.0","source":{"id":"2508.17557","kind":"arxiv","version":5}},"canonical_sha256":"837a435888d1f29108a2a10e8833429f97ccbf4a353c694dcc727510a6e478fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"837a435888d1f29108a2a10e8833429f97ccbf4a353c694dcc727510a6e478fa","first_computed_at":"2026-07-03T00:16:50.366223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T00:16:50.366223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VtXN42F0ombYMbqgHd9qusTgh+4dNXquc//7JIhLzRx5EjSMp/pVU0NzpZkXbILsWQxbTIabIyZig66YKiDKCw==","signature_status":"signed_v1","signed_at":"2026-07-03T00:16:50.366733Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.17557","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af84d42f0b5e821d9dfdc12fed0d00d691af0eb9e0f951c525a215b0425c09ec","sha256:beba17fb4c4873ae70b1dcbe9597451992dc70dfd0d122fbc78cd0ac91b888d9"],"state_sha256":"fd1153ad66343f7486654e91fe01abe56f6f701cb19066a3559ae237dc306c9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnsjKTekqrn7ds2F7YTgFFp3/yESQCIqYkcCxiU4DiNshyGF0MSXX/FXYB9URtKJGK+uw3MM7H7D1WJ1i8TwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T10:06:45.782415Z","bundle_sha256":"1a79cb061b9f0468ea1534def264df65e65a5b623d4295ac601cbc6d87693d2f"}}