{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LFQYPEYLMRKHCVXTFYEMC27SSS","short_pith_number":"pith:LFQYPEYL","canonical_record":{"source":{"id":"1207.6745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-29T04:29:03Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"dfd9ffebc04d20e7aae04873771d1816435d018cdeff57457eac52c1d054e67b","abstract_canon_sha256":"a8b133c21b15f4cd6eb65dd6a9d2c38d8b84584cc6be25177c59e49e69c77172"},"schema_version":"1.0"},"canonical_sha256":"596187930b64547156f32e08c16bf294be939ffd13615b6635f595eb35b012de","source":{"kind":"arxiv","id":"1207.6745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6745","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6745v1","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6745","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"LFQYPEYLMRKH","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LFQYPEYLMRKHCVXT","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LFQYPEYL","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LFQYPEYLMRKHCVXTFYEMC27SSS","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-29T04:29:03Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"dfd9ffebc04d20e7aae04873771d1816435d018cdeff57457eac52c1d054e67b","abstract_canon_sha256":"a8b133c21b15f4cd6eb65dd6a9d2c38d8b84584cc6be25177c59e49e69c77172"},"schema_version":"1.0"},"canonical_sha256":"596187930b64547156f32e08c16bf294be939ffd13615b6635f595eb35b012de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:48.856048Z","signature_b64":"V+TmY0Yi8HgxrOnwZBZo/WT+kcpcd8UDFkNo5P+GZzL9r+iGOiQBxhRXGuVTG5yAvHh6ipx1H7oVOHGCi78hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"596187930b64547156f32e08c16bf294be939ffd13615b6635f595eb35b012de","last_reissued_at":"2026-05-18T03:49:48.855501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:48.855501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6745","source_version":1,"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:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"beRmaHvk4uO8K89PXkWiGttRTSUL8nUQU1azjpmfH9m0eeQlea4w+98SGJdmPg8mzoxSPmn5Fk9PStYtjHsDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:51:34.806356Z"},"content_sha256":"696716f3fc0ce34589e4d8d2ee0a88633c26457f6e6ce1431285af42aeabf0c7","schema_version":"1.0","event_id":"sha256:696716f3fc0ce34589e4d8d2ee0a88633c26457f6e6ce1431285af42aeabf0c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LFQYPEYLMRKHCVXTFYEMC27SSS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universally Consistent Latent Position Estimation and Vertex Classification for Random Dot Product 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-07-29T04:29:03Z","abstract_excerpt":"In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels are observed for a number of vertices tending to infinity, then we show that the remaining vertices can be classified with error converging to Bayes optimal using the $k$-nearest-neighbors classification rule. We evaluate the proposed methods on simulated data and a graph derived from Wikipedia."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6745","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"},"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:49:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b70z/431aGH5vc6c4SI8CPx3ucKigDYZend6mS7xF4vkIuz1R4CipvGwUE0SeF8zIRt9aoNmqam51TD1n/F+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:51:34.806874Z"},"content_sha256":"9a5a4cf88ea91ad04024312f06e8a224294fdee08c945f19e46fa1b226954e34","schema_version":"1.0","event_id":"sha256:9a5a4cf88ea91ad04024312f06e8a224294fdee08c945f19e46fa1b226954e34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFQYPEYLMRKHCVXTFYEMC27SSS/bundle.json","state_url":"https://pith.science/pith/LFQYPEYLMRKHCVXTFYEMC27SSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFQYPEYLMRKHCVXTFYEMC27SSS/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-21T23:51:34Z","links":{"resolver":"https://pith.science/pith/LFQYPEYLMRKHCVXTFYEMC27SSS","bundle":"https://pith.science/pith/LFQYPEYLMRKHCVXTFYEMC27SSS/bundle.json","state":"https://pith.science/pith/LFQYPEYLMRKHCVXTFYEMC27SSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFQYPEYLMRKHCVXTFYEMC27SSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LFQYPEYLMRKHCVXTFYEMC27SSS","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":"a8b133c21b15f4cd6eb65dd6a9d2c38d8b84584cc6be25177c59e49e69c77172","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-29T04:29:03Z","title_canon_sha256":"dfd9ffebc04d20e7aae04873771d1816435d018cdeff57457eac52c1d054e67b"},"schema_version":"1.0","source":{"id":"1207.6745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6745","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6745v1","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6745","created_at":"2026-05-18T03:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"LFQYPEYLMRKH","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LFQYPEYLMRKHCVXT","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LFQYPEYL","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:9a5a4cf88ea91ad04024312f06e8a224294fdee08c945f19e46fa1b226954e34","target":"graph","created_at":"2026-05-18T03:49:48Z","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 latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels are observed for a number of vertices tending to infinity, then we show that the remaining vertices can be classified with error converging to Bayes optimal using the $k$-nearest-neighbors classification rule. We evaluate the proposed methods on simulated data and a graph derived from Wikipedia.","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-07-29T04:29:03Z","title":"Universally Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6745","kind":"arxiv","version":1},"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:696716f3fc0ce34589e4d8d2ee0a88633c26457f6e6ce1431285af42aeabf0c7","target":"record","created_at":"2026-05-18T03:49:48Z","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":"a8b133c21b15f4cd6eb65dd6a9d2c38d8b84584cc6be25177c59e49e69c77172","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-07-29T04:29:03Z","title_canon_sha256":"dfd9ffebc04d20e7aae04873771d1816435d018cdeff57457eac52c1d054e67b"},"schema_version":"1.0","source":{"id":"1207.6745","kind":"arxiv","version":1}},"canonical_sha256":"596187930b64547156f32e08c16bf294be939ffd13615b6635f595eb35b012de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"596187930b64547156f32e08c16bf294be939ffd13615b6635f595eb35b012de","first_computed_at":"2026-05-18T03:49:48.855501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:48.855501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V+TmY0Yi8HgxrOnwZBZo/WT+kcpcd8UDFkNo5P+GZzL9r+iGOiQBxhRXGuVTG5yAvHh6ipx1H7oVOHGCi78hCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:48.856048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:696716f3fc0ce34589e4d8d2ee0a88633c26457f6e6ce1431285af42aeabf0c7","sha256:9a5a4cf88ea91ad04024312f06e8a224294fdee08c945f19e46fa1b226954e34"],"state_sha256":"67b3c16cbb027d2bd079651b565626d6f32e384099a5fba57628ea17794fea65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpS/gRJnb/aEs97CDwm+vu3BdPKE2u8hdCzpBCOmgK2QiIQlFuz+sK1yBzrsoEJU6OPddifIwEuSk13uHKByCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:51:34.809649Z","bundle_sha256":"8a7ce2d9af94dacb712e3345b50d1d7028fe5cd31de098fdbf1ba4a5c47d666d"}}