{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BD6JICFLXLBJSWXWAWTCTHZI42","short_pith_number":"pith:BD6JICFL","canonical_record":{"source":{"id":"1804.07543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-20T10:46:33Z","cross_cats_sorted":[],"title_canon_sha256":"6bbbd0f5ce0bd43123ec97ef0ce2838e2ea9340c23eacd0185972a89443053c3","abstract_canon_sha256":"d8888861e94cc5158ff32a6c1ef2b1c8695bc000a0162feb7473d0a57f9938a9"},"schema_version":"1.0"},"canonical_sha256":"08fc9408abbac2995af605a6299f28e69c065ddb5622feadd03ecaae7e539663","source":{"kind":"arxiv","id":"1804.07543","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07543","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07543v1","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07543","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"BD6JICFLXLBJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BD6JICFLXLBJSWXW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BD6JICFL","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BD6JICFLXLBJSWXWAWTCTHZI42","target":"record","payload":{"canonical_record":{"source":{"id":"1804.07543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-20T10:46:33Z","cross_cats_sorted":[],"title_canon_sha256":"6bbbd0f5ce0bd43123ec97ef0ce2838e2ea9340c23eacd0185972a89443053c3","abstract_canon_sha256":"d8888861e94cc5158ff32a6c1ef2b1c8695bc000a0162feb7473d0a57f9938a9"},"schema_version":"1.0"},"canonical_sha256":"08fc9408abbac2995af605a6299f28e69c065ddb5622feadd03ecaae7e539663","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:58.504691Z","signature_b64":"Mhf5NgpOQGJgYC12UXgGXWYy3Ok13fEjbK456Z3UCCNLzyEtc8QHexBOM4AvT3Oolv6DFKCqgjy/ds2nt7alCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08fc9408abbac2995af605a6299f28e69c065ddb5622feadd03ecaae7e539663","last_reissued_at":"2026-05-18T00:17:58.504067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:58.504067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.07543","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:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bvcz6doRW0Sm0BjxuR3OrEK0VWvqkXfLX1sibFCDDqyeOiISotJdGt9ZhePdtOF7QD1DOlV8rROGVnj5762sDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:36:36.118928Z"},"content_sha256":"cd49629c7ce5d8d5640cc982b42d3d21092d9e880074ecc06198e4cec6a57778","schema_version":"1.0","event_id":"sha256:cd49629c7ce5d8d5640cc982b42d3d21092d9e880074ecc06198e4cec6a57778"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BD6JICFLXLBJSWXWAWTCTHZI42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Heuristic for Reachability Problem in Asynchronous Binary Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Morgan Magnin, Olivier Roux, Xinwei Chai","submitted_at":"2018-04-20T10:46:33Z","abstract_excerpt":"On demand of efficient reachability analysis due to the inevitable complexity of large-scale biological models, this paper is dedicated to a novel approach: PermReach, for reachability problem of our new framework, Asynchronous Binary Automata Networks (ABAN). ABAN is an expressive modeling framework which contains all the dynamics behaviors performed by Asynchronous Boolean Networks. Compared to Boolean Networks (BN), ABAN has a finer description of state transitions (from a local state to another, instead of symmetric Boolean functions). To analyze the reachability properties on large-scale "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07543","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:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9G+XMyicfwPjtOHRAT888enPCt8U0NmudPnessSPgtdeiBJJWijw3KZftd3tkPVz4ct8N4308dSnMJwOQ0McDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:36:36.119726Z"},"content_sha256":"834a318d15d0b9661eae4e53ba3273e13455c23fe589b256370a204493a59f92","schema_version":"1.0","event_id":"sha256:834a318d15d0b9661eae4e53ba3273e13455c23fe589b256370a204493a59f92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BD6JICFLXLBJSWXWAWTCTHZI42/bundle.json","state_url":"https://pith.science/pith/BD6JICFLXLBJSWXWAWTCTHZI42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BD6JICFLXLBJSWXWAWTCTHZI42/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-06-12T02:36:36Z","links":{"resolver":"https://pith.science/pith/BD6JICFLXLBJSWXWAWTCTHZI42","bundle":"https://pith.science/pith/BD6JICFLXLBJSWXWAWTCTHZI42/bundle.json","state":"https://pith.science/pith/BD6JICFLXLBJSWXWAWTCTHZI42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BD6JICFLXLBJSWXWAWTCTHZI42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BD6JICFLXLBJSWXWAWTCTHZI42","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":"d8888861e94cc5158ff32a6c1ef2b1c8695bc000a0162feb7473d0a57f9938a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-20T10:46:33Z","title_canon_sha256":"6bbbd0f5ce0bd43123ec97ef0ce2838e2ea9340c23eacd0185972a89443053c3"},"schema_version":"1.0","source":{"id":"1804.07543","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07543","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07543v1","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07543","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"BD6JICFLXLBJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BD6JICFLXLBJSWXW","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BD6JICFL","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:834a318d15d0b9661eae4e53ba3273e13455c23fe589b256370a204493a59f92","target":"graph","created_at":"2026-05-18T00:17: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":"On demand of efficient reachability analysis due to the inevitable complexity of large-scale biological models, this paper is dedicated to a novel approach: PermReach, for reachability problem of our new framework, Asynchronous Binary Automata Networks (ABAN). ABAN is an expressive modeling framework which contains all the dynamics behaviors performed by Asynchronous Boolean Networks. Compared to Boolean Networks (BN), ABAN has a finer description of state transitions (from a local state to another, instead of symmetric Boolean functions). To analyze the reachability properties on large-scale ","authors_text":"Morgan Magnin, Olivier Roux, Xinwei Chai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-20T10:46:33Z","title":"A Heuristic for Reachability Problem in Asynchronous Binary Automata Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07543","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:cd49629c7ce5d8d5640cc982b42d3d21092d9e880074ecc06198e4cec6a57778","target":"record","created_at":"2026-05-18T00:17: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":"d8888861e94cc5158ff32a6c1ef2b1c8695bc000a0162feb7473d0a57f9938a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-20T10:46:33Z","title_canon_sha256":"6bbbd0f5ce0bd43123ec97ef0ce2838e2ea9340c23eacd0185972a89443053c3"},"schema_version":"1.0","source":{"id":"1804.07543","kind":"arxiv","version":1}},"canonical_sha256":"08fc9408abbac2995af605a6299f28e69c065ddb5622feadd03ecaae7e539663","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08fc9408abbac2995af605a6299f28e69c065ddb5622feadd03ecaae7e539663","first_computed_at":"2026-05-18T00:17:58.504067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:58.504067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mhf5NgpOQGJgYC12UXgGXWYy3Ok13fEjbK456Z3UCCNLzyEtc8QHexBOM4AvT3Oolv6DFKCqgjy/ds2nt7alCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:58.504691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07543","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd49629c7ce5d8d5640cc982b42d3d21092d9e880074ecc06198e4cec6a57778","sha256:834a318d15d0b9661eae4e53ba3273e13455c23fe589b256370a204493a59f92"],"state_sha256":"eae9485bcd3870e7d2faa94c43a119b6e14ee98b12b95de6c617fda2a8a325a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4wgYROdyoNkh8CXjSxzXN2MS9eYn2aEIQ6gd9j0hISBTuCDOrIQJR3RUKLWeDo/BsO6tcBqRh3JdVVxXlDqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:36:36.123643Z","bundle_sha256":"259c2ba3b7609c91322a447c14959b37769069dba02e2a67c411127a64a2a897"}}