{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KE2JUTNXIHH4B7CBCG62I2AGQN","short_pith_number":"pith:KE2JUTNX","canonical_record":{"source":{"id":"1311.6868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-11-27T05:00:07Z","cross_cats_sorted":["cs.CE","cs.SI","q-bio.QM"],"title_canon_sha256":"6622251a8ff3303c6ff7f16df5efa313f7dd3c7360d9b0d778e0ce5f3a69a81c","abstract_canon_sha256":"6d5da360461824ff5bf4ff0398423b6dda3ae70689d6f90cbfade160ed735f11"},"schema_version":"1.0"},"canonical_sha256":"51349a4db741cfc0fc4111bda46806837ffbf81c8d2dfd567c6f20a8a67b2445","source":{"kind":"arxiv","id":"1311.6868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6868","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6868v1","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6868","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"KE2JUTNXIHH4","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KE2JUTNXIHH4B7CB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KE2JUTNX","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KE2JUTNXIHH4B7CBCG62I2AGQN","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-11-27T05:00:07Z","cross_cats_sorted":["cs.CE","cs.SI","q-bio.QM"],"title_canon_sha256":"6622251a8ff3303c6ff7f16df5efa313f7dd3c7360d9b0d778e0ce5f3a69a81c","abstract_canon_sha256":"6d5da360461824ff5bf4ff0398423b6dda3ae70689d6f90cbfade160ed735f11"},"schema_version":"1.0"},"canonical_sha256":"51349a4db741cfc0fc4111bda46806837ffbf81c8d2dfd567c6f20a8a67b2445","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:04.071853Z","signature_b64":"MNyr4dYchXx4ksRGYssChcbOxaqQtoPSLjvB5uMM+qZ25kBQsqd1iWwfYj/YoPodiAj1NxcwwkhkFeSoQl6CCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51349a4db741cfc0fc4111bda46806837ffbf81c8d2dfd567c6f20a8a67b2445","last_reissued_at":"2026-05-18T03:06:04.071349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:04.071349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6868","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-18T03:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLAcSxemJCtQoSVjOVmuHyvHM9kY4Ad1VE/kb1+K4/IB40VxycL4vo/Lgl77tgYDdaj1v2SslSiwy1qOrqKKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:19:28.445456Z"},"content_sha256":"1260928d12663e09905e517d180b111bf8c3dd3d05c635acd6ae9962c5ca31bc","schema_version":"1.0","event_id":"sha256:1260928d12663e09905e517d180b111bf8c3dd3d05c635acd6ae9962c5ca31bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KE2JUTNXIHH4B7CBCG62I2AGQN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dimension Reduction of Large AND-NOT Network Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.SI","q-bio.QM"],"primary_cat":"q-bio.MN","authors_text":"Alan Veliz-Cuba, Boris Aguilar, Reinhard Laubenbacher","submitted_at":"2013-11-27T05:00:07Z","abstract_excerpt":"Boolean networks have been used successfully in modeling biological networks and provide a good framework for theoretical analysis. However, the analysis of large networks is not trivial. In order to simplify the analysis of such networks, several model reduction algorithms have been proposed; however, it is not clear if such algorithms scale well with respect to the number of nodes. The goal of this paper is to propose and implement an algorithm for the reduction of AND-NOT network models for the purpose of steady state computation. Our method of network reduction is the use of \"steady state "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6868","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-18T03:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXH5CQUxon+Q2n+tzhxD6uyL/NuhDktU4w315/F7OhucxywcNs2o6BYoYYlJgyDtDcdbgUMeD7OAC0NIOXl3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:19:28.446102Z"},"content_sha256":"e2e997878d285be753113c15abf7d83b11a5914e53fb70a17368a105f9928ca2","schema_version":"1.0","event_id":"sha256:e2e997878d285be753113c15abf7d83b11a5914e53fb70a17368a105f9928ca2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KE2JUTNXIHH4B7CBCG62I2AGQN/bundle.json","state_url":"https://pith.science/pith/KE2JUTNXIHH4B7CBCG62I2AGQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KE2JUTNXIHH4B7CBCG62I2AGQN/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-30T18:19:28Z","links":{"resolver":"https://pith.science/pith/KE2JUTNXIHH4B7CBCG62I2AGQN","bundle":"https://pith.science/pith/KE2JUTNXIHH4B7CBCG62I2AGQN/bundle.json","state":"https://pith.science/pith/KE2JUTNXIHH4B7CBCG62I2AGQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KE2JUTNXIHH4B7CBCG62I2AGQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KE2JUTNXIHH4B7CBCG62I2AGQN","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":"6d5da360461824ff5bf4ff0398423b6dda3ae70689d6f90cbfade160ed735f11","cross_cats_sorted":["cs.CE","cs.SI","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-11-27T05:00:07Z","title_canon_sha256":"6622251a8ff3303c6ff7f16df5efa313f7dd3c7360d9b0d778e0ce5f3a69a81c"},"schema_version":"1.0","source":{"id":"1311.6868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6868","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6868v1","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6868","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"KE2JUTNXIHH4","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KE2JUTNXIHH4B7CB","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KE2JUTNX","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:e2e997878d285be753113c15abf7d83b11a5914e53fb70a17368a105f9928ca2","target":"graph","created_at":"2026-05-18T03:06:04Z","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":"Boolean networks have been used successfully in modeling biological networks and provide a good framework for theoretical analysis. However, the analysis of large networks is not trivial. In order to simplify the analysis of such networks, several model reduction algorithms have been proposed; however, it is not clear if such algorithms scale well with respect to the number of nodes. The goal of this paper is to propose and implement an algorithm for the reduction of AND-NOT network models for the purpose of steady state computation. Our method of network reduction is the use of \"steady state ","authors_text":"Alan Veliz-Cuba, Boris Aguilar, Reinhard Laubenbacher","cross_cats":["cs.CE","cs.SI","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-11-27T05:00:07Z","title":"Dimension Reduction of Large AND-NOT Network Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6868","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:1260928d12663e09905e517d180b111bf8c3dd3d05c635acd6ae9962c5ca31bc","target":"record","created_at":"2026-05-18T03:06:04Z","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":"6d5da360461824ff5bf4ff0398423b6dda3ae70689d6f90cbfade160ed735f11","cross_cats_sorted":["cs.CE","cs.SI","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-11-27T05:00:07Z","title_canon_sha256":"6622251a8ff3303c6ff7f16df5efa313f7dd3c7360d9b0d778e0ce5f3a69a81c"},"schema_version":"1.0","source":{"id":"1311.6868","kind":"arxiv","version":1}},"canonical_sha256":"51349a4db741cfc0fc4111bda46806837ffbf81c8d2dfd567c6f20a8a67b2445","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51349a4db741cfc0fc4111bda46806837ffbf81c8d2dfd567c6f20a8a67b2445","first_computed_at":"2026-05-18T03:06:04.071349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:04.071349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MNyr4dYchXx4ksRGYssChcbOxaqQtoPSLjvB5uMM+qZ25kBQsqd1iWwfYj/YoPodiAj1NxcwwkhkFeSoQl6CCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:04.071853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1260928d12663e09905e517d180b111bf8c3dd3d05c635acd6ae9962c5ca31bc","sha256:e2e997878d285be753113c15abf7d83b11a5914e53fb70a17368a105f9928ca2"],"state_sha256":"c8161e25482f8a06719246cefe18f70dbd99a4df85762fc6ca6909ad58189aea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFTf4fJKgMSwhwaQX7wu2kVdGHkjMCJUUzbI1/db0imywMwM+Wq0PKxx29kpsy01DNIhBC7e4QPk7ryLDVkKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:19:28.449404Z","bundle_sha256":"03adb4351ed5c4cad9d7392f5a2c2e00e82cc01f7607346a3bff625fe9030904"}}