{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GOVGTUQWQ6CUYH3EDYRYWAZHBE","short_pith_number":"pith:GOVGTUQW","canonical_record":{"source":{"id":"1406.1502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-06-05T16:27:15Z","cross_cats_sorted":[],"title_canon_sha256":"627b4b6f0c1a112eb1d4df40bae136137c779bbd09bbe00a9bec331f55ee13b9","abstract_canon_sha256":"098cff26e74f1b39eb63afa02c56e355173f4eadba3135f648ba2caeb732ee29"},"schema_version":"1.0"},"canonical_sha256":"33aa69d21687854c1f641e238b03270937a2b452ba3ee77c590d179d84f1b42b","source":{"kind":"arxiv","id":"1406.1502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1502","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1502v1","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1502","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"GOVGTUQWQ6CU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GOVGTUQWQ6CUYH3E","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GOVGTUQW","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GOVGTUQWQ6CUYH3EDYRYWAZHBE","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-06-05T16:27:15Z","cross_cats_sorted":[],"title_canon_sha256":"627b4b6f0c1a112eb1d4df40bae136137c779bbd09bbe00a9bec331f55ee13b9","abstract_canon_sha256":"098cff26e74f1b39eb63afa02c56e355173f4eadba3135f648ba2caeb732ee29"},"schema_version":"1.0"},"canonical_sha256":"33aa69d21687854c1f641e238b03270937a2b452ba3ee77c590d179d84f1b42b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:36.285902Z","signature_b64":"KthJeZ5cq5t02Ju6VxvQ2cEqLZDH0FXsXwRY+x/wKianB4Uq/rYiUgloybGbVz3aldyWnbiy88QAWe6lUe6SCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33aa69d21687854c1f641e238b03270937a2b452ba3ee77c590d179d84f1b42b","last_reissued_at":"2026-05-18T01:14:36.285172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:36.285172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1502","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-18T01:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXkLUHVaFQYnRaaOuxKAj6NtD/L5uGlL3RiaR5KmAvUpXRuMaxUn0EUglt1dseE49XYeo5IcXzekQOxXtXfOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:48:59.486606Z"},"content_sha256":"9a9b943f435732610dae70b9eff4e6ce394014a3e6f579bc82ed25bf1c46270c","schema_version":"1.0","event_id":"sha256:9a9b943f435732610dae70b9eff4e6ce394014a3e6f579bc82ed25bf1c46270c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GOVGTUQWQ6CUYH3EDYRYWAZHBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards designing artificial universes for artificial agents under interaction closure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Christoph Salge, Daniel Polani, Martin Biehl","submitted_at":"2014-06-05T16:27:15Z","abstract_excerpt":"We are interested in designing artificial universes for artifi- cial agents. We view artificial agents as networks of high- level processes on top of of a low-level detailed-description system. We require that the high-level processes have some intrinsic explanatory power and we introduce an extension of informational closure namely interaction closure to capture this. Then we derive a method to design artificial universes in the form of finite Markov chains which exhibit high-level pro- cesses that satisfy the property of interaction closure. We also investigate control or information transfe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1502","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-18T01:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InwAs6zeLvUTHSGg+on3REcTBlDn6JLntWGYvv847gKrEt/OBNT0C8m/sk5iSN/TXxXyx+c0eMM6JebvPDvaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:48:59.486953Z"},"content_sha256":"01e6ee7728a15eac22af9043a23ba0eb535c5ef722546f8e5849fa8a77052566","schema_version":"1.0","event_id":"sha256:01e6ee7728a15eac22af9043a23ba0eb535c5ef722546f8e5849fa8a77052566"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOVGTUQWQ6CUYH3EDYRYWAZHBE/bundle.json","state_url":"https://pith.science/pith/GOVGTUQWQ6CUYH3EDYRYWAZHBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOVGTUQWQ6CUYH3EDYRYWAZHBE/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-22T22:48:59Z","links":{"resolver":"https://pith.science/pith/GOVGTUQWQ6CUYH3EDYRYWAZHBE","bundle":"https://pith.science/pith/GOVGTUQWQ6CUYH3EDYRYWAZHBE/bundle.json","state":"https://pith.science/pith/GOVGTUQWQ6CUYH3EDYRYWAZHBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOVGTUQWQ6CUYH3EDYRYWAZHBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GOVGTUQWQ6CUYH3EDYRYWAZHBE","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":"098cff26e74f1b39eb63afa02c56e355173f4eadba3135f648ba2caeb732ee29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-06-05T16:27:15Z","title_canon_sha256":"627b4b6f0c1a112eb1d4df40bae136137c779bbd09bbe00a9bec331f55ee13b9"},"schema_version":"1.0","source":{"id":"1406.1502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1502","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1502v1","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1502","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"GOVGTUQWQ6CU","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GOVGTUQWQ6CUYH3E","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GOVGTUQW","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:01e6ee7728a15eac22af9043a23ba0eb535c5ef722546f8e5849fa8a77052566","target":"graph","created_at":"2026-05-18T01:14:36Z","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 are interested in designing artificial universes for artifi- cial agents. We view artificial agents as networks of high- level processes on top of of a low-level detailed-description system. We require that the high-level processes have some intrinsic explanatory power and we introduce an extension of informational closure namely interaction closure to capture this. Then we derive a method to design artificial universes in the form of finite Markov chains which exhibit high-level pro- cesses that satisfy the property of interaction closure. We also investigate control or information transfe","authors_text":"Christoph Salge, Daniel Polani, Martin Biehl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-06-05T16:27:15Z","title":"Towards designing artificial universes for artificial agents under interaction closure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1502","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:9a9b943f435732610dae70b9eff4e6ce394014a3e6f579bc82ed25bf1c46270c","target":"record","created_at":"2026-05-18T01:14:36Z","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":"098cff26e74f1b39eb63afa02c56e355173f4eadba3135f648ba2caeb732ee29","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2014-06-05T16:27:15Z","title_canon_sha256":"627b4b6f0c1a112eb1d4df40bae136137c779bbd09bbe00a9bec331f55ee13b9"},"schema_version":"1.0","source":{"id":"1406.1502","kind":"arxiv","version":1}},"canonical_sha256":"33aa69d21687854c1f641e238b03270937a2b452ba3ee77c590d179d84f1b42b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33aa69d21687854c1f641e238b03270937a2b452ba3ee77c590d179d84f1b42b","first_computed_at":"2026-05-18T01:14:36.285172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:36.285172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KthJeZ5cq5t02Ju6VxvQ2cEqLZDH0FXsXwRY+x/wKianB4Uq/rYiUgloybGbVz3aldyWnbiy88QAWe6lUe6SCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:36.285902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a9b943f435732610dae70b9eff4e6ce394014a3e6f579bc82ed25bf1c46270c","sha256:01e6ee7728a15eac22af9043a23ba0eb535c5ef722546f8e5849fa8a77052566"],"state_sha256":"c08f7d863d04b701986a32a4a76bff3fbd9a2fb2aac3462ee45388270cd5fed3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GaQ5QMbnd6lO4sEzPkbQQXWp+RqlwDcvzMgUG4kuwFhRd3uLLLMmEApve1/QW2XYIVzVkNATM9CIld4il3fWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:48:59.488904Z","bundle_sha256":"ad6a8abdfd51fc275814692fba2b6c59bc99c39d4e60080804f0a96093e9f843"}}