{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5NUXQQQCR3VS6CVA2TANY7NNGK","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":"6f22ce1b7c4627cdcb5ec4291c9526da09f43edd655bdd91d861fb3b22b71239","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-04-29T15:13:24Z","title_canon_sha256":"b5bc7dc593f185ff29f0e89e10a57f9e63edb656713a63b239b6e3b8cbceacc9"},"schema_version":"1.0","source":{"id":"2005.02151","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.02151","created_at":"2026-07-05T06:06:50Z"},{"alias_kind":"arxiv_version","alias_value":"2005.02151v3","created_at":"2026-07-05T06:06:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.02151","created_at":"2026-07-05T06:06:50Z"},{"alias_kind":"pith_short_12","alias_value":"5NUXQQQCR3VS","created_at":"2026-07-05T06:06:50Z"},{"alias_kind":"pith_short_16","alias_value":"5NUXQQQCR3VS6CVA","created_at":"2026-07-05T06:06:50Z"},{"alias_kind":"pith_short_8","alias_value":"5NUXQQQC","created_at":"2026-07-05T06:06:50Z"}],"graph_snapshots":[{"event_id":"sha256:8beaf1954f7ff9dcb254ff62a34e9ca262d2ce46e1c798378175c6a9a58e99cb","target":"graph","created_at":"2026-07-05T06:06:50Z","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/2005.02151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vertex nomination is a lightly-supervised network information retrieval task in which vertices of interest in one graph are used to query a second graph to discover vertices of interest in the second graph. Similar to other information retrieval tasks, the output of a vertex nomination scheme is a ranked list of the vertices in the second graph, with the heretofore unknown vertices of interest ideally concentrating at the top of the list. Vertex nomination schemes provide a useful suite of tools for efficiently mining complex networks for pertinent information. In this paper, we explore, both ","authors_text":"Carey E. Priebe, Keith Levin, Vince Lyzinski","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-04-29T15:13:24Z","title":"Vertex Nomination in Richly Attributed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.02151","kind":"arxiv","version":3},"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:16e69e55fd676690ecadf1a5c7d15ddf5ba8e700737223fcb87b1403e5b79a3d","target":"record","created_at":"2026-07-05T06:06:50Z","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":"6f22ce1b7c4627cdcb5ec4291c9526da09f43edd655bdd91d861fb3b22b71239","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-04-29T15:13:24Z","title_canon_sha256":"b5bc7dc593f185ff29f0e89e10a57f9e63edb656713a63b239b6e3b8cbceacc9"},"schema_version":"1.0","source":{"id":"2005.02151","kind":"arxiv","version":3}},"canonical_sha256":"eb697842028eeb2f0aa0d4c0dc7dad32b1d4a88318b994b103e1b35c4eb4bed3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb697842028eeb2f0aa0d4c0dc7dad32b1d4a88318b994b103e1b35c4eb4bed3","first_computed_at":"2026-07-05T06:06:50.950594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:06:50.950594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lsNNhai5Djyln8LbImIHaScSENu7Tk6LFCp6lTDoY7JXnPcZZxO1yziIxQY0CrO0ZNMMQ8YUhL6W+eCxU1TGDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:06:50.950994Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.02151","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16e69e55fd676690ecadf1a5c7d15ddf5ba8e700737223fcb87b1403e5b79a3d","sha256:8beaf1954f7ff9dcb254ff62a34e9ca262d2ce46e1c798378175c6a9a58e99cb"],"state_sha256":"04ee25bccb7121b3444d5f9c2b5769002351285155b1d037344e4c894aa1e5e7"}