{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OJPOQDW4WR2JBP4IV3PCEDIQ2S","short_pith_number":"pith:OJPOQDW4","schema_version":"1.0","canonical_sha256":"725ee80edcb47490bf88aede220d10d4b0e6f434e8ab457a647e00ec18daaee1","source":{"kind":"arxiv","id":"2506.06013","version":2},"attestation_state":"computed","paper":{"title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Kuldeep S Meel, Mohimenul Kabir, Samuel Pastva, Van-Giang Trinh","submitted_at":"2025-06-06T12:00:39Z","abstract_excerpt":"Boolean Networks (BNs) serve as a fundamental modeling framework for capturing complex dynamical systems across various domains, including systems biology, computational logic, and artificial intelligence. A crucial property of BNs is the presence of trap spaces -- subspaces of the state space that, once entered, cannot be exited. Minimal trap spaces, in particular, play a significant role in analyzing the long-term behavior of BNs, making their efficient enumeration and counting essential. The fixed points in BNs are a special case of minimal trap spaces. In this work, we formulate several me"},"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":"2506.06013","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-06T12:00:39Z","cross_cats_sorted":[],"title_canon_sha256":"cd46650098e3cd7434bece1b1bb998a8eb9bb24b1a1199005321d9045bc4e541","abstract_canon_sha256":"028a036fda6233bffb0c6f914c3ab1aa92ed7b4ab63ce5db963503f8de2bb483"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:29.464453Z","signature_b64":"kzeQQiHRL+UeNwdlI9dKtx6NCOpN/+OsmaTeFfFbWKyeE/bbZ+L3lSjnbFBMFCT4rdRartj1o3wXIOC0BG33AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"725ee80edcb47490bf88aede220d10d4b0e6f434e8ab457a647e00ec18daaee1","last_reissued_at":"2026-07-05T11:23:29.463928Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:29.463928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Kuldeep S Meel, Mohimenul Kabir, Samuel Pastva, Van-Giang Trinh","submitted_at":"2025-06-06T12:00:39Z","abstract_excerpt":"Boolean Networks (BNs) serve as a fundamental modeling framework for capturing complex dynamical systems across various domains, including systems biology, computational logic, and artificial intelligence. A crucial property of BNs is the presence of trap spaces -- subspaces of the state space that, once entered, cannot be exited. Minimal trap spaces, in particular, play a significant role in analyzing the long-term behavior of BNs, making their efficient enumeration and counting essential. The fixed points in BNs are a special case of minimal trap spaces. In this work, we formulate several me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06013","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.06013/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.06013","created_at":"2026-07-05T11:23:29.463984+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.06013v2","created_at":"2026-07-05T11:23:29.463984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06013","created_at":"2026-07-05T11:23:29.463984+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJPOQDW4WR2J","created_at":"2026-07-05T11:23:29.463984+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJPOQDW4WR2JBP4I","created_at":"2026-07-05T11:23:29.463984+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJPOQDW4","created_at":"2026-07-05T11:23:29.463984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11655","citing_title":"Counting Answer Sets of Disjunctive Answer Set Programs","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJPOQDW4WR2JBP4IV3PCEDIQ2S","json":"https://pith.science/pith/OJPOQDW4WR2JBP4IV3PCEDIQ2S.json","graph_json":"https://pith.science/api/pith-number/OJPOQDW4WR2JBP4IV3PCEDIQ2S/graph.json","events_json":"https://pith.science/api/pith-number/OJPOQDW4WR2JBP4IV3PCEDIQ2S/events.json","paper":"https://pith.science/paper/OJPOQDW4"},"agent_actions":{"view_html":"https://pith.science/pith/OJPOQDW4WR2JBP4IV3PCEDIQ2S","download_json":"https://pith.science/pith/OJPOQDW4WR2JBP4IV3PCEDIQ2S.json","view_paper":"https://pith.science/paper/OJPOQDW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.06013&json=true","fetch_graph":"https://pith.science/api/pith-number/OJPOQDW4WR2JBP4IV3PCEDIQ2S/graph.json","fetch_events":"https://pith.science/api/pith-number/OJPOQDW4WR2JBP4IV3PCEDIQ2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJPOQDW4WR2JBP4IV3PCEDIQ2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJPOQDW4WR2JBP4IV3PCEDIQ2S/action/storage_attestation","attest_author":"https://pith.science/pith/OJPOQDW4WR2JBP4IV3PCEDIQ2S/action/author_attestation","sign_citation":"https://pith.science/pith/OJPOQDW4WR2JBP4IV3PCEDIQ2S/action/citation_signature","submit_replication":"https://pith.science/pith/OJPOQDW4WR2JBP4IV3PCEDIQ2S/action/replication_record"}},"created_at":"2026-07-05T11:23:29.463984+00:00","updated_at":"2026-07-05T11:23:29.463984+00:00"}