{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DQOXDS7KW7IYLNNBK22MGAR75U","short_pith_number":"pith:DQOXDS7K","schema_version":"1.0","canonical_sha256":"1c1d71cbeab7d185b5a156b4c3023fed0919448d7f94dfd16ec2f6164ee995a8","source":{"kind":"arxiv","id":"1802.06307","version":1},"attestation_state":"computed","paper":{"title":"Out-of-sample extension of graph adjacency spectral embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, Farbod Roosta-Khorasani, Keith Levin, Michael W. Mahoney","submitted_at":"2018-02-17T23:21:20Z","abstract_excerpt":"Many popular dimensionality reduction procedures have out-of-sample extensions, which allow a practitioner to apply a learned embedding to observations not seen in the initial training sample. In this work, we consider the problem of obtaining an out-of-sample extension for the adjacency spectral embedding, a procedure for embedding the vertices of a graph into Euclidean space. We present two different approaches to this problem, one based on a least-squares objective and the other based on a maximum-likelihood formulation. We show that if the graph of interest is drawn according to a certain "},"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":"1802.06307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-17T23:21:20Z","cross_cats_sorted":[],"title_canon_sha256":"ba11086cec4c54c3a7f08a9f9511f5abd40c46e79db7d7a90843af2c2273717a","abstract_canon_sha256":"2ed70205036d5097dd9c3169a50eed8761e22eafed5b5daca278899a197fb4ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.732212Z","signature_b64":"v0E8RTUiHd7s09ClsL1zykXb1ASz1xH0HXsqvPAr9LxGp2C8ddtxaO4n0SnCFmcbYDa2jOhmz0CKNFuTx9+fAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c1d71cbeab7d185b5a156b4c3023fed0919448d7f94dfd16ec2f6164ee995a8","last_reissued_at":"2026-05-18T00:23:03.731724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.731724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Out-of-sample extension of graph adjacency spectral embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Carey E. Priebe, Farbod Roosta-Khorasani, Keith Levin, Michael W. Mahoney","submitted_at":"2018-02-17T23:21:20Z","abstract_excerpt":"Many popular dimensionality reduction procedures have out-of-sample extensions, which allow a practitioner to apply a learned embedding to observations not seen in the initial training sample. In this work, we consider the problem of obtaining an out-of-sample extension for the adjacency spectral embedding, a procedure for embedding the vertices of a graph into Euclidean space. We present two different approaches to this problem, one based on a least-squares objective and the other based on a maximum-likelihood formulation. We show that if the graph of interest is drawn according to a certain "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06307","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":"1802.06307","created_at":"2026-05-18T00:23:03.731797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06307v1","created_at":"2026-05-18T00:23:03.731797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06307","created_at":"2026-05-18T00:23:03.731797+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQOXDS7KW7IY","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQOXDS7KW7IYLNNB","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQOXDS7K","created_at":"2026-05-18T12:32:19.392346+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/DQOXDS7KW7IYLNNBK22MGAR75U","json":"https://pith.science/pith/DQOXDS7KW7IYLNNBK22MGAR75U.json","graph_json":"https://pith.science/api/pith-number/DQOXDS7KW7IYLNNBK22MGAR75U/graph.json","events_json":"https://pith.science/api/pith-number/DQOXDS7KW7IYLNNBK22MGAR75U/events.json","paper":"https://pith.science/paper/DQOXDS7K"},"agent_actions":{"view_html":"https://pith.science/pith/DQOXDS7KW7IYLNNBK22MGAR75U","download_json":"https://pith.science/pith/DQOXDS7KW7IYLNNBK22MGAR75U.json","view_paper":"https://pith.science/paper/DQOXDS7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06307&json=true","fetch_graph":"https://pith.science/api/pith-number/DQOXDS7KW7IYLNNBK22MGAR75U/graph.json","fetch_events":"https://pith.science/api/pith-number/DQOXDS7KW7IYLNNBK22MGAR75U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQOXDS7KW7IYLNNBK22MGAR75U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQOXDS7KW7IYLNNBK22MGAR75U/action/storage_attestation","attest_author":"https://pith.science/pith/DQOXDS7KW7IYLNNBK22MGAR75U/action/author_attestation","sign_citation":"https://pith.science/pith/DQOXDS7KW7IYLNNBK22MGAR75U/action/citation_signature","submit_replication":"https://pith.science/pith/DQOXDS7KW7IYLNNBK22MGAR75U/action/replication_record"}},"created_at":"2026-05-18T00:23:03.731797+00:00","updated_at":"2026-05-18T00:23:03.731797+00:00"}