{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G7GHRSHVWB5LZI4NQUJZB3BXJ2","short_pith_number":"pith:G7GHRSHV","canonical_record":{"source":{"id":"1509.00061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-31T20:46:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2155237337ecd27604e4ada83dab0fb7dbbfd62c7eb328a61f423f93d11ab30e","abstract_canon_sha256":"b4b0ac5ac28714b270bf2a4c965820a57cb9461f4522ba7df16502eea5fc59a1"},"schema_version":"1.0"},"canonical_sha256":"37cc78c8f5b07abca38d851390ec374e9c185bc610feb36f9f234b2ed3aabb22","source":{"kind":"arxiv","id":"1509.00061","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00061","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00061v1","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00061","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"G7GHRSHVWB5L","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G7GHRSHVWB5LZI4N","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G7GHRSHV","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G7GHRSHVWB5LZI4NQUJZB3BXJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-31T20:46:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2155237337ecd27604e4ada83dab0fb7dbbfd62c7eb328a61f423f93d11ab30e","abstract_canon_sha256":"b4b0ac5ac28714b270bf2a4c965820a57cb9461f4522ba7df16502eea5fc59a1"},"schema_version":"1.0"},"canonical_sha256":"37cc78c8f5b07abca38d851390ec374e9c185bc610feb36f9f234b2ed3aabb22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:30.709709Z","signature_b64":"F/becF3TMIURLC3YWr0lDGcC2skAzLbJOzX8mQVF0IkWLxZr1eNbQ0hkvJ0qdyKSG9tSFaR/hiCPuVYKKMZbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37cc78c8f5b07abca38d851390ec374e9c185bc610feb36f9f234b2ed3aabb22","last_reissued_at":"2026-05-18T01:34:30.709260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:30.709260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00061","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-18T01:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ksGsgEWAPYmZGPBB12ctW0V4HRZbwwPsAxYNhXBSj8ihp7W1iVx35IQrG1jCZ32h7JmHxL+DJdXdpHSeQgs/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:01:34.739639Z"},"content_sha256":"85a21fde7fcb29b73c66b951b6e23bb021b60634b5794623f1fb6aae86be08be","schema_version":"1.0","event_id":"sha256:85a21fde7fcb29b73c66b951b6e23bb021b60634b5794623f1fb6aae86be08be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G7GHRSHVWB5LZI4NQUJZB3BXJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Value function approximation via low-rank models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hao Yi Ong","submitted_at":"2015-08-31T20:46:23Z","abstract_excerpt":"We propose a novel value function approximation technique for Markov decision processes. We consider the problem of compactly representing the state-action value function using a low-rank and sparse matrix model. The problem is to decompose a matrix that encodes the true value function into low-rank and sparse components, and we achieve this using Robust Principal Component Analysis (PCA). Under minimal assumptions, this Robust PCA problem can be solved exactly via the Principal Component Pursuit convex optimization problem. We experiment the procedure on several examples and demonstrate that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00061","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-18T01:34:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pAV2q+y3tpaQvwc5bNvIIXRNClKZcloB9Kus7gyNn3IF6/GJzVdN9Szej9v/8NGU2PquiupHYzhFAlB4UY7vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:01:34.739989Z"},"content_sha256":"fb6548af3d6c7bd97207196a971436d48b0b3de727526ff9ffb23d582d59fc94","schema_version":"1.0","event_id":"sha256:fb6548af3d6c7bd97207196a971436d48b0b3de727526ff9ffb23d582d59fc94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7GHRSHVWB5LZI4NQUJZB3BXJ2/bundle.json","state_url":"https://pith.science/pith/G7GHRSHVWB5LZI4NQUJZB3BXJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7GHRSHVWB5LZI4NQUJZB3BXJ2/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-06-03T23:01:34Z","links":{"resolver":"https://pith.science/pith/G7GHRSHVWB5LZI4NQUJZB3BXJ2","bundle":"https://pith.science/pith/G7GHRSHVWB5LZI4NQUJZB3BXJ2/bundle.json","state":"https://pith.science/pith/G7GHRSHVWB5LZI4NQUJZB3BXJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7GHRSHVWB5LZI4NQUJZB3BXJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G7GHRSHVWB5LZI4NQUJZB3BXJ2","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":"b4b0ac5ac28714b270bf2a4c965820a57cb9461f4522ba7df16502eea5fc59a1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-31T20:46:23Z","title_canon_sha256":"2155237337ecd27604e4ada83dab0fb7dbbfd62c7eb328a61f423f93d11ab30e"},"schema_version":"1.0","source":{"id":"1509.00061","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00061","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00061v1","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00061","created_at":"2026-05-18T01:34:30Z"},{"alias_kind":"pith_short_12","alias_value":"G7GHRSHVWB5L","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G7GHRSHVWB5LZI4N","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G7GHRSHV","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:fb6548af3d6c7bd97207196a971436d48b0b3de727526ff9ffb23d582d59fc94","target":"graph","created_at":"2026-05-18T01:34:30Z","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":"We propose a novel value function approximation technique for Markov decision processes. We consider the problem of compactly representing the state-action value function using a low-rank and sparse matrix model. The problem is to decompose a matrix that encodes the true value function into low-rank and sparse components, and we achieve this using Robust Principal Component Analysis (PCA). Under minimal assumptions, this Robust PCA problem can be solved exactly via the Principal Component Pursuit convex optimization problem. We experiment the procedure on several examples and demonstrate that ","authors_text":"Hao Yi Ong","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-31T20:46:23Z","title":"Value function approximation via low-rank models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00061","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:85a21fde7fcb29b73c66b951b6e23bb021b60634b5794623f1fb6aae86be08be","target":"record","created_at":"2026-05-18T01:34:30Z","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":"b4b0ac5ac28714b270bf2a4c965820a57cb9461f4522ba7df16502eea5fc59a1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-31T20:46:23Z","title_canon_sha256":"2155237337ecd27604e4ada83dab0fb7dbbfd62c7eb328a61f423f93d11ab30e"},"schema_version":"1.0","source":{"id":"1509.00061","kind":"arxiv","version":1}},"canonical_sha256":"37cc78c8f5b07abca38d851390ec374e9c185bc610feb36f9f234b2ed3aabb22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37cc78c8f5b07abca38d851390ec374e9c185bc610feb36f9f234b2ed3aabb22","first_computed_at":"2026-05-18T01:34:30.709260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:30.709260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F/becF3TMIURLC3YWr0lDGcC2skAzLbJOzX8mQVF0IkWLxZr1eNbQ0hkvJ0qdyKSG9tSFaR/hiCPuVYKKMZbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:30.709709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00061","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85a21fde7fcb29b73c66b951b6e23bb021b60634b5794623f1fb6aae86be08be","sha256:fb6548af3d6c7bd97207196a971436d48b0b3de727526ff9ffb23d582d59fc94"],"state_sha256":"5523fe7a618f78d2d523488d9ac1a8774dd08a7c1dd1c5e388d510d6ade4ac7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5O+2f2EnQpzeyDptwRyBJrxj4vGNDS6Q0RF81MlKrtxpotP99PRsE2qVN8n25DN1qOcxCNHUjSfZsodyySuuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:01:34.742082Z","bundle_sha256":"1147db94a84ae743c6190294d37d1c290543a8a06a400747e4f05f8da39d08d9"}}