{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SMIWDBTGU7UH2Z4PNQBTSXL5OA","short_pith_number":"pith:SMIWDBTG","canonical_record":{"source":{"id":"1109.0807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-05T06:46:07Z","cross_cats_sorted":["cond-mat.dis-nn","math.IT","q-bio.MN"],"title_canon_sha256":"1d14e339b403cd29f6a98fa5ed85a09bdd5823a6bc789cff8c4bbaffd6e09e5d","abstract_canon_sha256":"d3266c382f4005ffd745e303afc28a68f3aa39cb0aaf2a800265c56cc98c70b8"},"schema_version":"1.0"},"canonical_sha256":"9311618666a7e87d678f6c03395d7d700efacc53627e9fbf4330f95cadc78a1c","source":{"kind":"arxiv","id":"1109.0807","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0807","created_at":"2026-05-18T03:25:14Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0807v2","created_at":"2026-05-18T03:25:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0807","created_at":"2026-05-18T03:25:14Z"},{"alias_kind":"pith_short_12","alias_value":"SMIWDBTGU7UH","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SMIWDBTGU7UH2Z4P","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SMIWDBTG","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SMIWDBTGU7UH2Z4PNQBTSXL5OA","target":"record","payload":{"canonical_record":{"source":{"id":"1109.0807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-05T06:46:07Z","cross_cats_sorted":["cond-mat.dis-nn","math.IT","q-bio.MN"],"title_canon_sha256":"1d14e339b403cd29f6a98fa5ed85a09bdd5823a6bc789cff8c4bbaffd6e09e5d","abstract_canon_sha256":"d3266c382f4005ffd745e303afc28a68f3aa39cb0aaf2a800265c56cc98c70b8"},"schema_version":"1.0"},"canonical_sha256":"9311618666a7e87d678f6c03395d7d700efacc53627e9fbf4330f95cadc78a1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:14.786771Z","signature_b64":"U594ehbvqRcvhepSRpguI/B+aof4TUbDtTuO1dDBO05sJWnq/OyJl3z73eH6F2VyRstd1WGwtQUfUwFRgkyJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9311618666a7e87d678f6c03395d7d700efacc53627e9fbf4330f95cadc78a1c","last_reissued_at":"2026-05-18T03:25:14.785991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:14.785991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.0807","source_version":2,"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:25:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00hpjOMdYxK7wQ/Ivd9sUwRbFkeS5G8jaCinkoA/0CiBPEWj5DR2uMLrf92SxyfdYDkEk1d0kyTV0pXa67uFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:18:32.269536Z"},"content_sha256":"116cecf0e2e3988d5ccc5c319bfb61b68be0991c8dbc2c3b8b0f182fcdc3f77b","schema_version":"1.0","event_id":"sha256:116cecf0e2e3988d5ccc5c319bfb61b68be0991c8dbc2c3b8b0f182fcdc3f77b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SMIWDBTGU7UH2Z4PNQBTSXL5OA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Harmonic Analysis of Boolean Networks: Determinative Power and Perturbations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math.IT","q-bio.MN"],"primary_cat":"cs.IT","authors_text":"Martin Bossert, Reinhard Heckel, Steffen Schober","submitted_at":"2011-09-05T06:46:07Z","abstract_excerpt":"Consider a large Boolean network with a feed forward structure. Given a probability distribution on the inputs, can one find, possibly small, collections of input nodes that determine the states of most other nodes in the network? To answer this question, a notion that quantifies the determinative power of an input over the states of the nodes in the network is needed. We argue that the mutual information (MI) between a given subset of the inputs X = {X_1, ..., X_n} of some node i and its associated function f_i(X) quantifies the determinative power of this set of inputs over node i. We compar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0807","kind":"arxiv","version":2},"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:25:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7HDkoXajACSSkfOprZDAMRqL7qLAjNpQU4GcLSyw2vp97pxN8eD12Kmcd4X7i+rgHOrOOiCJIuZ3wicTMdz9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:18:32.269890Z"},"content_sha256":"ca79cd11284df5c7857ccc1e915b9251aa661e7279b53f2f7b71a431b457a2e3","schema_version":"1.0","event_id":"sha256:ca79cd11284df5c7857ccc1e915b9251aa661e7279b53f2f7b71a431b457a2e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMIWDBTGU7UH2Z4PNQBTSXL5OA/bundle.json","state_url":"https://pith.science/pith/SMIWDBTGU7UH2Z4PNQBTSXL5OA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMIWDBTGU7UH2Z4PNQBTSXL5OA/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-22T21:18:32Z","links":{"resolver":"https://pith.science/pith/SMIWDBTGU7UH2Z4PNQBTSXL5OA","bundle":"https://pith.science/pith/SMIWDBTGU7UH2Z4PNQBTSXL5OA/bundle.json","state":"https://pith.science/pith/SMIWDBTGU7UH2Z4PNQBTSXL5OA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMIWDBTGU7UH2Z4PNQBTSXL5OA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SMIWDBTGU7UH2Z4PNQBTSXL5OA","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":"d3266c382f4005ffd745e303afc28a68f3aa39cb0aaf2a800265c56cc98c70b8","cross_cats_sorted":["cond-mat.dis-nn","math.IT","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-05T06:46:07Z","title_canon_sha256":"1d14e339b403cd29f6a98fa5ed85a09bdd5823a6bc789cff8c4bbaffd6e09e5d"},"schema_version":"1.0","source":{"id":"1109.0807","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0807","created_at":"2026-05-18T03:25:14Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0807v2","created_at":"2026-05-18T03:25:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0807","created_at":"2026-05-18T03:25:14Z"},{"alias_kind":"pith_short_12","alias_value":"SMIWDBTGU7UH","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SMIWDBTGU7UH2Z4P","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SMIWDBTG","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:ca79cd11284df5c7857ccc1e915b9251aa661e7279b53f2f7b71a431b457a2e3","target":"graph","created_at":"2026-05-18T03:25:14Z","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":"Consider a large Boolean network with a feed forward structure. Given a probability distribution on the inputs, can one find, possibly small, collections of input nodes that determine the states of most other nodes in the network? To answer this question, a notion that quantifies the determinative power of an input over the states of the nodes in the network is needed. We argue that the mutual information (MI) between a given subset of the inputs X = {X_1, ..., X_n} of some node i and its associated function f_i(X) quantifies the determinative power of this set of inputs over node i. We compar","authors_text":"Martin Bossert, Reinhard Heckel, Steffen Schober","cross_cats":["cond-mat.dis-nn","math.IT","q-bio.MN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-05T06:46:07Z","title":"Harmonic Analysis of Boolean Networks: Determinative Power and Perturbations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0807","kind":"arxiv","version":2},"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:116cecf0e2e3988d5ccc5c319bfb61b68be0991c8dbc2c3b8b0f182fcdc3f77b","target":"record","created_at":"2026-05-18T03:25:14Z","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":"d3266c382f4005ffd745e303afc28a68f3aa39cb0aaf2a800265c56cc98c70b8","cross_cats_sorted":["cond-mat.dis-nn","math.IT","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-05T06:46:07Z","title_canon_sha256":"1d14e339b403cd29f6a98fa5ed85a09bdd5823a6bc789cff8c4bbaffd6e09e5d"},"schema_version":"1.0","source":{"id":"1109.0807","kind":"arxiv","version":2}},"canonical_sha256":"9311618666a7e87d678f6c03395d7d700efacc53627e9fbf4330f95cadc78a1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9311618666a7e87d678f6c03395d7d700efacc53627e9fbf4330f95cadc78a1c","first_computed_at":"2026-05-18T03:25:14.785991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:14.785991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U594ehbvqRcvhepSRpguI/B+aof4TUbDtTuO1dDBO05sJWnq/OyJl3z73eH6F2VyRstd1WGwtQUfUwFRgkyJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:14.786771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.0807","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:116cecf0e2e3988d5ccc5c319bfb61b68be0991c8dbc2c3b8b0f182fcdc3f77b","sha256:ca79cd11284df5c7857ccc1e915b9251aa661e7279b53f2f7b71a431b457a2e3"],"state_sha256":"092c74d723b6aa2c645561a66ecbe480e53eb2b18c0847a52cbc1bc9d2131ee7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b78FyxtcaPT69MeMHFz3q3v0RcmWLEmLYkwPhsE7JsEoZa2/DgMLpkk3AUBfSQ1ucajHHKBhanh2x9NSf6DDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:18:32.271963Z","bundle_sha256":"d293803112cc40c9a88ebd8baab68a9b82dbdf09551df0b6de6b842e6efe8af7"}}