{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LXSBAZIFQ7YMHNAIXFN7TYVHHB","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":"053cc0aa048ff02a32679a40ec3471095f4d96d4062b32f7909904e25af00816","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-04-10T12:39:31Z","title_canon_sha256":"3ae3c3d8b1a53e9371bf90b43f4022832bce954cd8db415491d8037a26dbc667"},"schema_version":"1.0","source":{"id":"1904.05138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05138","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05138v1","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05138","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"LXSBAZIFQ7YM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LXSBAZIFQ7YMHNAI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LXSBAZIF","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:be7309358ed26c9a9ecf541139afcaf81d1786626a6e9c8df9e3160797b4ee28","target":"graph","created_at":"2026-05-17T23:48:54Z","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 our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. Also the class of Pascal finite polynomial automorphisms was introduced. Pascal finite polynomial maps constitute a generalization of exponential automorphisms to positive characteristic.\n  In this note we explore properties of the algorithm while using Segre homotopy and reductions modulo prime number. We give a method of retrieving an inverse of a given polynomial automorphism $F$ with integer coefficients form a finite set of the inverses of its reductions modulo prime numbers. Some examples il","authors_text":"El\\.zbieta Adamus, Pawe{\\l} Bogdan","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-04-10T12:39:31Z","title":"Algorithm for studying polynomial maps and reductions modulo prime number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05138","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:ee7c573d19adf13654bc9c45d310d7dcb04901a0c1f1db9c080fd2da81754cbe","target":"record","created_at":"2026-05-17T23:48:54Z","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":"053cc0aa048ff02a32679a40ec3471095f4d96d4062b32f7909904e25af00816","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-04-10T12:39:31Z","title_canon_sha256":"3ae3c3d8b1a53e9371bf90b43f4022832bce954cd8db415491d8037a26dbc667"},"schema_version":"1.0","source":{"id":"1904.05138","kind":"arxiv","version":1}},"canonical_sha256":"5de410650587f0c3b408b95bf9e2a7387e073848d76b1544b615a25a7c6fd25f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5de410650587f0c3b408b95bf9e2a7387e073848d76b1544b615a25a7c6fd25f","first_computed_at":"2026-05-17T23:48:54.040805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:54.040805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4MXEIppGIl5cpxicHJ4W8O5kpicxcyWnnyTNHZiD3vOcCK+jErQEUsaiJ5qpNnPZzzKpL3Uw3jENhhRXdvm3BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:54.041297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee7c573d19adf13654bc9c45d310d7dcb04901a0c1f1db9c080fd2da81754cbe","sha256:be7309358ed26c9a9ecf541139afcaf81d1786626a6e9c8df9e3160797b4ee28"],"state_sha256":"6f89d4a61d84f4f5be9e12523452692ed86703b57b9b4666ebf0d470414960c7"}