{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NSTDOCP52QB5HITOWMTJ2OMDMU","short_pith_number":"pith:NSTDOCP5","schema_version":"1.0","canonical_sha256":"6ca63709fdd403d3a26eb3269d3983650f720917d328f12052e3742397cddf14","source":{"kind":"arxiv","id":"2211.12603","version":2},"attestation_state":"computed","paper":{"title":"Reachability in Restricted Chemical Reaction Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM","cs.ET","nlin.AO","q-bio.MN"],"primary_cat":"cs.DC","authors_text":"Andrew Rodriguez, Bin Fu, Elise Grizzell, Marco Rodriguez, Robert M. Alaniz, Robert Schweller, Timothy Gomez, Tim Wylie","submitted_at":"2022-11-22T22:03:07Z","abstract_excerpt":"The popularity of molecular computation has given rise to several models of abstraction, one of the more recent ones being Chemical Reaction Networks (CRNs). These are equivalent to other popular computational models, such as Vector Addition Systems and Petri-Nets, and restricted versions are equivalent to Population Protocols. This paper continues the work on core \\emph{reachability} questions related to Chemical Reaction Networks; given two configurations, can one reach the other according to the system's rules? With no restrictions, reachability was recently shown to be Ackermann-complete, "},"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":"2211.12603","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2022-11-22T22:03:07Z","cross_cats_sorted":["cs.DM","cs.ET","nlin.AO","q-bio.MN"],"title_canon_sha256":"6f8b714a91626023c7d963d6bf33e8538babe51c02547240c955d9bacc0e5872","abstract_canon_sha256":"dbd0cef117d4fd18fdab9da0f5e5f1670abb854c2ec7ff168754b34268ceada3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:34.297173Z","signature_b64":"JiH1X+2DQjJ+TBr2mvyxE+gZnXP2F2HzrzNKG9QwOf7yteWFSR8Sa7HaddQsFRB6KtiV902DyQl0GdWMzTW0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ca63709fdd403d3a26eb3269d3983650f720917d328f12052e3742397cddf14","last_reissued_at":"2026-07-05T10:20:34.296749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:34.296749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability in Restricted Chemical Reaction Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM","cs.ET","nlin.AO","q-bio.MN"],"primary_cat":"cs.DC","authors_text":"Andrew Rodriguez, Bin Fu, Elise Grizzell, Marco Rodriguez, Robert M. Alaniz, Robert Schweller, Timothy Gomez, Tim Wylie","submitted_at":"2022-11-22T22:03:07Z","abstract_excerpt":"The popularity of molecular computation has given rise to several models of abstraction, one of the more recent ones being Chemical Reaction Networks (CRNs). These are equivalent to other popular computational models, such as Vector Addition Systems and Petri-Nets, and restricted versions are equivalent to Population Protocols. This paper continues the work on core \\emph{reachability} questions related to Chemical Reaction Networks; given two configurations, can one reach the other according to the system's rules? With no restrictions, reachability was recently shown to be Ackermann-complete, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12603","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.12603/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.12603","created_at":"2026-07-05T10:20:34.296804+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.12603v2","created_at":"2026-07-05T10:20:34.296804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12603","created_at":"2026-07-05T10:20:34.296804+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSTDOCP52QB5","created_at":"2026-07-05T10:20:34.296804+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSTDOCP52QB5HITO","created_at":"2026-07-05T10:20:34.296804+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSTDOCP5","created_at":"2026-07-05T10:20:34.296804+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/NSTDOCP52QB5HITOWMTJ2OMDMU","json":"https://pith.science/pith/NSTDOCP52QB5HITOWMTJ2OMDMU.json","graph_json":"https://pith.science/api/pith-number/NSTDOCP52QB5HITOWMTJ2OMDMU/graph.json","events_json":"https://pith.science/api/pith-number/NSTDOCP52QB5HITOWMTJ2OMDMU/events.json","paper":"https://pith.science/paper/NSTDOCP5"},"agent_actions":{"view_html":"https://pith.science/pith/NSTDOCP52QB5HITOWMTJ2OMDMU","download_json":"https://pith.science/pith/NSTDOCP52QB5HITOWMTJ2OMDMU.json","view_paper":"https://pith.science/paper/NSTDOCP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.12603&json=true","fetch_graph":"https://pith.science/api/pith-number/NSTDOCP52QB5HITOWMTJ2OMDMU/graph.json","fetch_events":"https://pith.science/api/pith-number/NSTDOCP52QB5HITOWMTJ2OMDMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSTDOCP52QB5HITOWMTJ2OMDMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSTDOCP52QB5HITOWMTJ2OMDMU/action/storage_attestation","attest_author":"https://pith.science/pith/NSTDOCP52QB5HITOWMTJ2OMDMU/action/author_attestation","sign_citation":"https://pith.science/pith/NSTDOCP52QB5HITOWMTJ2OMDMU/action/citation_signature","submit_replication":"https://pith.science/pith/NSTDOCP52QB5HITOWMTJ2OMDMU/action/replication_record"}},"created_at":"2026-07-05T10:20:34.296804+00:00","updated_at":"2026-07-05T10:20:34.296804+00:00"}