{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AN2BGAFIFCI7JGSXS4PSXNV2HZ","short_pith_number":"pith:AN2BGAFI","canonical_record":{"source":{"id":"1610.04293","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-13T23:40:30Z","cross_cats_sorted":[],"title_canon_sha256":"87b38ee716b56b89cf7632122c6ded9f1b19da597ba339cc4fa9dc6300e34fac","abstract_canon_sha256":"3c8d92fc2735865c834ea7f7f27d4304f8a2cf8647bb4e804e96c025d811b968"},"schema_version":"1.0"},"canonical_sha256":"03741300a82891f49a57971f2bb6ba3e5d347a97e633a12fc6e887560c0c6927","source":{"kind":"arxiv","id":"1610.04293","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04293","created_at":"2026-05-17T23:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04293v3","created_at":"2026-05-17T23:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04293","created_at":"2026-05-17T23:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"AN2BGAFIFCI7","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AN2BGAFIFCI7JGSX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AN2BGAFI","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AN2BGAFIFCI7JGSXS4PSXNV2HZ","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04293","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-13T23:40:30Z","cross_cats_sorted":[],"title_canon_sha256":"87b38ee716b56b89cf7632122c6ded9f1b19da597ba339cc4fa9dc6300e34fac","abstract_canon_sha256":"3c8d92fc2735865c834ea7f7f27d4304f8a2cf8647bb4e804e96c025d811b968"},"schema_version":"1.0"},"canonical_sha256":"03741300a82891f49a57971f2bb6ba3e5d347a97e633a12fc6e887560c0c6927","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:43.758209Z","signature_b64":"NKKoNoo6bsf5kuDd4zgmwuWMhKMgkb4kX6E0T5fGKVbIfMYr8Xa1IKkyz/T8aMvwrB5IGYrcDCeIr//U8ncVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03741300a82891f49a57971f2bb6ba3e5d347a97e633a12fc6e887560c0c6927","last_reissued_at":"2026-05-17T23:42:43.757577Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:43.757577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04293","source_version":3,"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-17T23:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJGNSDgW8I6DPSLqG05xwuLCtFZSsTb3rJimSWxqaXcmsq79u2MmnMopYzbILo3oyPorPgb1y87vw6Ay3sxLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:36:16.662160Z"},"content_sha256":"f63da9fa7e373673fe468a4bbb3fa2e46b582f25c4dd17ec1c72dad8577acd82","schema_version":"1.0","event_id":"sha256:f63da9fa7e373673fe468a4bbb3fa2e46b582f25c4dd17ec1c72dad8577acd82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AN2BGAFIFCI7JGSXS4PSXNV2HZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The social network model on infinite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Allan Sly, Ben Morris, Chuan Qin, Jonathan Hermon","submitted_at":"2016-10-13T23:40:30Z","abstract_excerpt":"Given an infinite connected regular graph $G=(V,E)$, place at each vertex Pois($\\lambda$) walkers performing independent lazy simple random walks on $G$ simultaneously. When two walkers visit the same vertex at the same time they are declared to be acquainted. We show that when $G$ is vertex-transitive and amenable, for all $\\lambda>0$ a.s. any pair of walkers will eventually have a path of acquaintances between them. In contrast, we show that when $G$ is non-amenable (not necessarily transitive) there is always a phase transition at some $\\lambda_{c}(G)>0$. We give general bounds on $\\lambda_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04293","kind":"arxiv","version":3},"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-17T23:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"isKbLk0Q0UqjHJsofmlqG6B9w9HkX+x5dh9H6vr3g7V1fcFB6Qq9G53zvpzk3mcDxGnTxuAeAmbgFpbrII5dDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:36:16.662826Z"},"content_sha256":"e4c7c729efa37538533d33f49ed7a81a1bacb234ee0c13df4a6de27cab7ee00c","schema_version":"1.0","event_id":"sha256:e4c7c729efa37538533d33f49ed7a81a1bacb234ee0c13df4a6de27cab7ee00c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN2BGAFIFCI7JGSXS4PSXNV2HZ/bundle.json","state_url":"https://pith.science/pith/AN2BGAFIFCI7JGSXS4PSXNV2HZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN2BGAFIFCI7JGSXS4PSXNV2HZ/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-08T01:36:16Z","links":{"resolver":"https://pith.science/pith/AN2BGAFIFCI7JGSXS4PSXNV2HZ","bundle":"https://pith.science/pith/AN2BGAFIFCI7JGSXS4PSXNV2HZ/bundle.json","state":"https://pith.science/pith/AN2BGAFIFCI7JGSXS4PSXNV2HZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN2BGAFIFCI7JGSXS4PSXNV2HZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AN2BGAFIFCI7JGSXS4PSXNV2HZ","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":"3c8d92fc2735865c834ea7f7f27d4304f8a2cf8647bb4e804e96c025d811b968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-13T23:40:30Z","title_canon_sha256":"87b38ee716b56b89cf7632122c6ded9f1b19da597ba339cc4fa9dc6300e34fac"},"schema_version":"1.0","source":{"id":"1610.04293","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04293","created_at":"2026-05-17T23:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04293v3","created_at":"2026-05-17T23:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04293","created_at":"2026-05-17T23:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"AN2BGAFIFCI7","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AN2BGAFIFCI7JGSX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AN2BGAFI","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:e4c7c729efa37538533d33f49ed7a81a1bacb234ee0c13df4a6de27cab7ee00c","target":"graph","created_at":"2026-05-17T23:42:43Z","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":"Given an infinite connected regular graph $G=(V,E)$, place at each vertex Pois($\\lambda$) walkers performing independent lazy simple random walks on $G$ simultaneously. When two walkers visit the same vertex at the same time they are declared to be acquainted. We show that when $G$ is vertex-transitive and amenable, for all $\\lambda>0$ a.s. any pair of walkers will eventually have a path of acquaintances between them. In contrast, we show that when $G$ is non-amenable (not necessarily transitive) there is always a phase transition at some $\\lambda_{c}(G)>0$. We give general bounds on $\\lambda_","authors_text":"Allan Sly, Ben Morris, Chuan Qin, Jonathan Hermon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-13T23:40:30Z","title":"The social network model on infinite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04293","kind":"arxiv","version":3},"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:f63da9fa7e373673fe468a4bbb3fa2e46b582f25c4dd17ec1c72dad8577acd82","target":"record","created_at":"2026-05-17T23:42:43Z","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":"3c8d92fc2735865c834ea7f7f27d4304f8a2cf8647bb4e804e96c025d811b968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-13T23:40:30Z","title_canon_sha256":"87b38ee716b56b89cf7632122c6ded9f1b19da597ba339cc4fa9dc6300e34fac"},"schema_version":"1.0","source":{"id":"1610.04293","kind":"arxiv","version":3}},"canonical_sha256":"03741300a82891f49a57971f2bb6ba3e5d347a97e633a12fc6e887560c0c6927","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03741300a82891f49a57971f2bb6ba3e5d347a97e633a12fc6e887560c0c6927","first_computed_at":"2026-05-17T23:42:43.757577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:43.757577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NKKoNoo6bsf5kuDd4zgmwuWMhKMgkb4kX6E0T5fGKVbIfMYr8Xa1IKkyz/T8aMvwrB5IGYrcDCeIr//U8ncVCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:43.758209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04293","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f63da9fa7e373673fe468a4bbb3fa2e46b582f25c4dd17ec1c72dad8577acd82","sha256:e4c7c729efa37538533d33f49ed7a81a1bacb234ee0c13df4a6de27cab7ee00c"],"state_sha256":"76f67cf93b6f6f0cf71de002b3df7400b4f9f74b672952c47ccf78531e341329"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pDo9SbEpVnLpnnKnQcCKzKyEl5Y8IjumGRLfaPYSQ80t4II6I0KaFX+xcEGt5os9Hv9S43v+o2L6kfwKw3aBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:36:16.666646Z","bundle_sha256":"f740ab3d57edb56eec7618c6dd5ab37d1946062d8d8db7964e0b0bd557db8787"}}