{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NDWUEL2JZZD4CXBXQZCE3VGOR2","short_pith_number":"pith:NDWUEL2J","canonical_record":{"source":{"id":"1911.06861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T20:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"68220a6db289d2c066218207b95ee834bdfdac01388f9acd9758599e1fa56aa4","abstract_canon_sha256":"0a9264e56cfe1654903134125b750500151c1e8ff8810ca6951fbe73c3d01e30"},"schema_version":"1.0"},"canonical_sha256":"68ed422f49ce47c15c3786444dd4ce8e9b5b90483d578250b80394a50a2d723d","source":{"kind":"arxiv","id":"1911.06861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06861","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06861v1","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06861","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"NDWUEL2JZZD4","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_16","alias_value":"NDWUEL2JZZD4CXBX","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_8","alias_value":"NDWUEL2J","created_at":"2026-07-05T00:19:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NDWUEL2JZZD4CXBXQZCE3VGOR2","target":"record","payload":{"canonical_record":{"source":{"id":"1911.06861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T20:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"68220a6db289d2c066218207b95ee834bdfdac01388f9acd9758599e1fa56aa4","abstract_canon_sha256":"0a9264e56cfe1654903134125b750500151c1e8ff8810ca6951fbe73c3d01e30"},"schema_version":"1.0"},"canonical_sha256":"68ed422f49ce47c15c3786444dd4ce8e9b5b90483d578250b80394a50a2d723d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:40.043063Z","signature_b64":"dCHvpfH18cRTyDq+QN3eywanBsEzSb3y7NpqGX7znMO7Nhaf+UEXxBigx1kT8aQiQlkpIok0w/FZXlZRlPTACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68ed422f49ce47c15c3786444dd4ce8e9b5b90483d578250b80394a50a2d723d","last_reissued_at":"2026-07-05T00:19:40.042641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:40.042641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.06861","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-07-05T00:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWSJ5N17SVke2ZVQOAStg+Z6oMKN6XXZKgYTtzuvZ40Amz2/32l6z+1sQE1RmqyiOitsiUkw0v5DiepZB9LPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T18:42:01.231271Z"},"content_sha256":"9f3274bc4df2a358264385abd29ac4ce149db2b7987c36530d43fd5da19b3912","schema_version":"1.0","event_id":"sha256:9f3274bc4df2a358264385abd29ac4ce149db2b7987c36530d43fd5da19b3912"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NDWUEL2JZZD4CXBXQZCE3VGOR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-Scale Parallel Matching of Social Network Profiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Alexander Panchenko, Dmitry Babaev, Sergei Obiedkov","submitted_at":"2019-11-15T20:21:44Z","abstract_excerpt":"A profile matching algorithm takes as input a user profile of one social network and returns, if existing, the profile of the same person in another social network. Such methods have immediate applications in Internet marketing, search, security, and a number of other domains, which is why this topic saw a recent surge in popularity. In this paper, we present a user identity resolution approach that uses minimal supervision and achieves a precision of 0.98 at a recall of 0.54. Furthermore, the method is computationally efficient and easily parallelizable. We show that the method can be used to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06861","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.06861/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:19:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pb/CyasQk9tVK3S9jTRxnY6L8z7NVV9dXVbbbBMlEEowSlq88vFQz/ShiZiloaIf583hQ7HSHyeFFzs+8fBGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T18:42:01.232081Z"},"content_sha256":"9407489440e56420ab9f43dd915abebbcc74f031cbf832f5cfe17f8bc82164da","schema_version":"1.0","event_id":"sha256:9407489440e56420ab9f43dd915abebbcc74f031cbf832f5cfe17f8bc82164da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDWUEL2JZZD4CXBXQZCE3VGOR2/bundle.json","state_url":"https://pith.science/pith/NDWUEL2JZZD4CXBXQZCE3VGOR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDWUEL2JZZD4CXBXQZCE3VGOR2/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-08-14T18:42:01Z","links":{"resolver":"https://pith.science/pith/NDWUEL2JZZD4CXBXQZCE3VGOR2","bundle":"https://pith.science/pith/NDWUEL2JZZD4CXBXQZCE3VGOR2/bundle.json","state":"https://pith.science/pith/NDWUEL2JZZD4CXBXQZCE3VGOR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDWUEL2JZZD4CXBXQZCE3VGOR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NDWUEL2JZZD4CXBXQZCE3VGOR2","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":"0a9264e56cfe1654903134125b750500151c1e8ff8810ca6951fbe73c3d01e30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T20:21:44Z","title_canon_sha256":"68220a6db289d2c066218207b95ee834bdfdac01388f9acd9758599e1fa56aa4"},"schema_version":"1.0","source":{"id":"1911.06861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06861","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06861v1","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06861","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_12","alias_value":"NDWUEL2JZZD4","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_16","alias_value":"NDWUEL2JZZD4CXBX","created_at":"2026-07-05T00:19:40Z"},{"alias_kind":"pith_short_8","alias_value":"NDWUEL2J","created_at":"2026-07-05T00:19:40Z"}],"graph_snapshots":[{"event_id":"sha256:9407489440e56420ab9f43dd915abebbcc74f031cbf832f5cfe17f8bc82164da","target":"graph","created_at":"2026-07-05T00:19:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.06861/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A profile matching algorithm takes as input a user profile of one social network and returns, if existing, the profile of the same person in another social network. Such methods have immediate applications in Internet marketing, search, security, and a number of other domains, which is why this topic saw a recent surge in popularity. In this paper, we present a user identity resolution approach that uses minimal supervision and achieves a precision of 0.98 at a recall of 0.54. Furthermore, the method is computationally efficient and easily parallelizable. We show that the method can be used to","authors_text":"Alexander Panchenko, Dmitry Babaev, Sergei Obiedkov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T20:21:44Z","title":"Large-Scale Parallel Matching of Social Network Profiles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06861","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:9f3274bc4df2a358264385abd29ac4ce149db2b7987c36530d43fd5da19b3912","target":"record","created_at":"2026-07-05T00:19:40Z","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":"0a9264e56cfe1654903134125b750500151c1e8ff8810ca6951fbe73c3d01e30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-11-15T20:21:44Z","title_canon_sha256":"68220a6db289d2c066218207b95ee834bdfdac01388f9acd9758599e1fa56aa4"},"schema_version":"1.0","source":{"id":"1911.06861","kind":"arxiv","version":1}},"canonical_sha256":"68ed422f49ce47c15c3786444dd4ce8e9b5b90483d578250b80394a50a2d723d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68ed422f49ce47c15c3786444dd4ce8e9b5b90483d578250b80394a50a2d723d","first_computed_at":"2026-07-05T00:19:40.042641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:19:40.042641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dCHvpfH18cRTyDq+QN3eywanBsEzSb3y7NpqGX7znMO7Nhaf+UEXxBigx1kT8aQiQlkpIok0w/FZXlZRlPTACA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:19:40.043063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.06861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f3274bc4df2a358264385abd29ac4ce149db2b7987c36530d43fd5da19b3912","sha256:9407489440e56420ab9f43dd915abebbcc74f031cbf832f5cfe17f8bc82164da"],"state_sha256":"ba072f1beae22f270d5fc1721d5dcf2b3e33d406121af8c512229cca4949d6ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjVyfm06OXVjT58PTWjunEZMop8gYZAnFkCBMR6mwBSevZ4Yqd2wS57hxJhZnEq8zoRaYM9Lyj1pZbXYUn8UCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T18:42:01.248522Z","bundle_sha256":"29bb71623c90b4c23717ced609908b707229e593923e3f6acfdbfcc5d8107449"}}