{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IG7IFF63OYILIC3AMIIT52GFLU","short_pith_number":"pith:IG7IFF63","canonical_record":{"source":{"id":"1907.06012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-13T05:27:55Z","cross_cats_sorted":["cs.FL","nlin.CG"],"title_canon_sha256":"067a907af0988fea71a074f30bf8c7238b46dd6687650b76a7a5caed0f55b3bb","abstract_canon_sha256":"d7adc8dff0785ed14ad206609e975f1d2ee89492e2feb18b4009a9213f830536"},"schema_version":"1.0"},"canonical_sha256":"41be8297db7610b40b6062113ee8c55d0a5588d0a1dc9e4043a84c23e02ebdb0","source":{"kind":"arxiv","id":"1907.06012","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06012","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06012v1","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06012","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"IG7IFF63OYIL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IG7IFF63OYILIC3A","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IG7IFF63","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IG7IFF63OYILIC3AMIIT52GFLU","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-13T05:27:55Z","cross_cats_sorted":["cs.FL","nlin.CG"],"title_canon_sha256":"067a907af0988fea71a074f30bf8c7238b46dd6687650b76a7a5caed0f55b3bb","abstract_canon_sha256":"d7adc8dff0785ed14ad206609e975f1d2ee89492e2feb18b4009a9213f830536"},"schema_version":"1.0"},"canonical_sha256":"41be8297db7610b40b6062113ee8c55d0a5588d0a1dc9e4043a84c23e02ebdb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:42.673216Z","signature_b64":"kJa1jFhl+JXgCbKYXTkMzY8S3z/lNfLbrN7qx8Fir2gs098LazsZgIZqYH9/VzZCBAT5sjBisuHYc0K+N8p1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41be8297db7610b40b6062113ee8c55d0a5588d0a1dc9e4043a84c23e02ebdb0","last_reissued_at":"2026-05-17T23:40:42.672575Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:42.672575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06012","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-17T23:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5dYooI5GrEow1JB+GQOCFMK0eVn9K73WBolrmI3RtkBv4s+8VekZt48kVfH44leD6RXyPsH9eIQI+qPtMjk6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:16:00.359944Z"},"content_sha256":"df68aedec161b8ceed2ed9a55d8bfb23fea53049351ec9b07253844ccd33ab8a","schema_version":"1.0","event_id":"sha256:df68aedec161b8ceed2ed9a55d8bfb23fea53049351ec9b07253844ccd33ab8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IG7IFF63OYILIC3AMIIT52GFLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","nlin.CG"],"primary_cat":"cs.CC","authors_text":"Chao Wang, Tianze Wang, Xinyu Du, Zeyu Gao","submitted_at":"2019-07-13T05:27:55Z","abstract_excerpt":"In this paper, we study reversibility of one-dimensional(1D) linear cellular automata(LCA) under null boundary condition, whose core problems have been divided into two main parts: calculating the period of reversibility and verifying the reversibility in a period. With existing methods, the time and space complexity of these two parts are still too expensive to be employed. So the process soon becomes totally incalculable with a slightly big size, which greatly limits its application. In this paper, we set out to solve these two problems using two efficient algorithms, which make it possible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06012","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-17T23:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUSIpwKZ0S1riOtkm2TaymsSgoYCCEEPFuS3U05+STFCbWCjQteGrgqM9sdbddx2pUFIvtC390AysUhJbStRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:16:00.360554Z"},"content_sha256":"65da75ce7eb4b9116dba05fbba47a98774b99192feab6d8ea0aba78165baed56","schema_version":"1.0","event_id":"sha256:65da75ce7eb4b9116dba05fbba47a98774b99192feab6d8ea0aba78165baed56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU/bundle.json","state_url":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IG7IFF63OYILIC3AMIIT52GFLU/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-28T06:16:00Z","links":{"resolver":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU","bundle":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU/bundle.json","state":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IG7IFF63OYILIC3AMIIT52GFLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IG7IFF63OYILIC3AMIIT52GFLU","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":"d7adc8dff0785ed14ad206609e975f1d2ee89492e2feb18b4009a9213f830536","cross_cats_sorted":["cs.FL","nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-13T05:27:55Z","title_canon_sha256":"067a907af0988fea71a074f30bf8c7238b46dd6687650b76a7a5caed0f55b3bb"},"schema_version":"1.0","source":{"id":"1907.06012","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06012","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06012v1","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06012","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"IG7IFF63OYIL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IG7IFF63OYILIC3A","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IG7IFF63","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:65da75ce7eb4b9116dba05fbba47a98774b99192feab6d8ea0aba78165baed56","target":"graph","created_at":"2026-05-17T23:40:42Z","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, we study reversibility of one-dimensional(1D) linear cellular automata(LCA) under null boundary condition, whose core problems have been divided into two main parts: calculating the period of reversibility and verifying the reversibility in a period. With existing methods, the time and space complexity of these two parts are still too expensive to be employed. So the process soon becomes totally incalculable with a slightly big size, which greatly limits its application. In this paper, we set out to solve these two problems using two efficient algorithms, which make it possible ","authors_text":"Chao Wang, Tianze Wang, Xinyu Du, Zeyu Gao","cross_cats":["cs.FL","nlin.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-13T05:27:55Z","title":"Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06012","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:df68aedec161b8ceed2ed9a55d8bfb23fea53049351ec9b07253844ccd33ab8a","target":"record","created_at":"2026-05-17T23:40:42Z","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":"d7adc8dff0785ed14ad206609e975f1d2ee89492e2feb18b4009a9213f830536","cross_cats_sorted":["cs.FL","nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-13T05:27:55Z","title_canon_sha256":"067a907af0988fea71a074f30bf8c7238b46dd6687650b76a7a5caed0f55b3bb"},"schema_version":"1.0","source":{"id":"1907.06012","kind":"arxiv","version":1}},"canonical_sha256":"41be8297db7610b40b6062113ee8c55d0a5588d0a1dc9e4043a84c23e02ebdb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41be8297db7610b40b6062113ee8c55d0a5588d0a1dc9e4043a84c23e02ebdb0","first_computed_at":"2026-05-17T23:40:42.672575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:42.672575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kJa1jFhl+JXgCbKYXTkMzY8S3z/lNfLbrN7qx8Fir2gs098LazsZgIZqYH9/VzZCBAT5sjBisuHYc0K+N8p1AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:42.673216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06012","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df68aedec161b8ceed2ed9a55d8bfb23fea53049351ec9b07253844ccd33ab8a","sha256:65da75ce7eb4b9116dba05fbba47a98774b99192feab6d8ea0aba78165baed56"],"state_sha256":"4f7c4f71cde26df8c195d80a1f95ea0000dfdadff5119ba9f0004c0dfa190479"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4u8Cq8jIJ364mmtTm1wxPLEe/5rWOkk5n6bKoKwIam9Bz8GikjbLTHHt1AGH4zzhNr27bsT+b4/diSUR7t8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:16:00.363418Z","bundle_sha256":"ff3df8738ad06ba69b5651bad9a765b475e4f3d3efabd44e5853a28a85475db2"}}