{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UUC3N7COGUI45ZLK4EL5WTV2O6","short_pith_number":"pith:UUC3N7CO","canonical_record":{"source":{"id":"1806.04853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-13T05:42:31Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"edb5ed5197eaebd98e4f978351ff967122d442c8e39c3c9d0c5e2418a1093d2b","abstract_canon_sha256":"50675a6525988e520634f1cd1b92827bc92e917b40dadc7273c7e1a49afaf39e"},"schema_version":"1.0"},"canonical_sha256":"a505b6fc4e3511cee56ae117db4eba77bc0c908dcd9164c2cfb38c6a1d901ee8","source":{"kind":"arxiv","id":"1806.04853","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04853","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04853v1","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04853","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"UUC3N7COGUI4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UUC3N7COGUI45ZLK","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UUC3N7CO","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UUC3N7COGUI45ZLK4EL5WTV2O6","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-13T05:42:31Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"edb5ed5197eaebd98e4f978351ff967122d442c8e39c3c9d0c5e2418a1093d2b","abstract_canon_sha256":"50675a6525988e520634f1cd1b92827bc92e917b40dadc7273c7e1a49afaf39e"},"schema_version":"1.0"},"canonical_sha256":"a505b6fc4e3511cee56ae117db4eba77bc0c908dcd9164c2cfb38c6a1d901ee8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:20.704503Z","signature_b64":"M7AnX4r4iH3whEI322G+FvcdDbGmin0vIl48Mt5Mm4P4nxnBC2vVbzFkCC5ASdMocPPvFFJHz5xBUqFDY6cqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a505b6fc4e3511cee56ae117db4eba77bc0c908dcd9164c2cfb38c6a1d901ee8","last_reissued_at":"2026-05-18T00:13:20.703963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:20.703963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04853","source_version":1,"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:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6fN4uFOOFQdfEbGVvj/xOacNtimxEtSeOdEn3nIbh3+0Q682jZQcYjmG0VgxGihnG6gHzRP1HcsMobinoQYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:39:56.957397Z"},"content_sha256":"c5490f59f61a982cb7b45ec6636ef65ab6c9d6fcd3645aa4277d1e5af448e52a","schema_version":"1.0","event_id":"sha256:c5490f59f61a982cb7b45ec6636ef65ab6c9d6fcd3645aa4277d1e5af448e52a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UUC3N7COGUI45ZLK4EL5WTV2O6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SybilBlind: Detecting Fake Users in Online Social Networks without Manual Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.CR","authors_text":"Binghui Wang, Le Zhang, Neil Zhenqiang Gong","submitted_at":"2018-06-13T05:42:31Z","abstract_excerpt":"Detecting fake users (also called Sybils) in online social networks is a basic security research problem. State-of-the-art approaches rely on a large amount of manually labeled users as a training set. These approaches suffer from three key limitations: 1) it is time-consuming and costly to manually label a large training set, 2) they cannot detect new Sybils in a timely fashion, and 3) they are vulnerable to Sybil attacks that leverage information of the training set. In this work, we propose SybilBlind, a structure-based Sybil detection framework that does not rely on a manually labeled trai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04853","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":""},"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:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3EioVYdIfmbpbyWXMYaovaHgmDlCL8uq7tSOEjbTh1Vr31u4XCc40dc0QxVNimG/48rTcvSX7KsmDTr/N7TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:39:56.958111Z"},"content_sha256":"b5b44ed27b98e08da21ace5b29506a9bd97490a36fdf08b6640adf8abb9ea3e2","schema_version":"1.0","event_id":"sha256:b5b44ed27b98e08da21ace5b29506a9bd97490a36fdf08b6640adf8abb9ea3e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUC3N7COGUI45ZLK4EL5WTV2O6/bundle.json","state_url":"https://pith.science/pith/UUC3N7COGUI45ZLK4EL5WTV2O6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUC3N7COGUI45ZLK4EL5WTV2O6/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-27T17:39:56Z","links":{"resolver":"https://pith.science/pith/UUC3N7COGUI45ZLK4EL5WTV2O6","bundle":"https://pith.science/pith/UUC3N7COGUI45ZLK4EL5WTV2O6/bundle.json","state":"https://pith.science/pith/UUC3N7COGUI45ZLK4EL5WTV2O6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUC3N7COGUI45ZLK4EL5WTV2O6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UUC3N7COGUI45ZLK4EL5WTV2O6","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":"50675a6525988e520634f1cd1b92827bc92e917b40dadc7273c7e1a49afaf39e","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-13T05:42:31Z","title_canon_sha256":"edb5ed5197eaebd98e4f978351ff967122d442c8e39c3c9d0c5e2418a1093d2b"},"schema_version":"1.0","source":{"id":"1806.04853","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04853","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04853v1","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04853","created_at":"2026-05-18T00:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"UUC3N7COGUI4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UUC3N7COGUI45ZLK","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UUC3N7CO","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:b5b44ed27b98e08da21ace5b29506a9bd97490a36fdf08b6640adf8abb9ea3e2","target":"graph","created_at":"2026-05-18T00:13:20Z","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":"Detecting fake users (also called Sybils) in online social networks is a basic security research problem. State-of-the-art approaches rely on a large amount of manually labeled users as a training set. These approaches suffer from three key limitations: 1) it is time-consuming and costly to manually label a large training set, 2) they cannot detect new Sybils in a timely fashion, and 3) they are vulnerable to Sybil attacks that leverage information of the training set. In this work, we propose SybilBlind, a structure-based Sybil detection framework that does not rely on a manually labeled trai","authors_text":"Binghui Wang, Le Zhang, Neil Zhenqiang Gong","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-13T05:42:31Z","title":"SybilBlind: Detecting Fake Users in Online Social Networks without Manual Labels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04853","kind":"arxiv","version":1},"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:c5490f59f61a982cb7b45ec6636ef65ab6c9d6fcd3645aa4277d1e5af448e52a","target":"record","created_at":"2026-05-18T00:13:20Z","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":"50675a6525988e520634f1cd1b92827bc92e917b40dadc7273c7e1a49afaf39e","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-06-13T05:42:31Z","title_canon_sha256":"edb5ed5197eaebd98e4f978351ff967122d442c8e39c3c9d0c5e2418a1093d2b"},"schema_version":"1.0","source":{"id":"1806.04853","kind":"arxiv","version":1}},"canonical_sha256":"a505b6fc4e3511cee56ae117db4eba77bc0c908dcd9164c2cfb38c6a1d901ee8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a505b6fc4e3511cee56ae117db4eba77bc0c908dcd9164c2cfb38c6a1d901ee8","first_computed_at":"2026-05-18T00:13:20.703963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:20.703963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M7AnX4r4iH3whEI322G+FvcdDbGmin0vIl48Mt5Mm4P4nxnBC2vVbzFkCC5ASdMocPPvFFJHz5xBUqFDY6cqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:20.704503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04853","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5490f59f61a982cb7b45ec6636ef65ab6c9d6fcd3645aa4277d1e5af448e52a","sha256:b5b44ed27b98e08da21ace5b29506a9bd97490a36fdf08b6640adf8abb9ea3e2"],"state_sha256":"926706c9a59aee8bbcf3717692dacd1e8d382cf9bdeedb8154869d90f3eda5ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlkejEb13V0Tnt5sUQvA7tc1SYUYXlFjCY4F7FVAK1u5lR0t+9Xsh7Dwwy+PQ801M6rlQW50xx9eCAWRMQepAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:39:56.961763Z","bundle_sha256":"2b906894795b020a01170e8a89ccbeaaeb0d000c9e003f7c9990b1513cc6ce9d"}}