{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3CAJYEAQ4PZYGJXDPOICQAUCZG","short_pith_number":"pith:3CAJYEAQ","schema_version":"1.0","canonical_sha256":"d8809c1010e3f38326e37b90280282c9967acf6419c99c2e1a4cf46b1aba3853","source":{"kind":"arxiv","id":"1708.09149","version":8},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.09149","created_at":"2026-05-17T23:51:00.180013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09149v8","created_at":"2026-05-17T23:51:00.180013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09149","created_at":"2026-05-17T23:51:00.180013+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CAJYEAQ4PZY","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CAJYEAQ4PZYGJXD","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CAJYEAQ","created_at":"2026-05-18T12:30:58.224056+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/3CAJYEAQ4PZYGJXDPOICQAUCZG","json":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG.json","graph_json":"https://pith.science/api/pith-number/3CAJYEAQ4PZYGJXDPOICQAUCZG/graph.json","events_json":"https://pith.science/api/pith-number/3CAJYEAQ4PZYGJXDPOICQAUCZG/events.json","paper":"https://pith.science/paper/3CAJYEAQ"},"agent_actions":{"view_html":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG","download_json":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG.json","view_paper":"https://pith.science/paper/3CAJYEAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09149&json=true","fetch_graph":"https://pith.science/api/pith-number/3CAJYEAQ4PZYGJXDPOICQAUCZG/graph.json","fetch_events":"https://pith.science/api/pith-number/3CAJYEAQ4PZYGJXDPOICQAUCZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/action/storage_attestation","attest_author":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/action/author_attestation","sign_citation":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/action/citation_signature","submit_replication":"https://pith.science/pith/3CAJYEAQ4PZYGJXDPOICQAUCZG/action/replication_record"}},"created_at":"2026-05-17T23:51:00.180013+00:00","updated_at":"2026-05-17T23:51:00.180013+00:00"}