{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TI4SAVHNF3ZEM7YAW4RLDQPYXC","short_pith_number":"pith:TI4SAVHN","schema_version":"1.0","canonical_sha256":"9a392054ed2ef2467f00b722b1c1f8b89c56c123e1ac0f41c42381fb56adc069","source":{"kind":"arxiv","id":"1103.2892","version":2},"attestation_state":"computed","paper":{"title":"Computing weakly reversible realizations of chemical reaction networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.MN"],"primary_cat":"math.DS","authors_text":"Gabor Szederkenyi, Katalin M. Hangos, Zsolt Tuza","submitted_at":"2011-03-15T12:21:02Z","abstract_excerpt":"An algorithm is given in this paper for the computation of dynamically equivalent weakly reversible realizations with the maximal number of reactions, for chemical reaction networks (CRNs) with mass action kinetics."},"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":"1103.2892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2011-03-15T12:21:02Z","cross_cats_sorted":["q-bio.MN"],"title_canon_sha256":"8cfaa64164b7d9cd6ea1c638bb34cf63b172853fc384aaef3462d5bc787579dd","abstract_canon_sha256":"5a734477e3b4ac21fe572b0bd4085a7b6a4f9ff89635058686d53ea61433e762"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:19.071739Z","signature_b64":"QSSVO2dZXxyzd6/ZmDzhnO9aYRUy32uEPYBfaPlT1xnGRfy+M3C9bM8FV/woqWmPvLX6urqS7ss4otBr8dGMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a392054ed2ef2467f00b722b1c1f8b89c56c123e1ac0f41c42381fb56adc069","last_reissued_at":"2026-05-18T02:22:19.070897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:19.070897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing weakly reversible realizations of chemical reaction networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.MN"],"primary_cat":"math.DS","authors_text":"Gabor Szederkenyi, Katalin M. Hangos, Zsolt Tuza","submitted_at":"2011-03-15T12:21:02Z","abstract_excerpt":"An algorithm is given in this paper for the computation of dynamically equivalent weakly reversible realizations with the maximal number of reactions, for chemical reaction networks (CRNs) with mass action kinetics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2892","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":"1103.2892","created_at":"2026-05-18T02:22:19.071027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2892v2","created_at":"2026-05-18T02:22:19.071027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2892","created_at":"2026-05-18T02:22:19.071027+00:00"},{"alias_kind":"pith_short_12","alias_value":"TI4SAVHNF3ZE","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TI4SAVHNF3ZEM7YA","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TI4SAVHN","created_at":"2026-05-18T12:26:42.757692+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/TI4SAVHNF3ZEM7YAW4RLDQPYXC","json":"https://pith.science/pith/TI4SAVHNF3ZEM7YAW4RLDQPYXC.json","graph_json":"https://pith.science/api/pith-number/TI4SAVHNF3ZEM7YAW4RLDQPYXC/graph.json","events_json":"https://pith.science/api/pith-number/TI4SAVHNF3ZEM7YAW4RLDQPYXC/events.json","paper":"https://pith.science/paper/TI4SAVHN"},"agent_actions":{"view_html":"https://pith.science/pith/TI4SAVHNF3ZEM7YAW4RLDQPYXC","download_json":"https://pith.science/pith/TI4SAVHNF3ZEM7YAW4RLDQPYXC.json","view_paper":"https://pith.science/paper/TI4SAVHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2892&json=true","fetch_graph":"https://pith.science/api/pith-number/TI4SAVHNF3ZEM7YAW4RLDQPYXC/graph.json","fetch_events":"https://pith.science/api/pith-number/TI4SAVHNF3ZEM7YAW4RLDQPYXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TI4SAVHNF3ZEM7YAW4RLDQPYXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TI4SAVHNF3ZEM7YAW4RLDQPYXC/action/storage_attestation","attest_author":"https://pith.science/pith/TI4SAVHNF3ZEM7YAW4RLDQPYXC/action/author_attestation","sign_citation":"https://pith.science/pith/TI4SAVHNF3ZEM7YAW4RLDQPYXC/action/citation_signature","submit_replication":"https://pith.science/pith/TI4SAVHNF3ZEM7YAW4RLDQPYXC/action/replication_record"}},"created_at":"2026-05-18T02:22:19.071027+00:00","updated_at":"2026-05-18T02:22:19.071027+00:00"}