{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7NAFBC2TNFS452ACRMZ4GYX2P2","short_pith_number":"pith:7NAFBC2T","canonical_record":{"source":{"id":"1701.08285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-28T12:32:03Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e7e07bc9290b65e6182e64a2bb4b5565b090cdc750c00c163eaf1f50908a2fa0","abstract_canon_sha256":"88b124ded20c3906f73b32c9740583fb6e7abbbbda2306ed9da16439e01aaa1b"},"schema_version":"1.0"},"canonical_sha256":"fb40508b536965cee8028b33c362fa7e8024f7a93b814fbbc5b001e31bf0a35f","source":{"kind":"arxiv","id":"1701.08285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08285","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08285v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08285","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"7NAFBC2TNFS4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7NAFBC2TNFS452AC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7NAFBC2T","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7NAFBC2TNFS452ACRMZ4GYX2P2","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-28T12:32:03Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"e7e07bc9290b65e6182e64a2bb4b5565b090cdc750c00c163eaf1f50908a2fa0","abstract_canon_sha256":"88b124ded20c3906f73b32c9740583fb6e7abbbbda2306ed9da16439e01aaa1b"},"schema_version":"1.0"},"canonical_sha256":"fb40508b536965cee8028b33c362fa7e8024f7a93b814fbbc5b001e31bf0a35f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:54.681744Z","signature_b64":"HGYgSmZEjvcs4xdurPKJ+yW6uEb3ISwtMy+IiNDfZpg0QX1YSnQ+0uIeptROI1+JzaLmbhghG7U9RSLl0AznBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb40508b536965cee8028b33c362fa7e8024f7a93b814fbbc5b001e31bf0a35f","last_reissued_at":"2026-05-18T00:51:54.681144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:54.681144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08285","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:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eM7U+bRtrTx/C2tkjYwwzbWuUuot0oSqvsASd9Zj/NdHG1zfj+i1rrCfxX6UHGiowWUuXYEG4A3pTWaTicdABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:32:03.375720Z"},"content_sha256":"96a68f5904c490f644cc3deb0db6016e2c373e26b3fc1059175c480849cd8769","schema_version":"1.0","event_id":"sha256:96a68f5904c490f644cc3deb0db6016e2c373e26b3fc1059175c480849cd8769"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7NAFBC2TNFS452ACRMZ4GYX2P2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Who With Whom And How?: Extracting Large Social Networks Using Search Engines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.SI","authors_text":"Hanno Ackermann, Philipp Kemkes, Sergej Zerr, Stefan Siersdorfer","submitted_at":"2017-01-28T12:32:03Z","abstract_excerpt":"Social network analysis is leveraged in a variety of applications such as identifying influential entities, detecting communities with special interests, and determining the flow of information and innovations. However, existing approaches for extracting social networks from unstructured Web content do not scale well and are only feasible for small graphs. In this paper, we introduce novel methodologies for query-based search engine mining, enabling efficient extraction of social networks from large amounts of Web data. To this end, we use patterns in phrase queries for retrieving entity conne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08285","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:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3e5c1ZPk6ERUHmvjYdskDi+iLRCTv0f//Tcw7kT5F27TnxIlaBQz4nSTJZMlHbqZM9d4IxuMc0klXDxTATvsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:32:03.376084Z"},"content_sha256":"a8891c771ec243c7b270928e93f01be9fc4d325bd2a6e4069c6b820eacefb442","schema_version":"1.0","event_id":"sha256:a8891c771ec243c7b270928e93f01be9fc4d325bd2a6e4069c6b820eacefb442"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NAFBC2TNFS452ACRMZ4GYX2P2/bundle.json","state_url":"https://pith.science/pith/7NAFBC2TNFS452ACRMZ4GYX2P2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NAFBC2TNFS452ACRMZ4GYX2P2/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:32:03Z","links":{"resolver":"https://pith.science/pith/7NAFBC2TNFS452ACRMZ4GYX2P2","bundle":"https://pith.science/pith/7NAFBC2TNFS452ACRMZ4GYX2P2/bundle.json","state":"https://pith.science/pith/7NAFBC2TNFS452ACRMZ4GYX2P2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NAFBC2TNFS452ACRMZ4GYX2P2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7NAFBC2TNFS452ACRMZ4GYX2P2","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":"88b124ded20c3906f73b32c9740583fb6e7abbbbda2306ed9da16439e01aaa1b","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-28T12:32:03Z","title_canon_sha256":"e7e07bc9290b65e6182e64a2bb4b5565b090cdc750c00c163eaf1f50908a2fa0"},"schema_version":"1.0","source":{"id":"1701.08285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08285","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08285v1","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08285","created_at":"2026-05-18T00:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"7NAFBC2TNFS4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7NAFBC2TNFS452AC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7NAFBC2T","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:a8891c771ec243c7b270928e93f01be9fc4d325bd2a6e4069c6b820eacefb442","target":"graph","created_at":"2026-05-18T00:51:54Z","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":"Social network analysis is leveraged in a variety of applications such as identifying influential entities, detecting communities with special interests, and determining the flow of information and innovations. However, existing approaches for extracting social networks from unstructured Web content do not scale well and are only feasible for small graphs. In this paper, we introduce novel methodologies for query-based search engine mining, enabling efficient extraction of social networks from large amounts of Web data. To this end, we use patterns in phrase queries for retrieving entity conne","authors_text":"Hanno Ackermann, Philipp Kemkes, Sergej Zerr, Stefan Siersdorfer","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-28T12:32:03Z","title":"Who With Whom And How?: Extracting Large Social Networks Using Search Engines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08285","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:96a68f5904c490f644cc3deb0db6016e2c373e26b3fc1059175c480849cd8769","target":"record","created_at":"2026-05-18T00:51:54Z","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":"88b124ded20c3906f73b32c9740583fb6e7abbbbda2306ed9da16439e01aaa1b","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-01-28T12:32:03Z","title_canon_sha256":"e7e07bc9290b65e6182e64a2bb4b5565b090cdc750c00c163eaf1f50908a2fa0"},"schema_version":"1.0","source":{"id":"1701.08285","kind":"arxiv","version":1}},"canonical_sha256":"fb40508b536965cee8028b33c362fa7e8024f7a93b814fbbc5b001e31bf0a35f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb40508b536965cee8028b33c362fa7e8024f7a93b814fbbc5b001e31bf0a35f","first_computed_at":"2026-05-18T00:51:54.681144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:54.681144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HGYgSmZEjvcs4xdurPKJ+yW6uEb3ISwtMy+IiNDfZpg0QX1YSnQ+0uIeptROI1+JzaLmbhghG7U9RSLl0AznBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:54.681744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96a68f5904c490f644cc3deb0db6016e2c373e26b3fc1059175c480849cd8769","sha256:a8891c771ec243c7b270928e93f01be9fc4d325bd2a6e4069c6b820eacefb442"],"state_sha256":"46ea0e2776cd04dc05f6a44a66c144571eae64c736b5079541a232b9085e6bcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wxKRrDSJzgP5r/lxMi4n5Sm4HmNjR6e1xri9gRLbMUuaoCBsyu/5AfyoF0fXRaL53u9Yjvz1dIoEP2PYbAXaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:32:03.378357Z","bundle_sha256":"bfae46433bd474a59631cc60113f48a4d21148eb809b0d6a4efcfa7e7d89a0ef"}}