{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7E22BHP755S7HTQHD65F3SNIR7","short_pith_number":"pith:7E22BHP7","schema_version":"1.0","canonical_sha256":"f935a09dffef65f3ce071fba5dc9a88fdab2a461a27fbfab0bcd32fd4e043c5b","source":{"kind":"arxiv","id":"1708.07936","version":1},"attestation_state":"computed","paper":{"title":"Some algorithms related to the Jacobian Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.AC","authors_text":"Christian Valqui, Jorge A. Guccione, Juan J. Guccione, Rodrigo Horruitiner","submitted_at":"2017-08-26T06:00:33Z","abstract_excerpt":"We describe an algorithm that computes possible corners of hypothetical counterexamples to the Jacobian Conjecture up to a given bound. Using this algorithm we compute the possible families corresponding to $\\gcd(deg(P),deg(Q))\\le 35$, and all the pairs $(deg(P),deg(Q))$ with $\\max(deg(P),deg(Q))\\le 150$ for any hypothetical counterexample."},"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":"1708.07936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2017-08-26T06:00:33Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"9392529550be3af1cb6866d13cb228a03feb11c0feca9c397c79349a36520824","abstract_canon_sha256":"2909119febbc1c4295588352e2a8e1039a2532530c9286ed2c0ca483ed0b5bc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:37.588263Z","signature_b64":"pEj6zfDtiIXQbiWiS4JXldKcSC575DJVpep/MG/XgXLFPbCa4CiTZ1yuOmEoP/sUUvcQ3KwIgJPBffnRxSVtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f935a09dffef65f3ce071fba5dc9a88fdab2a461a27fbfab0bcd32fd4e043c5b","last_reissued_at":"2026-05-18T00:36:37.587675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:37.587675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some algorithms related to the Jacobian Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.AC","authors_text":"Christian Valqui, Jorge A. Guccione, Juan J. Guccione, Rodrigo Horruitiner","submitted_at":"2017-08-26T06:00:33Z","abstract_excerpt":"We describe an algorithm that computes possible corners of hypothetical counterexamples to the Jacobian Conjecture up to a given bound. Using this algorithm we compute the possible families corresponding to $\\gcd(deg(P),deg(Q))\\le 35$, and all the pairs $(deg(P),deg(Q))$ with $\\max(deg(P),deg(Q))\\le 150$ for any hypothetical counterexample."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07936","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":"1708.07936","created_at":"2026-05-18T00:36:37.587755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07936v1","created_at":"2026-05-18T00:36:37.587755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07936","created_at":"2026-05-18T00:36:37.587755+00:00"},{"alias_kind":"pith_short_12","alias_value":"7E22BHP755S7","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7E22BHP755S7HTQH","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7E22BHP7","created_at":"2026-05-18T12:31:05.417338+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/7E22BHP755S7HTQHD65F3SNIR7","json":"https://pith.science/pith/7E22BHP755S7HTQHD65F3SNIR7.json","graph_json":"https://pith.science/api/pith-number/7E22BHP755S7HTQHD65F3SNIR7/graph.json","events_json":"https://pith.science/api/pith-number/7E22BHP755S7HTQHD65F3SNIR7/events.json","paper":"https://pith.science/paper/7E22BHP7"},"agent_actions":{"view_html":"https://pith.science/pith/7E22BHP755S7HTQHD65F3SNIR7","download_json":"https://pith.science/pith/7E22BHP755S7HTQHD65F3SNIR7.json","view_paper":"https://pith.science/paper/7E22BHP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07936&json=true","fetch_graph":"https://pith.science/api/pith-number/7E22BHP755S7HTQHD65F3SNIR7/graph.json","fetch_events":"https://pith.science/api/pith-number/7E22BHP755S7HTQHD65F3SNIR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7E22BHP755S7HTQHD65F3SNIR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7E22BHP755S7HTQHD65F3SNIR7/action/storage_attestation","attest_author":"https://pith.science/pith/7E22BHP755S7HTQHD65F3SNIR7/action/author_attestation","sign_citation":"https://pith.science/pith/7E22BHP755S7HTQHD65F3SNIR7/action/citation_signature","submit_replication":"https://pith.science/pith/7E22BHP755S7HTQHD65F3SNIR7/action/replication_record"}},"created_at":"2026-05-18T00:36:37.587755+00:00","updated_at":"2026-05-18T00:36:37.587755+00:00"}