{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GAU5YRDXDF27KC7UGUUP6ZDLHF","short_pith_number":"pith:GAU5YRDX","canonical_record":{"source":{"id":"1302.3008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-02-13T08:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"f9d71fcd1e4c18a2650881d297b5aa0ebf695aab8dc672844c7460ee8f7caa91","abstract_canon_sha256":"f34b749ed7784183fff01d2967b500cdde002aced61a5fa2eb85e9d2c3fa4449"},"schema_version":"1.0"},"canonical_sha256":"3029dc44771975f50bf43528ff646b39462c895cb4fc3e56bd5d646eddb0ab7f","source":{"kind":"arxiv","id":"1302.3008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3008","created_at":"2026-05-18T03:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3008v1","created_at":"2026-05-18T03:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3008","created_at":"2026-05-18T03:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"GAU5YRDXDF27","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GAU5YRDXDF27KC7U","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GAU5YRDX","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GAU5YRDXDF27KC7UGUUP6ZDLHF","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-02-13T08:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"f9d71fcd1e4c18a2650881d297b5aa0ebf695aab8dc672844c7460ee8f7caa91","abstract_canon_sha256":"f34b749ed7784183fff01d2967b500cdde002aced61a5fa2eb85e9d2c3fa4449"},"schema_version":"1.0"},"canonical_sha256":"3029dc44771975f50bf43528ff646b39462c895cb4fc3e56bd5d646eddb0ab7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:49.046290Z","signature_b64":"GlTZfglqV7OniWgBGImED9urNaLBz9hLmRVxbidLOeiO+TUW9jZdg5VlWsrFWrx112liEUZI6wThzyySezknCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3029dc44771975f50bf43528ff646b39462c895cb4fc3e56bd5d646eddb0ab7f","last_reissued_at":"2026-05-18T03:33:49.045526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:49.045526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3008","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-18T03:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5qf3nl+gkOEoDUYlrwSEdNvRzTwnbjbQdY090IM3zj0FGE2xbVAdEAV7i/mEZfTOS0Au3vgg+hL2mr5kODwSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:45:30.602438Z"},"content_sha256":"66e5a16ca35ba478b81af6ae05f590a91e3e76266309f9d730f45d316371e1b2","schema_version":"1.0","event_id":"sha256:66e5a16ca35ba478b81af6ae05f590a91e3e76266309f9d730f45d316371e1b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GAU5YRDXDF27KC7UGUUP6ZDLHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Boolean systems with generically long attractors I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Maciej Malicki, Winfried Just","submitted_at":"2013-02-13T08:07:01Z","abstract_excerpt":"We study the class of cooperative Boolean networks whose only regulatory functions are COPY, binary AND, and binary OR. We prove that for all sufficiently large N and c < 2 there exist Boolean networks in this class that have an attractor of length > c^N whose basin of attraction comprises an arbitrarily large fraction of the state space. The existence of such networks contrasts with results on various other types of dynamical systems that show nongenericity or absence of non-steady state attractors under the assumption of cooperativity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3008","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-18T03:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QzQf78A1wQ3EKhbau7CTnj8pXW6Wxfw3Dr471BwSr7pr4xa/7rsyPRLNBdcJoUtmvtB+lITC/aSunoLD9TJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:45:30.603096Z"},"content_sha256":"9ff65233f71eabac157ad162f45c920fd01cad57e14adefd876f05f71242bbea","schema_version":"1.0","event_id":"sha256:9ff65233f71eabac157ad162f45c920fd01cad57e14adefd876f05f71242bbea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAU5YRDXDF27KC7UGUUP6ZDLHF/bundle.json","state_url":"https://pith.science/pith/GAU5YRDXDF27KC7UGUUP6ZDLHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAU5YRDXDF27KC7UGUUP6ZDLHF/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-27T13:45:30Z","links":{"resolver":"https://pith.science/pith/GAU5YRDXDF27KC7UGUUP6ZDLHF","bundle":"https://pith.science/pith/GAU5YRDXDF27KC7UGUUP6ZDLHF/bundle.json","state":"https://pith.science/pith/GAU5YRDXDF27KC7UGUUP6ZDLHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAU5YRDXDF27KC7UGUUP6ZDLHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GAU5YRDXDF27KC7UGUUP6ZDLHF","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":"f34b749ed7784183fff01d2967b500cdde002aced61a5fa2eb85e9d2c3fa4449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-02-13T08:07:01Z","title_canon_sha256":"f9d71fcd1e4c18a2650881d297b5aa0ebf695aab8dc672844c7460ee8f7caa91"},"schema_version":"1.0","source":{"id":"1302.3008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3008","created_at":"2026-05-18T03:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3008v1","created_at":"2026-05-18T03:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3008","created_at":"2026-05-18T03:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"GAU5YRDXDF27","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GAU5YRDXDF27KC7U","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GAU5YRDX","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:9ff65233f71eabac157ad162f45c920fd01cad57e14adefd876f05f71242bbea","target":"graph","created_at":"2026-05-18T03:33:49Z","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 the class of cooperative Boolean networks whose only regulatory functions are COPY, binary AND, and binary OR. We prove that for all sufficiently large N and c < 2 there exist Boolean networks in this class that have an attractor of length > c^N whose basin of attraction comprises an arbitrarily large fraction of the state space. The existence of such networks contrasts with results on various other types of dynamical systems that show nongenericity or absence of non-steady state attractors under the assumption of cooperativity.","authors_text":"Maciej Malicki, Winfried Just","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-02-13T08:07:01Z","title":"Cooperative Boolean systems with generically long attractors I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3008","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:66e5a16ca35ba478b81af6ae05f590a91e3e76266309f9d730f45d316371e1b2","target":"record","created_at":"2026-05-18T03:33:49Z","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":"f34b749ed7784183fff01d2967b500cdde002aced61a5fa2eb85e9d2c3fa4449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2013-02-13T08:07:01Z","title_canon_sha256":"f9d71fcd1e4c18a2650881d297b5aa0ebf695aab8dc672844c7460ee8f7caa91"},"schema_version":"1.0","source":{"id":"1302.3008","kind":"arxiv","version":1}},"canonical_sha256":"3029dc44771975f50bf43528ff646b39462c895cb4fc3e56bd5d646eddb0ab7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3029dc44771975f50bf43528ff646b39462c895cb4fc3e56bd5d646eddb0ab7f","first_computed_at":"2026-05-18T03:33:49.045526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:49.045526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GlTZfglqV7OniWgBGImED9urNaLBz9hLmRVxbidLOeiO+TUW9jZdg5VlWsrFWrx112liEUZI6wThzyySezknCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:49.046290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66e5a16ca35ba478b81af6ae05f590a91e3e76266309f9d730f45d316371e1b2","sha256:9ff65233f71eabac157ad162f45c920fd01cad57e14adefd876f05f71242bbea"],"state_sha256":"cf33d58a292a9789909856d389202cef8c83541c4582dcc711638c551fc7b7ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGTbkUBarFMLCSKQiaEk1pbaoW+tI73wLKor8/KFm9LjkqBTx3u3VYdRsIrulVDPoUsRnWsvN0H9bidSVG7PCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:45:30.606076Z","bundle_sha256":"92d39ff3a206e18eeeaf8e153db4525942e5891c2f565729b17e14efadb6b1aa"}}