{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PXX5XIQYEPRIFRKCS52AJR6J5K","short_pith_number":"pith:PXX5XIQY","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"},"canonical_sha256":"7defdba21823e282c542977404c7c9eaa4e32dc5d423cac6f3097db85a97b93f","source":{"kind":"arxiv","id":"1212.1182","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1182","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1182v3","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1182","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"PXX5XIQYEPRI","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PXX5XIQYEPRIFRKC","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PXX5XIQY","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PXX5XIQYEPRIFRKCS52AJR6J5K","target":"record","payload":{"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"},"canonical_sha256":"7defdba21823e282c542977404c7c9eaa4e32dc5d423cac6f3097db85a97b93f","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"},"source_kind":"arxiv","source_id":"1212.1182","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-18T03:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5G7EXajYzip+h6NwhWEd4zFs3vf5bRznu1/th50KYvBybaei1lkrRJabcfMCsSGSnItBZ1JVJY1iQPysGs3ZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:04:49.513487Z"},"content_sha256":"caa9b39bd07d0459ebee6eddae02ba5bd559421868b5002de9d0ec97a98a7cdc","schema_version":"1.0","event_id":"sha256:caa9b39bd07d0459ebee6eddae02ba5bd559421868b5002de9d0ec97a98a7cdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PXX5XIQYEPRIFRKCS52AJR6J5K","target":"graph","payload":{"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"},"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-18T03:16:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8J+06vSJXQuz+RyI9+9QwhIZH//0nYGYFpQWYsTOqrvlBBJv0ZwswM1m55pW9A1uAeIKSW+oqjDymO8TJnHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:04:49.514196Z"},"content_sha256":"85f36aed44802d421e289ef431bff99ba2910d871609013c758e10b493cccbae","schema_version":"1.0","event_id":"sha256:85f36aed44802d421e289ef431bff99ba2910d871609013c758e10b493cccbae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/bundle.json","state_url":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/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-06-11T20:04:49Z","links":{"resolver":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K","bundle":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/bundle.json","state":"https://pith.science/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXX5XIQYEPRIFRKCS52AJR6J5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PXX5XIQYEPRIFRKCS52AJR6J5K","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":"50cb4d11e02dad61ade398fdeb8ef6fe66f4883a1dbb3765abbd213f75eac4dd","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-05T21:24:11Z","title_canon_sha256":"e715fa598f07933e08d3a35b53d444810c22ba513e3bba6cbe5eec6ced850ca8"},"schema_version":"1.0","source":{"id":"1212.1182","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1182","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1182v3","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1182","created_at":"2026-05-18T03:16:06Z"},{"alias_kind":"pith_short_12","alias_value":"PXX5XIQYEPRI","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PXX5XIQYEPRIFRKC","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PXX5XIQY","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:85f36aed44802d421e289ef431bff99ba2910d871609013c758e10b493cccbae","target":"graph","created_at":"2026-05-18T03:16:06Z","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":"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 ","authors_text":"Carey E. Priebe, Daniel L. Sussman, Minh Tang","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-05T21:24:11Z","title":"Universally consistent vertex classification for latent positions graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1182","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:caa9b39bd07d0459ebee6eddae02ba5bd559421868b5002de9d0ec97a98a7cdc","target":"record","created_at":"2026-05-18T03:16:06Z","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":"50cb4d11e02dad61ade398fdeb8ef6fe66f4883a1dbb3765abbd213f75eac4dd","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-05T21:24:11Z","title_canon_sha256":"e715fa598f07933e08d3a35b53d444810c22ba513e3bba6cbe5eec6ced850ca8"},"schema_version":"1.0","source":{"id":"1212.1182","kind":"arxiv","version":3}},"canonical_sha256":"7defdba21823e282c542977404c7c9eaa4e32dc5d423cac6f3097db85a97b93f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7defdba21823e282c542977404c7c9eaa4e32dc5d423cac6f3097db85a97b93f","first_computed_at":"2026-05-18T03:16:06.305214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:06.305214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LIZp2qnNPjOvjxjeuDZV7yqtdwVEssQi6esjHPlmTnFj9qVm/IWeuvprHpN5+C3Zky7GLb1vHWKhhdgECRGIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:06.305974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1182","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:caa9b39bd07d0459ebee6eddae02ba5bd559421868b5002de9d0ec97a98a7cdc","sha256:85f36aed44802d421e289ef431bff99ba2910d871609013c758e10b493cccbae"],"state_sha256":"fdf69c8fc8659fa7d5a245048e39e6a7e94ef946d6747f670f6cf6193be393be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzuXAswTRqsleMtaMnAYYybeB0MNvfCVOu1PL64uLxSy6ZXw0X6JE9MEYwYDRaqH0pXyyb96/JcT+US7MAV4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:04:49.518005Z","bundle_sha256":"72aee1a009ec998663110daba28b6486d65c8b762dc6a420bd7b065d25c763ca"}}