{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IBYGPU36D7YZNMHNMDXLLILJMO","short_pith_number":"pith:IBYGPU36","schema_version":"1.0","canonical_sha256":"407067d37e1ff196b0ed60eeb5a16963b1005186ae590e394b8258603ff54a21","source":{"kind":"arxiv","id":"1207.1415","version":1},"attestation_state":"computed","paper":{"title":"Approximate Linear Programming for First-order MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Craig Boutilier, Scott Sanner","submitted_at":"2012-07-04T16:24:08Z","abstract_excerpt":"We introduce a new approximate solution technique for first-order Markov decision processes (FOMDPs). Representing the value function linearly w.r.t. a set of first-order basis functions, we compute suitable weights by casting the corresponding optimization as a first-order linear program and show how off-the-shelf theorem prover and LP software can be effectively used. This technique allows one to solve FOMDPs independent of a specific domain instantiation; furthermore, it allows one to determine bounds on approximation error that apply equally to all domain instantiations. We apply this solu"},"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":"1207.1415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:24:08Z","cross_cats_sorted":[],"title_canon_sha256":"84937efd4241222e2243433f8da393f2e7cddc36629cd77b0329e4dbd71b9bcf","abstract_canon_sha256":"d8a0d891cbe4ef21ec34adce0aa7772db431d603dbfc1fb66669d618b38dcb96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.169574Z","signature_b64":"0dtItYC8VuQPJU4IRBAaKV+s27AkQDXkbEDbEthWkFjO0Ul0416ymgftV5Jjx6k7eDpzVeb/CcObqD94TP2gCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"407067d37e1ff196b0ed60eeb5a16963b1005186ae590e394b8258603ff54a21","last_reissued_at":"2026-05-18T03:51:37.169091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.169091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Linear Programming for First-order MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Craig Boutilier, Scott Sanner","submitted_at":"2012-07-04T16:24:08Z","abstract_excerpt":"We introduce a new approximate solution technique for first-order Markov decision processes (FOMDPs). Representing the value function linearly w.r.t. a set of first-order basis functions, we compute suitable weights by casting the corresponding optimization as a first-order linear program and show how off-the-shelf theorem prover and LP software can be effectively used. This technique allows one to solve FOMDPs independent of a specific domain instantiation; furthermore, it allows one to determine bounds on approximation error that apply equally to all domain instantiations. We apply this solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1415","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":"1207.1415","created_at":"2026-05-18T03:51:37.169167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1415v1","created_at":"2026-05-18T03:51:37.169167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1415","created_at":"2026-05-18T03:51:37.169167+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBYGPU36D7YZ","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBYGPU36D7YZNMHN","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBYGPU36","created_at":"2026-05-18T12:27:09.501522+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/IBYGPU36D7YZNMHNMDXLLILJMO","json":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO.json","graph_json":"https://pith.science/api/pith-number/IBYGPU36D7YZNMHNMDXLLILJMO/graph.json","events_json":"https://pith.science/api/pith-number/IBYGPU36D7YZNMHNMDXLLILJMO/events.json","paper":"https://pith.science/paper/IBYGPU36"},"agent_actions":{"view_html":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO","download_json":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO.json","view_paper":"https://pith.science/paper/IBYGPU36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1415&json=true","fetch_graph":"https://pith.science/api/pith-number/IBYGPU36D7YZNMHNMDXLLILJMO/graph.json","fetch_events":"https://pith.science/api/pith-number/IBYGPU36D7YZNMHNMDXLLILJMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO/action/storage_attestation","attest_author":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO/action/author_attestation","sign_citation":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO/action/citation_signature","submit_replication":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO/action/replication_record"}},"created_at":"2026-05-18T03:51:37.169167+00:00","updated_at":"2026-05-18T03:51:37.169167+00:00"}