{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DUYR5VAWGBYUDX6T7GRWRPJUEK","short_pith_number":"pith:DUYR5VAW","schema_version":"1.0","canonical_sha256":"1d311ed416307141dfd3f9a368bd3422a4722128f8475d548edc723bee314ad2","source":{"kind":"arxiv","id":"2606.30690","version":1},"attestation_state":"computed","paper":{"title":"Power-Saving Bounds For Monic Minkowski Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Seamus Lavine","submitted_at":"2026-06-28T20:32:23Z","abstract_excerpt":"We prove that if $f\\in \\mathbb Z[x]$ is a monic polynomial of degree $k\\geq 2$, then there exists a constant $c>0$, depending only on $f$, and finite sets $A\\subset \\mathbb R$ of arbitrarily large size such that \\[ |f(A)|\\leq |A|^{k-c}, \\] where $f(A)$ is interpreted in the Minkowski sum-product sense. In particular, taking $f(x)=x^2+x$, this gives a power-saving upper bound for $AA+A$, answering a question raised by Roche-Newton, Ruzsa, Shen, and Shkredov."},"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":"2606.30690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-28T20:32:23Z","cross_cats_sorted":[],"title_canon_sha256":"791a15ef590abb7e3d98fbda7ec96865f2fc4c04914f57b539c9db4684eb886b","abstract_canon_sha256":"b7fc7bde01370da07f477855558e01e3ff3ccc65cb1fac1e5a59a8d16a749e67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T00:17:13.609530Z","signature_b64":"v1a8WwBKXQIo5dEZ5tmXXatzZqhAT5oiJVOVeD9TeBZ8ngJraGq6Cv94PHomiHUpXWLUpLAOGUKCA51xKQT2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d311ed416307141dfd3f9a368bd3422a4722128f8475d548edc723bee314ad2","last_reissued_at":"2026-07-01T00:17:13.609130Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T00:17:13.609130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Power-Saving Bounds For Monic Minkowski Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Seamus Lavine","submitted_at":"2026-06-28T20:32:23Z","abstract_excerpt":"We prove that if $f\\in \\mathbb Z[x]$ is a monic polynomial of degree $k\\geq 2$, then there exists a constant $c>0$, depending only on $f$, and finite sets $A\\subset \\mathbb R$ of arbitrarily large size such that \\[ |f(A)|\\leq |A|^{k-c}, \\] where $f(A)$ is interpreted in the Minkowski sum-product sense. In particular, taking $f(x)=x^2+x$, this gives a power-saving upper bound for $AA+A$, answering a question raised by Roche-Newton, Ruzsa, Shen, and Shkredov."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30690","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.30690/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.30690","created_at":"2026-07-01T00:17:13.609191+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30690v1","created_at":"2026-07-01T00:17:13.609191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30690","created_at":"2026-07-01T00:17:13.609191+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUYR5VAWGBYU","created_at":"2026-07-01T00:17:13.609191+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUYR5VAWGBYUDX6T","created_at":"2026-07-01T00:17:13.609191+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUYR5VAW","created_at":"2026-07-01T00:17:13.609191+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/DUYR5VAWGBYUDX6T7GRWRPJUEK","json":"https://pith.science/pith/DUYR5VAWGBYUDX6T7GRWRPJUEK.json","graph_json":"https://pith.science/api/pith-number/DUYR5VAWGBYUDX6T7GRWRPJUEK/graph.json","events_json":"https://pith.science/api/pith-number/DUYR5VAWGBYUDX6T7GRWRPJUEK/events.json","paper":"https://pith.science/paper/DUYR5VAW"},"agent_actions":{"view_html":"https://pith.science/pith/DUYR5VAWGBYUDX6T7GRWRPJUEK","download_json":"https://pith.science/pith/DUYR5VAWGBYUDX6T7GRWRPJUEK.json","view_paper":"https://pith.science/paper/DUYR5VAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30690&json=true","fetch_graph":"https://pith.science/api/pith-number/DUYR5VAWGBYUDX6T7GRWRPJUEK/graph.json","fetch_events":"https://pith.science/api/pith-number/DUYR5VAWGBYUDX6T7GRWRPJUEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUYR5VAWGBYUDX6T7GRWRPJUEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUYR5VAWGBYUDX6T7GRWRPJUEK/action/storage_attestation","attest_author":"https://pith.science/pith/DUYR5VAWGBYUDX6T7GRWRPJUEK/action/author_attestation","sign_citation":"https://pith.science/pith/DUYR5VAWGBYUDX6T7GRWRPJUEK/action/citation_signature","submit_replication":"https://pith.science/pith/DUYR5VAWGBYUDX6T7GRWRPJUEK/action/replication_record"}},"created_at":"2026-07-01T00:17:13.609191+00:00","updated_at":"2026-07-01T00:17:13.609191+00:00"}