{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AIPGDBBVT7KM4USH753UYHKHVB","short_pith_number":"pith:AIPGDBBV","schema_version":"1.0","canonical_sha256":"021e6184359fd4ce5247ff774c1d47a857a72166fc1e087b4653c27bd8492e2d","source":{"kind":"arxiv","id":"1508.04422","version":3},"attestation_state":"computed","paper":{"title":"Scalable Out-of-Sample Extension of Graph Embeddings Using Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","stat.ME"],"primary_cat":"stat.ML","authors_text":"Aren Jansen, Gregory Sell, Vince Lyzinski","submitted_at":"2015-08-18T19:47:31Z","abstract_excerpt":"Several popular graph embedding techniques for representation learning and dimensionality reduction rely on performing computationally expensive eigendecompositions to derive a nonlinear transformation of the input data space. The resulting eigenvectors encode the embedding coordinates for the training samples only, and so the embedding of novel data samples requires further costly computation. In this paper, we present a method for the out-of-sample extension of graph embeddings using deep neural networks (DNN) to parametrically approximate these nonlinear maps. Compared with traditional nonp"},"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":"1508.04422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-18T19:47:31Z","cross_cats_sorted":["cs.LG","cs.NE","stat.ME"],"title_canon_sha256":"5ae8eb767ab3ffd28c3cba35cb2e514712a1c0cce1a1e0c0684335a95abea855","abstract_canon_sha256":"b55a9fdd8182ac56041c7f52a07c66b1e76c285ffb2e19912c5a9d9c312a5a55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:30.688909Z","signature_b64":"BfuqOGhRIA4jA4L0mYb5RkDuDylWi8rS3XoGmIKmTQ0GU0nwHz0o/HXZQ+BMHPfPzYM0FCecUgeOFaGufqXMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"021e6184359fd4ce5247ff774c1d47a857a72166fc1e087b4653c27bd8492e2d","last_reissued_at":"2026-05-18T01:12:30.688531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:30.688531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Out-of-Sample Extension of Graph Embeddings Using Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","stat.ME"],"primary_cat":"stat.ML","authors_text":"Aren Jansen, Gregory Sell, Vince Lyzinski","submitted_at":"2015-08-18T19:47:31Z","abstract_excerpt":"Several popular graph embedding techniques for representation learning and dimensionality reduction rely on performing computationally expensive eigendecompositions to derive a nonlinear transformation of the input data space. The resulting eigenvectors encode the embedding coordinates for the training samples only, and so the embedding of novel data samples requires further costly computation. In this paper, we present a method for the out-of-sample extension of graph embeddings using deep neural networks (DNN) to parametrically approximate these nonlinear maps. Compared with traditional nonp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04422","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":"1508.04422","created_at":"2026-05-18T01:12:30.688582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04422v3","created_at":"2026-05-18T01:12:30.688582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04422","created_at":"2026-05-18T01:12:30.688582+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIPGDBBVT7KM","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIPGDBBVT7KM4USH","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIPGDBBV","created_at":"2026-05-18T12:29:10.953037+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/AIPGDBBVT7KM4USH753UYHKHVB","json":"https://pith.science/pith/AIPGDBBVT7KM4USH753UYHKHVB.json","graph_json":"https://pith.science/api/pith-number/AIPGDBBVT7KM4USH753UYHKHVB/graph.json","events_json":"https://pith.science/api/pith-number/AIPGDBBVT7KM4USH753UYHKHVB/events.json","paper":"https://pith.science/paper/AIPGDBBV"},"agent_actions":{"view_html":"https://pith.science/pith/AIPGDBBVT7KM4USH753UYHKHVB","download_json":"https://pith.science/pith/AIPGDBBVT7KM4USH753UYHKHVB.json","view_paper":"https://pith.science/paper/AIPGDBBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04422&json=true","fetch_graph":"https://pith.science/api/pith-number/AIPGDBBVT7KM4USH753UYHKHVB/graph.json","fetch_events":"https://pith.science/api/pith-number/AIPGDBBVT7KM4USH753UYHKHVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIPGDBBVT7KM4USH753UYHKHVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIPGDBBVT7KM4USH753UYHKHVB/action/storage_attestation","attest_author":"https://pith.science/pith/AIPGDBBVT7KM4USH753UYHKHVB/action/author_attestation","sign_citation":"https://pith.science/pith/AIPGDBBVT7KM4USH753UYHKHVB/action/citation_signature","submit_replication":"https://pith.science/pith/AIPGDBBVT7KM4USH753UYHKHVB/action/replication_record"}},"created_at":"2026-05-18T01:12:30.688582+00:00","updated_at":"2026-05-18T01:12:30.688582+00:00"}