{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YXYGS3QLNEQHPEYFBTMZ7AQLVC","short_pith_number":"pith:YXYGS3QL","schema_version":"1.0","canonical_sha256":"c5f0696e0b69207793050cd99f820ba898c8a1ef754ec4a4c8b3e0828dd24461","source":{"kind":"arxiv","id":"1104.3787","version":3},"attestation_state":"computed","paper":{"title":"Projective simulation for artificial intelligence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","quant-ph"],"primary_cat":"nlin.AO","authors_text":"Gemma De las Cuevas, Hans J. Briegel","submitted_at":"2011-04-19T16:02:44Z","abstract_excerpt":"We propose a model of a learning agent whose interaction with the environment is governed by a simulation-based projection, which allows the agent to project itself into future situations before it takes real action. Projective simulation is based on a random walk through a network of clips, which are elementary patches of episodic memory. The network of clips changes dynamically, both due to new perceptual input and due to certain compositional principles of the simulation process. During simulation, the clips are screened for specific features which trigger factual action of the agent. The s"},"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":"1104.3787","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2011-04-19T16:02:44Z","cross_cats_sorted":["cond-mat.dis-nn","quant-ph"],"title_canon_sha256":"d5977a308c11df9e0aef2cd236e26f39e87c6047574cd2285dc9401384b32962","abstract_canon_sha256":"b7dbea769f509282abebbdb06d90b4dd48fb346bdd68317e8a87e363212d72e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:02.153022Z","signature_b64":"Pp4rNO59bH3dmJeqUobtksoCgmTjJewOCimGlkaI8CtpvYh7OdSg6IuWqViAraoWomJhN9DOIb1Y23UftouJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5f0696e0b69207793050cd99f820ba898c8a1ef754ec4a4c8b3e0828dd24461","last_reissued_at":"2026-05-18T02:22:02.152264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:02.152264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projective simulation for artificial intelligence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","quant-ph"],"primary_cat":"nlin.AO","authors_text":"Gemma De las Cuevas, Hans J. Briegel","submitted_at":"2011-04-19T16:02:44Z","abstract_excerpt":"We propose a model of a learning agent whose interaction with the environment is governed by a simulation-based projection, which allows the agent to project itself into future situations before it takes real action. Projective simulation is based on a random walk through a network of clips, which are elementary patches of episodic memory. The network of clips changes dynamically, both due to new perceptual input and due to certain compositional principles of the simulation process. During simulation, the clips are screened for specific features which trigger factual action of the agent. The s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3787","kind":"arxiv","version":3},"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":"1104.3787","created_at":"2026-05-18T02:22:02.152402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3787v3","created_at":"2026-05-18T02:22:02.152402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3787","created_at":"2026-05-18T02:22:02.152402+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXYGS3QLNEQH","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXYGS3QLNEQHPEYF","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXYGS3QL","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09622","citing_title":"Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YXYGS3QLNEQHPEYFBTMZ7AQLVC","json":"https://pith.science/pith/YXYGS3QLNEQHPEYFBTMZ7AQLVC.json","graph_json":"https://pith.science/api/pith-number/YXYGS3QLNEQHPEYFBTMZ7AQLVC/graph.json","events_json":"https://pith.science/api/pith-number/YXYGS3QLNEQHPEYFBTMZ7AQLVC/events.json","paper":"https://pith.science/paper/YXYGS3QL"},"agent_actions":{"view_html":"https://pith.science/pith/YXYGS3QLNEQHPEYFBTMZ7AQLVC","download_json":"https://pith.science/pith/YXYGS3QLNEQHPEYFBTMZ7AQLVC.json","view_paper":"https://pith.science/paper/YXYGS3QL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3787&json=true","fetch_graph":"https://pith.science/api/pith-number/YXYGS3QLNEQHPEYFBTMZ7AQLVC/graph.json","fetch_events":"https://pith.science/api/pith-number/YXYGS3QLNEQHPEYFBTMZ7AQLVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXYGS3QLNEQHPEYFBTMZ7AQLVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXYGS3QLNEQHPEYFBTMZ7AQLVC/action/storage_attestation","attest_author":"https://pith.science/pith/YXYGS3QLNEQHPEYFBTMZ7AQLVC/action/author_attestation","sign_citation":"https://pith.science/pith/YXYGS3QLNEQHPEYFBTMZ7AQLVC/action/citation_signature","submit_replication":"https://pith.science/pith/YXYGS3QLNEQHPEYFBTMZ7AQLVC/action/replication_record"}},"created_at":"2026-05-18T02:22:02.152402+00:00","updated_at":"2026-05-18T02:22:02.152402+00:00"}