{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LXSBAZIFQ7YMHNAIXFN7TYVHHB","short_pith_number":"pith:LXSBAZIF","schema_version":"1.0","canonical_sha256":"5de410650587f0c3b408b95bf9e2a7387e073848d76b1544b615a25a7c6fd25f","source":{"kind":"arxiv","id":"1904.05138","version":1},"attestation_state":"computed","paper":{"title":"Algorithm for studying polynomial maps and reductions modulo prime number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.NT","authors_text":"El\\.zbieta Adamus, Pawe{\\l} Bogdan","submitted_at":"2019-04-10T12:39:31Z","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"},"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":"1904.05138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-04-10T12:39:31Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"3ae3c3d8b1a53e9371bf90b43f4022832bce954cd8db415491d8037a26dbc667","abstract_canon_sha256":"053cc0aa048ff02a32679a40ec3471095f4d96d4062b32f7909904e25af00816"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:54.041297Z","signature_b64":"4MXEIppGIl5cpxicHJ4W8O5kpicxcyWnnyTNHZiD3vOcCK+jErQEUsaiJ5qpNnPZzzKpL3Uw3jENhhRXdvm3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5de410650587f0c3b408b95bf9e2a7387e073848d76b1544b615a25a7c6fd25f","last_reissued_at":"2026-05-17T23:48:54.040805Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:54.040805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm for studying polynomial maps and reductions modulo prime number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.NT","authors_text":"El\\.zbieta Adamus, Pawe{\\l} Bogdan","submitted_at":"2019-04-10T12:39:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05138","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":"1904.05138","created_at":"2026-05-17T23:48:54.040876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05138v1","created_at":"2026-05-17T23:48:54.040876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05138","created_at":"2026-05-17T23:48:54.040876+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXSBAZIFQ7YM","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXSBAZIFQ7YMHNAI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXSBAZIF","created_at":"2026-05-18T12:33:21.387695+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/LXSBAZIFQ7YMHNAIXFN7TYVHHB","json":"https://pith.science/pith/LXSBAZIFQ7YMHNAIXFN7TYVHHB.json","graph_json":"https://pith.science/api/pith-number/LXSBAZIFQ7YMHNAIXFN7TYVHHB/graph.json","events_json":"https://pith.science/api/pith-number/LXSBAZIFQ7YMHNAIXFN7TYVHHB/events.json","paper":"https://pith.science/paper/LXSBAZIF"},"agent_actions":{"view_html":"https://pith.science/pith/LXSBAZIFQ7YMHNAIXFN7TYVHHB","download_json":"https://pith.science/pith/LXSBAZIFQ7YMHNAIXFN7TYVHHB.json","view_paper":"https://pith.science/paper/LXSBAZIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05138&json=true","fetch_graph":"https://pith.science/api/pith-number/LXSBAZIFQ7YMHNAIXFN7TYVHHB/graph.json","fetch_events":"https://pith.science/api/pith-number/LXSBAZIFQ7YMHNAIXFN7TYVHHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXSBAZIFQ7YMHNAIXFN7TYVHHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXSBAZIFQ7YMHNAIXFN7TYVHHB/action/storage_attestation","attest_author":"https://pith.science/pith/LXSBAZIFQ7YMHNAIXFN7TYVHHB/action/author_attestation","sign_citation":"https://pith.science/pith/LXSBAZIFQ7YMHNAIXFN7TYVHHB/action/citation_signature","submit_replication":"https://pith.science/pith/LXSBAZIFQ7YMHNAIXFN7TYVHHB/action/replication_record"}},"created_at":"2026-05-17T23:48:54.040876+00:00","updated_at":"2026-05-17T23:48:54.040876+00:00"}