{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OAUKOXNLI2ZILBEORZUDR43SUS","short_pith_number":"pith:OAUKOXNL","schema_version":"1.0","canonical_sha256":"7028a75dab46b285848e8e6838f372a4aadaf76b6d565920c3a49a46b138213b","source":{"kind":"arxiv","id":"1506.01654","version":1},"attestation_state":"computed","paper":{"title":"An inversion algorithm for polynomial maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Elzbieta Adamus, Pawel Bogdan, Teresa Crespo, Zbigniew Hajto","submitted_at":"2015-06-04T17:07:07Z","abstract_excerpt":"We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero polynomial appears in all n sequences and moreover computes the inverse map of F. This algorithm provides a classification of polynomial automorphisms of affine spaces."},"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":"1506.01654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2015-06-04T17:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"31292f657d55a8039ee4d41c19b807a0bbc1baffa32a0bc6932ba924987c879c","abstract_canon_sha256":"5f2195f2de54b7c0d9a2b8ab0953dff449dac61ba4ee660ce67571983ab75725"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:57:18.325550Z","signature_b64":"mZ0JF8nHM02SBz3n8tSbDvYsYBwqzCwXDlJhiMmSNq0y2dIKv391fOAWOlAlUKk8FhfQkduKkGKLPoLYh3AUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7028a75dab46b285848e8e6838f372a4aadaf76b6d565920c3a49a46b138213b","last_reissued_at":"2026-05-18T01:57:18.325063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:57:18.325063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An inversion algorithm for polynomial maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Elzbieta Adamus, Pawel Bogdan, Teresa Crespo, Zbigniew Hajto","submitted_at":"2015-06-04T17:07:07Z","abstract_excerpt":"We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero polynomial appears in all n sequences and moreover computes the inverse map of F. This algorithm provides a classification of polynomial automorphisms of affine spaces."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01654","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":"1506.01654","created_at":"2026-05-18T01:57:18.325130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.01654v1","created_at":"2026-05-18T01:57:18.325130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01654","created_at":"2026-05-18T01:57:18.325130+00:00"},{"alias_kind":"pith_short_12","alias_value":"OAUKOXNLI2ZI","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OAUKOXNLI2ZILBEO","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OAUKOXNL","created_at":"2026-05-18T12:29:34.919912+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/OAUKOXNLI2ZILBEORZUDR43SUS","json":"https://pith.science/pith/OAUKOXNLI2ZILBEORZUDR43SUS.json","graph_json":"https://pith.science/api/pith-number/OAUKOXNLI2ZILBEORZUDR43SUS/graph.json","events_json":"https://pith.science/api/pith-number/OAUKOXNLI2ZILBEORZUDR43SUS/events.json","paper":"https://pith.science/paper/OAUKOXNL"},"agent_actions":{"view_html":"https://pith.science/pith/OAUKOXNLI2ZILBEORZUDR43SUS","download_json":"https://pith.science/pith/OAUKOXNLI2ZILBEORZUDR43SUS.json","view_paper":"https://pith.science/paper/OAUKOXNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.01654&json=true","fetch_graph":"https://pith.science/api/pith-number/OAUKOXNLI2ZILBEORZUDR43SUS/graph.json","fetch_events":"https://pith.science/api/pith-number/OAUKOXNLI2ZILBEORZUDR43SUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OAUKOXNLI2ZILBEORZUDR43SUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OAUKOXNLI2ZILBEORZUDR43SUS/action/storage_attestation","attest_author":"https://pith.science/pith/OAUKOXNLI2ZILBEORZUDR43SUS/action/author_attestation","sign_citation":"https://pith.science/pith/OAUKOXNLI2ZILBEORZUDR43SUS/action/citation_signature","submit_replication":"https://pith.science/pith/OAUKOXNLI2ZILBEORZUDR43SUS/action/replication_record"}},"created_at":"2026-05-18T01:57:18.325130+00:00","updated_at":"2026-05-18T01:57:18.325130+00:00"}