{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:36ZTPJG63CRO2XF4HSA2HEDVR2","short_pith_number":"pith:36ZTPJG6","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"},"canonical_sha256":"dfb337a4ded8a2ed5cbc3c81a390758e90d90f03d4310f4773fc3b5d16ea8209","source":{"kind":"arxiv","id":"1310.5637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5637","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5637v1","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5637","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"pith_short_12","alias_value":"36ZTPJG63CRO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"36ZTPJG63CRO2XF4","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"36ZTPJG6","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:36ZTPJG63CRO2XF4HSA2HEDVR2","target":"record","payload":{"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"},"canonical_sha256":"dfb337a4ded8a2ed5cbc3c81a390758e90d90f03d4310f4773fc3b5d16ea8209","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"},"source_kind":"arxiv","source_id":"1310.5637","source_version":1,"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:57:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJzlclxH8OrwuMzoCUN6IK2Xi8DCzVExGtttBqaiiyz2Xhdt3rEaG+I1n49Vb3wICwBSyyJaCmSJbRcmizTcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:35:26.533181Z"},"content_sha256":"c892e4a38b075f167bdd8fd2a61baef11b9d3d3688c0441a9bc8b3f18b414096","schema_version":"1.0","event_id":"sha256:c892e4a38b075f167bdd8fd2a61baef11b9d3d3688c0441a9bc8b3f18b414096"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:36ZTPJG63CRO2XF4HSA2HEDVR2","target":"graph","payload":{"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"},"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:57:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0V4AjYNRSeaCaQfm/n0IXnkc/ENQT3RMnUeSyTdqPNyGzxJhuYhUtwIPxH6RCLPIvWTxxcLjQk4HPf0zZAPmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:35:26.533940Z"},"content_sha256":"12883a373e677ac1c9b4943077a06397017a722d60e9cad6b9880e66da21ba35","schema_version":"1.0","event_id":"sha256:12883a373e677ac1c9b4943077a06397017a722d60e9cad6b9880e66da21ba35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/bundle.json","state_url":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/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-25T13:35:26Z","links":{"resolver":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2","bundle":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/bundle.json","state":"https://pith.science/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36ZTPJG63CRO2XF4HSA2HEDVR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:36ZTPJG63CRO2XF4HSA2HEDVR2","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":"517d0bd5f082c7460fefaf8bf2e0082f66d45d44dc0ff12e6e82b9eed6f6023a","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-10-21T16:46:01Z","title_canon_sha256":"7d8e99d2b86f532b8f006e9305e020f0c4ffc76668b255a733cc50cd65419d09"},"schema_version":"1.0","source":{"id":"1310.5637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5637","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5637v1","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5637","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"pith_short_12","alias_value":"36ZTPJG63CRO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"36ZTPJG63CRO2XF4","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"36ZTPJG6","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:12883a373e677ac1c9b4943077a06397017a722d60e9cad6b9880e66da21ba35","target":"graph","created_at":"2026-05-18T02:57:17Z","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 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.","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-10-21T16:46:01Z","title":"Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5637","kind":"arxiv","version":1},"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:c892e4a38b075f167bdd8fd2a61baef11b9d3d3688c0441a9bc8b3f18b414096","target":"record","created_at":"2026-05-18T02:57:17Z","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":"517d0bd5f082c7460fefaf8bf2e0082f66d45d44dc0ff12e6e82b9eed6f6023a","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-10-21T16:46:01Z","title_canon_sha256":"7d8e99d2b86f532b8f006e9305e020f0c4ffc76668b255a733cc50cd65419d09"},"schema_version":"1.0","source":{"id":"1310.5637","kind":"arxiv","version":1}},"canonical_sha256":"dfb337a4ded8a2ed5cbc3c81a390758e90d90f03d4310f4773fc3b5d16ea8209","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfb337a4ded8a2ed5cbc3c81a390758e90d90f03d4310f4773fc3b5d16ea8209","first_computed_at":"2026-05-18T02:57:17.506107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:17.506107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Frv4JRShW8zPY/0/0L5JKA87XirtTfiDD94HnG2M/XhjtO8Yn9h6H071xDRsXzU8sAu6npk51K0ytJ2elTVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:17.506566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c892e4a38b075f167bdd8fd2a61baef11b9d3d3688c0441a9bc8b3f18b414096","sha256:12883a373e677ac1c9b4943077a06397017a722d60e9cad6b9880e66da21ba35"],"state_sha256":"8e1c3cb88dfe0d75a9f051d29267e552a706b917e6fd6066baa8b1283ac65d91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzkXzpr/4gsgn0C/FuLMzMx4trl5BfsYXPVbgdjmSzfJ5s/1yw8Q/lLAmFSUohIEa8l+1CmrUXxWMeoaMdLTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:35:26.541161Z","bundle_sha256":"926737074f689cc18cf609f6623b2d70347e5038fe13c6e9dd370221afc6d245"}}