{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QXEPAAUTYPN7PEV42JIQOG7AAX","short_pith_number":"pith:QXEPAAUT","schema_version":"1.0","canonical_sha256":"85c8f00293c3dbf792bcd251071be005c30effe9ea88cf5e9f4a41751ab9fa29","source":{"kind":"arxiv","id":"1803.02095","version":2},"attestation_state":"computed","paper":{"title":"Local negative circuits and cyclic attractors in Boolean networks with at most five components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Claudine Chaouiya, Elisa Tonello, Etienne Farcot","submitted_at":"2018-03-06T10:26:21Z","abstract_excerpt":"We consider the following question on the relationship between the asymptotic behaviours of asynchronous dynamics of Boolean networks and their regulatory structures: does the presence of a cyclic attractor imply the existence of a local negative circuit in the regulatory graph? When the number of model components $n$ verifies $n \\geq 6$, the answer is known to be negative. We show that the question can be translated into a Boolean satisfiability problem on $n \\cdot 2^n$ variables. A Boolean formula expressing the absence of local negative circuits and a necessary condition for the existence o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.02095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-06T10:26:21Z","cross_cats_sorted":[],"title_canon_sha256":"6c66cc80cf79e0f2a2fdb37fdb4befa7c8944e6f4f58d312f0a4ff0cc6dafc56","abstract_canon_sha256":"ffbf8db3e0110c720b257d537296c163e986983e1eaafc924bf78e67ad5c4d62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.142755Z","signature_b64":"g3dE8Ju6hdKBWgzpIWkB8GnD4jko3dBOClJ9QeVXMZiOrOUTDd0yeeUyiSNQHxApJ725aFyZSTiZmmqVPFqABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85c8f00293c3dbf792bcd251071be005c30effe9ea88cf5e9f4a41751ab9fa29","last_reissued_at":"2026-05-18T00:02:45.142242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.142242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local negative circuits and cyclic attractors in Boolean networks with at most five components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Claudine Chaouiya, Elisa Tonello, Etienne Farcot","submitted_at":"2018-03-06T10:26:21Z","abstract_excerpt":"We consider the following question on the relationship between the asymptotic behaviours of asynchronous dynamics of Boolean networks and their regulatory structures: does the presence of a cyclic attractor imply the existence of a local negative circuit in the regulatory graph? When the number of model components $n$ verifies $n \\geq 6$, the answer is known to be negative. We show that the question can be translated into a Boolean satisfiability problem on $n \\cdot 2^n$ variables. A Boolean formula expressing the absence of local negative circuits and a necessary condition for the existence o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02095","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.02095","created_at":"2026-05-18T00:02:45.142334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02095v2","created_at":"2026-05-18T00:02:45.142334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02095","created_at":"2026-05-18T00:02:45.142334+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXEPAAUTYPN7","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXEPAAUTYPN7PEV4","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXEPAAUT","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QXEPAAUTYPN7PEV42JIQOG7AAX","json":"https://pith.science/pith/QXEPAAUTYPN7PEV42JIQOG7AAX.json","graph_json":"https://pith.science/api/pith-number/QXEPAAUTYPN7PEV42JIQOG7AAX/graph.json","events_json":"https://pith.science/api/pith-number/QXEPAAUTYPN7PEV42JIQOG7AAX/events.json","paper":"https://pith.science/paper/QXEPAAUT"},"agent_actions":{"view_html":"https://pith.science/pith/QXEPAAUTYPN7PEV42JIQOG7AAX","download_json":"https://pith.science/pith/QXEPAAUTYPN7PEV42JIQOG7AAX.json","view_paper":"https://pith.science/paper/QXEPAAUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02095&json=true","fetch_graph":"https://pith.science/api/pith-number/QXEPAAUTYPN7PEV42JIQOG7AAX/graph.json","fetch_events":"https://pith.science/api/pith-number/QXEPAAUTYPN7PEV42JIQOG7AAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXEPAAUTYPN7PEV42JIQOG7AAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXEPAAUTYPN7PEV42JIQOG7AAX/action/storage_attestation","attest_author":"https://pith.science/pith/QXEPAAUTYPN7PEV42JIQOG7AAX/action/author_attestation","sign_citation":"https://pith.science/pith/QXEPAAUTYPN7PEV42JIQOG7AAX/action/citation_signature","submit_replication":"https://pith.science/pith/QXEPAAUTYPN7PEV42JIQOG7AAX/action/replication_record"}},"created_at":"2026-05-18T00:02:45.142334+00:00","updated_at":"2026-05-18T00:02:45.142334+00:00"}