{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D7V4XMCYZ2BB2FJLK67L4MI4WJ","short_pith_number":"pith:D7V4XMCY","canonical_record":{"source":{"id":"1702.05704","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-19T05:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"5a33e821c45d7559b92fdff9dd601722ba81e092f2520c6475c886c0e299bd67","abstract_canon_sha256":"653de50d5da29afc0ad3585ce15b1a8afde8e82a963af6f4cbe223425d263f34"},"schema_version":"1.0"},"canonical_sha256":"1febcbb058ce821d152b57bebe311cb25357b398258d48fae6520b41cf105c64","source":{"kind":"arxiv","id":"1702.05704","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05704","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05704v5","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05704","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"pith_short_12","alias_value":"D7V4XMCYZ2BB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D7V4XMCYZ2BB2FJL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D7V4XMCY","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D7V4XMCYZ2BB2FJLK67L4MI4WJ","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05704","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-19T05:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"5a33e821c45d7559b92fdff9dd601722ba81e092f2520c6475c886c0e299bd67","abstract_canon_sha256":"653de50d5da29afc0ad3585ce15b1a8afde8e82a963af6f4cbe223425d263f34"},"schema_version":"1.0"},"canonical_sha256":"1febcbb058ce821d152b57bebe311cb25357b398258d48fae6520b41cf105c64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:59.380882Z","signature_b64":"PkWTH0Pkq/5CjMW7Y4HLWujl6SJt6dpX3TTSGQdHJdaQaljwXpJjNj26GZPiVImkMSiMRBeQbJebsvG1Mu66CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1febcbb058ce821d152b57bebe311cb25357b398258d48fae6520b41cf105c64","last_reissued_at":"2026-05-18T00:33:59.380214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:59.380214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05704","source_version":5,"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-18T00:33:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YsyuPE4n2Yydyg6kJdmcBZH9WKLPBy9W1yBENnO2HiEcbfXkhTHRusW8vyw8AYJxJ3xjTDls80Ysfj+Hs5GVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:22:51.326162Z"},"content_sha256":"db6b9467887ec1d56d8f876abe4535c956ef50a6643f90b4541b6c6393ff045f","schema_version":"1.0","event_id":"sha256:db6b9467887ec1d56d8f876abe4535c956ef50a6643f90b4541b6c6393ff045f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D7V4XMCYZ2BB2FJLK67L4MI4WJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity of Atomic Chemical Reaction Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Doty, Shaopeng Zhu","submitted_at":"2017-02-19T05:51:35Z","abstract_excerpt":"Informally, a chemical reaction network is \"atomic\" if each reaction may be interpreted as the rearrangement of indivisible units of matter. There are several reasonable definitions formalizing this idea. We investigate the computational complexity of deciding whether a given network is atomic according to each of these definitions.\n  Our first definition, primitive atomic, which requires each reaction to preserve the total number of atoms, is to shown to be equivalent to mass conservation. Since it is known that it can be decided in polynomial time whether a given chemical reaction network is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05704","kind":"arxiv","version":5},"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-18T00:33:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K51mxbY9wmvO+t1E3LP0BtqAuHzaeGD21QRNwY74ajB8CMvwGi6m03bUWJYkAVLMrDOIszCgTZvwbowlHA2eCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:22:51.326527Z"},"content_sha256":"09358764c0d74a2bb0fd5581309117cdf833c9dc0eee7e46951a6c78e67e03ae","schema_version":"1.0","event_id":"sha256:09358764c0d74a2bb0fd5581309117cdf833c9dc0eee7e46951a6c78e67e03ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7V4XMCYZ2BB2FJLK67L4MI4WJ/bundle.json","state_url":"https://pith.science/pith/D7V4XMCYZ2BB2FJLK67L4MI4WJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7V4XMCYZ2BB2FJLK67L4MI4WJ/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-30T14:22:51Z","links":{"resolver":"https://pith.science/pith/D7V4XMCYZ2BB2FJLK67L4MI4WJ","bundle":"https://pith.science/pith/D7V4XMCYZ2BB2FJLK67L4MI4WJ/bundle.json","state":"https://pith.science/pith/D7V4XMCYZ2BB2FJLK67L4MI4WJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7V4XMCYZ2BB2FJLK67L4MI4WJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D7V4XMCYZ2BB2FJLK67L4MI4WJ","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":"653de50d5da29afc0ad3585ce15b1a8afde8e82a963af6f4cbe223425d263f34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-19T05:51:35Z","title_canon_sha256":"5a33e821c45d7559b92fdff9dd601722ba81e092f2520c6475c886c0e299bd67"},"schema_version":"1.0","source":{"id":"1702.05704","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05704","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05704v5","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05704","created_at":"2026-05-18T00:33:59Z"},{"alias_kind":"pith_short_12","alias_value":"D7V4XMCYZ2BB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D7V4XMCYZ2BB2FJL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D7V4XMCY","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:09358764c0d74a2bb0fd5581309117cdf833c9dc0eee7e46951a6c78e67e03ae","target":"graph","created_at":"2026-05-18T00:33:59Z","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":"Informally, a chemical reaction network is \"atomic\" if each reaction may be interpreted as the rearrangement of indivisible units of matter. There are several reasonable definitions formalizing this idea. We investigate the computational complexity of deciding whether a given network is atomic according to each of these definitions.\n  Our first definition, primitive atomic, which requires each reaction to preserve the total number of atoms, is to shown to be equivalent to mass conservation. Since it is known that it can be decided in polynomial time whether a given chemical reaction network is","authors_text":"David Doty, Shaopeng Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-19T05:51:35Z","title":"Computational Complexity of Atomic Chemical Reaction Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05704","kind":"arxiv","version":5},"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:db6b9467887ec1d56d8f876abe4535c956ef50a6643f90b4541b6c6393ff045f","target":"record","created_at":"2026-05-18T00:33:59Z","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":"653de50d5da29afc0ad3585ce15b1a8afde8e82a963af6f4cbe223425d263f34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-19T05:51:35Z","title_canon_sha256":"5a33e821c45d7559b92fdff9dd601722ba81e092f2520c6475c886c0e299bd67"},"schema_version":"1.0","source":{"id":"1702.05704","kind":"arxiv","version":5}},"canonical_sha256":"1febcbb058ce821d152b57bebe311cb25357b398258d48fae6520b41cf105c64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1febcbb058ce821d152b57bebe311cb25357b398258d48fae6520b41cf105c64","first_computed_at":"2026-05-18T00:33:59.380214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:59.380214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PkWTH0Pkq/5CjMW7Y4HLWujl6SJt6dpX3TTSGQdHJdaQaljwXpJjNj26GZPiVImkMSiMRBeQbJebsvG1Mu66CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:59.380882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05704","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db6b9467887ec1d56d8f876abe4535c956ef50a6643f90b4541b6c6393ff045f","sha256:09358764c0d74a2bb0fd5581309117cdf833c9dc0eee7e46951a6c78e67e03ae"],"state_sha256":"63219ef386c5806232f4c20c2fc3c0bed6669a334bb6f8d59608da45b71f2722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CY6ADC3c4B+IJaOSBkiNcFBmi/43wor7d6FrBL3c/8zG/6bvszdX1nACHEnTq2Nx5gVmyOsnhQZMrs9Fgs81BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:22:51.328543Z","bundle_sha256":"39af225363ac5a3a9b0133b44ba2e75097bd4716ed3550170ef69aef49a835e6"}}