{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:X5UVMJ4WW7JUVHIPODGW2IJHRE","short_pith_number":"pith:X5UVMJ4W","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"},"canonical_sha256":"bf69562796b7d34a9d0f70cd6d2127890ef21a97f7be7538f628f0c8f21efab5","source":{"kind":"arxiv","id":"1306.2480","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2480","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2480v2","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2480","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"X5UVMJ4WW7JU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X5UVMJ4WW7JUVHIP","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X5UVMJ4W","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:X5UVMJ4WW7JUVHIPODGW2IJHRE","target":"record","payload":{"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"},"canonical_sha256":"bf69562796b7d34a9d0f70cd6d2127890ef21a97f7be7538f628f0c8f21efab5","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"},"source_kind":"arxiv","source_id":"1306.2480","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-18T02:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYZBs11XhRw51Vaapi+Hm/6UTgguK6SdpdSzH+hCezjonM+FLn1OPl5YlO7psAAE18j7XiCi/6n61azjCNBmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:03:55.400373Z"},"content_sha256":"5dec98d5fa57cb74080e0f9aead0177d2ab4e3fbcc145c0791465ca1baa93374","schema_version":"1.0","event_id":"sha256:5dec98d5fa57cb74080e0f9aead0177d2ab4e3fbcc145c0791465ca1baa93374"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:X5UVMJ4WW7JUVHIPODGW2IJHRE","target":"graph","payload":{"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"},"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-18T02:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9mhVYLu/2/kaWNinCnH8WCC/UWGn35WyXLxiBn1AlZg4wc95/72PxVf2WpYVM7U6Go5ol07XcITywSp/F/WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:03:55.400877Z"},"content_sha256":"49b0fc103c7671c88113ce521900f7989701623c9416d7f52ace61a7646697e4","schema_version":"1.0","event_id":"sha256:49b0fc103c7671c88113ce521900f7989701623c9416d7f52ace61a7646697e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/bundle.json","state_url":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/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-05-25T08:03:55Z","links":{"resolver":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE","bundle":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/bundle.json","state":"https://pith.science/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5UVMJ4WW7JUVHIPODGW2IJHRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:X5UVMJ4WW7JUVHIPODGW2IJHRE","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":"5ae212ba8b562e400357e182c63594f87ba29afdcb395e8302d894fc213f8726","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-06-11T10:31:58Z","title_canon_sha256":"098e22af3f580489ee8132a800b0c5573e5601308386b76b08df5d6d47392a32"},"schema_version":"1.0","source":{"id":"1306.2480","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2480","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2480v2","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2480","created_at":"2026-05-18T02:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"X5UVMJ4WW7JU","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"X5UVMJ4WW7JUVHIP","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"X5UVMJ4W","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:49b0fc103c7671c88113ce521900f7989701623c9416d7f52ace61a7646697e4","target":"graph","created_at":"2026-05-18T02:40:18Z","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":"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. ","authors_text":"Alessandro Seganti, Andrea De Martino, Federico Ricci-Tersenghi","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-06-11T10:31:58Z","title":"Boolean constraint satisfaction problems for reaction networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2480","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:5dec98d5fa57cb74080e0f9aead0177d2ab4e3fbcc145c0791465ca1baa93374","target":"record","created_at":"2026-05-18T02:40:18Z","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":"5ae212ba8b562e400357e182c63594f87ba29afdcb395e8302d894fc213f8726","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.MN","submitted_at":"2013-06-11T10:31:58Z","title_canon_sha256":"098e22af3f580489ee8132a800b0c5573e5601308386b76b08df5d6d47392a32"},"schema_version":"1.0","source":{"id":"1306.2480","kind":"arxiv","version":2}},"canonical_sha256":"bf69562796b7d34a9d0f70cd6d2127890ef21a97f7be7538f628f0c8f21efab5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf69562796b7d34a9d0f70cd6d2127890ef21a97f7be7538f628f0c8f21efab5","first_computed_at":"2026-05-18T02:40:18.717377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:18.717377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EZqsWu7wsEIgETa4EBZ6O7vISwpuMITAUP8TZtiQAaVQHrDrlbQbiRmnrp0r3no7K0JSUddJOfjt0nYMQsypAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:18.717979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2480","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dec98d5fa57cb74080e0f9aead0177d2ab4e3fbcc145c0791465ca1baa93374","sha256:49b0fc103c7671c88113ce521900f7989701623c9416d7f52ace61a7646697e4"],"state_sha256":"30183fe0d5327b9ff7eca4916ef77bb9992debd8e0b6ff2bb14988662ffc43d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMz8hSHGzyBiib5opVRsvTB6mIOeqQAQzWSWW4ZXquYYnGrBOCsN8/DF+RJRFGgyQFDi6FmO0EohlrEtxyRQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:03:55.404056Z","bundle_sha256":"6b0352d83c6218228f2b1d2c12c8b00dc0a78e271c8247f5b0325499474915e5"}}