{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R6ZMJVUJWHJZKDNPJQGKRY454T","short_pith_number":"pith:R6ZMJVUJ","schema_version":"1.0","canonical_sha256":"8fb2c4d689b1d3950daf4c0ca8e39de4e559657f4de61485bf737535b300237b","source":{"kind":"arxiv","id":"1602.03109","version":2},"attestation_state":"computed","paper":{"title":"Number of fixed points and disjoint cycles in monotone Boolean networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT","q-bio.MN"],"primary_cat":"math.CO","authors_text":"Adrien Richard, Julio Aracena, Lilian Salinas","submitted_at":"2016-02-09T18:15:30Z","abstract_excerpt":"Given a digraph $G$, a lot of attention has been deserved on the maximum number $\\phi(G)$ of fixed points in a Boolean network $f:\\{0,1\\}^n\\to\\{0,1\\}^n$ with $G$ as interaction graph. In particular, a central problem in network coding consists in studying the optimality of the classical upper bound $\\phi(G)\\leq 2^{\\tau}$, where $\\tau$ is the minimum size of a feedback vertex set of $G$. In this paper, we study the maximum number $\\phi_m(G)$ of fixed points in a {\\em monotone} Boolean network with interaction graph $G$. We establish new upper and lower bounds on $\\phi_m(G)$ that depends on the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.03109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-09T18:15:30Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT","q-bio.MN"],"title_canon_sha256":"4ab1c7dd11a41f9b469e034e3180ef731f160b86d812e3d662daac958d12d28d","abstract_canon_sha256":"e924e35e3038da45893606e6ffa8bda9aa39164e50e0cd8b31d0a5dfb0123294"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:14.029304Z","signature_b64":"g0IRq0w8ejNymo+KbMDIwL8/b5eUZAESlA2VPrTuNt6xmVm8blu+GXUoj2gPXPzvE6CcovcELkK1cTBlLqGtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb2c4d689b1d3950daf4c0ca8e39de4e559657f4de61485bf737535b300237b","last_reissued_at":"2026-05-18T00:31:14.028648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:14.028648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Number of fixed points and disjoint cycles in monotone Boolean networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT","q-bio.MN"],"primary_cat":"math.CO","authors_text":"Adrien Richard, Julio Aracena, Lilian Salinas","submitted_at":"2016-02-09T18:15:30Z","abstract_excerpt":"Given a digraph $G$, a lot of attention has been deserved on the maximum number $\\phi(G)$ of fixed points in a Boolean network $f:\\{0,1\\}^n\\to\\{0,1\\}^n$ with $G$ as interaction graph. In particular, a central problem in network coding consists in studying the optimality of the classical upper bound $\\phi(G)\\leq 2^{\\tau}$, where $\\tau$ is the minimum size of a feedback vertex set of $G$. In this paper, we study the maximum number $\\phi_m(G)$ of fixed points in a {\\em monotone} Boolean network with interaction graph $G$. We establish new upper and lower bounds on $\\phi_m(G)$ that depends on the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03109","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.03109","created_at":"2026-05-18T00:31:14.028729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03109v2","created_at":"2026-05-18T00:31:14.028729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03109","created_at":"2026-05-18T00:31:14.028729+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6ZMJVUJWHJZ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6ZMJVUJWHJZKDNP","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6ZMJVUJ","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R6ZMJVUJWHJZKDNPJQGKRY454T","json":"https://pith.science/pith/R6ZMJVUJWHJZKDNPJQGKRY454T.json","graph_json":"https://pith.science/api/pith-number/R6ZMJVUJWHJZKDNPJQGKRY454T/graph.json","events_json":"https://pith.science/api/pith-number/R6ZMJVUJWHJZKDNPJQGKRY454T/events.json","paper":"https://pith.science/paper/R6ZMJVUJ"},"agent_actions":{"view_html":"https://pith.science/pith/R6ZMJVUJWHJZKDNPJQGKRY454T","download_json":"https://pith.science/pith/R6ZMJVUJWHJZKDNPJQGKRY454T.json","view_paper":"https://pith.science/paper/R6ZMJVUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03109&json=true","fetch_graph":"https://pith.science/api/pith-number/R6ZMJVUJWHJZKDNPJQGKRY454T/graph.json","fetch_events":"https://pith.science/api/pith-number/R6ZMJVUJWHJZKDNPJQGKRY454T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6ZMJVUJWHJZKDNPJQGKRY454T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6ZMJVUJWHJZKDNPJQGKRY454T/action/storage_attestation","attest_author":"https://pith.science/pith/R6ZMJVUJWHJZKDNPJQGKRY454T/action/author_attestation","sign_citation":"https://pith.science/pith/R6ZMJVUJWHJZKDNPJQGKRY454T/action/citation_signature","submit_replication":"https://pith.science/pith/R6ZMJVUJWHJZKDNPJQGKRY454T/action/replication_record"}},"created_at":"2026-05-18T00:31:14.028729+00:00","updated_at":"2026-05-18T00:31:14.028729+00:00"}