{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MZS3ZR3OWRW45FJRMN7ZTJX6KK","short_pith_number":"pith:MZS3ZR3O","canonical_record":{"source":{"id":"1607.01369","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-05T19:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"5742c3ce7460957da32a0172876f5c06f5bdb7b97c9f732852cc04fd5ed84988","abstract_canon_sha256":"4c01fd799780af778bd5e467c1bbf5c6ea45dfd12dc5d78acd3a7de0eb1459f9"},"schema_version":"1.0"},"canonical_sha256":"6665bcc76eb46dce9531637f99a6fe52a3db6a06b744670d2cf0b0e57a76bf44","source":{"kind":"arxiv","id":"1607.01369","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01369","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01369v3","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01369","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"MZS3ZR3OWRW4","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MZS3ZR3OWRW45FJR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MZS3ZR3O","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MZS3ZR3OWRW45FJRMN7ZTJX6KK","target":"record","payload":{"canonical_record":{"source":{"id":"1607.01369","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-05T19:08:48Z","cross_cats_sorted":[],"title_canon_sha256":"5742c3ce7460957da32a0172876f5c06f5bdb7b97c9f732852cc04fd5ed84988","abstract_canon_sha256":"4c01fd799780af778bd5e467c1bbf5c6ea45dfd12dc5d78acd3a7de0eb1459f9"},"schema_version":"1.0"},"canonical_sha256":"6665bcc76eb46dce9531637f99a6fe52a3db6a06b744670d2cf0b0e57a76bf44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:50.558085Z","signature_b64":"9duI6gs344tjIQni1jbn7RJ33A1XgEUXBBU+MHtkfCvTCjuKZMEM7d/9SQa9QZxdRqmkgi0G0xZhPSX7J/UOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6665bcc76eb46dce9531637f99a6fe52a3db6a06b744670d2cf0b0e57a76bf44","last_reissued_at":"2026-05-18T01:07:50.557634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:50.557634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.01369","source_version":3,"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-18T01:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d6yjlQ6ooRdpYnbJ68lvEiHa51T8mQne0i5lCmXg84KSUFqrnXvJrXdA/20DdXINIYX0G3Hc2zzB2mhpuIl4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:59:42.700623Z"},"content_sha256":"bed233454480930213e5b0d8755a9aed1ab0a9f2a1a9d8655ad96e62da764792","schema_version":"1.0","event_id":"sha256:bed233454480930213e5b0d8755a9aed1ab0a9f2a1a9d8655ad96e62da764792"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MZS3ZR3OWRW45FJRMN7ZTJX6KK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, Donniell E. Fishkind, Keith Levin, Vince Lyzinski","submitted_at":"2016-07-05T19:08:48Z","abstract_excerpt":"Given a graph in which a few vertices are deemed interesting a priori, the vertex nomination task is to order the remaining vertices into a nomination list such that there is a concentration of interesting vertices at the top of the list. Previous work has yielded several approaches to this problem, with theoretical results in the setting where the graph is drawn from a stochastic block model (SBM), including a vertex nomination analogue of the Bayes optimal classifier. In this paper, we prove that maximum likelihood (ML)-based vertex nomination is consistent, in the sense that the performance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01369","kind":"arxiv","version":3},"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-18T01:07:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6vl1OikvEggEag3B92Othz1c9rrsRGeE0Ui4YDESlaVYreK+ww2CX84Lj3oUI3YCH8zjTk1YwgAHMRZ/eNxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:59:42.701408Z"},"content_sha256":"4070e8734228f3c6af85fd0ed9e0c85eb443b5688d16fc74faed0aa52716f280","schema_version":"1.0","event_id":"sha256:4070e8734228f3c6af85fd0ed9e0c85eb443b5688d16fc74faed0aa52716f280"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZS3ZR3OWRW45FJRMN7ZTJX6KK/bundle.json","state_url":"https://pith.science/pith/MZS3ZR3OWRW45FJRMN7ZTJX6KK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZS3ZR3OWRW45FJRMN7ZTJX6KK/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-30T10:59:42Z","links":{"resolver":"https://pith.science/pith/MZS3ZR3OWRW45FJRMN7ZTJX6KK","bundle":"https://pith.science/pith/MZS3ZR3OWRW45FJRMN7ZTJX6KK/bundle.json","state":"https://pith.science/pith/MZS3ZR3OWRW45FJRMN7ZTJX6KK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZS3ZR3OWRW45FJRMN7ZTJX6KK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MZS3ZR3OWRW45FJRMN7ZTJX6KK","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":"4c01fd799780af778bd5e467c1bbf5c6ea45dfd12dc5d78acd3a7de0eb1459f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-05T19:08:48Z","title_canon_sha256":"5742c3ce7460957da32a0172876f5c06f5bdb7b97c9f732852cc04fd5ed84988"},"schema_version":"1.0","source":{"id":"1607.01369","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01369","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01369v3","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01369","created_at":"2026-05-18T01:07:50Z"},{"alias_kind":"pith_short_12","alias_value":"MZS3ZR3OWRW4","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MZS3ZR3OWRW45FJR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MZS3ZR3O","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:4070e8734228f3c6af85fd0ed9e0c85eb443b5688d16fc74faed0aa52716f280","target":"graph","created_at":"2026-05-18T01:07: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"},"paper":{"abstract_excerpt":"Given a graph in which a few vertices are deemed interesting a priori, the vertex nomination task is to order the remaining vertices into a nomination list such that there is a concentration of interesting vertices at the top of the list. Previous work has yielded several approaches to this problem, with theoretical results in the setting where the graph is drawn from a stochastic block model (SBM), including a vertex nomination analogue of the Bayes optimal classifier. In this paper, we prove that maximum likelihood (ML)-based vertex nomination is consistent, in the sense that the performance","authors_text":"Carey E. Priebe, Donniell E. Fishkind, Keith Levin, Vince Lyzinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-05T19:08:48Z","title":"On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01369","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:bed233454480930213e5b0d8755a9aed1ab0a9f2a1a9d8655ad96e62da764792","target":"record","created_at":"2026-05-18T01:07: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":"4c01fd799780af778bd5e467c1bbf5c6ea45dfd12dc5d78acd3a7de0eb1459f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-05T19:08:48Z","title_canon_sha256":"5742c3ce7460957da32a0172876f5c06f5bdb7b97c9f732852cc04fd5ed84988"},"schema_version":"1.0","source":{"id":"1607.01369","kind":"arxiv","version":3}},"canonical_sha256":"6665bcc76eb46dce9531637f99a6fe52a3db6a06b744670d2cf0b0e57a76bf44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6665bcc76eb46dce9531637f99a6fe52a3db6a06b744670d2cf0b0e57a76bf44","first_computed_at":"2026-05-18T01:07:50.557634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:50.557634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9duI6gs344tjIQni1jbn7RJ33A1XgEUXBBU+MHtkfCvTCjuKZMEM7d/9SQa9QZxdRqmkgi0G0xZhPSX7J/UOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:50.558085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01369","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bed233454480930213e5b0d8755a9aed1ab0a9f2a1a9d8655ad96e62da764792","sha256:4070e8734228f3c6af85fd0ed9e0c85eb443b5688d16fc74faed0aa52716f280"],"state_sha256":"1da6f3895308471118521b0efa8f8fa850e18fae507fd7a2385368aafb3a3edb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWE0Gd11CiSBClPxlL7TIEhfVCOIEGVilV40HBxLND+ukgpCP4bckk5I2T3c8+Ho2/J67LIjdkx2O84cyFgjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:59:42.703609Z","bundle_sha256":"720a99a53b36a50c1f5dbb5b2ff3bce8832b644b16183586c8fbc3327bd83bb3"}}