{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6NO4JSEBVKYTLD7YQA37XX4655","short_pith_number":"pith:6NO4JSEB","schema_version":"1.0","canonical_sha256":"f35dc4c881aab1358ff88037fbdf9eef6c3cf302c23d475caa3f14b8339b1fff","source":{"kind":"arxiv","id":"1801.01240","version":2},"attestation_state":"computed","paper":{"title":"The distance to square-free polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Art\\=uras Dubickas, Min Sha","submitted_at":"2018-01-04T04:06:43Z","abstract_excerpt":"In this paper, we consider a variant of Tur\\'an's problem on the distance from an integer polynomial in $\\mathbb{Z}[x]$ to the nea\\-rest irreducible polynomial in $\\mathbb{Z}[x]$. We prove that for any polynomial $f \\in \\mathbb{Z}[x]$, there exist infinitely many square-free polynomials $g\\in \\mathbb{Z}[x]$ such that $L(f-g) \\le 2$, where $L(f-g)$ denotes the sum of the absolute values of the coefficients of $f-g$. On the other hand, we show that this inequality cannot be replaced by $L(f-g) \\le 1$. For this, for each integer $d \\geq 16$ we construct infinitely many polynomials $f \\in \\mathbb{"},"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":"1801.01240","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-01-04T04:06:43Z","cross_cats_sorted":[],"title_canon_sha256":"729fc03113a9f4c7f690de3daa490ff963089538fa1fca03d0686cf3ed645b65","abstract_canon_sha256":"6df88eb1569064d186311b77206810c9905c1bd672b62ac3b70277457ac3f33a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:03.161956Z","signature_b64":"9a9YfIvZJm/vLmU4ruylzKJpu99y69zNRNv1mZljtZfivlTLOp2kE89pFIDA+xYIgH0RN2kaocFKg+Cyyu7cDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f35dc4c881aab1358ff88037fbdf9eef6c3cf302c23d475caa3f14b8339b1fff","last_reissued_at":"2026-05-18T00:08:03.161306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:03.161306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The distance to square-free polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Art\\=uras Dubickas, Min Sha","submitted_at":"2018-01-04T04:06:43Z","abstract_excerpt":"In this paper, we consider a variant of Tur\\'an's problem on the distance from an integer polynomial in $\\mathbb{Z}[x]$ to the nea\\-rest irreducible polynomial in $\\mathbb{Z}[x]$. We prove that for any polynomial $f \\in \\mathbb{Z}[x]$, there exist infinitely many square-free polynomials $g\\in \\mathbb{Z}[x]$ such that $L(f-g) \\le 2$, where $L(f-g)$ denotes the sum of the absolute values of the coefficients of $f-g$. On the other hand, we show that this inequality cannot be replaced by $L(f-g) \\le 1$. For this, for each integer $d \\geq 16$ we construct infinitely many polynomials $f \\in \\mathbb{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01240","kind":"arxiv","version":2},"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":"1801.01240","created_at":"2026-05-18T00:08:03.161409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01240v2","created_at":"2026-05-18T00:08:03.161409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01240","created_at":"2026-05-18T00:08:03.161409+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NO4JSEBVKYT","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NO4JSEBVKYTLD7Y","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NO4JSEB","created_at":"2026-05-18T12:32:11.075285+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/6NO4JSEBVKYTLD7YQA37XX4655","json":"https://pith.science/pith/6NO4JSEBVKYTLD7YQA37XX4655.json","graph_json":"https://pith.science/api/pith-number/6NO4JSEBVKYTLD7YQA37XX4655/graph.json","events_json":"https://pith.science/api/pith-number/6NO4JSEBVKYTLD7YQA37XX4655/events.json","paper":"https://pith.science/paper/6NO4JSEB"},"agent_actions":{"view_html":"https://pith.science/pith/6NO4JSEBVKYTLD7YQA37XX4655","download_json":"https://pith.science/pith/6NO4JSEBVKYTLD7YQA37XX4655.json","view_paper":"https://pith.science/paper/6NO4JSEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01240&json=true","fetch_graph":"https://pith.science/api/pith-number/6NO4JSEBVKYTLD7YQA37XX4655/graph.json","fetch_events":"https://pith.science/api/pith-number/6NO4JSEBVKYTLD7YQA37XX4655/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NO4JSEBVKYTLD7YQA37XX4655/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NO4JSEBVKYTLD7YQA37XX4655/action/storage_attestation","attest_author":"https://pith.science/pith/6NO4JSEBVKYTLD7YQA37XX4655/action/author_attestation","sign_citation":"https://pith.science/pith/6NO4JSEBVKYTLD7YQA37XX4655/action/citation_signature","submit_replication":"https://pith.science/pith/6NO4JSEBVKYTLD7YQA37XX4655/action/replication_record"}},"created_at":"2026-05-18T00:08:03.161409+00:00","updated_at":"2026-05-18T00:08:03.161409+00:00"}