{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YA7QUIRPGVF3JB2Q3G7ULODRGK","short_pith_number":"pith:YA7QUIRP","schema_version":"1.0","canonical_sha256":"c03f0a222f354bb48750d9bf45b87132aa0efaa703f26ecb58e51b6b37583815","source":{"kind":"arxiv","id":"2011.05255","version":1},"attestation_state":"computed","paper":{"title":"On social networks that support learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"econ.TH","authors_text":"Fedor Sandomirskiy, Itai Arieli, Rann Smorodinsky","submitted_at":"2020-11-10T17:22:45Z","abstract_excerpt":"It is well understood that the structure of a social network is critical to whether or not agents can aggregate information correctly. In this paper, we study social networks that support information aggregation when rational agents act sequentially and irrevocably. Whether or not information is aggregated depends, inter alia, on the order in which agents decide. Thus, to decouple the order and the topology, our model studies a random arrival order.\n  Unlike the case of a fixed arrival order, in our model, the decision of an agent is unlikely to be affected by those who are far from him in the"},"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":"2011.05255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2020-11-10T17:22:45Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"e8c56ec5346a7eeeca3abe734359c720779a1797c0957caac3bea4e5c6a08efe","abstract_canon_sha256":"ebe2aa37dcdbce64d6c6703301a6d09a21cd5af99ebb99172ac144039dc0499d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:45.132550Z","signature_b64":"rvwjCsgz3K50nQBWdEtL0AREQ6dNTFtym8wke5AWMpxYGQqvUILLq9pwoAwm+vw7wGH8NcX+Qlgcc9QKgeNLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c03f0a222f354bb48750d9bf45b87132aa0efaa703f26ecb58e51b6b37583815","last_reissued_at":"2026-07-05T01:50:45.132175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:45.132175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On social networks that support learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"econ.TH","authors_text":"Fedor Sandomirskiy, Itai Arieli, Rann Smorodinsky","submitted_at":"2020-11-10T17:22:45Z","abstract_excerpt":"It is well understood that the structure of a social network is critical to whether or not agents can aggregate information correctly. In this paper, we study social networks that support information aggregation when rational agents act sequentially and irrevocably. Whether or not information is aggregated depends, inter alia, on the order in which agents decide. Thus, to decouple the order and the topology, our model studies a random arrival order.\n  Unlike the case of a fixed arrival order, in our model, the decision of an agent is unlikely to be affected by those who are far from him in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05255","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.05255/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.05255","created_at":"2026-07-05T01:50:45.132231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.05255v1","created_at":"2026-07-05T01:50:45.132231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05255","created_at":"2026-07-05T01:50:45.132231+00:00"},{"alias_kind":"pith_short_12","alias_value":"YA7QUIRPGVF3","created_at":"2026-07-05T01:50:45.132231+00:00"},{"alias_kind":"pith_short_16","alias_value":"YA7QUIRPGVF3JB2Q","created_at":"2026-07-05T01:50:45.132231+00:00"},{"alias_kind":"pith_short_8","alias_value":"YA7QUIRP","created_at":"2026-07-05T01:50:45.132231+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01419","citing_title":"A model of opinion dynamics evolving via a preferential attachment mechanism involving multiple extractions","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YA7QUIRPGVF3JB2Q3G7ULODRGK","json":"https://pith.science/pith/YA7QUIRPGVF3JB2Q3G7ULODRGK.json","graph_json":"https://pith.science/api/pith-number/YA7QUIRPGVF3JB2Q3G7ULODRGK/graph.json","events_json":"https://pith.science/api/pith-number/YA7QUIRPGVF3JB2Q3G7ULODRGK/events.json","paper":"https://pith.science/paper/YA7QUIRP"},"agent_actions":{"view_html":"https://pith.science/pith/YA7QUIRPGVF3JB2Q3G7ULODRGK","download_json":"https://pith.science/pith/YA7QUIRPGVF3JB2Q3G7ULODRGK.json","view_paper":"https://pith.science/paper/YA7QUIRP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.05255&json=true","fetch_graph":"https://pith.science/api/pith-number/YA7QUIRPGVF3JB2Q3G7ULODRGK/graph.json","fetch_events":"https://pith.science/api/pith-number/YA7QUIRPGVF3JB2Q3G7ULODRGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YA7QUIRPGVF3JB2Q3G7ULODRGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YA7QUIRPGVF3JB2Q3G7ULODRGK/action/storage_attestation","attest_author":"https://pith.science/pith/YA7QUIRPGVF3JB2Q3G7ULODRGK/action/author_attestation","sign_citation":"https://pith.science/pith/YA7QUIRPGVF3JB2Q3G7ULODRGK/action/citation_signature","submit_replication":"https://pith.science/pith/YA7QUIRPGVF3JB2Q3G7ULODRGK/action/replication_record"}},"created_at":"2026-07-05T01:50:45.132231+00:00","updated_at":"2026-07-05T01:50:45.132231+00:00"}