{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:36ZTPJG63CRO2XF4HSA2HEDVR2","short_pith_number":"pith:36ZTPJG6","schema_version":"1.0","canonical_sha256":"dfb337a4ded8a2ed5cbc3c81a390758e90d90f03d4310f4773fc3b5d16ea8209","source":{"kind":"arxiv","id":"1310.5637","version":1},"attestation_state":"computed","paper":{"title":"Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem","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-10-21T16:46:01Z","abstract_excerpt":"We analyze the solutions, on single network instances, of a recently introduced class of constraint-satisfaction problems (CSPs), describing feasible steady states of chemical reaction networks. First, we show that the CSPs generalize the scheme known as Network Expansion, which is recovered in a specific limit. Next, a full statistical mechanics characterization (including the phase diagram and a discussion of physical origin of the phase transitions) for Network Expansion is obtained. Finally, we provide a message-passing algorithm to solve the original CSPs in the most general form."},"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":"1310.5637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-10-21T16:46:01Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"title_canon_sha256":"7d8e99d2b86f532b8f006e9305e020f0c4ffc76668b255a733cc50cd65419d09","abstract_canon_sha256":"517d0bd5f082c7460fefaf8bf2e0082f66d45d44dc0ff12e6e82b9eed6f6023a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:17.506566Z","signature_b64":"5Frv4JRShW8zPY/0/0L5JKA87XirtTfiDD94HnG2M/XhjtO8Yn9h6H071xDRsXzU8sAu6npk51K0ytJ2elTVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfb337a4ded8a2ed5cbc3c81a390758e90d90f03d4310f4773fc3b5d16ea8209","last_reissued_at":"2026-05-18T02:57:17.506107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:17.506107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem","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-10-21T16:46:01Z","abstract_excerpt":"We analyze the solutions, on single network instances, of a recently introduced class of constraint-satisfaction problems (CSPs), describing feasible steady states of chemical reaction networks. First, we show that the CSPs generalize the scheme known as Network Expansion, which is recovered in a specific limit. Next, a full statistical mechanics characterization (including the phase diagram and a discussion of physical origin of the phase transitions) for Network Expansion is obtained. Finally, we provide a message-passing algorithm to solve the original CSPs in the most general form."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5637","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.5637","created_at":"2026-05-18T02:57:17.506182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5637v1","created_at":"2026-05-18T02:57:17.506182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5637","created_at":"2026-05-18T02:57:17.506182+00:00"},{"alias_kind":"pith_short_12","alias_value":"36ZTPJG63CRO","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"36ZTPJG63CRO2XF4","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"36ZTPJG6","created_at":"2026-05-18T12:27:32.513160+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/36ZTPJG63CRO2XF4HSA2HEDVR2","json":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2.json","graph_json":"https://pith.science/api/pith-number/36ZTPJG63CRO2XF4HSA2HEDVR2/graph.json","events_json":"https://pith.science/api/pith-number/36ZTPJG63CRO2XF4HSA2HEDVR2/events.json","paper":"https://pith.science/paper/36ZTPJG6"},"agent_actions":{"view_html":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2","download_json":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2.json","view_paper":"https://pith.science/paper/36ZTPJG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5637&json=true","fetch_graph":"https://pith.science/api/pith-number/36ZTPJG63CRO2XF4HSA2HEDVR2/graph.json","fetch_events":"https://pith.science/api/pith-number/36ZTPJG63CRO2XF4HSA2HEDVR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/action/storage_attestation","attest_author":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/action/author_attestation","sign_citation":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/action/citation_signature","submit_replication":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/action/replication_record"}},"created_at":"2026-05-18T02:57:17.506182+00:00","updated_at":"2026-05-18T02:57:17.506182+00:00"}