{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HYU5RMMVPYVWPV6TLVV5YK4AIO","short_pith_number":"pith:HYU5RMMV","schema_version":"1.0","canonical_sha256":"3e29d8b1957e2b67d7d35d6bdc2b804383324706a1e902be8f523191d55a4f9a","source":{"kind":"arxiv","id":"1810.04586","version":1},"attestation_state":"computed","paper":{"title":"The Laplacian in RL: Learning Representations with Efficient Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George Tucker, Ofir Nachum, Yifan Wu","submitted_at":"2018-10-10T15:25:49Z","abstract_excerpt":"The smallest eigenvectors of the graph Laplacian are well-known to provide a succinct representation of the geometry of a weighted graph. In reinforcement learning (RL), where the weighted graph may be interpreted as the state transition process induced by a behavior policy acting on the environment, approximating the eigenvectors of the Laplacian provides a promising approach to state representation learning. However, existing methods for performing this approximation are ill-suited in general RL settings for two main reasons: First, they are computationally expensive, often requiring operati"},"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":"1810.04586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T15:25:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f9f3fe23a0ba16c320d843b7d18b14b3ac9e09b4a6a860a69d9676fb59a0b39","abstract_canon_sha256":"57f468c18fd973b589b7e6419230962f9585c951fb5c37275551b27595c543f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:39.669217Z","signature_b64":"GYsxn7mnyzk1DKgdmIY9r3ZHzISroQ4u7DeivBzS5MVsaGEs4du1ZmVIIwIYv7vaJyeP8HyqGza80dpJKQWPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e29d8b1957e2b67d7d35d6bdc2b804383324706a1e902be8f523191d55a4f9a","last_reissued_at":"2026-05-18T00:03:39.668668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:39.668668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Laplacian in RL: Learning Representations with Efficient Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George Tucker, Ofir Nachum, Yifan Wu","submitted_at":"2018-10-10T15:25:49Z","abstract_excerpt":"The smallest eigenvectors of the graph Laplacian are well-known to provide a succinct representation of the geometry of a weighted graph. In reinforcement learning (RL), where the weighted graph may be interpreted as the state transition process induced by a behavior policy acting on the environment, approximating the eigenvectors of the Laplacian provides a promising approach to state representation learning. However, existing methods for performing this approximation are ill-suited in general RL settings for two main reasons: First, they are computationally expensive, often requiring operati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04586","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":"1810.04586","created_at":"2026-05-18T00:03:39.668751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04586v1","created_at":"2026-05-18T00:03:39.668751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04586","created_at":"2026-05-18T00:03:39.668751+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYU5RMMVPYVW","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYU5RMMVPYVWPV6T","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYU5RMMV","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01862","citing_title":"QHyer: Q-conditioned Hybrid Attention-mamba Transformer for Offline Goal-conditioned RL","ref_index":214,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO","json":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO.json","graph_json":"https://pith.science/api/pith-number/HYU5RMMVPYVWPV6TLVV5YK4AIO/graph.json","events_json":"https://pith.science/api/pith-number/HYU5RMMVPYVWPV6TLVV5YK4AIO/events.json","paper":"https://pith.science/paper/HYU5RMMV"},"agent_actions":{"view_html":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO","download_json":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO.json","view_paper":"https://pith.science/paper/HYU5RMMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04586&json=true","fetch_graph":"https://pith.science/api/pith-number/HYU5RMMVPYVWPV6TLVV5YK4AIO/graph.json","fetch_events":"https://pith.science/api/pith-number/HYU5RMMVPYVWPV6TLVV5YK4AIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/action/storage_attestation","attest_author":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/action/author_attestation","sign_citation":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/action/citation_signature","submit_replication":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/action/replication_record"}},"created_at":"2026-05-18T00:03:39.668751+00:00","updated_at":"2026-05-18T00:03:39.668751+00:00"}