{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HT7QCCJWSLO6UM5KGVVNEY5HJC","short_pith_number":"pith:HT7QCCJW","schema_version":"1.0","canonical_sha256":"3cff01093692ddea33aa356ad263a7489d35097ea79f234db1c1d1b7ca3928d1","source":{"kind":"arxiv","id":"1501.05767","version":1},"attestation_state":"computed","paper":{"title":"Integral polynomials with small discriminants and resultants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Friedrich G\\\"otze, Vasili Bernik, Victor Beresnevich","submitted_at":"2015-01-23T11:05:33Z","abstract_excerpt":"Let $n\\in\\mathbb{N}$ be fixed, $Q>1$ be a real parameter and $\\mathcal{P}_n(Q)$ denote the set of polynomials over $\\mathbb{Z}$ of degree $n$ and height at most $Q$. In this paper we investigate the following counting problems regarding polynomials with small discriminant $D(P)$ and pairs of polynomials with small resultant $R(P_1,P_2)$:\n  (i) given $0\\le v\\le n-1$ and a sufficiently large $Q$, estimate the number of polynomials $P\\in\\mathcal{P}_n(Q)$ such that $$0<|D(P)|\\le Q^{2n-2-2v};$$ (ii) given $0\\le w\\le n$ and a sufficiently large $Q$, estimate the number of pairs of polynomials $P_1,P"},"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.05767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-01-23T11:05:33Z","cross_cats_sorted":[],"title_canon_sha256":"ee287c7c79c069fa1279d1aaf92a180ac710f20e62ee794fbdeb686e2bf6f8ae","abstract_canon_sha256":"b0f208560ac645a5bc578c85a897d17b2d8ccfc6a68cf05967fe08522cd55010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:49.045888Z","signature_b64":"RwbiG204H86cYPJx/PZwgYs/aq7QPHAV1VoDO7wEtmLjjigOD1Fd2nZdcGrVVqx62DSBzNAu+o7ug6Y6hRuhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cff01093692ddea33aa356ad263a7489d35097ea79f234db1c1d1b7ca3928d1","last_reissued_at":"2026-05-18T02:28:49.045525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:49.045525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integral polynomials with small discriminants and resultants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Friedrich G\\\"otze, Vasili Bernik, Victor Beresnevich","submitted_at":"2015-01-23T11:05:33Z","abstract_excerpt":"Let $n\\in\\mathbb{N}$ be fixed, $Q>1$ be a real parameter and $\\mathcal{P}_n(Q)$ denote the set of polynomials over $\\mathbb{Z}$ of degree $n$ and height at most $Q$. In this paper we investigate the following counting problems regarding polynomials with small discriminant $D(P)$ and pairs of polynomials with small resultant $R(P_1,P_2)$:\n  (i) given $0\\le v\\le n-1$ and a sufficiently large $Q$, estimate the number of polynomials $P\\in\\mathcal{P}_n(Q)$ such that $$0<|D(P)|\\le Q^{2n-2-2v};$$ (ii) given $0\\le w\\le n$ and a sufficiently large $Q$, estimate the number of pairs of polynomials $P_1,P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05767","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.05767","created_at":"2026-05-18T02:28:49.045582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05767v1","created_at":"2026-05-18T02:28:49.045582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05767","created_at":"2026-05-18T02:28:49.045582+00:00"},{"alias_kind":"pith_short_12","alias_value":"HT7QCCJWSLO6","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HT7QCCJWSLO6UM5K","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HT7QCCJW","created_at":"2026-05-18T12:29:25.134429+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/HT7QCCJWSLO6UM5KGVVNEY5HJC","json":"https://pith.science/pith/HT7QCCJWSLO6UM5KGVVNEY5HJC.json","graph_json":"https://pith.science/api/pith-number/HT7QCCJWSLO6UM5KGVVNEY5HJC/graph.json","events_json":"https://pith.science/api/pith-number/HT7QCCJWSLO6UM5KGVVNEY5HJC/events.json","paper":"https://pith.science/paper/HT7QCCJW"},"agent_actions":{"view_html":"https://pith.science/pith/HT7QCCJWSLO6UM5KGVVNEY5HJC","download_json":"https://pith.science/pith/HT7QCCJWSLO6UM5KGVVNEY5HJC.json","view_paper":"https://pith.science/paper/HT7QCCJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05767&json=true","fetch_graph":"https://pith.science/api/pith-number/HT7QCCJWSLO6UM5KGVVNEY5HJC/graph.json","fetch_events":"https://pith.science/api/pith-number/HT7QCCJWSLO6UM5KGVVNEY5HJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HT7QCCJWSLO6UM5KGVVNEY5HJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HT7QCCJWSLO6UM5KGVVNEY5HJC/action/storage_attestation","attest_author":"https://pith.science/pith/HT7QCCJWSLO6UM5KGVVNEY5HJC/action/author_attestation","sign_citation":"https://pith.science/pith/HT7QCCJWSLO6UM5KGVVNEY5HJC/action/citation_signature","submit_replication":"https://pith.science/pith/HT7QCCJWSLO6UM5KGVVNEY5HJC/action/replication_record"}},"created_at":"2026-05-18T02:28:49.045582+00:00","updated_at":"2026-05-18T02:28:49.045582+00:00"}