{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3CAJYEAQ4PZYGJXDPOICQAUCZG","short_pith_number":"pith:3CAJYEAQ","canonical_record":{"source":{"id":"1708.09149","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-30T07:54:52Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"a3561748013180f1e3413e4480c6adffc42d6573079663bad54df4dd699a2f9c","abstract_canon_sha256":"402199d25a11e21ea518c01e74e9d97c91eb3192b7d3099b3e8484bc93610987"},"schema_version":"1.0"},"canonical_sha256":"d8809c1010e3f38326e37b90280282c9967acf6419c99c2e1a4cf46b1aba3853","source":{"kind":"arxiv","id":"1708.09149","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09149","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09149v8","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09149","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"3CAJYEAQ4PZY","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3CAJYEAQ4PZYGJXD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3CAJYEAQ","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3CAJYEAQ4PZYGJXDPOICQAUCZG","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09149","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-30T07:54:52Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"a3561748013180f1e3413e4480c6adffc42d6573079663bad54df4dd699a2f9c","abstract_canon_sha256":"402199d25a11e21ea518c01e74e9d97c91eb3192b7d3099b3e8484bc93610987"},"schema_version":"1.0"},"canonical_sha256":"d8809c1010e3f38326e37b90280282c9967acf6419c99c2e1a4cf46b1aba3853","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:00.180473Z","signature_b64":"em3T95/xevpn30DQVZJByOr4D2x0fmCgGoNQeE0nCXoqxpfs+Hdw4NtLYVMM20jNZoKY/FltTcKkIgzvFTNcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8809c1010e3f38326e37b90280282c9967acf6419c99c2e1a4cf46b1aba3853","last_reissued_at":"2026-05-17T23:51:00.179930Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:00.179930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09149","source_version":8,"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-17T23:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+o/PwfMh4hWofPjnD0uQo50zx84gCa27QkiCFF8DWGsL7vLOOo9vtqQJNfI/quGGbooM476q16/93ElKBuNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T19:54:58.930338Z"},"content_sha256":"25c02930dd641d32e7fdc98ebb206bd1bfa21a2b5c7449f33f9c1b5aea2e757e","schema_version":"1.0","event_id":"sha256:25c02930dd641d32e7fdc98ebb206bd1bfa21a2b5c7449f33f9c1b5aea2e757e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3CAJYEAQ4PZYGJXDPOICQAUCZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Networks: central time to trigger expected emergent open-endedness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Artur Ziviani, Felipe S. Abrah\\~ao, Klaus Wehmuth","submitted_at":"2017-08-30T07:54:52Z","abstract_excerpt":"This article investigates emergence and complexity in complex systems that can share information on a network. To this end, we use a theoretical approach from information theory, computability theory, and complex networks. One key studied question is how much emergent complexity (or information) arises when a population of computable systems is networked compared with when this population is isolated. First, we define a general model for networked theoretical machines, which we call algorithmic networks. Then, we narrow our scope to investigate algorithmic networks that optimize the average fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09149","kind":"arxiv","version":8},"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-17T23:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70SSY55vqWosvi/d5Cnmgo7Lhs6sFXG+NrpeaIyqGqOiSeJar7OSqHJHUaL12Z/sZ0Y8yxduDfzS98klr/3ACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T19:54:58.930687Z"},"content_sha256":"6990d813459125cfb63133385b518412150ce766eb0af924f30924770b56984f","schema_version":"1.0","event_id":"sha256:6990d813459125cfb63133385b518412150ce766eb0af924f30924770b56984f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/bundle.json","state_url":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/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-22T19:54:58Z","links":{"resolver":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG","bundle":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/bundle.json","state":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3CAJYEAQ4PZYGJXDPOICQAUCZG","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":"402199d25a11e21ea518c01e74e9d97c91eb3192b7d3099b3e8484bc93610987","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-30T07:54:52Z","title_canon_sha256":"a3561748013180f1e3413e4480c6adffc42d6573079663bad54df4dd699a2f9c"},"schema_version":"1.0","source":{"id":"1708.09149","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09149","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09149v8","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09149","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"3CAJYEAQ4PZY","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3CAJYEAQ4PZYGJXD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3CAJYEAQ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:6990d813459125cfb63133385b518412150ce766eb0af924f30924770b56984f","target":"graph","created_at":"2026-05-17T23:51:00Z","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":"This article investigates emergence and complexity in complex systems that can share information on a network. To this end, we use a theoretical approach from information theory, computability theory, and complex networks. One key studied question is how much emergent complexity (or information) arises when a population of computable systems is networked compared with when this population is isolated. First, we define a general model for networked theoretical machines, which we call algorithmic networks. Then, we narrow our scope to investigate algorithmic networks that optimize the average fi","authors_text":"Artur Ziviani, Felipe S. Abrah\\~ao, Klaus Wehmuth","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-30T07:54:52Z","title":"Algorithmic Networks: central time to trigger expected emergent open-endedness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09149","kind":"arxiv","version":8},"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:25c02930dd641d32e7fdc98ebb206bd1bfa21a2b5c7449f33f9c1b5aea2e757e","target":"record","created_at":"2026-05-17T23:51:00Z","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":"402199d25a11e21ea518c01e74e9d97c91eb3192b7d3099b3e8484bc93610987","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-30T07:54:52Z","title_canon_sha256":"a3561748013180f1e3413e4480c6adffc42d6573079663bad54df4dd699a2f9c"},"schema_version":"1.0","source":{"id":"1708.09149","kind":"arxiv","version":8}},"canonical_sha256":"d8809c1010e3f38326e37b90280282c9967acf6419c99c2e1a4cf46b1aba3853","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8809c1010e3f38326e37b90280282c9967acf6419c99c2e1a4cf46b1aba3853","first_computed_at":"2026-05-17T23:51:00.179930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:00.179930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"em3T95/xevpn30DQVZJByOr4D2x0fmCgGoNQeE0nCXoqxpfs+Hdw4NtLYVMM20jNZoKY/FltTcKkIgzvFTNcDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:00.180473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09149","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25c02930dd641d32e7fdc98ebb206bd1bfa21a2b5c7449f33f9c1b5aea2e757e","sha256:6990d813459125cfb63133385b518412150ce766eb0af924f30924770b56984f"],"state_sha256":"283ba9ae654d7d9a9685519da2801650f3fbafff5b3fdc8bc237285e08ff3316"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/347JWN5nqTKhsHSPLAqyDT/H0uJBhM2kC/W5B9qE0rqjD7qsTHnoExLwGV/zGOPf+ZlYvqnLOehRgSWmmDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T19:54:58.932629Z","bundle_sha256":"54d8f5e444cad741b36aa2544ef744b16f59af1e6fd104f6448a7f50e2a74419"}}