{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HYU5RMMVPYVWPV6TLVV5YK4AIO","short_pith_number":"pith:HYU5RMMV","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"},"canonical_sha256":"3e29d8b1957e2b67d7d35d6bdc2b804383324706a1e902be8f523191d55a4f9a","source":{"kind":"arxiv","id":"1810.04586","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04586","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04586v1","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04586","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"HYU5RMMVPYVW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HYU5RMMVPYVWPV6T","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HYU5RMMV","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HYU5RMMVPYVWPV6TLVV5YK4AIO","target":"record","payload":{"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"},"canonical_sha256":"3e29d8b1957e2b67d7d35d6bdc2b804383324706a1e902be8f523191d55a4f9a","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"},"source_kind":"arxiv","source_id":"1810.04586","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-18T00:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIQhTib7FL5PuPV5qdy5TVH47s+h6MUvIEtKZ1l48iDTl6A4G5JA/VelMRJV2MT5r2oKIREnlUoF0elIbPbyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:21:16.398915Z"},"content_sha256":"18681f5c5fc53c3777d92cd8cdce521d1d25bad223db9170e93eae8e5b8ca96a","schema_version":"1.0","event_id":"sha256:18681f5c5fc53c3777d92cd8cdce521d1d25bad223db9170e93eae8e5b8ca96a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HYU5RMMVPYVWPV6TLVV5YK4AIO","target":"graph","payload":{"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"},"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-18T00:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RIVfYmR6E1DrrdcD7S5nFItidYRtT2t0G6YQMOelMjecK8hxVjbR8d/Te/AGRhfmU1+lXKebyphcwPA5B9ZDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:21:16.399308Z"},"content_sha256":"d9127db62a32e5c233aa0707e602962aa6f7d72f77a3aa30919bcb6002c59106","schema_version":"1.0","event_id":"sha256:d9127db62a32e5c233aa0707e602962aa6f7d72f77a3aa30919bcb6002c59106"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/bundle.json","state_url":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/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-25T22:21:16Z","links":{"resolver":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO","bundle":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/bundle.json","state":"https://pith.science/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYU5RMMVPYVWPV6TLVV5YK4AIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HYU5RMMVPYVWPV6TLVV5YK4AIO","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":"57f468c18fd973b589b7e6419230962f9585c951fb5c37275551b27595c543f9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T15:25:49Z","title_canon_sha256":"5f9f3fe23a0ba16c320d843b7d18b14b3ac9e09b4a6a860a69d9676fb59a0b39"},"schema_version":"1.0","source":{"id":"1810.04586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04586","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04586v1","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04586","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"HYU5RMMVPYVW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HYU5RMMVPYVWPV6T","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HYU5RMMV","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:d9127db62a32e5c233aa0707e602962aa6f7d72f77a3aa30919bcb6002c59106","target":"graph","created_at":"2026-05-18T00:03:39Z","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":"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","authors_text":"George Tucker, Ofir Nachum, Yifan Wu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T15:25:49Z","title":"The Laplacian in RL: Learning Representations with Efficient Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04586","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:18681f5c5fc53c3777d92cd8cdce521d1d25bad223db9170e93eae8e5b8ca96a","target":"record","created_at":"2026-05-18T00:03:39Z","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":"57f468c18fd973b589b7e6419230962f9585c951fb5c37275551b27595c543f9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T15:25:49Z","title_canon_sha256":"5f9f3fe23a0ba16c320d843b7d18b14b3ac9e09b4a6a860a69d9676fb59a0b39"},"schema_version":"1.0","source":{"id":"1810.04586","kind":"arxiv","version":1}},"canonical_sha256":"3e29d8b1957e2b67d7d35d6bdc2b804383324706a1e902be8f523191d55a4f9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e29d8b1957e2b67d7d35d6bdc2b804383324706a1e902be8f523191d55a4f9a","first_computed_at":"2026-05-18T00:03:39.668668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:39.668668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GYsxn7mnyzk1DKgdmIY9r3ZHzISroQ4u7DeivBzS5MVsaGEs4du1ZmVIIwIYv7vaJyeP8HyqGza80dpJKQWPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:39.669217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18681f5c5fc53c3777d92cd8cdce521d1d25bad223db9170e93eae8e5b8ca96a","sha256:d9127db62a32e5c233aa0707e602962aa6f7d72f77a3aa30919bcb6002c59106"],"state_sha256":"72eebd25b465154dbd15633406ee2858f4f03fad9b4515d7dac93c056695b4a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeT8qdIQH0xMbPDPcdUt+CqKwETMHX4BuVCetqAS+3r59WU50bBH/uuciYeGu/d3Dd7t1UBTxH0XAsl8J2zrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:21:16.402414Z","bundle_sha256":"1a087593101fdf74cd5b411062bc6c993e1456ec1c5ad47f93f3ff779f16ee9f"}}