{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PIDYWJTB37RUYJ4LJOVLZUIYLU","short_pith_number":"pith:PIDYWJTB","canonical_record":{"source":{"id":"1301.6715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"817498e0b47c8c42eaab2ba0affd512bf820e7f841f7f40d66e0cfdc4e44c18f","abstract_canon_sha256":"87d3a2aa7cc1e90535826c0fb4f26d7e7d10a6bde712e79a2adf83a437217476"},"schema_version":"1.0"},"canonical_sha256":"7a078b2661dfe34c278b4baabcd1185d00d28cb8f4d0db989ff6131f32ecd2c3","source":{"kind":"arxiv","id":"1301.6715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6715","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6715v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6715","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"PIDYWJTB37RU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PIDYWJTB37RUYJ4L","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PIDYWJTB","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PIDYWJTB37RUYJ4LJOVLZUIYLU","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"817498e0b47c8c42eaab2ba0affd512bf820e7f841f7f40d66e0cfdc4e44c18f","abstract_canon_sha256":"87d3a2aa7cc1e90535826c0fb4f26d7e7d10a6bde712e79a2adf83a437217476"},"schema_version":"1.0"},"canonical_sha256":"7a078b2661dfe34c278b4baabcd1185d00d28cb8f4d0db989ff6131f32ecd2c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.781995Z","signature_b64":"aHpoMG/rNUaxXaPKqvZFska2N0Kewa7CCnNDkJ+14j1+Y8DboXh7aofEp3BZQTFy/IrlK7Ve+i1FVipGEtn5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a078b2661dfe34c278b4baabcd1185d00d28cb8f4d0db989ff6131f32ecd2c3","last_reissued_at":"2026-05-18T03:35:12.781426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.781426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6715","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:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbJpVQ02lKIWI71+zRiLpT0u5SD+PCRQIl2tx4MvKFTXuWJoDjVj0LzvYKi9XTZ6NrKxj0QItDK6reIfBIiLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:31:00.760895Z"},"content_sha256":"debfad5d91568a08a07aa300da8be353bb1189042247e3ad9d94ed9c3ba1252b","schema_version":"1.0","event_id":"sha256:debfad5d91568a08a07aa300da8be353bb1189042247e3ad9d94ed9c3ba1252b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PIDYWJTB37RUYJ4LJOVLZUIYLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"My Brain is Full: When More Memory Helps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christopher Lusena, Chris Wells, Judy Goldsmith, Shelia Sittinger, Tong Li","submitted_at":"2013-01-23T15:59:22Z","abstract_excerpt":"We consider the problem of finding good finite-horizon policies for POMDPs under the expected reward metric.  The policies considered are {em free finite-memory policies with limited memory}; a policy is a mapping from the space of observation-memory pairs to the space of action-memeory pairs (the policy updates the memory as it goes), and the number of possible memory states is a parameter of the input to the policy-finding algorithms.  The algorithms considered here are preliminary implementations of three search heuristics:  local search, simulated annealing, and genetic algorithms.  We com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6715","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:35:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ucte1q8JCPfMy7agQFEiGNo9aKUHqG9NFV6uWLrxt8OmJx3uVCbk9+miRnRBLVC5GoNZ2/82lY0z/zRUEIBLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:31:00.761246Z"},"content_sha256":"41786ae9a1c8ccdd1916477a1582528495f02e9dfac6119f068ac6c2aa38fe63","schema_version":"1.0","event_id":"sha256:41786ae9a1c8ccdd1916477a1582528495f02e9dfac6119f068ac6c2aa38fe63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/bundle.json","state_url":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/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-03T21:31:00Z","links":{"resolver":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU","bundle":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/bundle.json","state":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PIDYWJTB37RUYJ4LJOVLZUIYLU","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":"87d3a2aa7cc1e90535826c0fb4f26d7e7d10a6bde712e79a2adf83a437217476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:22Z","title_canon_sha256":"817498e0b47c8c42eaab2ba0affd512bf820e7f841f7f40d66e0cfdc4e44c18f"},"schema_version":"1.0","source":{"id":"1301.6715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6715","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6715v1","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6715","created_at":"2026-05-18T03:35:12Z"},{"alias_kind":"pith_short_12","alias_value":"PIDYWJTB37RU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PIDYWJTB37RUYJ4L","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PIDYWJTB","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:41786ae9a1c8ccdd1916477a1582528495f02e9dfac6119f068ac6c2aa38fe63","target":"graph","created_at":"2026-05-18T03:35:12Z","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 finding good finite-horizon policies for POMDPs under the expected reward metric.  The policies considered are {em free finite-memory policies with limited memory}; a policy is a mapping from the space of observation-memory pairs to the space of action-memeory pairs (the policy updates the memory as it goes), and the number of possible memory states is a parameter of the input to the policy-finding algorithms.  The algorithms considered here are preliminary implementations of three search heuristics:  local search, simulated annealing, and genetic algorithms.  We com","authors_text":"Christopher Lusena, Chris Wells, Judy Goldsmith, Shelia Sittinger, Tong Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:22Z","title":"My Brain is Full: When More Memory Helps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6715","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:debfad5d91568a08a07aa300da8be353bb1189042247e3ad9d94ed9c3ba1252b","target":"record","created_at":"2026-05-18T03:35:12Z","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":"87d3a2aa7cc1e90535826c0fb4f26d7e7d10a6bde712e79a2adf83a437217476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:59:22Z","title_canon_sha256":"817498e0b47c8c42eaab2ba0affd512bf820e7f841f7f40d66e0cfdc4e44c18f"},"schema_version":"1.0","source":{"id":"1301.6715","kind":"arxiv","version":1}},"canonical_sha256":"7a078b2661dfe34c278b4baabcd1185d00d28cb8f4d0db989ff6131f32ecd2c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a078b2661dfe34c278b4baabcd1185d00d28cb8f4d0db989ff6131f32ecd2c3","first_computed_at":"2026-05-18T03:35:12.781426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:12.781426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aHpoMG/rNUaxXaPKqvZFska2N0Kewa7CCnNDkJ+14j1+Y8DboXh7aofEp3BZQTFy/IrlK7Ve+i1FVipGEtn5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:12.781995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:debfad5d91568a08a07aa300da8be353bb1189042247e3ad9d94ed9c3ba1252b","sha256:41786ae9a1c8ccdd1916477a1582528495f02e9dfac6119f068ac6c2aa38fe63"],"state_sha256":"79a7baa3e472359aa419909663abbf9c004248416d5eba5fa34723f3fdf8d44a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GlMjPLlU6D933Fpzggp3elHGJQK4yj88DcL4X1W25XLom1q3ZI//JrYA9uI6qiKAvj7aUQaBd7v1hJwq0p0/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:31:00.763173Z","bundle_sha256":"d59b627a3f10b0ea4e16b5259852c9d56cb2690e08a46457b99327b989216fd7"}}