{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OYYVONOB5XD47JOY4PQ7H2VRSJ","short_pith_number":"pith:OYYVONOB","schema_version":"1.0","canonical_sha256":"76315735c1edc7cfa5d8e3e1f3eab192725f1a053166e218404477da11112a74","source":{"kind":"arxiv","id":"1612.07786","version":1},"attestation_state":"computed","paper":{"title":"On the bit complexity of polynomial system solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Guillermo Matera, Nardo Gimenez","submitted_at":"2016-12-22T20:46:42Z","abstract_excerpt":"We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\\'ezout number of the system and linear in its bit size. Our algorithm solves the input system modulo a prime number p and applies p-adic lifting. For this purpose, we establish a number of results on the bit length of a \"lucky\" prime p, namely one for which the reduction of the input system modulo p preserves certain fundamental geometric and algebraic properties of the original system. These results rely on the analysi"},"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":"1612.07786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-12-22T20:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"4be66e1e7aebec3eb4e895ad3bbbd74a9ecbe301ef4d3cfbf46c4a4e8dab5de4","abstract_canon_sha256":"46a6531b154aac37ae07a833edc2986368a4ff401b174db90ed18ff7314717d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:09.362920Z","signature_b64":"aa4OBRrY6oTf67TEORN6gP3j+lrFU3N+lVQ1XL+DAk65JoP1Alw059oXbZCnTm4/VkK40PJKwPbv9PkiTcQzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76315735c1edc7cfa5d8e3e1f3eab192725f1a053166e218404477da11112a74","last_reissued_at":"2026-05-18T00:54:09.362513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:09.362513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the bit complexity of polynomial system solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Guillermo Matera, Nardo Gimenez","submitted_at":"2016-12-22T20:46:42Z","abstract_excerpt":"We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\\'ezout number of the system and linear in its bit size. Our algorithm solves the input system modulo a prime number p and applies p-adic lifting. For this purpose, we establish a number of results on the bit length of a \"lucky\" prime p, namely one for which the reduction of the input system modulo p preserves certain fundamental geometric and algebraic properties of the original system. These results rely on the analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07786","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":"1612.07786","created_at":"2026-05-18T00:54:09.362574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07786v1","created_at":"2026-05-18T00:54:09.362574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07786","created_at":"2026-05-18T00:54:09.362574+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYYVONOB5XD4","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYYVONOB5XD47JOY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYYVONOB","created_at":"2026-05-18T12:30:36.002864+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/OYYVONOB5XD47JOY4PQ7H2VRSJ","json":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ.json","graph_json":"https://pith.science/api/pith-number/OYYVONOB5XD47JOY4PQ7H2VRSJ/graph.json","events_json":"https://pith.science/api/pith-number/OYYVONOB5XD47JOY4PQ7H2VRSJ/events.json","paper":"https://pith.science/paper/OYYVONOB"},"agent_actions":{"view_html":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ","download_json":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ.json","view_paper":"https://pith.science/paper/OYYVONOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07786&json=true","fetch_graph":"https://pith.science/api/pith-number/OYYVONOB5XD47JOY4PQ7H2VRSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OYYVONOB5XD47JOY4PQ7H2VRSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/action/storage_attestation","attest_author":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/action/author_attestation","sign_citation":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/action/citation_signature","submit_replication":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/action/replication_record"}},"created_at":"2026-05-18T00:54:09.362574+00:00","updated_at":"2026-05-18T00:54:09.362574+00:00"}