{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6Q6UUS6YLNMWKAOQ4SILJTNIPM","short_pith_number":"pith:6Q6UUS6Y","canonical_record":{"source":{"id":"1404.5515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2014-04-22T14:34:57Z","cross_cats_sorted":["q-bio.MN"],"title_canon_sha256":"04c3618529efe2808783f41a9cca962723f6b0913433926b5fa9e23afcecf932","abstract_canon_sha256":"a29b36b65be683376d154e39366afef574080f04cea1681585d2724d08555248"},"schema_version":"1.0"},"canonical_sha256":"f43d4a4bd85b596501d0e490b4cda87b17db96e2c714496308d12c33bf715aaf","source":{"kind":"arxiv","id":"1404.5515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5515","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5515v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5515","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"6Q6UUS6YLNMW","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6Q6UUS6YLNMWKAOQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6Q6UUS6Y","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6Q6UUS6YLNMWKAOQ4SILJTNIPM","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2014-04-22T14:34:57Z","cross_cats_sorted":["q-bio.MN"],"title_canon_sha256":"04c3618529efe2808783f41a9cca962723f6b0913433926b5fa9e23afcecf932","abstract_canon_sha256":"a29b36b65be683376d154e39366afef574080f04cea1681585d2724d08555248"},"schema_version":"1.0"},"canonical_sha256":"f43d4a4bd85b596501d0e490b4cda87b17db96e2c714496308d12c33bf715aaf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:31.153989Z","signature_b64":"2gKAwERGkuxhYQe6JmBh7GdynITYH8l7KtlpyKQN7xwD+Hbq1/m+T0TNYj3bzNo87bGDJlOUe4cDMbfwfXwJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f43d4a4bd85b596501d0e490b4cda87b17db96e2c714496308d12c33bf715aaf","last_reissued_at":"2026-05-18T02:53:31.153251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:31.153251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5515","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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8RNWMjK/doQemyIzHSvtdIofrWSyM5tlkOsNJ3JybbI+v4nt96RDdJtIirnmyCp3YTsBkspNrIqgha7zcoVwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:15:47.052472Z"},"content_sha256":"65cbae56c63da0b9e07ed6dffb39b17b27be27c4267d23c530576d1b759b7ede","schema_version":"1.0","event_id":"sha256:65cbae56c63da0b9e07ed6dffb39b17b27be27c4267d23c530576d1b759b7ede"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6Q6UUS6YLNMWKAOQ4SILJTNIPM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Detecting Fixed Points of Boolean Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.MN"],"primary_cat":"q-bio.QM","authors_text":"Yi Ming Zou","submitted_at":"2014-04-22T14:34:57Z","abstract_excerpt":"In the applications of Boolean networks to modeling biological systems, an important computational problem is the detection of the fixed points of these networks. This is an NP-complete problem in general. There have been various attempts to develop algorithms to address the computation need for large size Boolean networks. The existing methods are usually based on known algorithms and thus limited to the situations where these known algorithms can apply. In this paper, we propose a novel approach to this problem. We show that any system of Boolean equations is equivalent to one Boolean equati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5515","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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMMlvvTSWPpQAwo9NavauqXHyBi7R1b8/i1pPN1nQahUFw8LXfbJC+DmfwcEA51Za4eLlfwS4HOccy4p9D80Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:15:47.053175Z"},"content_sha256":"6f18471e0ed549591bc396a3d8f48b98676bc3c69ee7c55a34d4f3b5192feba0","schema_version":"1.0","event_id":"sha256:6f18471e0ed549591bc396a3d8f48b98676bc3c69ee7c55a34d4f3b5192feba0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Q6UUS6YLNMWKAOQ4SILJTNIPM/bundle.json","state_url":"https://pith.science/pith/6Q6UUS6YLNMWKAOQ4SILJTNIPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Q6UUS6YLNMWKAOQ4SILJTNIPM/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-25T03:15:47Z","links":{"resolver":"https://pith.science/pith/6Q6UUS6YLNMWKAOQ4SILJTNIPM","bundle":"https://pith.science/pith/6Q6UUS6YLNMWKAOQ4SILJTNIPM/bundle.json","state":"https://pith.science/pith/6Q6UUS6YLNMWKAOQ4SILJTNIPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Q6UUS6YLNMWKAOQ4SILJTNIPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6Q6UUS6YLNMWKAOQ4SILJTNIPM","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":"a29b36b65be683376d154e39366afef574080f04cea1681585d2724d08555248","cross_cats_sorted":["q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2014-04-22T14:34:57Z","title_canon_sha256":"04c3618529efe2808783f41a9cca962723f6b0913433926b5fa9e23afcecf932"},"schema_version":"1.0","source":{"id":"1404.5515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5515","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5515v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5515","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"6Q6UUS6YLNMW","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6Q6UUS6YLNMWKAOQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6Q6UUS6Y","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:6f18471e0ed549591bc396a3d8f48b98676bc3c69ee7c55a34d4f3b5192feba0","target":"graph","created_at":"2026-05-18T02:53:31Z","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 the applications of Boolean networks to modeling biological systems, an important computational problem is the detection of the fixed points of these networks. This is an NP-complete problem in general. There have been various attempts to develop algorithms to address the computation need for large size Boolean networks. The existing methods are usually based on known algorithms and thus limited to the situations where these known algorithms can apply. In this paper, we propose a novel approach to this problem. We show that any system of Boolean equations is equivalent to one Boolean equati","authors_text":"Yi Ming Zou","cross_cats":["q-bio.MN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2014-04-22T14:34:57Z","title":"An Algorithm for Detecting Fixed Points of Boolean Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5515","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:65cbae56c63da0b9e07ed6dffb39b17b27be27c4267d23c530576d1b759b7ede","target":"record","created_at":"2026-05-18T02:53:31Z","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":"a29b36b65be683376d154e39366afef574080f04cea1681585d2724d08555248","cross_cats_sorted":["q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2014-04-22T14:34:57Z","title_canon_sha256":"04c3618529efe2808783f41a9cca962723f6b0913433926b5fa9e23afcecf932"},"schema_version":"1.0","source":{"id":"1404.5515","kind":"arxiv","version":1}},"canonical_sha256":"f43d4a4bd85b596501d0e490b4cda87b17db96e2c714496308d12c33bf715aaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f43d4a4bd85b596501d0e490b4cda87b17db96e2c714496308d12c33bf715aaf","first_computed_at":"2026-05-18T02:53:31.153251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:31.153251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2gKAwERGkuxhYQe6JmBh7GdynITYH8l7KtlpyKQN7xwD+Hbq1/m+T0TNYj3bzNo87bGDJlOUe4cDMbfwfXwJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:31.153989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65cbae56c63da0b9e07ed6dffb39b17b27be27c4267d23c530576d1b759b7ede","sha256:6f18471e0ed549591bc396a3d8f48b98676bc3c69ee7c55a34d4f3b5192feba0"],"state_sha256":"3476b5feb49486d4bff3a10ad2f072e82c6a88ecc54228eda8408bcca4b0eab7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fuzcp50XMeakBI6UwZQTJAYyjNcJQzHSUyFx1c+2rtZfL02RYlx+lXv1BjaMXBfMly+FC1Z+dJD6Xjd21MjaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:15:47.057227Z","bundle_sha256":"63d1450c10af7d15fb63de22aa300d4f81b64f2d1f561f051d02b2ee86706138"}}