{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PWBOKZOXZB6RQL44QCYJGD336I","short_pith_number":"pith:PWBOKZOX","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"},"canonical_sha256":"7d82e565d7c87d182f9c80b0930f7bf231aceb3627b9b728690183acf7ccfa23","source":{"kind":"arxiv","id":"1702.03101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03101","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03101v1","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03101","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"PWBOKZOXZB6R","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWBOKZOXZB6RQL44","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWBOKZOX","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PWBOKZOXZB6RQL44QCYJGD336I","target":"record","payload":{"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"},"canonical_sha256":"7d82e565d7c87d182f9c80b0930f7bf231aceb3627b9b728690183acf7ccfa23","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"},"source_kind":"arxiv","source_id":"1702.03101","source_version":1,"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-18T00:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1l6uoVsycGvppO4e/yjXLrAUZ6dAKXF1GQcpQA2q/Be1qvKxPJO//nOqluQvkLvYoLxjMmWLsgzy3/bl768PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:00:33.325800Z"},"content_sha256":"2a09fd81ca3723b99867e30e24f257df805848aad55b9906ffdb19e153aa03db","schema_version":"1.0","event_id":"sha256:2a09fd81ca3723b99867e30e24f257df805848aad55b9906ffdb19e153aa03db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PWBOKZOXZB6RQL44QCYJGD336I","target":"graph","payload":{"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"},"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-18T00:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oyV2GExlF9KkXm/V7PdQzN0Al5EbRphuEZW4JRsqk7FCwEq5vX32J8mwheqSGflm6FWKTADfSCRPXLTYSSzCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:00:33.326528Z"},"content_sha256":"d5a785a1e6768675fa4a733d6f9a6cb2840ece13dce7fee2fa3609c1fa49f255","schema_version":"1.0","event_id":"sha256:d5a785a1e6768675fa4a733d6f9a6cb2840ece13dce7fee2fa3609c1fa49f255"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I/bundle.json","state_url":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWBOKZOXZB6RQL44QCYJGD336I/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-25T19:00:33Z","links":{"resolver":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I","bundle":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I/bundle.json","state":"https://pith.science/pith/PWBOKZOXZB6RQL44QCYJGD336I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWBOKZOXZB6RQL44QCYJGD336I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PWBOKZOXZB6RQL44QCYJGD336I","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":"1f1833abb4e68be835aedf0ae1fda41f146f8556f083649f30bed4d1f97d1265","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-10T08:52:51Z","title_canon_sha256":"cd61f7a8d81b8634c991cbacf446045ab1817d3a5c8a5cae9a2fcef724958dfc"},"schema_version":"1.0","source":{"id":"1702.03101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03101","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03101v1","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03101","created_at":"2026-05-18T00:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"PWBOKZOXZB6R","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWBOKZOXZB6RQL44","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWBOKZOX","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:d5a785a1e6768675fa4a733d6f9a6cb2840ece13dce7fee2fa3609c1fa49f255","target":"graph","created_at":"2026-05-18T00:50:58Z","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":"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","authors_text":"Florian Bridoux, Guillaume Theyssier, K\\'evin Perrot, Pierre Guillon, Sylvain Sen\\'e","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-10T08:52:51Z","title":"On the cost of simulating a parallel Boolean automata network by a block-sequential one"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03101","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:2a09fd81ca3723b99867e30e24f257df805848aad55b9906ffdb19e153aa03db","target":"record","created_at":"2026-05-18T00:50:58Z","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":"1f1833abb4e68be835aedf0ae1fda41f146f8556f083649f30bed4d1f97d1265","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-10T08:52:51Z","title_canon_sha256":"cd61f7a8d81b8634c991cbacf446045ab1817d3a5c8a5cae9a2fcef724958dfc"},"schema_version":"1.0","source":{"id":"1702.03101","kind":"arxiv","version":1}},"canonical_sha256":"7d82e565d7c87d182f9c80b0930f7bf231aceb3627b9b728690183acf7ccfa23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d82e565d7c87d182f9c80b0930f7bf231aceb3627b9b728690183acf7ccfa23","first_computed_at":"2026-05-18T00:50:58.652199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:58.652199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jCBVSv6dh2BsK05XxL6uey0PxBnZmq6ETFIj28Z/wOst1v6TjXLaZXTsDPPo5skiIc+zq0zLc+Av6GsQr9YnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:58.652749Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a09fd81ca3723b99867e30e24f257df805848aad55b9906ffdb19e153aa03db","sha256:d5a785a1e6768675fa4a733d6f9a6cb2840ece13dce7fee2fa3609c1fa49f255"],"state_sha256":"c79edd9dec0a6b6a43ba9ab1366ee13bc16a92872314d1bb2ff7ce92e4df1108"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfmzYUR3hGBF8nUurFZHvUbpYaf2PsTzLh0HE8eWkpSi0miAiogt013MzHnpalBgEE3X49+hj/myGJ0By0jNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:00:33.329951Z","bundle_sha256":"e81806bcf1881eb93765a389c13cc6cbfc4c1cb371db39a28fce9a96c90f4ace"}}