{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G3XCNHGV32ZCHSARB7OZRIYPJQ","short_pith_number":"pith:G3XCNHGV","schema_version":"1.0","canonical_sha256":"36ee269cd5deb223c8110fdd98a30f4c0129f565c9f478d046e1e9323fa3c627","source":{"kind":"arxiv","id":"1906.08524","version":1},"attestation_state":"computed","paper":{"title":"Max-Plus Matching Pursuit for Deterministic Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (SIERRA)","submitted_at":"2019-06-20T09:44:48Z","abstract_excerpt":"We consider deterministic Markov decision processes (MDPs) and apply max-plus algebra tools to approximate the value iteration algorithm by a smaller-dimensional iteration based on a representation on dictionaries of value functions. The setup naturally leads to novel theoretical results which are simply formulated due to the max-plus algebra structure. For example, when considering a fixed (non adaptive) finite basis, the computational complexity of approximating the optimal value function is not directly related to the number of states, but to notions of covering numbers of the state space. "},"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":"1906.08524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T09:44:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"42b5137335611d297859fc7939214598923a3c1b26a18046695f588b2342e382","abstract_canon_sha256":"cf44cf8319d6f67cdd47e8ced2e43d50447de1b8122e7d63244359628db0d793"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:52.228528Z","signature_b64":"S6UcbvaMhZFnSwTftSmaz6zaE4ZBUj0MeznNmzTZU6ev/hLmnlG0GKmDizPx79VFOQ54qdUW/9Ec6SSS2PmaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ee269cd5deb223c8110fdd98a30f4c0129f565c9f478d046e1e9323fa3c627","last_reissued_at":"2026-05-17T23:42:52.228120Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:52.228120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Max-Plus Matching Pursuit for Deterministic Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (SIERRA)","submitted_at":"2019-06-20T09:44:48Z","abstract_excerpt":"We consider deterministic Markov decision processes (MDPs) and apply max-plus algebra tools to approximate the value iteration algorithm by a smaller-dimensional iteration based on a representation on dictionaries of value functions. The setup naturally leads to novel theoretical results which are simply formulated due to the max-plus algebra structure. For example, when considering a fixed (non adaptive) finite basis, the computational complexity of approximating the optimal value function is not directly related to the number of states, but to notions of covering numbers of the state space. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08524","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":"1906.08524","created_at":"2026-05-17T23:42:52.228179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08524v1","created_at":"2026-05-17T23:42:52.228179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08524","created_at":"2026-05-17T23:42:52.228179+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3XCNHGV32ZC","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3XCNHGV32ZCHSAR","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3XCNHGV","created_at":"2026-05-18T12:33:18.533446+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/G3XCNHGV32ZCHSARB7OZRIYPJQ","json":"https://pith.science/pith/G3XCNHGV32ZCHSARB7OZRIYPJQ.json","graph_json":"https://pith.science/api/pith-number/G3XCNHGV32ZCHSARB7OZRIYPJQ/graph.json","events_json":"https://pith.science/api/pith-number/G3XCNHGV32ZCHSARB7OZRIYPJQ/events.json","paper":"https://pith.science/paper/G3XCNHGV"},"agent_actions":{"view_html":"https://pith.science/pith/G3XCNHGV32ZCHSARB7OZRIYPJQ","download_json":"https://pith.science/pith/G3XCNHGV32ZCHSARB7OZRIYPJQ.json","view_paper":"https://pith.science/paper/G3XCNHGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08524&json=true","fetch_graph":"https://pith.science/api/pith-number/G3XCNHGV32ZCHSARB7OZRIYPJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/G3XCNHGV32ZCHSARB7OZRIYPJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3XCNHGV32ZCHSARB7OZRIYPJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3XCNHGV32ZCHSARB7OZRIYPJQ/action/storage_attestation","attest_author":"https://pith.science/pith/G3XCNHGV32ZCHSARB7OZRIYPJQ/action/author_attestation","sign_citation":"https://pith.science/pith/G3XCNHGV32ZCHSARB7OZRIYPJQ/action/citation_signature","submit_replication":"https://pith.science/pith/G3XCNHGV32ZCHSARB7OZRIYPJQ/action/replication_record"}},"created_at":"2026-05-17T23:42:52.228179+00:00","updated_at":"2026-05-17T23:42:52.228179+00:00"}