{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IG7IFF63OYILIC3AMIIT52GFLU","short_pith_number":"pith:IG7IFF63","schema_version":"1.0","canonical_sha256":"41be8297db7610b40b6062113ee8c55d0a5588d0a1dc9e4043a84c23e02ebdb0","source":{"kind":"arxiv","id":"1907.06012","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.06012","created_at":"2026-05-17T23:40:42.672681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06012v1","created_at":"2026-05-17T23:40:42.672681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06012","created_at":"2026-05-17T23:40:42.672681+00:00"},{"alias_kind":"pith_short_12","alias_value":"IG7IFF63OYIL","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IG7IFF63OYILIC3A","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IG7IFF63","created_at":"2026-05-18T12:33:18.533446+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/IG7IFF63OYILIC3AMIIT52GFLU","json":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU.json","graph_json":"https://pith.science/api/pith-number/IG7IFF63OYILIC3AMIIT52GFLU/graph.json","events_json":"https://pith.science/api/pith-number/IG7IFF63OYILIC3AMIIT52GFLU/events.json","paper":"https://pith.science/paper/IG7IFF63"},"agent_actions":{"view_html":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU","download_json":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU.json","view_paper":"https://pith.science/paper/IG7IFF63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06012&json=true","fetch_graph":"https://pith.science/api/pith-number/IG7IFF63OYILIC3AMIIT52GFLU/graph.json","fetch_events":"https://pith.science/api/pith-number/IG7IFF63OYILIC3AMIIT52GFLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU/action/storage_attestation","attest_author":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU/action/author_attestation","sign_citation":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU/action/citation_signature","submit_replication":"https://pith.science/pith/IG7IFF63OYILIC3AMIIT52GFLU/action/replication_record"}},"created_at":"2026-05-17T23:40:42.672681+00:00","updated_at":"2026-05-17T23:40:42.672681+00:00"}