{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PIDYWJTB37RUYJ4LJOVLZUIYLU","short_pith_number":"pith:PIDYWJTB","schema_version":"1.0","canonical_sha256":"7a078b2661dfe34c278b4baabcd1185d00d28cb8f4d0db989ff6131f32ecd2c3","source":{"kind":"arxiv","id":"1301.6715","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.6715","created_at":"2026-05-18T03:35:12.781544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6715v1","created_at":"2026-05-18T03:35:12.781544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6715","created_at":"2026-05-18T03:35:12.781544+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIDYWJTB37RU","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIDYWJTB37RUYJ4L","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIDYWJTB","created_at":"2026-05-18T12:27:54.935989+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/PIDYWJTB37RUYJ4LJOVLZUIYLU","json":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU.json","graph_json":"https://pith.science/api/pith-number/PIDYWJTB37RUYJ4LJOVLZUIYLU/graph.json","events_json":"https://pith.science/api/pith-number/PIDYWJTB37RUYJ4LJOVLZUIYLU/events.json","paper":"https://pith.science/paper/PIDYWJTB"},"agent_actions":{"view_html":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU","download_json":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU.json","view_paper":"https://pith.science/paper/PIDYWJTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6715&json=true","fetch_graph":"https://pith.science/api/pith-number/PIDYWJTB37RUYJ4LJOVLZUIYLU/graph.json","fetch_events":"https://pith.science/api/pith-number/PIDYWJTB37RUYJ4LJOVLZUIYLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/action/storage_attestation","attest_author":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/action/author_attestation","sign_citation":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/action/citation_signature","submit_replication":"https://pith.science/pith/PIDYWJTB37RUYJ4LJOVLZUIYLU/action/replication_record"}},"created_at":"2026-05-18T03:35:12.781544+00:00","updated_at":"2026-05-18T03:35:12.781544+00:00"}