{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:F4IMBU2N5CB3ORLZS2Z7LEUFT3","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":"1dcdec0d1f7d28c267b11a021a0e3cdf9d18c864ebade33d591c17cf29a56bab","cross_cats_sorted":["cs.DM","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-29T13:17:52Z","title_canon_sha256":"1ea80511b2ebb9dd7a3ae4146cecce0fcab11d37cc37b2d9bd49163a6c015e9f"},"schema_version":"1.0","source":{"id":"2606.30270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30270","created_at":"2026-06-30T02:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30270v1","created_at":"2026-06-30T02:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30270","created_at":"2026-06-30T02:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"F4IMBU2N5CB3","created_at":"2026-06-30T02:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"F4IMBU2N5CB3ORLZ","created_at":"2026-06-30T02:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"F4IMBU2N","created_at":"2026-06-30T02:17:56Z"}],"graph_snapshots":[{"event_id":"sha256:f82c175015f7e5f93fcdaa19961b7f8cf15657cd4ba57164d72f79c89304a14a","target":"graph","created_at":"2026-06-30T02:17:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.30270/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Boolean networks are finite discrete nonlinear systems whose long-term behaviour is organised by fixed-point and cyclic attractors. Detecting such recurrent states is important in applications ranging from gene regulation and neural computation to complex-network models, but the computational boundary between tractable and intractable attractor analysis is still not fully understood. We study that boundary from the perspective of local logical rules. We consider Boolean networks under parallel update whose coordinate functions are given by circuits over a fixed finite basis of a closed Boolean","authors_text":"Alexander Drobyshev, Grigoriy Bokov","cross_cats":["cs.DM","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-29T13:17:52Z","title":"Cyclic Attractor Detection in Boolean Network Dynamics under Local Logical Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30270","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:d5f33101fac4a8443913b8375e196a56dba2b1e87efc71a648fa78a20d417fca","target":"record","created_at":"2026-06-30T02:17:56Z","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":"1dcdec0d1f7d28c267b11a021a0e3cdf9d18c864ebade33d591c17cf29a56bab","cross_cats_sorted":["cs.DM","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-29T13:17:52Z","title_canon_sha256":"1ea80511b2ebb9dd7a3ae4146cecce0fcab11d37cc37b2d9bd49163a6c015e9f"},"schema_version":"1.0","source":{"id":"2606.30270","kind":"arxiv","version":1}},"canonical_sha256":"2f10c0d34de883b7457996b3f592859ef679f9fc0cd28e87b9de09fa9176ac66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f10c0d34de883b7457996b3f592859ef679f9fc0cd28e87b9de09fa9176ac66","first_computed_at":"2026-06-30T02:17:56.875649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:17:56.875649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"szgLCheqvIVWPcW9a49T+p9NkyPiFJq3Tm+JNxJVpoHo7vCJ217ljweQ5p41tm49oTUkDIrZBkHEqt5xV6gvAQ==","signature_status":"signed_v1","signed_at":"2026-06-30T02:17:56.876302Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.30270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5f33101fac4a8443913b8375e196a56dba2b1e87efc71a648fa78a20d417fca","sha256:f82c175015f7e5f93fcdaa19961b7f8cf15657cd4ba57164d72f79c89304a14a"],"state_sha256":"d3fc36529a8a1862bc30da54932fef3b4830002797c93cbb96cbad7cded453d2"}