{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PAR3XUG222RZVLYGUHKZHI3IER","short_pith_number":"pith:PAR3XUG2","canonical_record":{"source":{"id":"1212.2893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-12T17:22:33Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e97ad3edbf586dd544d76eb585fa2a112ceeb0e4d272af0203ecbd93cfbce43f","abstract_canon_sha256":"5d6e323fba5691cca687c9e734b3b7bd33d0349c9c75b5cb3e439d5a8bc2e932"},"schema_version":"1.0"},"canonical_sha256":"7823bbd0dad6a39aaf06a1d593a3682443c17d62d9098d39959b417543c1189c","source":{"kind":"arxiv","id":"1212.2893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2893","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2893v1","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2893","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"PAR3XUG222RZ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PAR3XUG222RZVLYG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PAR3XUG2","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PAR3XUG222RZVLYGUHKZHI3IER","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-12T17:22:33Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e97ad3edbf586dd544d76eb585fa2a112ceeb0e4d272af0203ecbd93cfbce43f","abstract_canon_sha256":"5d6e323fba5691cca687c9e734b3b7bd33d0349c9c75b5cb3e439d5a8bc2e932"},"schema_version":"1.0"},"canonical_sha256":"7823bbd0dad6a39aaf06a1d593a3682443c17d62d9098d39959b417543c1189c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:35.029462Z","signature_b64":"jk0Xh+su7BHBTkBWVbsOhKW5TwcQ5TJrFDnQ2SqLejJYzxs/vkkNtGS7Y8afqV5efYEsV78E8HNJ/Of6aym7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7823bbd0dad6a39aaf06a1d593a3682443c17d62d9098d39959b417543c1189c","last_reissued_at":"2026-05-18T03:38:35.028916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:35.028916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2893","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-18T03:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KHS43k5FaMN7Z8W/ehliyA0Cwjerq8YLtFKnIv00FzA/tucyqIIQ5CJVLJQC6Y6R+WuLf/73TP86X2/pWDQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:33:05.947476Z"},"content_sha256":"a6b74f455468fc9e322fdf64ab97161ce39e58bf7688d59c6b797077247737e0","schema_version":"1.0","event_id":"sha256:a6b74f455468fc9e322fdf64ab97161ce39e58bf7688d59c6b797077247737e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PAR3XUG222RZVLYGUHKZHI3IER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Learning in Social Networks: Finite Population and the Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jianqing Fan, Xin Tong, Yao Zeng","submitted_at":"2012-12-12T17:22:33Z","abstract_excerpt":"Following the Bayesian communication learning paradigm, we propose a finite population learning concept to capture the level of information aggregation in any given network, where agents are allowed to communicate with neighbors repeatedly before making a single decision. This concept helps determine the occurrence of effective information aggregation in a finite network and reveals explicit interplays among parameters. It also enables meaningful comparative statics regarding the effectiveness of information aggregation in networks. Moreover, it offers a solid foundation to address, with a new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2893","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-18T03:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZY1keo3/S3VmuFwVfFk4pOAoBKc3Z1Br3jU5WhsjRGsuQMct5eQXrrHx1hM0L7w2iqQ+ewTHbvunGCAql/lCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:33:05.947821Z"},"content_sha256":"80b062e2be4d6e4e8d1ee027c900ebc883faf22c1ef79a9eb266d1d38e276ea6","schema_version":"1.0","event_id":"sha256:80b062e2be4d6e4e8d1ee027c900ebc883faf22c1ef79a9eb266d1d38e276ea6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAR3XUG222RZVLYGUHKZHI3IER/bundle.json","state_url":"https://pith.science/pith/PAR3XUG222RZVLYGUHKZHI3IER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAR3XUG222RZVLYGUHKZHI3IER/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-09T00:33:05Z","links":{"resolver":"https://pith.science/pith/PAR3XUG222RZVLYGUHKZHI3IER","bundle":"https://pith.science/pith/PAR3XUG222RZVLYGUHKZHI3IER/bundle.json","state":"https://pith.science/pith/PAR3XUG222RZVLYGUHKZHI3IER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAR3XUG222RZVLYGUHKZHI3IER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PAR3XUG222RZVLYGUHKZHI3IER","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":"5d6e323fba5691cca687c9e734b3b7bd33d0349c9c75b5cb3e439d5a8bc2e932","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-12T17:22:33Z","title_canon_sha256":"e97ad3edbf586dd544d76eb585fa2a112ceeb0e4d272af0203ecbd93cfbce43f"},"schema_version":"1.0","source":{"id":"1212.2893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2893","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2893v1","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2893","created_at":"2026-05-18T03:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"PAR3XUG222RZ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PAR3XUG222RZVLYG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PAR3XUG2","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:80b062e2be4d6e4e8d1ee027c900ebc883faf22c1ef79a9eb266d1d38e276ea6","target":"graph","created_at":"2026-05-18T03:38:35Z","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":"Following the Bayesian communication learning paradigm, we propose a finite population learning concept to capture the level of information aggregation in any given network, where agents are allowed to communicate with neighbors repeatedly before making a single decision. This concept helps determine the occurrence of effective information aggregation in a finite network and reveals explicit interplays among parameters. It also enables meaningful comparative statics regarding the effectiveness of information aggregation in networks. Moreover, it offers a solid foundation to address, with a new","authors_text":"Jianqing Fan, Xin Tong, Yao Zeng","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-12T17:22:33Z","title":"Communication Learning in Social Networks: Finite Population and the Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2893","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:a6b74f455468fc9e322fdf64ab97161ce39e58bf7688d59c6b797077247737e0","target":"record","created_at":"2026-05-18T03:38:35Z","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":"5d6e323fba5691cca687c9e734b3b7bd33d0349c9c75b5cb3e439d5a8bc2e932","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-12-12T17:22:33Z","title_canon_sha256":"e97ad3edbf586dd544d76eb585fa2a112ceeb0e4d272af0203ecbd93cfbce43f"},"schema_version":"1.0","source":{"id":"1212.2893","kind":"arxiv","version":1}},"canonical_sha256":"7823bbd0dad6a39aaf06a1d593a3682443c17d62d9098d39959b417543c1189c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7823bbd0dad6a39aaf06a1d593a3682443c17d62d9098d39959b417543c1189c","first_computed_at":"2026-05-18T03:38:35.028916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:35.028916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jk0Xh+su7BHBTkBWVbsOhKW5TwcQ5TJrFDnQ2SqLejJYzxs/vkkNtGS7Y8afqV5efYEsV78E8HNJ/Of6aym7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:35.029462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6b74f455468fc9e322fdf64ab97161ce39e58bf7688d59c6b797077247737e0","sha256:80b062e2be4d6e4e8d1ee027c900ebc883faf22c1ef79a9eb266d1d38e276ea6"],"state_sha256":"17ca9d7c2c2451ba799830bd0def4d5a39474823005772ca1fd8aefead19aeb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/V0dbmF+Rosl7JeRkurKsYO7XSDOdzMg4Iu9SNIhxlIlDtptbI1XqiRiZVOGUrj4z47ZhbyTLEIjHkPEssKEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:33:05.949733Z","bundle_sha256":"935a489483ff525ef8e597a8bfdc18e2c1df3abce7f9f16ebffd9eab9555d587"}}