{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WY6S3SSWCNBUEV5V2D3FDN7EOX","short_pith_number":"pith:WY6S3SSW","canonical_record":{"source":{"id":"1310.5747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-21T22:27:53Z","cross_cats_sorted":[],"title_canon_sha256":"84fc26de932788bbb807695795d8d1161e9f19dd4be7707cd978d44166a1f5f8","abstract_canon_sha256":"4a5b6b15fad97c37213a40673358b3105605eeabc65f81d11cd9ede589340760"},"schema_version":"1.0"},"canonical_sha256":"b63d2dca5613434257b5d0f651b7e475ff6c51a9dd979f3353828290b9a27aeb","source":{"kind":"arxiv","id":"1310.5747","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5747","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5747v2","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5747","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"pith_short_12","alias_value":"WY6S3SSWCNBU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WY6S3SSWCNBUEV5V","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WY6S3SSW","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WY6S3SSWCNBUEV5V2D3FDN7EOX","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-21T22:27:53Z","cross_cats_sorted":[],"title_canon_sha256":"84fc26de932788bbb807695795d8d1161e9f19dd4be7707cd978d44166a1f5f8","abstract_canon_sha256":"4a5b6b15fad97c37213a40673358b3105605eeabc65f81d11cd9ede589340760"},"schema_version":"1.0"},"canonical_sha256":"b63d2dca5613434257b5d0f651b7e475ff6c51a9dd979f3353828290b9a27aeb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:45.539603Z","signature_b64":"Ck5JUaH1mYVjb5Z02s/usK1F3Xpp2PUMmH5glD+t/oB1dEKZnjIblRJevL5APVoepisR50CLQZSc1t6Hna+lBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b63d2dca5613434257b5d0f651b7e475ff6c51a9dd979f3353828290b9a27aeb","last_reissued_at":"2026-05-18T02:58:45.538875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:45.538875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5747","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:58:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xbow3At4+UdUJbNw6F/fRdLQ+WNXksyK5ebGtoUWUlax48tr2f4WrRw3GI85RzZrAXtt89IYeXQn3R8GlR/3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:16:28.264282Z"},"content_sha256":"938565b07bd3de792d996ed3c9b0cf36e4ebcebc2ea583c91a484cf83cc6e85f","schema_version":"1.0","event_id":"sha256:938565b07bd3de792d996ed3c9b0cf36e4ebcebc2ea583c91a484cf83cc6e85f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WY6S3SSWCNBUEV5V2D3FDN7EOX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Full characterisation of attractors of two intersected asynchronous Boolean automata cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Damien Regnault, J\\'er\\'emy Sobieraj, Mathilde Noual, Sylvain Sen\\'e, Tarek Melliti","submitted_at":"2013-10-21T22:27:53Z","abstract_excerpt":"The understanding of Boolean automata networks dynamics takes an important place in various domains of computer science such as computability, complexity and discrete dynamical systems. In this paper, we make a step further in this understanding by focusing on their cycles, whose necessity in networks is known as the brick of their complexity. We present new results that provide a characterisation of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect at one automaton, the so-called double-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5747","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:58:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uHQE9bNsGX3PvvJyYdbNvdIktZCyZIvseRjsGrMwLxmOHM/lseaaY/D7wk7YSY0bG+w4rfWtcFSTtXFYd9y2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:16:28.264981Z"},"content_sha256":"7b65a9abd4ded8cea0c000aa4d1b8e8a57e01d7c36f97a290472d00cd0f6ed17","schema_version":"1.0","event_id":"sha256:7b65a9abd4ded8cea0c000aa4d1b8e8a57e01d7c36f97a290472d00cd0f6ed17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WY6S3SSWCNBUEV5V2D3FDN7EOX/bundle.json","state_url":"https://pith.science/pith/WY6S3SSWCNBUEV5V2D3FDN7EOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WY6S3SSWCNBUEV5V2D3FDN7EOX/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-25T23:16:28Z","links":{"resolver":"https://pith.science/pith/WY6S3SSWCNBUEV5V2D3FDN7EOX","bundle":"https://pith.science/pith/WY6S3SSWCNBUEV5V2D3FDN7EOX/bundle.json","state":"https://pith.science/pith/WY6S3SSWCNBUEV5V2D3FDN7EOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WY6S3SSWCNBUEV5V2D3FDN7EOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WY6S3SSWCNBUEV5V2D3FDN7EOX","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":"4a5b6b15fad97c37213a40673358b3105605eeabc65f81d11cd9ede589340760","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-21T22:27:53Z","title_canon_sha256":"84fc26de932788bbb807695795d8d1161e9f19dd4be7707cd978d44166a1f5f8"},"schema_version":"1.0","source":{"id":"1310.5747","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5747","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5747v2","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5747","created_at":"2026-05-18T02:58:45Z"},{"alias_kind":"pith_short_12","alias_value":"WY6S3SSWCNBU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WY6S3SSWCNBUEV5V","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WY6S3SSW","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:7b65a9abd4ded8cea0c000aa4d1b8e8a57e01d7c36f97a290472d00cd0f6ed17","target":"graph","created_at":"2026-05-18T02:58:45Z","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":"The understanding of Boolean automata networks dynamics takes an important place in various domains of computer science such as computability, complexity and discrete dynamical systems. In this paper, we make a step further in this understanding by focusing on their cycles, whose necessity in networks is known as the brick of their complexity. We present new results that provide a characterisation of the transient and asymptotic dynamics, i.e. of the computational abilities, of asynchronous Boolean automata networks composed of two cycles that intersect at one automaton, the so-called double-c","authors_text":"Damien Regnault, J\\'er\\'emy Sobieraj, Mathilde Noual, Sylvain Sen\\'e, Tarek Melliti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-21T22:27:53Z","title":"Full characterisation of attractors of two intersected asynchronous Boolean automata cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5747","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:938565b07bd3de792d996ed3c9b0cf36e4ebcebc2ea583c91a484cf83cc6e85f","target":"record","created_at":"2026-05-18T02:58:45Z","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":"4a5b6b15fad97c37213a40673358b3105605eeabc65f81d11cd9ede589340760","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-21T22:27:53Z","title_canon_sha256":"84fc26de932788bbb807695795d8d1161e9f19dd4be7707cd978d44166a1f5f8"},"schema_version":"1.0","source":{"id":"1310.5747","kind":"arxiv","version":2}},"canonical_sha256":"b63d2dca5613434257b5d0f651b7e475ff6c51a9dd979f3353828290b9a27aeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b63d2dca5613434257b5d0f651b7e475ff6c51a9dd979f3353828290b9a27aeb","first_computed_at":"2026-05-18T02:58:45.538875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:45.538875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ck5JUaH1mYVjb5Z02s/usK1F3Xpp2PUMmH5glD+t/oB1dEKZnjIblRJevL5APVoepisR50CLQZSc1t6Hna+lBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:45.539603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5747","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:938565b07bd3de792d996ed3c9b0cf36e4ebcebc2ea583c91a484cf83cc6e85f","sha256:7b65a9abd4ded8cea0c000aa4d1b8e8a57e01d7c36f97a290472d00cd0f6ed17"],"state_sha256":"e7ee25008ff14c7af854f628fb0445fa344bb0e474efea880424a2bef144c9bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hUtUwLu4Vjw7+ms6caiqWQsB4WwSHY4E6rY5exl/TZWR6wHjphbtHm6j0s+iDBttUR4/o2A12a+kl54BCTQFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:16:28.268697Z","bundle_sha256":"82ff50ce9dd0daac21f6430e05ce0c91799aed74ebe722c4ee24d8ffe99b7bed"}}