{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4DGB4KB6A67BSJJ3FGQJQZAYQT","short_pith_number":"pith:4DGB4KB6","schema_version":"1.0","canonical_sha256":"e0cc1e283e07be19253b29a098641884f3773877d38df70c41ffb6539e7c4c31","source":{"kind":"arxiv","id":"2503.19147","version":1},"attestation_state":"computed","paper":{"title":"On the number of asynchronous attractors in AND-NOT Boolean networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DM","authors_text":"Jordan Rozum, Kyu Hyong Park, R\\'eka Albert, Samuel Pastva, Van-Giang Trinh","submitted_at":"2025-03-24T21:06:32Z","abstract_excerpt":"Boolean Networks (BNs) describe the time evolution of binary states using logic functions on the nodes of a network. They are fundamental models for complex discrete dynamical systems, with applications in various areas of science and engineering, and especially in systems biology. A key aspect of the dynamical behavior of BNs is the number of attractors, which determines the diversity of long-term system trajectories. Due to the noisy nature and incomplete characterization of biological systems, a stochastic asynchronous update scheme is often more appropriate than the deterministic synchrono"},"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":"2503.19147","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-03-24T21:06:32Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9ddd5715d220e2f010614f59c40ca53cf4ae1c1cd8a2ab17015a638293f8aee1","abstract_canon_sha256":"9cdddba0869b5d7f28a5fc305756a7e5dc404f2633d1277e2e016452c954cc80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:50.471263Z","signature_b64":"0C0InFlQKki6/UNCVTrtFqgj+lhVeFnVkAUdmykxm83rveGPetv9ZcIG6EfoJvCknZo/B9lIK5u/2ihIFZArBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0cc1e283e07be19253b29a098641884f3773877d38df70c41ffb6539e7c4c31","last_reissued_at":"2026-07-05T10:38:50.470724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:50.470724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of asynchronous attractors in AND-NOT Boolean networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DM","authors_text":"Jordan Rozum, Kyu Hyong Park, R\\'eka Albert, Samuel Pastva, Van-Giang Trinh","submitted_at":"2025-03-24T21:06:32Z","abstract_excerpt":"Boolean Networks (BNs) describe the time evolution of binary states using logic functions on the nodes of a network. They are fundamental models for complex discrete dynamical systems, with applications in various areas of science and engineering, and especially in systems biology. A key aspect of the dynamical behavior of BNs is the number of attractors, which determines the diversity of long-term system trajectories. Due to the noisy nature and incomplete characterization of biological systems, a stochastic asynchronous update scheme is often more appropriate than the deterministic synchrono"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.19147","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.19147/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.19147","created_at":"2026-07-05T10:38:50.470781+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.19147v1","created_at":"2026-07-05T10:38:50.470781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.19147","created_at":"2026-07-05T10:38:50.470781+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DGB4KB6A67B","created_at":"2026-07-05T10:38:50.470781+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DGB4KB6A67BSJJ3","created_at":"2026-07-05T10:38:50.470781+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DGB4KB6","created_at":"2026-07-05T10:38:50.470781+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.15417","citing_title":"On the Boolean Network Theory of Datalog$^\\neg$","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DGB4KB6A67BSJJ3FGQJQZAYQT","json":"https://pith.science/pith/4DGB4KB6A67BSJJ3FGQJQZAYQT.json","graph_json":"https://pith.science/api/pith-number/4DGB4KB6A67BSJJ3FGQJQZAYQT/graph.json","events_json":"https://pith.science/api/pith-number/4DGB4KB6A67BSJJ3FGQJQZAYQT/events.json","paper":"https://pith.science/paper/4DGB4KB6"},"agent_actions":{"view_html":"https://pith.science/pith/4DGB4KB6A67BSJJ3FGQJQZAYQT","download_json":"https://pith.science/pith/4DGB4KB6A67BSJJ3FGQJQZAYQT.json","view_paper":"https://pith.science/paper/4DGB4KB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.19147&json=true","fetch_graph":"https://pith.science/api/pith-number/4DGB4KB6A67BSJJ3FGQJQZAYQT/graph.json","fetch_events":"https://pith.science/api/pith-number/4DGB4KB6A67BSJJ3FGQJQZAYQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DGB4KB6A67BSJJ3FGQJQZAYQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DGB4KB6A67BSJJ3FGQJQZAYQT/action/storage_attestation","attest_author":"https://pith.science/pith/4DGB4KB6A67BSJJ3FGQJQZAYQT/action/author_attestation","sign_citation":"https://pith.science/pith/4DGB4KB6A67BSJJ3FGQJQZAYQT/action/citation_signature","submit_replication":"https://pith.science/pith/4DGB4KB6A67BSJJ3FGQJQZAYQT/action/replication_record"}},"created_at":"2026-07-05T10:38:50.470781+00:00","updated_at":"2026-07-05T10:38:50.470781+00:00"}