{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:F5A6FW5OC5IQ3AOKYINZCHVIH6","short_pith_number":"pith:F5A6FW5O","canonical_record":{"source":{"id":"0906.0060","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2009-05-30T05:26:36Z","cross_cats_sorted":["cs.NI","physics.data-an","physics.soc-ph","stat.ME"],"title_canon_sha256":"4d5b5fcfe7a3d002dbbd9387c0090633a682a3fce1cc13566019aebfb623b411","abstract_canon_sha256":"db4a1677e2bb7ecc8abb0241b4d553d69b93220654bc01617f060534273c86ce"},"schema_version":"1.0"},"canonical_sha256":"2f41e2dbae17510d81cac21b911ea83fb12f283f327a0155b685569aad591ef4","source":{"kind":"arxiv","id":"0906.0060","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0060","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0060v5","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0060","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"F5A6FW5OC5IQ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"F5A6FW5OC5IQ3AOK","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"F5A6FW5O","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:F5A6FW5OC5IQ3AOKYINZCHVIH6","target":"record","payload":{"canonical_record":{"source":{"id":"0906.0060","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2009-05-30T05:26:36Z","cross_cats_sorted":["cs.NI","physics.data-an","physics.soc-ph","stat.ME"],"title_canon_sha256":"4d5b5fcfe7a3d002dbbd9387c0090633a682a3fce1cc13566019aebfb623b411","abstract_canon_sha256":"db4a1677e2bb7ecc8abb0241b4d553d69b93220654bc01617f060534273c86ce"},"schema_version":"1.0"},"canonical_sha256":"2f41e2dbae17510d81cac21b911ea83fb12f283f327a0155b685569aad591ef4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:55.594558Z","signature_b64":"g1BVhR+jpvwTx5p66nrLYQoGjHquuQow0EjYlXmGJzOsXR0iI/ZtJ51HdEfm521EIv6jLcBv6haHWXjO3IblAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f41e2dbae17510d81cac21b911ea83fb12f283f327a0155b685569aad591ef4","last_reissued_at":"2026-05-18T02:24:55.593942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:55.593942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.0060","source_version":5,"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-18T02:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQVvyPq1F0U9oCN8Ve9hD3wz3T4ZOaOr+9yKZ3qEdVRwmv98Q1lrer93AFfdadsrpkHRsL6M4oTkiVBODo36Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:53:58.583792Z"},"content_sha256":"3ea02d6204c509aaae5429eebc0f60b286d7b7e7db5d5dc51653e72393336b80","schema_version":"1.0","event_id":"sha256:3ea02d6204c509aaae5429eebc0f60b286d7b7e7db5d5dc51653e72393336b80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:F5A6FW5OC5IQ3AOKYINZCHVIH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Walk in Facebook: Uniform Sampling of Users in Online Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","physics.data-an","physics.soc-ph","stat.ME"],"primary_cat":"cs.SI","authors_text":"Athina Markopoulou, Carter T. Butts, Maciej Kurant, Minas Gjoka","submitted_at":"2009-05-30T05:26:36Z","abstract_excerpt":"Our goal in this paper is to develop a practical framework for obtaining a uniform sample of users in an online social network (OSN) by crawling its social graph. Such a sample allows to estimate any user property and some topological properties as well. To this end, first, we consider and compare several candidate crawling techniques. Two approaches that can produce approximately uniform samples are the Metropolis-Hasting random walk (MHRW) and a re-weighted random walk (RWRW). Both have pros and cons, which we demonstrate through a comparison to each other as well as to the \"ground truth.\" I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0060","kind":"arxiv","version":5},"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-18T02:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LWVwPG3IpasSaJs+mnI+N99YEWX+yQbFXsxYwBnKf7qIulaHlK6PmzJoYJ+k72AMC9noVtEjiDXtOVk0sCrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:53:58.584470Z"},"content_sha256":"5907aeb403767f169da0c50ad5254552e157d6cdcd770c9435412f73a5a14569","schema_version":"1.0","event_id":"sha256:5907aeb403767f169da0c50ad5254552e157d6cdcd770c9435412f73a5a14569"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5A6FW5OC5IQ3AOKYINZCHVIH6/bundle.json","state_url":"https://pith.science/pith/F5A6FW5OC5IQ3AOKYINZCHVIH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5A6FW5OC5IQ3AOKYINZCHVIH6/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-27T19:53:58Z","links":{"resolver":"https://pith.science/pith/F5A6FW5OC5IQ3AOKYINZCHVIH6","bundle":"https://pith.science/pith/F5A6FW5OC5IQ3AOKYINZCHVIH6/bundle.json","state":"https://pith.science/pith/F5A6FW5OC5IQ3AOKYINZCHVIH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5A6FW5OC5IQ3AOKYINZCHVIH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:F5A6FW5OC5IQ3AOKYINZCHVIH6","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":"db4a1677e2bb7ecc8abb0241b4d553d69b93220654bc01617f060534273c86ce","cross_cats_sorted":["cs.NI","physics.data-an","physics.soc-ph","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2009-05-30T05:26:36Z","title_canon_sha256":"4d5b5fcfe7a3d002dbbd9387c0090633a682a3fce1cc13566019aebfb623b411"},"schema_version":"1.0","source":{"id":"0906.0060","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0060","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0060v5","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0060","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"F5A6FW5OC5IQ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"F5A6FW5OC5IQ3AOK","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"F5A6FW5O","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:5907aeb403767f169da0c50ad5254552e157d6cdcd770c9435412f73a5a14569","target":"graph","created_at":"2026-05-18T02:24:55Z","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":"Our goal in this paper is to develop a practical framework for obtaining a uniform sample of users in an online social network (OSN) by crawling its social graph. Such a sample allows to estimate any user property and some topological properties as well. To this end, first, we consider and compare several candidate crawling techniques. Two approaches that can produce approximately uniform samples are the Metropolis-Hasting random walk (MHRW) and a re-weighted random walk (RWRW). Both have pros and cons, which we demonstrate through a comparison to each other as well as to the \"ground truth.\" I","authors_text":"Athina Markopoulou, Carter T. Butts, Maciej Kurant, Minas Gjoka","cross_cats":["cs.NI","physics.data-an","physics.soc-ph","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2009-05-30T05:26:36Z","title":"A Walk in Facebook: Uniform Sampling of Users in Online Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0060","kind":"arxiv","version":5},"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:3ea02d6204c509aaae5429eebc0f60b286d7b7e7db5d5dc51653e72393336b80","target":"record","created_at":"2026-05-18T02:24:55Z","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":"db4a1677e2bb7ecc8abb0241b4d553d69b93220654bc01617f060534273c86ce","cross_cats_sorted":["cs.NI","physics.data-an","physics.soc-ph","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2009-05-30T05:26:36Z","title_canon_sha256":"4d5b5fcfe7a3d002dbbd9387c0090633a682a3fce1cc13566019aebfb623b411"},"schema_version":"1.0","source":{"id":"0906.0060","kind":"arxiv","version":5}},"canonical_sha256":"2f41e2dbae17510d81cac21b911ea83fb12f283f327a0155b685569aad591ef4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f41e2dbae17510d81cac21b911ea83fb12f283f327a0155b685569aad591ef4","first_computed_at":"2026-05-18T02:24:55.593942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:55.593942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1BVhR+jpvwTx5p66nrLYQoGjHquuQow0EjYlXmGJzOsXR0iI/ZtJ51HdEfm521EIv6jLcBv6haHWXjO3IblAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:55.594558Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.0060","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ea02d6204c509aaae5429eebc0f60b286d7b7e7db5d5dc51653e72393336b80","sha256:5907aeb403767f169da0c50ad5254552e157d6cdcd770c9435412f73a5a14569"],"state_sha256":"a0d999119b503c4a68e7b55fe94b01058c8e1fc786f1c3df98d7a880214a5fd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4b7m+2wjFHf+X85qS1uxvjwyYrq6KmB8AMfCi2tTMfhkOolszkzBnY2nz3colvKHdDE6oGqh+rT3wJHI/KyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:53:58.587722Z","bundle_sha256":"4452652f1822c58b74128c6932d5dfeccf168d20a8213b7d273133ebf156940e"}}