{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IBYGPU36D7YZNMHNMDXLLILJMO","short_pith_number":"pith:IBYGPU36","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"},"canonical_sha256":"407067d37e1ff196b0ed60eeb5a16963b1005186ae590e394b8258603ff54a21","source":{"kind":"arxiv","id":"1207.1415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1415","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1415v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1415","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"IBYGPU36D7YZ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IBYGPU36D7YZNMHN","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IBYGPU36","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IBYGPU36D7YZNMHNMDXLLILJMO","target":"record","payload":{"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"},"canonical_sha256":"407067d37e1ff196b0ed60eeb5a16963b1005186ae590e394b8258603ff54a21","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"},"source_kind":"arxiv","source_id":"1207.1415","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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R7Q6VMD3S30U2UDm2da5hRd1oTKRTWKEIDdXjCMzhZpKne3J6zJIRvnMlAGdIkORQtiv78G9kn9acRLpi0htBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:36:57.988102Z"},"content_sha256":"99a257a1edfafabe5e619d3e7a4af970e91e51c7ee276a3a3e84912ebc6dfb1a","schema_version":"1.0","event_id":"sha256:99a257a1edfafabe5e619d3e7a4af970e91e51c7ee276a3a3e84912ebc6dfb1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IBYGPU36D7YZNMHNMDXLLILJMO","target":"graph","payload":{"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"},"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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"llByVyCz+qhR38C1y2Qa7m9MnLVuc7u/t1Ic6A16G3zjCfuDz8jJfhPd/D9GWV/7KeifgNEtHBJ/dDBo5tcaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:36:57.988767Z"},"content_sha256":"af2475571e1d3e08becfc20931b9dd6708e4aacececba35f5d2060f3ec78b7e5","schema_version":"1.0","event_id":"sha256:af2475571e1d3e08becfc20931b9dd6708e4aacececba35f5d2060f3ec78b7e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO/bundle.json","state_url":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBYGPU36D7YZNMHNMDXLLILJMO/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-09T03:36:57Z","links":{"resolver":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO","bundle":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO/bundle.json","state":"https://pith.science/pith/IBYGPU36D7YZNMHNMDXLLILJMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBYGPU36D7YZNMHNMDXLLILJMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IBYGPU36D7YZNMHNMDXLLILJMO","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":"d8a0d891cbe4ef21ec34adce0aa7772db431d603dbfc1fb66669d618b38dcb96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:24:08Z","title_canon_sha256":"84937efd4241222e2243433f8da393f2e7cddc36629cd77b0329e4dbd71b9bcf"},"schema_version":"1.0","source":{"id":"1207.1415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1415","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1415v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1415","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"IBYGPU36D7YZ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IBYGPU36D7YZNMHN","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IBYGPU36","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:af2475571e1d3e08becfc20931b9dd6708e4aacececba35f5d2060f3ec78b7e5","target":"graph","created_at":"2026-05-18T03:51:37Z","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 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","authors_text":"Craig Boutilier, Scott Sanner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:24:08Z","title":"Approximate Linear Programming for First-order MDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1415","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:99a257a1edfafabe5e619d3e7a4af970e91e51c7ee276a3a3e84912ebc6dfb1a","target":"record","created_at":"2026-05-18T03:51:37Z","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":"d8a0d891cbe4ef21ec34adce0aa7772db431d603dbfc1fb66669d618b38dcb96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:24:08Z","title_canon_sha256":"84937efd4241222e2243433f8da393f2e7cddc36629cd77b0329e4dbd71b9bcf"},"schema_version":"1.0","source":{"id":"1207.1415","kind":"arxiv","version":1}},"canonical_sha256":"407067d37e1ff196b0ed60eeb5a16963b1005186ae590e394b8258603ff54a21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"407067d37e1ff196b0ed60eeb5a16963b1005186ae590e394b8258603ff54a21","first_computed_at":"2026-05-18T03:51:37.169091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.169091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0dtItYC8VuQPJU4IRBAaKV+s27AkQDXkbEDbEthWkFjO0Ul0416ymgftV5Jjx6k7eDpzVeb/CcObqD94TP2gCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.169574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99a257a1edfafabe5e619d3e7a4af970e91e51c7ee276a3a3e84912ebc6dfb1a","sha256:af2475571e1d3e08becfc20931b9dd6708e4aacececba35f5d2060f3ec78b7e5"],"state_sha256":"3b41a5f4731df351054d0f8da878615780030f2e21aa706041bf92626bc3d65c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueZOKnkpWqXGxlhLGUElidbWZ3Svz7lE/quobbuPRcVcKxlP8mYrhxfd6RKfxn8dhyMNdqHW5rfOrrNla7tPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:36:57.992468Z","bundle_sha256":"1d9ee0d09c7f1dd013a548378388873d4966a721d695dae79223b81a6358857b"}}