{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5D2NMTFU3JVOU3T4QZWUQP4HWA","short_pith_number":"pith:5D2NMTFU","canonical_record":{"source":{"id":"1209.5527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-09-25T08:13:59Z","cross_cats_sorted":["econ.TH","math.PR"],"title_canon_sha256":"9934505a9e3c0cd93cc23b1ad3a3a2c00bc06ff5598c8519ed9ef7088e3ceaa8","abstract_canon_sha256":"32086de11b8f02daaa4dfb68d947cae70f74cf8567b683b56495b917feb39eab"},"schema_version":"1.0"},"canonical_sha256":"e8f4d64cb4da6aea6e7c866d483f87b004688a51828578a6c4b23d623a0a0312","source":{"kind":"arxiv","id":"1209.5527","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5527","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5527v2","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5527","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"pith_short_12","alias_value":"5D2NMTFU3JVO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5D2NMTFU3JVOU3T4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5D2NMTFU","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5D2NMTFU3JVOU3T4QZWUQP4HWA","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-09-25T08:13:59Z","cross_cats_sorted":["econ.TH","math.PR"],"title_canon_sha256":"9934505a9e3c0cd93cc23b1ad3a3a2c00bc06ff5598c8519ed9ef7088e3ceaa8","abstract_canon_sha256":"32086de11b8f02daaa4dfb68d947cae70f74cf8567b683b56495b917feb39eab"},"schema_version":"1.0"},"canonical_sha256":"e8f4d64cb4da6aea6e7c866d483f87b004688a51828578a6c4b23d623a0a0312","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:48.271489Z","signature_b64":"fpJnN/zyV2Ro8rU7AkeqFp77ShNb8O3eG7785EFGnMHA25krWacYLW+mq4MvdhGh1m6vlztoIUPUETP/QjUrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8f4d64cb4da6aea6e7c866d483f87b004688a51828578a6c4b23d623a0a0312","last_reissued_at":"2026-05-18T00:09:48.270773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:48.270773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5527","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-05-18T00:09:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11mbli5jmMEak2aTNNUeinDVOgPPHzQXpQ97CopH9jeyTK7PMJ5a8YGi7vNg2zth7IuRTvYGlazNdfbnadLsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:34:16.385660Z"},"content_sha256":"72a8158752ac67948de2e33a4bd51a1037fbc49f716d75c46b75f634726da483","schema_version":"1.0","event_id":"sha256:72a8158752ac67948de2e33a4bd51a1037fbc49f716d75c46b75f634726da483"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5D2NMTFU3JVOU3T4QZWUQP4HWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategic Learning and the Topology of Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH","math.PR"],"primary_cat":"cs.GT","authors_text":"Allan Sly, Elchanan Mossel, Omer Tamuz","submitted_at":"2012-09-25T08:13:59Z","abstract_excerpt":"We consider a group of strategic agents who must each repeatedly take one of two possible actions. They learn which of the two actions is preferable from initial private signals, and by observing the actions of their neighbors in a social network.\n  We show that the question of whether or not the agents learn efficiently depends on the topology of the social network. In particular, we identify a geometric \"egalitarianism\" condition on the social network that guarantees learning in infinite networks, or learning with high probability in large finite networks, in any equilibrium. We also give ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5527","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"},"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-18T00:09:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdpUcwxUjKQojHfriS78OV6ljjgdTZXsuOarSYz7g3h+qUSvfRVb3gKmS4B6iZm20PvQRfEdKSueI38nAcLSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:34:16.386014Z"},"content_sha256":"ec87f4ab495453c2cebf0498b6867e9a117d168001bbaf100d568687d64a357f","schema_version":"1.0","event_id":"sha256:ec87f4ab495453c2cebf0498b6867e9a117d168001bbaf100d568687d64a357f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5D2NMTFU3JVOU3T4QZWUQP4HWA/bundle.json","state_url":"https://pith.science/pith/5D2NMTFU3JVOU3T4QZWUQP4HWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5D2NMTFU3JVOU3T4QZWUQP4HWA/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-05-31T03:34:16Z","links":{"resolver":"https://pith.science/pith/5D2NMTFU3JVOU3T4QZWUQP4HWA","bundle":"https://pith.science/pith/5D2NMTFU3JVOU3T4QZWUQP4HWA/bundle.json","state":"https://pith.science/pith/5D2NMTFU3JVOU3T4QZWUQP4HWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5D2NMTFU3JVOU3T4QZWUQP4HWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5D2NMTFU3JVOU3T4QZWUQP4HWA","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":"32086de11b8f02daaa4dfb68d947cae70f74cf8567b683b56495b917feb39eab","cross_cats_sorted":["econ.TH","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-09-25T08:13:59Z","title_canon_sha256":"9934505a9e3c0cd93cc23b1ad3a3a2c00bc06ff5598c8519ed9ef7088e3ceaa8"},"schema_version":"1.0","source":{"id":"1209.5527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5527","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5527v2","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5527","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"pith_short_12","alias_value":"5D2NMTFU3JVO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5D2NMTFU3JVOU3T4","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5D2NMTFU","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:ec87f4ab495453c2cebf0498b6867e9a117d168001bbaf100d568687d64a357f","target":"graph","created_at":"2026-05-18T00:09:48Z","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":"We consider a group of strategic agents who must each repeatedly take one of two possible actions. They learn which of the two actions is preferable from initial private signals, and by observing the actions of their neighbors in a social network.\n  We show that the question of whether or not the agents learn efficiently depends on the topology of the social network. In particular, we identify a geometric \"egalitarianism\" condition on the social network that guarantees learning in infinite networks, or learning with high probability in large finite networks, in any equilibrium. We also give ex","authors_text":"Allan Sly, Elchanan Mossel, Omer Tamuz","cross_cats":["econ.TH","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-09-25T08:13:59Z","title":"Strategic Learning and the Topology of Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5527","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:72a8158752ac67948de2e33a4bd51a1037fbc49f716d75c46b75f634726da483","target":"record","created_at":"2026-05-18T00:09:48Z","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":"32086de11b8f02daaa4dfb68d947cae70f74cf8567b683b56495b917feb39eab","cross_cats_sorted":["econ.TH","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-09-25T08:13:59Z","title_canon_sha256":"9934505a9e3c0cd93cc23b1ad3a3a2c00bc06ff5598c8519ed9ef7088e3ceaa8"},"schema_version":"1.0","source":{"id":"1209.5527","kind":"arxiv","version":2}},"canonical_sha256":"e8f4d64cb4da6aea6e7c866d483f87b004688a51828578a6c4b23d623a0a0312","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8f4d64cb4da6aea6e7c866d483f87b004688a51828578a6c4b23d623a0a0312","first_computed_at":"2026-05-18T00:09:48.270773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:48.270773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fpJnN/zyV2Ro8rU7AkeqFp77ShNb8O3eG7785EFGnMHA25krWacYLW+mq4MvdhGh1m6vlztoIUPUETP/QjUrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:48.271489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72a8158752ac67948de2e33a4bd51a1037fbc49f716d75c46b75f634726da483","sha256:ec87f4ab495453c2cebf0498b6867e9a117d168001bbaf100d568687d64a357f"],"state_sha256":"3c6057a74ab125946c80a0c5d962aa1fa748503252b9a29ea7e2f14a06d33693"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLnlxfDVs7VICM43pd0tXxum36USuD4EYNM8G43nwj7ziTaGiMfVc5xi3sZtEMi0Yc9AIU9efEq5LzajZIqxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:34:16.388227Z","bundle_sha256":"fea313f008ac0c8f18c664c21b1092945fd0e07df1879dae5d5557472365a316"}}