{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N4DT2YWLAYFAXJZILWSU4343MC","short_pith_number":"pith:N4DT2YWL","canonical_record":{"source":{"id":"1703.01054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-03T06:41:02Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"6507df0ca9de4cc41aacaa6d577cce37d9d5507ab88f1d1e2f458b9ff19beced","abstract_canon_sha256":"82642b07b90f0b298558fd56312845a6bcc289e1a736bb14cb775442731f952a"},"schema_version":"1.0"},"canonical_sha256":"6f073d62cb060a0ba7285da54e6f9b60b2b8a4dde029f0e53d76f0acc70fdd12","source":{"kind":"arxiv","id":"1703.01054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01054","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01054v1","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01054","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"pith_short_12","alias_value":"N4DT2YWLAYFA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N4DT2YWLAYFAXJZI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N4DT2YWL","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N4DT2YWLAYFAXJZILWSU4343MC","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-03T06:41:02Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"6507df0ca9de4cc41aacaa6d577cce37d9d5507ab88f1d1e2f458b9ff19beced","abstract_canon_sha256":"82642b07b90f0b298558fd56312845a6bcc289e1a736bb14cb775442731f952a"},"schema_version":"1.0"},"canonical_sha256":"6f073d62cb060a0ba7285da54e6f9b60b2b8a4dde029f0e53d76f0acc70fdd12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:36.170943Z","signature_b64":"+JOXGlssRKScY6z49yLhmCei+noQFiLPN4HoZh7u1Fg+AMl6on6u0uXQRVh7258lhHJxbcAGH30+uWK5pkgHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f073d62cb060a0ba7285da54e6f9b60b2b8a4dde029f0e53d76f0acc70fdd12","last_reissued_at":"2026-05-18T00:49:36.170262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:36.170262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01054","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:49:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGmr4Lm3RuVSOPk83zZoHfhXeVDzuth0ty7drQecjv6xH938asoSodaWYkzs5vLqnczV6Tw7D9CCyQx7GQvEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:23:26.271040Z"},"content_sha256":"da8ecd2f2ededf57b5ff0b9c26adc2281d9e5008e65387e23a31aa1fed6debbd","schema_version":"1.0","event_id":"sha256:da8ecd2f2ededf57b5ff0b9c26adc2281d9e5008e65387e23a31aa1fed6debbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N4DT2YWLAYFAXJZILWSU4343MC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.SI","authors_text":"Aneesh Sharma, Ashish Goel, C. Seshadhri","submitted_at":"2017-03-03T06:41:02Z","abstract_excerpt":"Finding similar user pairs is a fundamental task in social networks, with numerous applications in ranking and personalization tasks such as link prediction and tie strength detection. A common manifestation of user similarity is based upon network structure: each user is represented by a vector that represents the user's network connections, where pairwise cosine similarity among these vectors defines user similarity. The predominant task for user similarity applications is to discover all similar pairs that have a pairwise cosine similarity value larger than a given threshold $\\tau$. In cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01054","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:49:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9mDmp1EaM3Aiu58ojqQwcCeXHEExgWxX/v3TFJXOCFxFMlSz9+7qCpT6X9gf1hULGpud6u1rP+4/+fmxrriBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:23:26.271818Z"},"content_sha256":"ba6dfcd8664c71306775690be6a40f42e16be32095bcf3d3caf5c6382cfc2b0d","schema_version":"1.0","event_id":"sha256:ba6dfcd8664c71306775690be6a40f42e16be32095bcf3d3caf5c6382cfc2b0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N4DT2YWLAYFAXJZILWSU4343MC/bundle.json","state_url":"https://pith.science/pith/N4DT2YWLAYFAXJZILWSU4343MC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N4DT2YWLAYFAXJZILWSU4343MC/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-12T03:23:26Z","links":{"resolver":"https://pith.science/pith/N4DT2YWLAYFAXJZILWSU4343MC","bundle":"https://pith.science/pith/N4DT2YWLAYFAXJZILWSU4343MC/bundle.json","state":"https://pith.science/pith/N4DT2YWLAYFAXJZILWSU4343MC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N4DT2YWLAYFAXJZILWSU4343MC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N4DT2YWLAYFAXJZILWSU4343MC","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":"82642b07b90f0b298558fd56312845a6bcc289e1a736bb14cb775442731f952a","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-03T06:41:02Z","title_canon_sha256":"6507df0ca9de4cc41aacaa6d577cce37d9d5507ab88f1d1e2f458b9ff19beced"},"schema_version":"1.0","source":{"id":"1703.01054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01054","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01054v1","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01054","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"pith_short_12","alias_value":"N4DT2YWLAYFA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N4DT2YWLAYFAXJZI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N4DT2YWL","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:ba6dfcd8664c71306775690be6a40f42e16be32095bcf3d3caf5c6382cfc2b0d","target":"graph","created_at":"2026-05-18T00:49:36Z","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":"Finding similar user pairs is a fundamental task in social networks, with numerous applications in ranking and personalization tasks such as link prediction and tie strength detection. A common manifestation of user similarity is based upon network structure: each user is represented by a vector that represents the user's network connections, where pairwise cosine similarity among these vectors defines user similarity. The predominant task for user similarity applications is to discover all similar pairs that have a pairwise cosine similarity value larger than a given threshold $\\tau$. In cont","authors_text":"Aneesh Sharma, Ashish Goel, C. Seshadhri","cross_cats":["cs.DC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-03T06:41:02Z","title":"When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01054","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:da8ecd2f2ededf57b5ff0b9c26adc2281d9e5008e65387e23a31aa1fed6debbd","target":"record","created_at":"2026-05-18T00:49:36Z","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":"82642b07b90f0b298558fd56312845a6bcc289e1a736bb14cb775442731f952a","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-03T06:41:02Z","title_canon_sha256":"6507df0ca9de4cc41aacaa6d577cce37d9d5507ab88f1d1e2f458b9ff19beced"},"schema_version":"1.0","source":{"id":"1703.01054","kind":"arxiv","version":1}},"canonical_sha256":"6f073d62cb060a0ba7285da54e6f9b60b2b8a4dde029f0e53d76f0acc70fdd12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f073d62cb060a0ba7285da54e6f9b60b2b8a4dde029f0e53d76f0acc70fdd12","first_computed_at":"2026-05-18T00:49:36.170262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:36.170262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+JOXGlssRKScY6z49yLhmCei+noQFiLPN4HoZh7u1Fg+AMl6on6u0uXQRVh7258lhHJxbcAGH30+uWK5pkgHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:36.170943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da8ecd2f2ededf57b5ff0b9c26adc2281d9e5008e65387e23a31aa1fed6debbd","sha256:ba6dfcd8664c71306775690be6a40f42e16be32095bcf3d3caf5c6382cfc2b0d"],"state_sha256":"22086609636d2a07470f42b63c5373b9a7969001f0b5c4e1feb71c32ab3cccb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqIAVVcx0E70SKdZpzK7o9ie8cUNjP9uANxQnZbQfKOzLPWFJeJ1dHamr1UVXa0IBKP3FXENPPNMpEDO2btJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:23:26.276078Z","bundle_sha256":"f75f36fe74f91022b2d65d584b49956c53018dc3c03bed02fbbf925e9ce32e0f"}}