{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PWUJQ35PQNG355TX3KG66PTCFZ","short_pith_number":"pith:PWUJQ35P","canonical_record":{"source":{"id":"1401.3428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:46:00Z","cross_cats_sorted":[],"title_canon_sha256":"007c7f897f1ea6363a06393de14718c58197741bd3f75123b04fa659f0b554a6","abstract_canon_sha256":"6a81c22de8b8244682e5f435360d72c97ebe5eb0fe194e3f8af5f69222fda5f5"},"schema_version":"1.0"},"canonical_sha256":"7da8986faf834dbef677da8def3e622e560f2c9de750e8bd3e2979d8e71862f4","source":{"kind":"arxiv","id":"1401.3428","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3428","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3428v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3428","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"PWUJQ35PQNG3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PWUJQ35PQNG355TX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PWUJQ35P","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PWUJQ35PQNG355TX3KG66PTCFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:46:00Z","cross_cats_sorted":[],"title_canon_sha256":"007c7f897f1ea6363a06393de14718c58197741bd3f75123b04fa659f0b554a6","abstract_canon_sha256":"6a81c22de8b8244682e5f435360d72c97ebe5eb0fe194e3f8af5f69222fda5f5"},"schema_version":"1.0"},"canonical_sha256":"7da8986faf834dbef677da8def3e622e560f2c9de750e8bd3e2979d8e71862f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:09.274633Z","signature_b64":"L68RwVhMbklEMOsKX+A4KKLSmfF4NUNH+KbjEdIAO3oHxzJb7VN4NCObsFEaJCluVIpvoTKgtiWLg0Khb05sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7da8986faf834dbef677da8def3e622e560f2c9de750e8bd3e2979d8e71862f4","last_reissued_at":"2026-05-18T03:02:09.274040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:09.274040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3428","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:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SA8YWiJ+Chv/6JODaUNDH5KBFM6IjKjuogrsdnyujPG7w+ug17lY4+bxxUtA6c5qwxjIZ6x/gHfXDbiY79R0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:36:11.445081Z"},"content_sha256":"981c50b08fe879e1f3161bca4cae5fbbaeb9ba1b6930a370ec894767faace1a6","schema_version":"1.0","event_id":"sha256:981c50b08fe879e1f3161bca4cae5fbbaeb9ba1b6930a370ec894767faace1a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PWUJQ35PQNG355TX3KG66PTCFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Emmanuel Benazera, Eric A. Hansen, Mausam, Nicolas Meuleau, Ronen I. Brafman","submitted_at":"2014-01-15T04:46:00Z","abstract_excerpt":"We consider the problem of optimal planning in stochastic domains with resource constraints, where the resources are continuous and the choice of action at each step depends on resource availability. We introduce the HAO* algorithm, a generalization of the AO* algorithm that performs search in a hybrid state space that is modeled using both discrete and continuous state variables, where the continuous variables represent monotonic resources. Like other heuristic search algorithms, HAO* leverages knowledge of the start state and an admissible heuristic to focus computational effort on those par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3428","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:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2saD3YaQFIel/Oy+JopeXzY/OHOhlM1WDg+gyquv3N/necmoiU/sGTrdT4/Of21jd+HT1EAehM2ue+SOIVfSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:36:11.445735Z"},"content_sha256":"6b6a92e15c8a207e71acb441d7073d1c05c8040888fafa47526ea8ebadb76866","schema_version":"1.0","event_id":"sha256:6b6a92e15c8a207e71acb441d7073d1c05c8040888fafa47526ea8ebadb76866"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWUJQ35PQNG355TX3KG66PTCFZ/bundle.json","state_url":"https://pith.science/pith/PWUJQ35PQNG355TX3KG66PTCFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWUJQ35PQNG355TX3KG66PTCFZ/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-27T07:36:11Z","links":{"resolver":"https://pith.science/pith/PWUJQ35PQNG355TX3KG66PTCFZ","bundle":"https://pith.science/pith/PWUJQ35PQNG355TX3KG66PTCFZ/bundle.json","state":"https://pith.science/pith/PWUJQ35PQNG355TX3KG66PTCFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWUJQ35PQNG355TX3KG66PTCFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PWUJQ35PQNG355TX3KG66PTCFZ","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":"6a81c22de8b8244682e5f435360d72c97ebe5eb0fe194e3f8af5f69222fda5f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:46:00Z","title_canon_sha256":"007c7f897f1ea6363a06393de14718c58197741bd3f75123b04fa659f0b554a6"},"schema_version":"1.0","source":{"id":"1401.3428","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3428","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3428v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3428","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"PWUJQ35PQNG3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PWUJQ35PQNG355TX","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PWUJQ35P","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:6b6a92e15c8a207e71acb441d7073d1c05c8040888fafa47526ea8ebadb76866","target":"graph","created_at":"2026-05-18T03:02:09Z","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 consider the problem of optimal planning in stochastic domains with resource constraints, where the resources are continuous and the choice of action at each step depends on resource availability. We introduce the HAO* algorithm, a generalization of the AO* algorithm that performs search in a hybrid state space that is modeled using both discrete and continuous state variables, where the continuous variables represent monotonic resources. Like other heuristic search algorithms, HAO* leverages knowledge of the start state and an admissible heuristic to focus computational effort on those par","authors_text":"Emmanuel Benazera, Eric A. Hansen, Mausam, Nicolas Meuleau, Ronen I. Brafman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:46:00Z","title":"A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3428","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:981c50b08fe879e1f3161bca4cae5fbbaeb9ba1b6930a370ec894767faace1a6","target":"record","created_at":"2026-05-18T03:02:09Z","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":"6a81c22de8b8244682e5f435360d72c97ebe5eb0fe194e3f8af5f69222fda5f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T04:46:00Z","title_canon_sha256":"007c7f897f1ea6363a06393de14718c58197741bd3f75123b04fa659f0b554a6"},"schema_version":"1.0","source":{"id":"1401.3428","kind":"arxiv","version":1}},"canonical_sha256":"7da8986faf834dbef677da8def3e622e560f2c9de750e8bd3e2979d8e71862f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7da8986faf834dbef677da8def3e622e560f2c9de750e8bd3e2979d8e71862f4","first_computed_at":"2026-05-18T03:02:09.274040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:09.274040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L68RwVhMbklEMOsKX+A4KKLSmfF4NUNH+KbjEdIAO3oHxzJb7VN4NCObsFEaJCluVIpvoTKgtiWLg0Khb05sDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:09.274633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3428","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:981c50b08fe879e1f3161bca4cae5fbbaeb9ba1b6930a370ec894767faace1a6","sha256:6b6a92e15c8a207e71acb441d7073d1c05c8040888fafa47526ea8ebadb76866"],"state_sha256":"0bda471c78a184aecb22d52a2af2003a40e951ab49bcdfe069ca493add81ae5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vGc7IISax3wwXHgaf8vfwWMXkGVQJ1BDmCo83czIlyiDa+T7omJ+xSfzHpSasZvleeIWAiaDCtF/fYyP7fevBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:36:11.449017Z","bundle_sha256":"9b0ad3decc7acc1d48f0ca265ff06bb1da4bd7fd19c3ae0b1857ca7e49644aaa"}}