{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JFEWX66LDTGUT3P2DY265PEXNL","short_pith_number":"pith:JFEWX66L","schema_version":"1.0","canonical_sha256":"49496bfbcb1ccd49edfa1e35eebc976aed94a2d774541408259c7d3b3aa1e5e3","source":{"kind":"arxiv","id":"1806.02215","version":3},"attestation_state":"computed","paper":{"title":"Spectral Inference Networks: Unifying Deep and Spectral Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashish Agarwal, David G. T. Barrett, David Pfau, Kimberly L. Stachenfeld, Stig Petersen","submitted_at":"2018-06-06T14:28:03Z","abstract_excerpt":"We present Spectral Inference Networks, a framework for learning eigenfunctions of linear operators by stochastic optimization. Spectral Inference Networks generalize Slow Feature Analysis to generic symmetric operators, and are closely related to Variational Monte Carlo methods from computational physics. As such, they can be a powerful tool for unsupervised representation learning from video or graph-structured data. We cast training Spectral Inference Networks as a bilevel optimization problem, which allows for online learning of multiple eigenfunctions. We show results of training Spectral"},"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":"1806.02215","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-06T14:28:03Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"1c31033b489c57e48316765939287b33bd54e9873bb66cb21e097ab7bae409ec","abstract_canon_sha256":"f2e3e5e42e24c4f32c9fb40b6d238bee035cd0134665b168dbeb2be4d143a115"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:33:52.033859Z","signature_b64":"qzz3eHb6miKYcV4M+9kiEtgn7lo5GkcJ0KXyjEHLVcN0K5aFc01sAArjBX+O6yqK2BcCmNXPo/eAEpgdhDmJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49496bfbcb1ccd49edfa1e35eebc976aed94a2d774541408259c7d3b3aa1e5e3","last_reissued_at":"2026-07-05T00:33:52.033323Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:33:52.033323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Inference Networks: Unifying Deep and Spectral Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashish Agarwal, David G. T. Barrett, David Pfau, Kimberly L. Stachenfeld, Stig Petersen","submitted_at":"2018-06-06T14:28:03Z","abstract_excerpt":"We present Spectral Inference Networks, a framework for learning eigenfunctions of linear operators by stochastic optimization. Spectral Inference Networks generalize Slow Feature Analysis to generic symmetric operators, and are closely related to Variational Monte Carlo methods from computational physics. As such, they can be a powerful tool for unsupervised representation learning from video or graph-structured data. We cast training Spectral Inference Networks as a bilevel optimization problem, which allows for online learning of multiple eigenfunctions. We show results of training Spectral"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02215","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1806.02215/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1806.02215","created_at":"2026-07-05T00:33:52.033388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02215v3","created_at":"2026-07-05T00:33:52.033388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02215","created_at":"2026-07-05T00:33:52.033388+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFEWX66LDTGU","created_at":"2026-07-05T00:33:52.033388+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFEWX66LDTGUT3P2","created_at":"2026-07-05T00:33:52.033388+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFEWX66L","created_at":"2026-07-05T00:33:52.033388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07513","citing_title":"Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularization","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11841","citing_title":"Minimax Rates and Spectral Distillation for Tree Ensembles","ref_index":59,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JFEWX66LDTGUT3P2DY265PEXNL","json":"https://pith.science/pith/JFEWX66LDTGUT3P2DY265PEXNL.json","graph_json":"https://pith.science/api/pith-number/JFEWX66LDTGUT3P2DY265PEXNL/graph.json","events_json":"https://pith.science/api/pith-number/JFEWX66LDTGUT3P2DY265PEXNL/events.json","paper":"https://pith.science/paper/JFEWX66L"},"agent_actions":{"view_html":"https://pith.science/pith/JFEWX66LDTGUT3P2DY265PEXNL","download_json":"https://pith.science/pith/JFEWX66LDTGUT3P2DY265PEXNL.json","view_paper":"https://pith.science/paper/JFEWX66L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02215&json=true","fetch_graph":"https://pith.science/api/pith-number/JFEWX66LDTGUT3P2DY265PEXNL/graph.json","fetch_events":"https://pith.science/api/pith-number/JFEWX66LDTGUT3P2DY265PEXNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFEWX66LDTGUT3P2DY265PEXNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFEWX66LDTGUT3P2DY265PEXNL/action/storage_attestation","attest_author":"https://pith.science/pith/JFEWX66LDTGUT3P2DY265PEXNL/action/author_attestation","sign_citation":"https://pith.science/pith/JFEWX66LDTGUT3P2DY265PEXNL/action/citation_signature","submit_replication":"https://pith.science/pith/JFEWX66LDTGUT3P2DY265PEXNL/action/replication_record"}},"created_at":"2026-07-05T00:33:52.033388+00:00","updated_at":"2026-07-05T00:33:52.033388+00:00"}