{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6TNIIFIJTRA4K3D6XOUHA227G6","short_pith_number":"pith:6TNIIFIJ","schema_version":"1.0","canonical_sha256":"f4da8415099c41c56c7ebba8706b5f37a43c3b88a261d5249ce062f47f3899f0","source":{"kind":"arxiv","id":"1205.5082","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Vertex Nomination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.CO"],"primary_cat":"stat.ME","authors_text":"Carey E. Priebe, Dominic S. Lee","submitted_at":"2012-05-23T01:19:37Z","abstract_excerpt":"Consider an attributed graph whose vertices are colored green or red, but only a few are observed to be red. The color of the other vertices is unobserved. Typically, the unknown total number of red vertices is small. The vertex nomination problem is to nominate one of the unobserved vertices as being red. The edge set of the graph is a subset of the set of unordered pairs of vertices. Suppose that each edge is also colored green or red and this is observed for all edges. The context statistic of a vertex is defined as the number of observed red vertices connected to it, and its content statis"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1205.5082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-05-23T01:19:37Z","cross_cats_sorted":["stat.AP","stat.CO"],"title_canon_sha256":"9b90ec9dbeca31b1b901d92ae850ca35218b82672d5386b1232ad101aae52c47","abstract_canon_sha256":"5dc2049403a61e82c2a4b44ae0db64f0f108a242a2a7950569f6f50f35878313"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:02.272603Z","signature_b64":"tMsWaC+8BdtuH6Ss67CkyWQ1roUxhFbXHF5axUc7fE46eYLVHMn6nIzKTlNQbnAZUyIU95PZI5kym7f6IwDwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4da8415099c41c56c7ebba8706b5f37a43c3b88a261d5249ce062f47f3899f0","last_reissued_at":"2026-05-18T03:55:02.271735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:02.271735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Vertex Nomination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.CO"],"primary_cat":"stat.ME","authors_text":"Carey E. Priebe, Dominic S. Lee","submitted_at":"2012-05-23T01:19:37Z","abstract_excerpt":"Consider an attributed graph whose vertices are colored green or red, but only a few are observed to be red. The color of the other vertices is unobserved. Typically, the unknown total number of red vertices is small. The vertex nomination problem is to nominate one of the unobserved vertices as being red. The edge set of the graph is a subset of the set of unordered pairs of vertices. Suppose that each edge is also colored green or red and this is observed for all edges. The context statistic of a vertex is defined as the number of observed red vertices connected to it, and its content statis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5082","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.5082","created_at":"2026-05-18T03:55:02.271850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.5082v1","created_at":"2026-05-18T03:55:02.271850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5082","created_at":"2026-05-18T03:55:02.271850+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TNIIFIJTRA4","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TNIIFIJTRA4K3D6","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TNIIFIJ","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TNIIFIJTRA4K3D6XOUHA227G6","json":"https://pith.science/pith/6TNIIFIJTRA4K3D6XOUHA227G6.json","graph_json":"https://pith.science/api/pith-number/6TNIIFIJTRA4K3D6XOUHA227G6/graph.json","events_json":"https://pith.science/api/pith-number/6TNIIFIJTRA4K3D6XOUHA227G6/events.json","paper":"https://pith.science/paper/6TNIIFIJ"},"agent_actions":{"view_html":"https://pith.science/pith/6TNIIFIJTRA4K3D6XOUHA227G6","download_json":"https://pith.science/pith/6TNIIFIJTRA4K3D6XOUHA227G6.json","view_paper":"https://pith.science/paper/6TNIIFIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.5082&json=true","fetch_graph":"https://pith.science/api/pith-number/6TNIIFIJTRA4K3D6XOUHA227G6/graph.json","fetch_events":"https://pith.science/api/pith-number/6TNIIFIJTRA4K3D6XOUHA227G6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TNIIFIJTRA4K3D6XOUHA227G6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TNIIFIJTRA4K3D6XOUHA227G6/action/storage_attestation","attest_author":"https://pith.science/pith/6TNIIFIJTRA4K3D6XOUHA227G6/action/author_attestation","sign_citation":"https://pith.science/pith/6TNIIFIJTRA4K3D6XOUHA227G6/action/citation_signature","submit_replication":"https://pith.science/pith/6TNIIFIJTRA4K3D6XOUHA227G6/action/replication_record"}},"created_at":"2026-05-18T03:55:02.271850+00:00","updated_at":"2026-05-18T03:55:02.271850+00:00"}