{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7PK25YJELWM4KFEFDBGLJ62MP4","short_pith_number":"pith:7PK25YJE","canonical_record":{"source":{"id":"1509.06225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-09-21T13:43:00Z","cross_cats_sorted":["math.NA","q-bio.MN"],"title_canon_sha256":"36d5ba1d1f2de59cf205fa9b15c07dd9ea7ec54235e3c12f7dd22d6afc1074f2","abstract_canon_sha256":"acd71c423e92228b0c17ad2b9c61a416879058e308c20939654593b23b58d057"},"schema_version":"1.0"},"canonical_sha256":"fbd5aee1245d99c51485184cb4fb4c7f32af973e87111f3f3c13ce74ee21b78a","source":{"kind":"arxiv","id":"1509.06225","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06225","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06225v2","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06225","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"7PK25YJELWM4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7PK25YJELWM4KFEF","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7PK25YJE","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7PK25YJELWM4KFEFDBGLJ62MP4","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-09-21T13:43:00Z","cross_cats_sorted":["math.NA","q-bio.MN"],"title_canon_sha256":"36d5ba1d1f2de59cf205fa9b15c07dd9ea7ec54235e3c12f7dd22d6afc1074f2","abstract_canon_sha256":"acd71c423e92228b0c17ad2b9c61a416879058e308c20939654593b23b58d057"},"schema_version":"1.0"},"canonical_sha256":"fbd5aee1245d99c51485184cb4fb4c7f32af973e87111f3f3c13ce74ee21b78a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.280950Z","signature_b64":"a3pg+MiGhOMDs34a8B3KuA1SQE6cznwmZ10yofrKP9vuweY7b0JLYwxGdVGxJ5EwgfDvCQBYhWR4y6HLNKBHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbd5aee1245d99c51485184cb4fb4c7f32af973e87111f3f3c13ce74ee21b78a","last_reissued_at":"2026-05-18T01:19:35.280399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.280399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06225","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-18T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPGLh8KrpOUP51T2+vqzt/RLxjCJPjUYaNXNfqKoTd+vp0/tKN1PLA+WM/IPzvT0q2LuJaPHQIm9nHmidg2XAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:18:16.862443Z"},"content_sha256":"80f535c76b9506f1c228e63402eea6c0db5f66035d2c4175d984f7f29c126f35","schema_version":"1.0","event_id":"sha256:80f535c76b9506f1c228e63402eea6c0db5f66035d2c4175d984f7f29c126f35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7PK25YJELWM4KFEFDBGLJ62MP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing all possible graph structures describing linearly conjugate realizations of kinetic systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","q-bio.MN"],"primary_cat":"math.DS","authors_text":"Bernadett Acs, Gabor Szederkenyi, Zoltan Andras Tuza, Zsolt Tuza","submitted_at":"2015-09-21T13:43:00Z","abstract_excerpt":"In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations using linear programming. Since there might exist exponentially many different reaction graph structures, we cannot expect to have a polynomial-time algorithm, but we can organize the computation in such a way that polynomial time is elapsed between displaying any two consecutive realizations. The correctness of the algorithm is proved, and possibilities of a pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06225","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-18T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzbY7VUFTWl33mxSpYRxguv8unSPprgFZD6dW2O5xU4s7AljUorj8gjLXVVR2CDm2yc8ZxRruAiUvvKwDTa6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:18:16.862792Z"},"content_sha256":"c9d1f8480adea9e3b8661dfb7de4ab94761c353a8ecad1c41ffa9bd6f6c6c6cb","schema_version":"1.0","event_id":"sha256:c9d1f8480adea9e3b8661dfb7de4ab94761c353a8ecad1c41ffa9bd6f6c6c6cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PK25YJELWM4KFEFDBGLJ62MP4/bundle.json","state_url":"https://pith.science/pith/7PK25YJELWM4KFEFDBGLJ62MP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PK25YJELWM4KFEFDBGLJ62MP4/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-30T02:18:16Z","links":{"resolver":"https://pith.science/pith/7PK25YJELWM4KFEFDBGLJ62MP4","bundle":"https://pith.science/pith/7PK25YJELWM4KFEFDBGLJ62MP4/bundle.json","state":"https://pith.science/pith/7PK25YJELWM4KFEFDBGLJ62MP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PK25YJELWM4KFEFDBGLJ62MP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7PK25YJELWM4KFEFDBGLJ62MP4","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":"acd71c423e92228b0c17ad2b9c61a416879058e308c20939654593b23b58d057","cross_cats_sorted":["math.NA","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-09-21T13:43:00Z","title_canon_sha256":"36d5ba1d1f2de59cf205fa9b15c07dd9ea7ec54235e3c12f7dd22d6afc1074f2"},"schema_version":"1.0","source":{"id":"1509.06225","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06225","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06225v2","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06225","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"7PK25YJELWM4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7PK25YJELWM4KFEF","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7PK25YJE","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:c9d1f8480adea9e3b8661dfb7de4ab94761c353a8ecad1c41ffa9bd6f6c6c6cb","target":"graph","created_at":"2026-05-18T01:19:35Z","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":"In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations using linear programming. Since there might exist exponentially many different reaction graph structures, we cannot expect to have a polynomial-time algorithm, but we can organize the computation in such a way that polynomial time is elapsed between displaying any two consecutive realizations. The correctness of the algorithm is proved, and possibilities of a pa","authors_text":"Bernadett Acs, Gabor Szederkenyi, Zoltan Andras Tuza, Zsolt Tuza","cross_cats":["math.NA","q-bio.MN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-09-21T13:43:00Z","title":"Computing all possible graph structures describing linearly conjugate realizations of kinetic systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06225","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:80f535c76b9506f1c228e63402eea6c0db5f66035d2c4175d984f7f29c126f35","target":"record","created_at":"2026-05-18T01:19:35Z","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":"acd71c423e92228b0c17ad2b9c61a416879058e308c20939654593b23b58d057","cross_cats_sorted":["math.NA","q-bio.MN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-09-21T13:43:00Z","title_canon_sha256":"36d5ba1d1f2de59cf205fa9b15c07dd9ea7ec54235e3c12f7dd22d6afc1074f2"},"schema_version":"1.0","source":{"id":"1509.06225","kind":"arxiv","version":2}},"canonical_sha256":"fbd5aee1245d99c51485184cb4fb4c7f32af973e87111f3f3c13ce74ee21b78a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbd5aee1245d99c51485184cb4fb4c7f32af973e87111f3f3c13ce74ee21b78a","first_computed_at":"2026-05-18T01:19:35.280399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:35.280399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a3pg+MiGhOMDs34a8B3KuA1SQE6cznwmZ10yofrKP9vuweY7b0JLYwxGdVGxJ5EwgfDvCQBYhWR4y6HLNKBHCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:35.280950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06225","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80f535c76b9506f1c228e63402eea6c0db5f66035d2c4175d984f7f29c126f35","sha256:c9d1f8480adea9e3b8661dfb7de4ab94761c353a8ecad1c41ffa9bd6f6c6c6cb"],"state_sha256":"a0cfc0eaadb13799b4e2e883fc39dce48c3975bfcfd12185d620f6aebcf6548f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2r9N5ndaDavJKbxN8j18uM4M3hGfqdee0jAmd+8Wtj21rNSg8RazmiSNgC6j268DccsPkzfKFvczNOlAM1+hAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:18:16.864780Z","bundle_sha256":"b4e87350fbb107c6c5683f30fc3fbdebc251c7371dfda26f4548f8d666e8baed"}}