{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4BPHN73IPJVI4HB2F5UM2TTBNO","short_pith_number":"pith:4BPHN73I","schema_version":"1.0","canonical_sha256":"e05e76ff687a6a8e1c3a2f68cd4e616bb9a89d78fa4827919d8e43aace7a1ac5","source":{"kind":"arxiv","id":"1604.07166","version":2},"attestation_state":"computed","paper":{"title":"Information Cascades on Arbitrary Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Jun Wan, Liang Li, Thomas Moscibroda, Yu Xia","submitted_at":"2016-04-25T08:52:37Z","abstract_excerpt":"In this paper, we study information cascades on graphs. In this setting, each node in the graph represents a person. One after another, each person has to take a decision based on a private signal as well as the decisions made by earlier neighboring nodes. Such information cascades commonly occur in practice and have been studied in complete graphs where everyone can overhear the decisions of every other player. It is known that information cascades can be fragile and based on very little information, and that they have a high likelihood of being wrong.\n  Generalizing the problem to arbitrary "},"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":"1604.07166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-25T08:52:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d5f07c59b2d89604e4f5375424107079006bb0b81d86fac453c48ba47f43d326","abstract_canon_sha256":"6ed2d81e4c3b24449525520d52c738826b4301039ac14227e0b9892cca8b6c12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:57.212876Z","signature_b64":"2XWIyOdv2YK/ab5G37MSU9TcD2OMai5p7uMPtvjW/MJXlb4F6/bbmbIZaoTWS6RVC+01XKuoHdyN2sOPVQd3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e05e76ff687a6a8e1c3a2f68cd4e616bb9a89d78fa4827919d8e43aace7a1ac5","last_reissued_at":"2026-05-18T01:15:57.212373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:57.212373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Cascades on Arbitrary Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Jun Wan, Liang Li, Thomas Moscibroda, Yu Xia","submitted_at":"2016-04-25T08:52:37Z","abstract_excerpt":"In this paper, we study information cascades on graphs. In this setting, each node in the graph represents a person. One after another, each person has to take a decision based on a private signal as well as the decisions made by earlier neighboring nodes. Such information cascades commonly occur in practice and have been studied in complete graphs where everyone can overhear the decisions of every other player. It is known that information cascades can be fragile and based on very little information, and that they have a high likelihood of being wrong.\n  Generalizing the problem to arbitrary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07166","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":""},"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":"1604.07166","created_at":"2026-05-18T01:15:57.212447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07166v2","created_at":"2026-05-18T01:15:57.212447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07166","created_at":"2026-05-18T01:15:57.212447+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BPHN73IPJVI","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BPHN73IPJVI4HB2","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BPHN73I","created_at":"2026-05-18T12:29:58.707656+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/4BPHN73IPJVI4HB2F5UM2TTBNO","json":"https://pith.science/pith/4BPHN73IPJVI4HB2F5UM2TTBNO.json","graph_json":"https://pith.science/api/pith-number/4BPHN73IPJVI4HB2F5UM2TTBNO/graph.json","events_json":"https://pith.science/api/pith-number/4BPHN73IPJVI4HB2F5UM2TTBNO/events.json","paper":"https://pith.science/paper/4BPHN73I"},"agent_actions":{"view_html":"https://pith.science/pith/4BPHN73IPJVI4HB2F5UM2TTBNO","download_json":"https://pith.science/pith/4BPHN73IPJVI4HB2F5UM2TTBNO.json","view_paper":"https://pith.science/paper/4BPHN73I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07166&json=true","fetch_graph":"https://pith.science/api/pith-number/4BPHN73IPJVI4HB2F5UM2TTBNO/graph.json","fetch_events":"https://pith.science/api/pith-number/4BPHN73IPJVI4HB2F5UM2TTBNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BPHN73IPJVI4HB2F5UM2TTBNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BPHN73IPJVI4HB2F5UM2TTBNO/action/storage_attestation","attest_author":"https://pith.science/pith/4BPHN73IPJVI4HB2F5UM2TTBNO/action/author_attestation","sign_citation":"https://pith.science/pith/4BPHN73IPJVI4HB2F5UM2TTBNO/action/citation_signature","submit_replication":"https://pith.science/pith/4BPHN73IPJVI4HB2F5UM2TTBNO/action/replication_record"}},"created_at":"2026-05-18T01:15:57.212447+00:00","updated_at":"2026-05-18T01:15:57.212447+00:00"}