{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:X5UVMJ4WW7JUVHIPODGW2IJHRE","short_pith_number":"pith:X5UVMJ4W","schema_version":"1.0","canonical_sha256":"bf69562796b7d34a9d0f70cd6d2127890ef21a97f7be7538f628f0c8f21efab5","source":{"kind":"arxiv","id":"1306.2480","version":2},"attestation_state":"computed","paper":{"title":"Boolean constraint satisfaction problems for reaction networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"q-bio.MN","authors_text":"Alessandro Seganti, Andrea De Martino, Federico Ricci-Tersenghi","submitted_at":"2013-06-11T10:31:58Z","abstract_excerpt":"We define and study a class of (random) Boolean constraint satisfaction problems representing minimal feasibility constraints for networks of chemical reactions. The constraints we consider encode, respectively, for hard mass-balance conditions (where the consumption and production fluxes of each chemical species are matched) and for soft mass-balance conditions (where a net production of compounds is in principle allowed). We solve these constraint satisfaction problems under the Bethe approximation and derive the corresponding Belief Propagation equations, that involve 8 different messages. "},"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":"1306.2480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-06-11T10:31:58Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"098e22af3f580489ee8132a800b0c5573e5601308386b76b08df5d6d47392a32","abstract_canon_sha256":"5ae212ba8b562e400357e182c63594f87ba29afdcb395e8302d894fc213f8726"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:18.717979Z","signature_b64":"EZqsWu7wsEIgETa4EBZ6O7vISwpuMITAUP8TZtiQAaVQHrDrlbQbiRmnrp0r3no7K0JSUddJOfjt0nYMQsypAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf69562796b7d34a9d0f70cd6d2127890ef21a97f7be7538f628f0c8f21efab5","last_reissued_at":"2026-05-18T02:40:18.717377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:18.717377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boolean constraint satisfaction problems for reaction networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"primary_cat":"q-bio.MN","authors_text":"Alessandro Seganti, Andrea De Martino, Federico Ricci-Tersenghi","submitted_at":"2013-06-11T10:31:58Z","abstract_excerpt":"We define and study a class of (random) Boolean constraint satisfaction problems representing minimal feasibility constraints for networks of chemical reactions. The constraints we consider encode, respectively, for hard mass-balance conditions (where the consumption and production fluxes of each chemical species are matched) and for soft mass-balance conditions (where a net production of compounds is in principle allowed). We solve these constraint satisfaction problems under the Bethe approximation and derive the corresponding Belief Propagation equations, that involve 8 different messages. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2480","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":"1306.2480","created_at":"2026-05-18T02:40:18.717461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2480v2","created_at":"2026-05-18T02:40:18.717461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2480","created_at":"2026-05-18T02:40:18.717461+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5UVMJ4WW7JU","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5UVMJ4WW7JUVHIP","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5UVMJ4W","created_at":"2026-05-18T12:28:06.772260+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/X5UVMJ4WW7JUVHIPODGW2IJHRE","json":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE.json","graph_json":"https://pith.science/api/pith-number/X5UVMJ4WW7JUVHIPODGW2IJHRE/graph.json","events_json":"https://pith.science/api/pith-number/X5UVMJ4WW7JUVHIPODGW2IJHRE/events.json","paper":"https://pith.science/paper/X5UVMJ4W"},"agent_actions":{"view_html":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE","download_json":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE.json","view_paper":"https://pith.science/paper/X5UVMJ4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2480&json=true","fetch_graph":"https://pith.science/api/pith-number/X5UVMJ4WW7JUVHIPODGW2IJHRE/graph.json","fetch_events":"https://pith.science/api/pith-number/X5UVMJ4WW7JUVHIPODGW2IJHRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/action/storage_attestation","attest_author":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/action/author_attestation","sign_citation":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/action/citation_signature","submit_replication":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/action/replication_record"}},"created_at":"2026-05-18T02:40:18.717461+00:00","updated_at":"2026-05-18T02:40:18.717461+00:00"}