{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QN6QJLAAIJ76QC5CHXPXOWAS4K","short_pith_number":"pith:QN6QJLAA","canonical_record":{"source":{"id":"1101.6018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-01-31T16:55:58Z","cross_cats_sorted":["nlin.AO"],"title_canon_sha256":"ee818c95f3f875ecc829ebf4183bbb347508cee842fdcee559f7627e08ce1f52","abstract_canon_sha256":"d87f07e4176935c1fe0409a38ef2998c6976fae206dd537d77f521e7ccb6e927"},"schema_version":"1.0"},"canonical_sha256":"837d04ac00427fe80ba23ddf775812e2b6044aa660a6ebab73aad9cb9e8f7412","source":{"kind":"arxiv","id":"1101.6018","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.6018","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1101.6018v1","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.6018","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"QN6QJLAAIJ76","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QN6QJLAAIJ76QC5C","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QN6QJLAA","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QN6QJLAAIJ76QC5CHXPXOWAS4K","target":"record","payload":{"canonical_record":{"source":{"id":"1101.6018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-01-31T16:55:58Z","cross_cats_sorted":["nlin.AO"],"title_canon_sha256":"ee818c95f3f875ecc829ebf4183bbb347508cee842fdcee559f7627e08ce1f52","abstract_canon_sha256":"d87f07e4176935c1fe0409a38ef2998c6976fae206dd537d77f521e7ccb6e927"},"schema_version":"1.0"},"canonical_sha256":"837d04ac00427fe80ba23ddf775812e2b6044aa660a6ebab73aad9cb9e8f7412","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:24.423490Z","signature_b64":"14+b3qDEKTgHjOWlUGWmVTSXAbiBBsKrr81pvQ20Ur5OlboaNm8T7gOP77ehqMOMMI9u7511yC+6abeBubxCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837d04ac00427fe80ba23ddf775812e2b6044aa660a6ebab73aad9cb9e8f7412","last_reissued_at":"2026-05-18T04:30:24.422825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:24.422825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.6018","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-18T04:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVtmlJwpEA4UWSoPdi6OqO5nww948j/mKgZu3k2wVa1fjxOB4d3FNL+jabzlJJUG8jFUyXi2XtezyWbU3Ps5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:19:10.651113Z"},"content_sha256":"b41b66592ca032ec23d9e39d2451f8071b751a7f96d4ae5fbe0372bb664e76a8","schema_version":"1.0","event_id":"sha256:b41b66592ca032ec23d9e39d2451f8071b751a7f96d4ae5fbe0372bb664e76a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QN6QJLAAIJ76QC5CHXPXOWAS4K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boolean Networks Design by Genetic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.AO"],"primary_cat":"cs.NE","authors_text":"Andrea Roli, Cristian Arcaroli, Marco Lazzarini, Stefano Benedettini","submitted_at":"2011-01-31T16:55:58Z","abstract_excerpt":"We present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with the aim of finding a network such that the attractor it reaches is of required length $l$. In general, any target can be defined, provided that it is possible to model the task as an optimisation problem over the space of networks. We experiment with different initial conditions for the networks, namely in ordered, chaotic and critical regions, and also with different target length values. Results show that all kinds of initia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.6018","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-18T04:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"at9y4QH3nhBcR4BXwqOT75VbLVyzs01a2vBxHn6p65nMqujzR1NtPW26J76plV/2LPvl4fo6f4b6sqlQS2zbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:19:10.651988Z"},"content_sha256":"0fb6a4eb6aac04096a661ba4b038a9b2baffc524ba73581ce2f19d178131761a","schema_version":"1.0","event_id":"sha256:0fb6a4eb6aac04096a661ba4b038a9b2baffc524ba73581ce2f19d178131761a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QN6QJLAAIJ76QC5CHXPXOWAS4K/bundle.json","state_url":"https://pith.science/pith/QN6QJLAAIJ76QC5CHXPXOWAS4K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QN6QJLAAIJ76QC5CHXPXOWAS4K/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-08T21:19:10Z","links":{"resolver":"https://pith.science/pith/QN6QJLAAIJ76QC5CHXPXOWAS4K","bundle":"https://pith.science/pith/QN6QJLAAIJ76QC5CHXPXOWAS4K/bundle.json","state":"https://pith.science/pith/QN6QJLAAIJ76QC5CHXPXOWAS4K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QN6QJLAAIJ76QC5CHXPXOWAS4K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QN6QJLAAIJ76QC5CHXPXOWAS4K","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":"d87f07e4176935c1fe0409a38ef2998c6976fae206dd537d77f521e7ccb6e927","cross_cats_sorted":["nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-01-31T16:55:58Z","title_canon_sha256":"ee818c95f3f875ecc829ebf4183bbb347508cee842fdcee559f7627e08ce1f52"},"schema_version":"1.0","source":{"id":"1101.6018","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.6018","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1101.6018v1","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.6018","created_at":"2026-05-18T04:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"QN6QJLAAIJ76","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QN6QJLAAIJ76QC5C","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QN6QJLAA","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:0fb6a4eb6aac04096a661ba4b038a9b2baffc524ba73581ce2f19d178131761a","target":"graph","created_at":"2026-05-18T04:30:24Z","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 present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with the aim of finding a network such that the attractor it reaches is of required length $l$. In general, any target can be defined, provided that it is possible to model the task as an optimisation problem over the space of networks. We experiment with different initial conditions for the networks, namely in ordered, chaotic and critical regions, and also with different target length values. Results show that all kinds of initia","authors_text":"Andrea Roli, Cristian Arcaroli, Marco Lazzarini, Stefano Benedettini","cross_cats":["nlin.AO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-01-31T16:55:58Z","title":"Boolean Networks Design by Genetic Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.6018","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:b41b66592ca032ec23d9e39d2451f8071b751a7f96d4ae5fbe0372bb664e76a8","target":"record","created_at":"2026-05-18T04:30:24Z","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":"d87f07e4176935c1fe0409a38ef2998c6976fae206dd537d77f521e7ccb6e927","cross_cats_sorted":["nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2011-01-31T16:55:58Z","title_canon_sha256":"ee818c95f3f875ecc829ebf4183bbb347508cee842fdcee559f7627e08ce1f52"},"schema_version":"1.0","source":{"id":"1101.6018","kind":"arxiv","version":1}},"canonical_sha256":"837d04ac00427fe80ba23ddf775812e2b6044aa660a6ebab73aad9cb9e8f7412","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"837d04ac00427fe80ba23ddf775812e2b6044aa660a6ebab73aad9cb9e8f7412","first_computed_at":"2026-05-18T04:30:24.422825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:24.422825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"14+b3qDEKTgHjOWlUGWmVTSXAbiBBsKrr81pvQ20Ur5OlboaNm8T7gOP77ehqMOMMI9u7511yC+6abeBubxCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:24.423490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.6018","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b41b66592ca032ec23d9e39d2451f8071b751a7f96d4ae5fbe0372bb664e76a8","sha256:0fb6a4eb6aac04096a661ba4b038a9b2baffc524ba73581ce2f19d178131761a"],"state_sha256":"64471e8709cd3c66e41bc84efb0baf95f8c10607ff4e6341d74360aede4ee847"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Baqfr8y/ZgTCBCRglU74i8FaDbm1Jv7WII0lX1flBCEh7i3ifeS51EJetpnjVxFaffaabXor8y7wjn1ypumpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:19:10.656242Z","bundle_sha256":"980687931f6782889e5ac1a011320fc45c30276092a66fb2e38d292a35832630"}}