{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TVEMRS2HO55T7Q74AG2FA6T6NS","short_pith_number":"pith:TVEMRS2H","canonical_record":{"source":{"id":"2010.06695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-13T21:21:17Z","cross_cats_sorted":[],"title_canon_sha256":"55959cd1bcef5c7f2b2ed05f56606fcdb3d4562c3217c184ba6afc4579ceae7d","abstract_canon_sha256":"f469056e0ba1d891a933399981ccf77ced367cb67dc9be800609c8072aff8635"},"schema_version":"1.0"},"canonical_sha256":"9d48c8cb47777b3fc3fc01b4507a7e6caa201de2d6674b49071dc84cf8d383d9","source":{"kind":"arxiv","id":"2010.06695","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.06695","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"2010.06695v2","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.06695","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"TVEMRS2HO55T","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_16","alias_value":"TVEMRS2HO55T7Q74","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_8","alias_value":"TVEMRS2H","created_at":"2026-07-05T03:01:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TVEMRS2HO55T7Q74AG2FA6T6NS","target":"record","payload":{"canonical_record":{"source":{"id":"2010.06695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-13T21:21:17Z","cross_cats_sorted":[],"title_canon_sha256":"55959cd1bcef5c7f2b2ed05f56606fcdb3d4562c3217c184ba6afc4579ceae7d","abstract_canon_sha256":"f469056e0ba1d891a933399981ccf77ced367cb67dc9be800609c8072aff8635"},"schema_version":"1.0"},"canonical_sha256":"9d48c8cb47777b3fc3fc01b4507a7e6caa201de2d6674b49071dc84cf8d383d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:53.406531Z","signature_b64":"13tKXUWaofdXMkC6q7IAnV+0h3OXAwfmFH75I8oPtV1RAgc5TYuXggMJzvB3+HA3ZNVVNefJD9BOOYFuopyeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d48c8cb47777b3fc3fc01b4507a7e6caa201de2d6674b49071dc84cf8d383d9","last_reissued_at":"2026-07-05T03:01:53.406128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:53.406128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.06695","source_version":2,"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-05T03:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TypvD/6i5z6NqMOwdiQeb2iZ7I6t1NK85N4RUXA7xfYDKkylRg6Rhst9hPmguBTMDUdK1bMjbYqqJDkuiOujDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:13:13.265295Z"},"content_sha256":"efd8cbebda9b22f0a30ee949542aa9448b3473406e52d5ff7d86e0dcc6c93761","schema_version":"1.0","event_id":"sha256:efd8cbebda9b22f0a30ee949542aa9448b3473406e52d5ff7d86e0dcc6c93761"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TVEMRS2HO55T7Q74AG2FA6T6NS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Bayesian Social Learning on Random Digraphs with Aperiodically Varying Network Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behrouz Touri, Massimo Franceschetti, Rohit Parasnis","submitted_at":"2020-10-13T21:21:17Z","abstract_excerpt":"We study non-Bayesian social learning on random directed graphs and show that under mild connectivity assumptions, all the agents almost surely learn the true state of the world asymptotically in time if the sequence of the associated weighted adjacency matrices belongs to Class $\\pstar$ (a broad class of stochastic chains that subsumes uniformly strongly connected chains). We show that uniform strong connectivity, while being unnecessary for asymptotic learning, ensures that all the agents' beliefs converge to a consensus almost surely, even when the true state is not identifiable. We then pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.06695","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.06695/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":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-07-05T03:01:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQlr/JL8zfWROhosPZTZ1nAnijnKuNVdBKc4Z5zFvBt2IX4NQwDawVhqMH9K+VhimA3hI+CbyQ1fsafN8E8IDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:13:13.265818Z"},"content_sha256":"ba0c10f483c3ecd6bac60de8431b0e43c66d07af399ebbeb5f099f1f9529b8da","schema_version":"1.0","event_id":"sha256:ba0c10f483c3ecd6bac60de8431b0e43c66d07af399ebbeb5f099f1f9529b8da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVEMRS2HO55T7Q74AG2FA6T6NS/bundle.json","state_url":"https://pith.science/pith/TVEMRS2HO55T7Q74AG2FA6T6NS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVEMRS2HO55T7Q74AG2FA6T6NS/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-08-11T01:13:13Z","links":{"resolver":"https://pith.science/pith/TVEMRS2HO55T7Q74AG2FA6T6NS","bundle":"https://pith.science/pith/TVEMRS2HO55T7Q74AG2FA6T6NS/bundle.json","state":"https://pith.science/pith/TVEMRS2HO55T7Q74AG2FA6T6NS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVEMRS2HO55T7Q74AG2FA6T6NS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TVEMRS2HO55T7Q74AG2FA6T6NS","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":"f469056e0ba1d891a933399981ccf77ced367cb67dc9be800609c8072aff8635","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-13T21:21:17Z","title_canon_sha256":"55959cd1bcef5c7f2b2ed05f56606fcdb3d4562c3217c184ba6afc4579ceae7d"},"schema_version":"1.0","source":{"id":"2010.06695","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.06695","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"arxiv_version","alias_value":"2010.06695v2","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.06695","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_12","alias_value":"TVEMRS2HO55T","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_16","alias_value":"TVEMRS2HO55T7Q74","created_at":"2026-07-05T03:01:53Z"},{"alias_kind":"pith_short_8","alias_value":"TVEMRS2H","created_at":"2026-07-05T03:01:53Z"}],"graph_snapshots":[{"event_id":"sha256:ba0c10f483c3ecd6bac60de8431b0e43c66d07af399ebbeb5f099f1f9529b8da","target":"graph","created_at":"2026-07-05T03:01:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.06695/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study non-Bayesian social learning on random directed graphs and show that under mild connectivity assumptions, all the agents almost surely learn the true state of the world asymptotically in time if the sequence of the associated weighted adjacency matrices belongs to Class $\\pstar$ (a broad class of stochastic chains that subsumes uniformly strongly connected chains). We show that uniform strong connectivity, while being unnecessary for asymptotic learning, ensures that all the agents' beliefs converge to a consensus almost surely, even when the true state is not identifiable. We then pr","authors_text":"Behrouz Touri, Massimo Franceschetti, Rohit Parasnis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-13T21:21:17Z","title":"Non-Bayesian Social Learning on Random Digraphs with Aperiodically Varying Network Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.06695","kind":"arxiv","version":2},"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:efd8cbebda9b22f0a30ee949542aa9448b3473406e52d5ff7d86e0dcc6c93761","target":"record","created_at":"2026-07-05T03:01:53Z","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":"f469056e0ba1d891a933399981ccf77ced367cb67dc9be800609c8072aff8635","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-13T21:21:17Z","title_canon_sha256":"55959cd1bcef5c7f2b2ed05f56606fcdb3d4562c3217c184ba6afc4579ceae7d"},"schema_version":"1.0","source":{"id":"2010.06695","kind":"arxiv","version":2}},"canonical_sha256":"9d48c8cb47777b3fc3fc01b4507a7e6caa201de2d6674b49071dc84cf8d383d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d48c8cb47777b3fc3fc01b4507a7e6caa201de2d6674b49071dc84cf8d383d9","first_computed_at":"2026-07-05T03:01:53.406128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:01:53.406128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"13tKXUWaofdXMkC6q7IAnV+0h3OXAwfmFH75I8oPtV1RAgc5TYuXggMJzvB3+HA3ZNVVNefJD9BOOYFuopyeCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:01:53.406531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.06695","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efd8cbebda9b22f0a30ee949542aa9448b3473406e52d5ff7d86e0dcc6c93761","sha256:ba0c10f483c3ecd6bac60de8431b0e43c66d07af399ebbeb5f099f1f9529b8da"],"state_sha256":"dea9ce3f5ddb3b991466e4fbe819407262e1417f35eab083751519db26ab0e66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JnFgrFawiC1QQs906Zwcq0d09MZgdJMDzGMr7tI0ivrwks33p13jmY5BJlUOfwN9vPdevz89NO58s8UIqPY3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:13:13.270988Z","bundle_sha256":"7e170d147e244ed61455861f479596107020996cc81c8152486cb802984428a1"}}