{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PXX5XIQYEPRIFRKCS52AJR6J5K","short_pith_number":"pith:PXX5XIQY","schema_version":"1.0","canonical_sha256":"7defdba21823e282c542977404c7c9eaa4e32dc5d423cac6f3097db85a97b93f","source":{"kind":"arxiv","id":"1212.1182","version":3},"attestation_state":"computed","paper":{"title":"Universally consistent vertex classification for latent positions graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, Daniel L. Sussman, Minh Tang","submitted_at":"2012-12-05T21:24:11Z","abstract_excerpt":"In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate feature maps for latent position graphs with positive definite link function $\\kappa$, provided that the latent positions are i.i.d. from some distribution F. We then consider the exploitation task of vertex classification where the link function $\\kappa$ belongs to the class of universal kernels and class labels are observed for a number of vertices tending to infinity and that the remaining vertices are to be classified. We show that minimization of the empirical $\\varphi$-risk for "},"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":"1212.1182","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-05T21:24:11Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"e715fa598f07933e08d3a35b53d444810c22ba513e3bba6cbe5eec6ced850ca8","abstract_canon_sha256":"50cb4d11e02dad61ade398fdeb8ef6fe66f4883a1dbb3765abbd213f75eac4dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:06.305974Z","signature_b64":"LIZp2qnNPjOvjxjeuDZV7yqtdwVEssQi6esjHPlmTnFj9qVm/IWeuvprHpN5+C3Zky7GLb1vHWKhhdgECRGIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7defdba21823e282c542977404c7c9eaa4e32dc5d423cac6f3097db85a97b93f","last_reissued_at":"2026-05-18T03:16:06.305214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:06.305214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universally consistent vertex classification for latent positions graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, Daniel L. Sussman, Minh Tang","submitted_at":"2012-12-05T21:24:11Z","abstract_excerpt":"In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate feature maps for latent position graphs with positive definite link function $\\kappa$, provided that the latent positions are i.i.d. from some distribution F. We then consider the exploitation task of vertex classification where the link function $\\kappa$ belongs to the class of universal kernels and class labels are observed for a number of vertices tending to infinity and that the remaining vertices are to be classified. We show that minimization of the empirical $\\varphi$-risk for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1182","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.1182","created_at":"2026-05-18T03:16:06.305331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1182v3","created_at":"2026-05-18T03:16:06.305331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1182","created_at":"2026-05-18T03:16:06.305331+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXX5XIQYEPRI","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXX5XIQYEPRIFRKC","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXX5XIQY","created_at":"2026-05-18T12:27:18.751474+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/PXX5XIQYEPRIFRKCS52AJR6J5K","json":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K.json","graph_json":"https://pith.science/api/pith-number/PXX5XIQYEPRIFRKCS52AJR6J5K/graph.json","events_json":"https://pith.science/api/pith-number/PXX5XIQYEPRIFRKCS52AJR6J5K/events.json","paper":"https://pith.science/paper/PXX5XIQY"},"agent_actions":{"view_html":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K","download_json":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K.json","view_paper":"https://pith.science/paper/PXX5XIQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1182&json=true","fetch_graph":"https://pith.science/api/pith-number/PXX5XIQYEPRIFRKCS52AJR6J5K/graph.json","fetch_events":"https://pith.science/api/pith-number/PXX5XIQYEPRIFRKCS52AJR6J5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/action/storage_attestation","attest_author":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/action/author_attestation","sign_citation":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/action/citation_signature","submit_replication":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/action/replication_record"}},"created_at":"2026-05-18T03:16:06.305331+00:00","updated_at":"2026-05-18T03:16:06.305331+00:00"}