{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PWBOKZOXZB6RQL44QCYJGD336I","short_pith_number":"pith:PWBOKZOX","schema_version":"1.0","canonical_sha256":"7d82e565d7c87d182f9c80b0930f7bf231aceb3627b9b728690183acf7ccfa23","source":{"kind":"arxiv","id":"1702.03101","version":1},"attestation_state":"computed","paper":{"title":"On the cost of simulating a parallel Boolean automata network by a block-sequential one","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Florian Bridoux, Guillaume Theyssier, K\\'evin Perrot, Pierre Guillon, Sylvain Sen\\'e","submitted_at":"2017-02-10T08:52:51Z","abstract_excerpt":"In this article we study the minimum number $\\kappa$ of additional automata that a Boolean automata network (BAN) associated with a given block-sequential update schedule needs in order to simulate a given BAN with a parallel update schedule. We introduce a graph that we call $\\mathsf{NECC}$ graph built from the BAN and the update schedule. We show the relation between $\\kappa$ and the chromatic number of the $\\mathsf{NECC}$ graph. Thanks to this $\\mathsf{NECC}$ graph, we bound $\\kappa$ in the worst case between $n/2$ and $2n/3+2$ ($n$ being the size of the BAN simulated) and we conjecture tha"},"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":"1702.03101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-10T08:52:51Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"cd61f7a8d81b8634c991cbacf446045ab1817d3a5c8a5cae9a2fcef724958dfc","abstract_canon_sha256":"1f1833abb4e68be835aedf0ae1fda41f146f8556f083649f30bed4d1f97d1265"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:58.652749Z","signature_b64":"jCBVSv6dh2BsK05XxL6uey0PxBnZmq6ETFIj28Z/wOst1v6TjXLaZXTsDPPo5skiIc+zq0zLc+Av6GsQr9YnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d82e565d7c87d182f9c80b0930f7bf231aceb3627b9b728690183acf7ccfa23","last_reissued_at":"2026-05-18T00:50:58.652199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:58.652199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the cost of simulating a parallel Boolean automata network by a block-sequential one","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Florian Bridoux, Guillaume Theyssier, K\\'evin Perrot, Pierre Guillon, Sylvain Sen\\'e","submitted_at":"2017-02-10T08:52:51Z","abstract_excerpt":"In this article we study the minimum number $\\kappa$ of additional automata that a Boolean automata network (BAN) associated with a given block-sequential update schedule needs in order to simulate a given BAN with a parallel update schedule. We introduce a graph that we call $\\mathsf{NECC}$ graph built from the BAN and the update schedule. We show the relation between $\\kappa$ and the chromatic number of the $\\mathsf{NECC}$ graph. Thanks to this $\\mathsf{NECC}$ graph, we bound $\\kappa$ in the worst case between $n/2$ and $2n/3+2$ ($n$ being the size of the BAN simulated) and we conjecture tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03101","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03101","created_at":"2026-05-18T00:50:58.652287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03101v1","created_at":"2026-05-18T00:50:58.652287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03101","created_at":"2026-05-18T00:50:58.652287+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWBOKZOXZB6R","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWBOKZOXZB6RQL44","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWBOKZOX","created_at":"2026-05-18T12:31:37.085036+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/PWBOKZOXZB6RQL44QCYJGD336I","json":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I.json","graph_json":"https://pith.science/api/pith-number/PWBOKZOXZB6RQL44QCYJGD336I/graph.json","events_json":"https://pith.science/api/pith-number/PWBOKZOXZB6RQL44QCYJGD336I/events.json","paper":"https://pith.science/paper/PWBOKZOX"},"agent_actions":{"view_html":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I","download_json":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I.json","view_paper":"https://pith.science/paper/PWBOKZOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03101&json=true","fetch_graph":"https://pith.science/api/pith-number/PWBOKZOXZB6RQL44QCYJGD336I/graph.json","fetch_events":"https://pith.science/api/pith-number/PWBOKZOXZB6RQL44QCYJGD336I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I/action/storage_attestation","attest_author":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I/action/author_attestation","sign_citation":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I/action/citation_signature","submit_replication":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I/action/replication_record"}},"created_at":"2026-05-18T00:50:58.652287+00:00","updated_at":"2026-05-18T00:50:58.652287+00:00"}