{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HVHGKIMAT5324B5ODRGCPNUGXV","short_pith_number":"pith:HVHGKIMA","canonical_record":{"source":{"id":"1702.05823","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-20T00:26:07Z","cross_cats_sorted":[],"title_canon_sha256":"5416607771cc25ec1f37122e7a2833599de0eb821f1ca7a68461e78ecbe23244","abstract_canon_sha256":"35eb99b5433060877603bf30e8015119d8cd2b0456864f1669987ad7a964e8fd"},"schema_version":"1.0"},"canonical_sha256":"3d4e6521809f77ae07ae1c4c27b686bd63fc480ee908878feecb93db60e8d1f3","source":{"kind":"arxiv","id":"1702.05823","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05823","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05823v2","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05823","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"pith_short_12","alias_value":"HVHGKIMAT532","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HVHGKIMAT5324B5O","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HVHGKIMA","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HVHGKIMAT5324B5ODRGCPNUGXV","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05823","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-20T00:26:07Z","cross_cats_sorted":[],"title_canon_sha256":"5416607771cc25ec1f37122e7a2833599de0eb821f1ca7a68461e78ecbe23244","abstract_canon_sha256":"35eb99b5433060877603bf30e8015119d8cd2b0456864f1669987ad7a964e8fd"},"schema_version":"1.0"},"canonical_sha256":"3d4e6521809f77ae07ae1c4c27b686bd63fc480ee908878feecb93db60e8d1f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:07.704660Z","signature_b64":"Gd3dXsEJUYTZuFvgp69kHwAC8LApaClDeKH/avahjtJMJ7tRn50OAYAyN5UUbpdEtT5MboePHQlZf9rFMcbtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d4e6521809f77ae07ae1c4c27b686bd63fc480ee908878feecb93db60e8d1f3","last_reissued_at":"2026-05-17T23:54:07.704249Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:07.704249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05823","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iagnm4a/HsAVi+6S8WwknkO5nJefJuQEFRE67C37GYuTy38pxrQt3jQAZ+G2Uyt0tmDeVqEPRdVQWUIIFcooBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:28:20.403372Z"},"content_sha256":"1d105fdccbe56975545fe7489ac8372d55a23af08348f597374d419219397bc6","schema_version":"1.0","event_id":"sha256:1d105fdccbe56975545fe7489ac8372d55a23af08348f597374d419219397bc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HVHGKIMAT5324B5ODRGCPNUGXV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved lower bound for the number of unimodular zeros of self-reciprocal polynomials with coefficients in a finite set","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Tam\\'as Erd\\'elyi","submitted_at":"2017-02-20T00:26:07Z","abstract_excerpt":"Let $n_1 < n_2 < \\cdots < n_N$ be non-negative integers. In a private communication Brian Conrey asked how fast the number of real zeros of the trigonometric polynomials $T_N(\\theta) = \\sum_{j=1}^N {\\cos (n_j\\theta)}$ tends to $\\infty$ as a function of $N$. Conrey's question in general does not appear to be easy.Let ${\\mathcal P}_n(S)$ be the set of all algebraic polynomials of degree at most $n$ with each of their coefficients in $S$. For a finite set $S \\subset {\\mathbb C}$ let $M = M(S) := \\max\\{|z|: z \\in S\\}$. It has been shown recently that if $S \\subset {\\mathbb R}$ is a finite set and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05823","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0djjBjq+Y3yKgl0dlDojLlP3XBwH0vIAlvSC7qw1ytlxS4b6sWKmKoiwXG9Lq10J/FNd4e9C37ScSADrB0tbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:28:20.403938Z"},"content_sha256":"f36f1f89ca8b96fe0c6c17a747554287237447aab14dac4e0674c5f878974966","schema_version":"1.0","event_id":"sha256:f36f1f89ca8b96fe0c6c17a747554287237447aab14dac4e0674c5f878974966"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVHGKIMAT5324B5ODRGCPNUGXV/bundle.json","state_url":"https://pith.science/pith/HVHGKIMAT5324B5ODRGCPNUGXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVHGKIMAT5324B5ODRGCPNUGXV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T14:28:20Z","links":{"resolver":"https://pith.science/pith/HVHGKIMAT5324B5ODRGCPNUGXV","bundle":"https://pith.science/pith/HVHGKIMAT5324B5ODRGCPNUGXV/bundle.json","state":"https://pith.science/pith/HVHGKIMAT5324B5ODRGCPNUGXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVHGKIMAT5324B5ODRGCPNUGXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HVHGKIMAT5324B5ODRGCPNUGXV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"35eb99b5433060877603bf30e8015119d8cd2b0456864f1669987ad7a964e8fd","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-20T00:26:07Z","title_canon_sha256":"5416607771cc25ec1f37122e7a2833599de0eb821f1ca7a68461e78ecbe23244"},"schema_version":"1.0","source":{"id":"1702.05823","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05823","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05823v2","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05823","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"pith_short_12","alias_value":"HVHGKIMAT532","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HVHGKIMAT5324B5O","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HVHGKIMA","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:f36f1f89ca8b96fe0c6c17a747554287237447aab14dac4e0674c5f878974966","target":"graph","created_at":"2026-05-17T23:54:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $n_1 < n_2 < \\cdots < n_N$ be non-negative integers. In a private communication Brian Conrey asked how fast the number of real zeros of the trigonometric polynomials $T_N(\\theta) = \\sum_{j=1}^N {\\cos (n_j\\theta)}$ tends to $\\infty$ as a function of $N$. Conrey's question in general does not appear to be easy.Let ${\\mathcal P}_n(S)$ be the set of all algebraic polynomials of degree at most $n$ with each of their coefficients in $S$. For a finite set $S \\subset {\\mathbb C}$ let $M = M(S) := \\max\\{|z|: z \\in S\\}$. It has been shown recently that if $S \\subset {\\mathbb R}$ is a finite set and ","authors_text":"Tam\\'as Erd\\'elyi","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-20T00:26:07Z","title":"Improved lower bound for the number of unimodular zeros of self-reciprocal polynomials with coefficients in a finite set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05823","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1d105fdccbe56975545fe7489ac8372d55a23af08348f597374d419219397bc6","target":"record","created_at":"2026-05-17T23:54:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"35eb99b5433060877603bf30e8015119d8cd2b0456864f1669987ad7a964e8fd","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-20T00:26:07Z","title_canon_sha256":"5416607771cc25ec1f37122e7a2833599de0eb821f1ca7a68461e78ecbe23244"},"schema_version":"1.0","source":{"id":"1702.05823","kind":"arxiv","version":2}},"canonical_sha256":"3d4e6521809f77ae07ae1c4c27b686bd63fc480ee908878feecb93db60e8d1f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d4e6521809f77ae07ae1c4c27b686bd63fc480ee908878feecb93db60e8d1f3","first_computed_at":"2026-05-17T23:54:07.704249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:07.704249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gd3dXsEJUYTZuFvgp69kHwAC8LApaClDeKH/avahjtJMJ7tRn50OAYAyN5UUbpdEtT5MboePHQlZf9rFMcbtAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:07.704660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05823","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d105fdccbe56975545fe7489ac8372d55a23af08348f597374d419219397bc6","sha256:f36f1f89ca8b96fe0c6c17a747554287237447aab14dac4e0674c5f878974966"],"state_sha256":"4c8c4045999e7d13b178925a8e1e9873277ede4d7ef8406d8ec97719d6400896"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYuoUxHc4f5htwu9lxZqCNHByyyoOycK8UaNMnKS/l7V/7ifMfDFDajqJmmp5PosDPxF/W+hfeK4aTZhLubCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:28:20.406670Z","bundle_sha256":"427800c05aa0cd9a8be23d9319b5b2f9ef57bc81d4a80602ef8aa24eeece732b"}}