{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QQQNE2I7HZMS5ZNUY3DP6GIN56","short_pith_number":"pith:QQQNE2I7","canonical_record":{"source":{"id":"1502.06132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-21T19:11:23Z","cross_cats_sorted":["cs.LG","cs.RO","math.MG"],"title_canon_sha256":"c8f118eeb8cbca5afe97b180ab0b14cde55973e4a79a6d88e9c561a9fbdc334b","abstract_canon_sha256":"780f0d5759cc8dede2e36527dc31ac9aec8718e0efbc65471b9fa1c98daddbce"},"schema_version":"1.0"},"canonical_sha256":"8420d2691f3e592ee5b4c6c6ff190def93bf925e8b289021a50ef2b8aa0908ef","source":{"kind":"arxiv","id":"1502.06132","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06132","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06132v1","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06132","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"QQQNE2I7HZMS","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QQQNE2I7HZMS5ZNU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QQQNE2I7","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QQQNE2I7HZMS5ZNUY3DP6GIN56","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-21T19:11:23Z","cross_cats_sorted":["cs.LG","cs.RO","math.MG"],"title_canon_sha256":"c8f118eeb8cbca5afe97b180ab0b14cde55973e4a79a6d88e9c561a9fbdc334b","abstract_canon_sha256":"780f0d5759cc8dede2e36527dc31ac9aec8718e0efbc65471b9fa1c98daddbce"},"schema_version":"1.0"},"canonical_sha256":"8420d2691f3e592ee5b4c6c6ff190def93bf925e8b289021a50ef2b8aa0908ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:37.982715Z","signature_b64":"is5Hzh/KMlLPohg9WergYsv6dFUXHa5V2MIAADQ6DKrCH8P5tQPtJ6/w/VD4ux7Md0QE+FcdZFJchuVMPdj0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8420d2691f3e592ee5b4c6c6ff190def93bf925e8b289021a50ef2b8aa0908ef","last_reissued_at":"2026-05-18T02:26:37.981780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:37.981780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06132","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-18T02:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHslffMVef53gP+V/Q3oN+iFx9knyh5KxB4Dyvxb8vYLX03tWJq03jfXEt1GQw9VPbtOhH8XJsvCgqT8vxGaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:14:25.697949Z"},"content_sha256":"a28e2a5f393dcc99ecd9d5ba98359f53c1cf22775f6238ffc29350e6a0245c0b","schema_version":"1.0","event_id":"sha256:a28e2a5f393dcc99ecd9d5ba98359f53c1cf22775f6238ffc29350e6a0245c0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QQQNE2I7HZMS5ZNUY3DP6GIN56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Memory Architectures for Autonomous Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.RO","math.MG"],"primary_cat":"cs.AI","authors_text":"Daniel E. Koditschek, Dan P. Guralnik","submitted_at":"2015-02-21T19:11:23Z","abstract_excerpt":"We propose a self-organizing memory architecture for perceptual experience, capable of supporting autonomous learning and goal-directed problem solving in the absence of any prior information about the agent's environment. The architecture is simple enough to ensure (1) a quadratic bound (in the number of available sensors) on space requirements, and (2) a quadratic bound on the time-complexity of the update-execute cycle. At the same time, it is sufficiently complex to provide the agent with an internal representation which is (3) minimal among all representations of its class which account f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06132","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-18T02:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkMw/fYmYKSpOOS3NTSbYkrkSNFKGm8YV3KkfRymRb1zDUSKLo6Bz7zNGSkVVehJZKNE/wBBCNqP9i4NXSVIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:14:25.698667Z"},"content_sha256":"b39e2c1b4cb08a571219e1c3c49f4e08344280743fd62cefeb8a566130e8dfa5","schema_version":"1.0","event_id":"sha256:b39e2c1b4cb08a571219e1c3c49f4e08344280743fd62cefeb8a566130e8dfa5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQQNE2I7HZMS5ZNUY3DP6GIN56/bundle.json","state_url":"https://pith.science/pith/QQQNE2I7HZMS5ZNUY3DP6GIN56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQQNE2I7HZMS5ZNUY3DP6GIN56/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-31T21:14:25Z","links":{"resolver":"https://pith.science/pith/QQQNE2I7HZMS5ZNUY3DP6GIN56","bundle":"https://pith.science/pith/QQQNE2I7HZMS5ZNUY3DP6GIN56/bundle.json","state":"https://pith.science/pith/QQQNE2I7HZMS5ZNUY3DP6GIN56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQQNE2I7HZMS5ZNUY3DP6GIN56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QQQNE2I7HZMS5ZNUY3DP6GIN56","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":"780f0d5759cc8dede2e36527dc31ac9aec8718e0efbc65471b9fa1c98daddbce","cross_cats_sorted":["cs.LG","cs.RO","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-21T19:11:23Z","title_canon_sha256":"c8f118eeb8cbca5afe97b180ab0b14cde55973e4a79a6d88e9c561a9fbdc334b"},"schema_version":"1.0","source":{"id":"1502.06132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06132","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06132v1","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06132","created_at":"2026-05-18T02:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"QQQNE2I7HZMS","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QQQNE2I7HZMS5ZNU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QQQNE2I7","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:b39e2c1b4cb08a571219e1c3c49f4e08344280743fd62cefeb8a566130e8dfa5","target":"graph","created_at":"2026-05-18T02:26: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 propose a self-organizing memory architecture for perceptual experience, capable of supporting autonomous learning and goal-directed problem solving in the absence of any prior information about the agent's environment. The architecture is simple enough to ensure (1) a quadratic bound (in the number of available sensors) on space requirements, and (2) a quadratic bound on the time-complexity of the update-execute cycle. At the same time, it is sufficiently complex to provide the agent with an internal representation which is (3) minimal among all representations of its class which account f","authors_text":"Daniel E. Koditschek, Dan P. Guralnik","cross_cats":["cs.LG","cs.RO","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-21T19:11:23Z","title":"Universal Memory Architectures for Autonomous Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06132","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:a28e2a5f393dcc99ecd9d5ba98359f53c1cf22775f6238ffc29350e6a0245c0b","target":"record","created_at":"2026-05-18T02:26: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":"780f0d5759cc8dede2e36527dc31ac9aec8718e0efbc65471b9fa1c98daddbce","cross_cats_sorted":["cs.LG","cs.RO","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-21T19:11:23Z","title_canon_sha256":"c8f118eeb8cbca5afe97b180ab0b14cde55973e4a79a6d88e9c561a9fbdc334b"},"schema_version":"1.0","source":{"id":"1502.06132","kind":"arxiv","version":1}},"canonical_sha256":"8420d2691f3e592ee5b4c6c6ff190def93bf925e8b289021a50ef2b8aa0908ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8420d2691f3e592ee5b4c6c6ff190def93bf925e8b289021a50ef2b8aa0908ef","first_computed_at":"2026-05-18T02:26:37.981780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:37.981780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"is5Hzh/KMlLPohg9WergYsv6dFUXHa5V2MIAADQ6DKrCH8P5tQPtJ6/w/VD4ux7Md0QE+FcdZFJchuVMPdj0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:37.982715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a28e2a5f393dcc99ecd9d5ba98359f53c1cf22775f6238ffc29350e6a0245c0b","sha256:b39e2c1b4cb08a571219e1c3c49f4e08344280743fd62cefeb8a566130e8dfa5"],"state_sha256":"8e7a5aab233daea40204ae738459583fdc453c46636670312b3f7e69800c699e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEpGWwfByijRZ+FC0WxzFJ/3YwHT56iHA6ptfzw7BDZt4wHH9RA4HN9dzt/OezlHj5gaHrViEKJutpKSU7LiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:14:25.702616Z","bundle_sha256":"d46d72f63535624ee44f9fb06124b337a597808f78340699d1597699ac794fc8"}}