{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OOPJFH2MYFQ7NHAMHELXYS4RC5","short_pith_number":"pith:OOPJFH2M","canonical_record":{"source":{"id":"1702.07650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-24T16:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"d61d1241ed57cb5a93a233268e95f3914eee2c23cf96bdcc846f77075f529d79","abstract_canon_sha256":"ccc669b26ac3bb4b0e30c0217b1213ba4b3ff827bd892fe3b383fc00a9d91554"},"schema_version":"1.0"},"canonical_sha256":"739e929f4cc161f69c0c39177c4b91174cb2b61361b123f98173222e2a5134ec","source":{"kind":"arxiv","id":"1702.07650","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07650","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07650v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07650","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"OOPJFH2MYFQ7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOPJFH2MYFQ7NHAM","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOPJFH2M","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OOPJFH2MYFQ7NHAMHELXYS4RC5","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-24T16:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"d61d1241ed57cb5a93a233268e95f3914eee2c23cf96bdcc846f77075f529d79","abstract_canon_sha256":"ccc669b26ac3bb4b0e30c0217b1213ba4b3ff827bd892fe3b383fc00a9d91554"},"schema_version":"1.0"},"canonical_sha256":"739e929f4cc161f69c0c39177c4b91174cb2b61361b123f98173222e2a5134ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.643997Z","signature_b64":"aTHoUEMqfnTu9PdxX+bou90z8kYW6Z8khqZIIsVk/QGplXOIGH+wLf8hPahKbHYlw/TWzhnPFUtGM0UqqXtpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"739e929f4cc161f69c0c39177c4b91174cb2b61361b123f98173222e2a5134ec","last_reissued_at":"2026-05-18T00:50:02.643385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.643385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07650","source_version":1,"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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wB/YtSn3ZANSV7xsRDCEMNvbIiDIYyKnE+OVrbHvOoQSLPCSbZO25sd1/X799BjXFiqOpWKjy6UtntB8sphFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:07:31.909668Z"},"content_sha256":"25354a8317915c54c6688b3af6cd23565d58e6d894a07fc1252ab4eb4098ff2f","schema_version":"1.0","event_id":"sha256:25354a8317915c54c6688b3af6cd23565d58e6d894a07fc1252ab4eb4098ff2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OOPJFH2MYFQ7NHAMHELXYS4RC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Maximum Gap in (Inverse) Cyclotomic Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Eunjeong Lee, Hoon Hong, Mary Ambrosino","submitted_at":"2017-02-24T16:30:55Z","abstract_excerpt":"The maximum gap $g(f)$ of a polynomial $f$ is the maximum of the differences (gaps) between two consecutive exponents that appear in $f$. Let $\\Phi_{n}$ and $\\Psi_{n}$ denote the $n$-th cyclotomic and $n$-th inverse cyclotomic polynomial, respectively. In this paper, we give several lower bounds for $g(\\Phi_{n})$ and $g(\\Psi_{n})$, where $n$ is the product of odd primes. We observe that they are very often exact. We also give an exact expression for $g(\\Psi_{n})$ under a certain condition. Finally we conjecture an exact expression for $g(\\Phi_{n})$ under a certain condition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07650","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"},"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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkyYhVSvpi6kXMHa5fFvIS7Pn/h0yfEbcnQYG6XEnbTNy+HLO70mkAbxC6MkF6lGmHhAe+SMNXA7JxKr6PFBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:07:31.910301Z"},"content_sha256":"6f2e31d2b53e2e4470226db45183de0a3abad5f290651e802509976cef76d211","schema_version":"1.0","event_id":"sha256:6f2e31d2b53e2e4470226db45183de0a3abad5f290651e802509976cef76d211"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOPJFH2MYFQ7NHAMHELXYS4RC5/bundle.json","state_url":"https://pith.science/pith/OOPJFH2MYFQ7NHAMHELXYS4RC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOPJFH2MYFQ7NHAMHELXYS4RC5/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-05-27T05:07:31Z","links":{"resolver":"https://pith.science/pith/OOPJFH2MYFQ7NHAMHELXYS4RC5","bundle":"https://pith.science/pith/OOPJFH2MYFQ7NHAMHELXYS4RC5/bundle.json","state":"https://pith.science/pith/OOPJFH2MYFQ7NHAMHELXYS4RC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOPJFH2MYFQ7NHAMHELXYS4RC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OOPJFH2MYFQ7NHAMHELXYS4RC5","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":"ccc669b26ac3bb4b0e30c0217b1213ba4b3ff827bd892fe3b383fc00a9d91554","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-24T16:30:55Z","title_canon_sha256":"d61d1241ed57cb5a93a233268e95f3914eee2c23cf96bdcc846f77075f529d79"},"schema_version":"1.0","source":{"id":"1702.07650","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07650","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07650v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07650","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"OOPJFH2MYFQ7","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOPJFH2MYFQ7NHAM","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOPJFH2M","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:6f2e31d2b53e2e4470226db45183de0a3abad5f290651e802509976cef76d211","target":"graph","created_at":"2026-05-18T00:50:02Z","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":"The maximum gap $g(f)$ of a polynomial $f$ is the maximum of the differences (gaps) between two consecutive exponents that appear in $f$. Let $\\Phi_{n}$ and $\\Psi_{n}$ denote the $n$-th cyclotomic and $n$-th inverse cyclotomic polynomial, respectively. In this paper, we give several lower bounds for $g(\\Phi_{n})$ and $g(\\Psi_{n})$, where $n$ is the product of odd primes. We observe that they are very often exact. We also give an exact expression for $g(\\Psi_{n})$ under a certain condition. Finally we conjecture an exact expression for $g(\\Phi_{n})$ under a certain condition.","authors_text":"Eunjeong Lee, Hoon Hong, Mary Ambrosino","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-24T16:30:55Z","title":"Lower Bounds for Maximum Gap in (Inverse) Cyclotomic Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07650","kind":"arxiv","version":1},"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:25354a8317915c54c6688b3af6cd23565d58e6d894a07fc1252ab4eb4098ff2f","target":"record","created_at":"2026-05-18T00:50:02Z","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":"ccc669b26ac3bb4b0e30c0217b1213ba4b3ff827bd892fe3b383fc00a9d91554","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-02-24T16:30:55Z","title_canon_sha256":"d61d1241ed57cb5a93a233268e95f3914eee2c23cf96bdcc846f77075f529d79"},"schema_version":"1.0","source":{"id":"1702.07650","kind":"arxiv","version":1}},"canonical_sha256":"739e929f4cc161f69c0c39177c4b91174cb2b61361b123f98173222e2a5134ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"739e929f4cc161f69c0c39177c4b91174cb2b61361b123f98173222e2a5134ec","first_computed_at":"2026-05-18T00:50:02.643385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.643385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aTHoUEMqfnTu9PdxX+bou90z8kYW6Z8khqZIIsVk/QGplXOIGH+wLf8hPahKbHYlw/TWzhnPFUtGM0UqqXtpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.643997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07650","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25354a8317915c54c6688b3af6cd23565d58e6d894a07fc1252ab4eb4098ff2f","sha256:6f2e31d2b53e2e4470226db45183de0a3abad5f290651e802509976cef76d211"],"state_sha256":"6a1ba1983b57a94d10033d0e865b923311519b098c29f418c2b25f46be842680"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZemhE2kA+y5izxHGQLemWM0OStxzjtyQCAW+yp8g9niQ0NudDsueLKqJvTtWo8y1KXlW/Ak2iUfjXom8OG++CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:07:31.914141Z","bundle_sha256":"880ed0cfe7bde2601d19477b3bb97751bf77ede84f8acc02208a8f1b7bdfa0bb"}}