{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4L7RJ3Z2F5G63AEQZP65GKHJ32","short_pith_number":"pith:4L7RJ3Z2","schema_version":"1.0","canonical_sha256":"e2ff14ef3a2f4ded8090cbfdd328e9de9fae10ded9787faff0bff1437c62465d","source":{"kind":"arxiv","id":"1501.03011","version":1},"attestation_state":"computed","paper":{"title":"Bivariate factorization using a critical fiber","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Martin Weimann","submitted_at":"2015-01-13T14:10:45Z","abstract_excerpt":"We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors, depending on the complexity of the ramification. We show that working along a critical fiber leads in some cases to a good theoretical complexity, due to the smaller number of analytic factors to recombine. We pay a particular attention to the case of polynomials that are non degenerate with respect to their P-adic Newton polytopes."},"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":"1501.03011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2015-01-13T14:10:45Z","cross_cats_sorted":[],"title_canon_sha256":"9ad5fb1b64d5f6e400e25739df21b1340965ec190380107c4dd6a4ce909524d9","abstract_canon_sha256":"6cfae8ed458144d809d8ddda7a0e721f5be02e997fffaecf544e2cc707829415"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:30.685336Z","signature_b64":"BTRLe9X6HrSjkxRwXEhq5V3FQpNvJqnN0MJguluAG8Edu6KNv0xcFyFHgkivcVXAJ8yyozzKSB+nniutwFXLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2ff14ef3a2f4ded8090cbfdd328e9de9fae10ded9787faff0bff1437c62465d","last_reissued_at":"2026-05-18T02:29:30.684763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:30.684763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bivariate factorization using a critical fiber","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Martin Weimann","submitted_at":"2015-01-13T14:10:45Z","abstract_excerpt":"We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors, depending on the complexity of the ramification. We show that working along a critical fiber leads in some cases to a good theoretical complexity, due to the smaller number of analytic factors to recombine. We pay a particular attention to the case of polynomials that are non degenerate with respect to their P-adic Newton polytopes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03011","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":"1501.03011","created_at":"2026-05-18T02:29:30.684858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03011v1","created_at":"2026-05-18T02:29:30.684858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03011","created_at":"2026-05-18T02:29:30.684858+00:00"},{"alias_kind":"pith_short_12","alias_value":"4L7RJ3Z2F5G6","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4L7RJ3Z2F5G63AEQ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4L7RJ3Z2","created_at":"2026-05-18T12:29:05.191682+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/4L7RJ3Z2F5G63AEQZP65GKHJ32","json":"https://pith.science/pith/4L7RJ3Z2F5G63AEQZP65GKHJ32.json","graph_json":"https://pith.science/api/pith-number/4L7RJ3Z2F5G63AEQZP65GKHJ32/graph.json","events_json":"https://pith.science/api/pith-number/4L7RJ3Z2F5G63AEQZP65GKHJ32/events.json","paper":"https://pith.science/paper/4L7RJ3Z2"},"agent_actions":{"view_html":"https://pith.science/pith/4L7RJ3Z2F5G63AEQZP65GKHJ32","download_json":"https://pith.science/pith/4L7RJ3Z2F5G63AEQZP65GKHJ32.json","view_paper":"https://pith.science/paper/4L7RJ3Z2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03011&json=true","fetch_graph":"https://pith.science/api/pith-number/4L7RJ3Z2F5G63AEQZP65GKHJ32/graph.json","fetch_events":"https://pith.science/api/pith-number/4L7RJ3Z2F5G63AEQZP65GKHJ32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4L7RJ3Z2F5G63AEQZP65GKHJ32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4L7RJ3Z2F5G63AEQZP65GKHJ32/action/storage_attestation","attest_author":"https://pith.science/pith/4L7RJ3Z2F5G63AEQZP65GKHJ32/action/author_attestation","sign_citation":"https://pith.science/pith/4L7RJ3Z2F5G63AEQZP65GKHJ32/action/citation_signature","submit_replication":"https://pith.science/pith/4L7RJ3Z2F5G63AEQZP65GKHJ32/action/replication_record"}},"created_at":"2026-05-18T02:29:30.684858+00:00","updated_at":"2026-05-18T02:29:30.684858+00:00"}