{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VI65RZSMBOREDIBAPSMXO6HZXE","short_pith_number":"pith:VI65RZSM","canonical_record":{"source":{"id":"1104.4141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-04-20T23:51:19Z","cross_cats_sorted":["cs.NE","nlin.AO"],"title_canon_sha256":"7cd23c4f9388f9cba1b0b1b8262b32ceec226d0baabfa88b66b5d77abbe22f2b","abstract_canon_sha256":"fc657f47f3956b7f329b0b05ceb53fa6dc453769a9162754ed7df91e8ee70a65"},"schema_version":"1.0"},"canonical_sha256":"aa3dd8e64c0ba241a0207c997778f9b93c820a38333f6954fd6c4376956c90d3","source":{"kind":"arxiv","id":"1104.4141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4141","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4141v2","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4141","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"VI65RZSMBORE","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VI65RZSMBOREDIBA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VI65RZSM","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VI65RZSMBOREDIBAPSMXO6HZXE","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-04-20T23:51:19Z","cross_cats_sorted":["cs.NE","nlin.AO"],"title_canon_sha256":"7cd23c4f9388f9cba1b0b1b8262b32ceec226d0baabfa88b66b5d77abbe22f2b","abstract_canon_sha256":"fc657f47f3956b7f329b0b05ceb53fa6dc453769a9162754ed7df91e8ee70a65"},"schema_version":"1.0"},"canonical_sha256":"aa3dd8e64c0ba241a0207c997778f9b93c820a38333f6954fd6c4376956c90d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:01.692979Z","signature_b64":"pIqN62kEMJ1VykeH9jrKys/ozeZVNpShID7VgQ5KAqOQYrWuRUEgyEUYFchRMwv5ncXoPeqTr0i7IxRqe9iRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa3dd8e64c0ba241a0207c997778f9b93c820a38333f6954fd6c4376956c90d3","last_reissued_at":"2026-05-18T02:22:01.692134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:01.692134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4141","source_version":2,"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:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJG+TralPEm9YDL96OAfBy07nqYpLA7L73O4GfCe7rdSW8KfHsHn/dAeUjlN3+taRGGhvQlUIwJ1Wed+Km2cCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:39:01.692558Z"},"content_sha256":"8ad3075872ef17e5eff32e31fb68937e213ecacabef3c647904578c7d5d9c8bd","schema_version":"1.0","event_id":"sha256:8ad3075872ef17e5eff32e31fb68937e213ecacabef3c647904578c7d5d9c8bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VI65RZSMBOREDIBAPSMXO6HZXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Emergent Criticality Through Adaptive Information Processing in Boolean Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","nlin.AO"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alireza Goudarzi, Christof Teuscher, Natali Gulbahce, Thimo Rohlf","submitted_at":"2011-04-20T23:51:19Z","abstract_excerpt":"We study information processing in populations of Boolean networks with evolving connectivity and systematically explore the interplay between the learning capability, robustness, the network topology, and the task complexity. We solve a long-standing open question and find computationally that, for large system sizes $N$, adaptive information processing drives the networks to a critical connectivity $K_{c}=2$. For finite size networks, the connectivity approaches the critical value with a power-law of the system size $N$. We show that network learning and generalization are optimized near cri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4141","kind":"arxiv","version":2},"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:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPAEsM2PATnIQ1RLle4LK7cxL0P1VwpRhcELliQl55lMwBCJbHkSiAAc4SoG4yvghj4ZVNN6Ai2y6nK4/F6VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:39:01.693108Z"},"content_sha256":"d6b1ae8d29f6462c09ae48e5c19877ee7a7b6e6aa594f755aeeb59c71ee0f32e","schema_version":"1.0","event_id":"sha256:d6b1ae8d29f6462c09ae48e5c19877ee7a7b6e6aa594f755aeeb59c71ee0f32e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VI65RZSMBOREDIBAPSMXO6HZXE/bundle.json","state_url":"https://pith.science/pith/VI65RZSMBOREDIBAPSMXO6HZXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VI65RZSMBOREDIBAPSMXO6HZXE/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-26T09:39:01Z","links":{"resolver":"https://pith.science/pith/VI65RZSMBOREDIBAPSMXO6HZXE","bundle":"https://pith.science/pith/VI65RZSMBOREDIBAPSMXO6HZXE/bundle.json","state":"https://pith.science/pith/VI65RZSMBOREDIBAPSMXO6HZXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VI65RZSMBOREDIBAPSMXO6HZXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VI65RZSMBOREDIBAPSMXO6HZXE","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":"fc657f47f3956b7f329b0b05ceb53fa6dc453769a9162754ed7df91e8ee70a65","cross_cats_sorted":["cs.NE","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-04-20T23:51:19Z","title_canon_sha256":"7cd23c4f9388f9cba1b0b1b8262b32ceec226d0baabfa88b66b5d77abbe22f2b"},"schema_version":"1.0","source":{"id":"1104.4141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4141","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4141v2","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4141","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"VI65RZSMBORE","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VI65RZSMBOREDIBA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VI65RZSM","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:d6b1ae8d29f6462c09ae48e5c19877ee7a7b6e6aa594f755aeeb59c71ee0f32e","target":"graph","created_at":"2026-05-18T02:22:01Z","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 study information processing in populations of Boolean networks with evolving connectivity and systematically explore the interplay between the learning capability, robustness, the network topology, and the task complexity. We solve a long-standing open question and find computationally that, for large system sizes $N$, adaptive information processing drives the networks to a critical connectivity $K_{c}=2$. For finite size networks, the connectivity approaches the critical value with a power-law of the system size $N$. We show that network learning and generalization are optimized near cri","authors_text":"Alireza Goudarzi, Christof Teuscher, Natali Gulbahce, Thimo Rohlf","cross_cats":["cs.NE","nlin.AO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-04-20T23:51:19Z","title":"Emergent Criticality Through Adaptive Information Processing in Boolean Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4141","kind":"arxiv","version":2},"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:8ad3075872ef17e5eff32e31fb68937e213ecacabef3c647904578c7d5d9c8bd","target":"record","created_at":"2026-05-18T02:22:01Z","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":"fc657f47f3956b7f329b0b05ceb53fa6dc453769a9162754ed7df91e8ee70a65","cross_cats_sorted":["cs.NE","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-04-20T23:51:19Z","title_canon_sha256":"7cd23c4f9388f9cba1b0b1b8262b32ceec226d0baabfa88b66b5d77abbe22f2b"},"schema_version":"1.0","source":{"id":"1104.4141","kind":"arxiv","version":2}},"canonical_sha256":"aa3dd8e64c0ba241a0207c997778f9b93c820a38333f6954fd6c4376956c90d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa3dd8e64c0ba241a0207c997778f9b93c820a38333f6954fd6c4376956c90d3","first_computed_at":"2026-05-18T02:22:01.692134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:01.692134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pIqN62kEMJ1VykeH9jrKys/ozeZVNpShID7VgQ5KAqOQYrWuRUEgyEUYFchRMwv5ncXoPeqTr0i7IxRqe9iRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:01.692979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ad3075872ef17e5eff32e31fb68937e213ecacabef3c647904578c7d5d9c8bd","sha256:d6b1ae8d29f6462c09ae48e5c19877ee7a7b6e6aa594f755aeeb59c71ee0f32e"],"state_sha256":"8651c09025a24e033d9d5b85add4af6bd06af24f754e52dd09cf1d3c1472f0cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KS1j6oOiBOFym6uihg59OHv2RE4HMBAkMSURULKI8uwfY6leMAyXjye9sYXoE4lputpCQ4Sh0A4PdC/tg2+uDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:39:01.697146Z","bundle_sha256":"59dc8da0ba0212b65a573d2a3edd587e0c51b7228bb322db16d676dc5b334327"}}