{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NGDZOKMZMS45PYG5QS6SSZCHFH","short_pith_number":"pith:NGDZOKMZ","canonical_record":{"source":{"id":"1101.4255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-01-22T03:02:01Z","cross_cats_sorted":[],"title_canon_sha256":"9fc11e927b1de2d5e2ed8241827b3e085ee06330ea2b7688760d45e1e9c2801c","abstract_canon_sha256":"ebfbd86bf25239e1b10c11923c98337d032ee459f7e7977190bb32e34e13abb3"},"schema_version":"1.0"},"canonical_sha256":"698797299964b9d7e0dd84bd29644729db0b9880ab5b162eab846225fd44e34e","source":{"kind":"arxiv","id":"1101.4255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4255","created_at":"2026-05-18T04:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4255v1","created_at":"2026-05-18T04:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4255","created_at":"2026-05-18T04:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"NGDZOKMZMS45","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NGDZOKMZMS45PYG5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NGDZOKMZ","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NGDZOKMZMS45PYG5QS6SSZCHFH","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-01-22T03:02:01Z","cross_cats_sorted":[],"title_canon_sha256":"9fc11e927b1de2d5e2ed8241827b3e085ee06330ea2b7688760d45e1e9c2801c","abstract_canon_sha256":"ebfbd86bf25239e1b10c11923c98337d032ee459f7e7977190bb32e34e13abb3"},"schema_version":"1.0"},"canonical_sha256":"698797299964b9d7e0dd84bd29644729db0b9880ab5b162eab846225fd44e34e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:11.257145Z","signature_b64":"UzZYgRCznWwJ6SpVav8JvwnopNONVc8Lo2XM+5I38hy+yjHraYh7m9DHpsN+V8SBLDOQUaKK6C75ktlNJ0f+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"698797299964b9d7e0dd84bd29644729db0b9880ab5b162eab846225fd44e34e","last_reissued_at":"2026-05-18T04:31:11.256668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:11.256668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4255","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-18T04:31:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NcMi+ZMtgBxHcORz89yMY9aR8V+iZJXBSZ4igIzpw9rBEGbbABZfG2US/yxbJZRdXI0Jtf+5irmdEUeSXvQjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:21:48.953671Z"},"content_sha256":"7feccf94acde1a994813d76c3478eebea78a6233bb962933e405551916ad2189","schema_version":"1.0","event_id":"sha256:7feccf94acde1a994813d76c3478eebea78a6233bb962933e405551916ad2189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NGDZOKMZMS45PYG5QS6SSZCHFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Gap in (Inverse) Cyclotomic Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Cheol-Min Park, Eunjeong Lee, Hoon Hong, Hyang-Sook Lee","submitted_at":"2011-01-22T03:02:01Z","abstract_excerpt":"Let $g(f)$ denote the maximum of the differences (gaps) between two consecutive exponents occurring in a polynomial $f$. Let $\\Phi_n$ denote the $n$-th cyclotomic polynomial and let $\\Psi_n$ denote the $n$-th inverse cyclotomic polynomial. In this note, we study $g(\\Phi_n)$ and $g(\\Psi_n)$ where $n$ is a product of odd primes, say $p_1 < p_2 < p_3$, etc. It is trivial to determine $g(\\Phi_{p_1})$, $g(\\Psi_{p_1})$ and $g(\\Psi_{p_1p_2})$. Hence the simplest non-trivial cases are $g(\\Phi_{p_1p_2})$ and $g(\\Psi_{p_1p_2p_3})$. We provide an exact expression for $g(\\Phi_{p_1p_2}).$ We also provide a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4255","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-18T04:31:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LntfN/afbJKcuOsccSJgaYdoKdLNVhS5Ib14ROFtwRSng21r/1KHfjd7byyLiBzFM6sJYRIu8ckquW9U83TBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:21:48.954031Z"},"content_sha256":"1c36c2116a5a53eeb4ca260b54a262bc54035e4fd365438bce3d2742a8aa67ef","schema_version":"1.0","event_id":"sha256:1c36c2116a5a53eeb4ca260b54a262bc54035e4fd365438bce3d2742a8aa67ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGDZOKMZMS45PYG5QS6SSZCHFH/bundle.json","state_url":"https://pith.science/pith/NGDZOKMZMS45PYG5QS6SSZCHFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGDZOKMZMS45PYG5QS6SSZCHFH/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-19T10:21:48Z","links":{"resolver":"https://pith.science/pith/NGDZOKMZMS45PYG5QS6SSZCHFH","bundle":"https://pith.science/pith/NGDZOKMZMS45PYG5QS6SSZCHFH/bundle.json","state":"https://pith.science/pith/NGDZOKMZMS45PYG5QS6SSZCHFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGDZOKMZMS45PYG5QS6SSZCHFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NGDZOKMZMS45PYG5QS6SSZCHFH","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":"ebfbd86bf25239e1b10c11923c98337d032ee459f7e7977190bb32e34e13abb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-01-22T03:02:01Z","title_canon_sha256":"9fc11e927b1de2d5e2ed8241827b3e085ee06330ea2b7688760d45e1e9c2801c"},"schema_version":"1.0","source":{"id":"1101.4255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4255","created_at":"2026-05-18T04:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4255v1","created_at":"2026-05-18T04:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4255","created_at":"2026-05-18T04:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"NGDZOKMZMS45","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NGDZOKMZMS45PYG5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NGDZOKMZ","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:1c36c2116a5a53eeb4ca260b54a262bc54035e4fd365438bce3d2742a8aa67ef","target":"graph","created_at":"2026-05-18T04:31:11Z","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 $g(f)$ denote the maximum of the differences (gaps) between two consecutive exponents occurring in a polynomial $f$. Let $\\Phi_n$ denote the $n$-th cyclotomic polynomial and let $\\Psi_n$ denote the $n$-th inverse cyclotomic polynomial. In this note, we study $g(\\Phi_n)$ and $g(\\Psi_n)$ where $n$ is a product of odd primes, say $p_1 < p_2 < p_3$, etc. It is trivial to determine $g(\\Phi_{p_1})$, $g(\\Psi_{p_1})$ and $g(\\Psi_{p_1p_2})$. Hence the simplest non-trivial cases are $g(\\Phi_{p_1p_2})$ and $g(\\Psi_{p_1p_2p_3})$. We provide an exact expression for $g(\\Phi_{p_1p_2}).$ We also provide a","authors_text":"Cheol-Min Park, Eunjeong Lee, Hoon Hong, Hyang-Sook Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-01-22T03:02:01Z","title":"Maximum Gap in (Inverse) Cyclotomic Polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4255","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:7feccf94acde1a994813d76c3478eebea78a6233bb962933e405551916ad2189","target":"record","created_at":"2026-05-18T04:31:11Z","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":"ebfbd86bf25239e1b10c11923c98337d032ee459f7e7977190bb32e34e13abb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-01-22T03:02:01Z","title_canon_sha256":"9fc11e927b1de2d5e2ed8241827b3e085ee06330ea2b7688760d45e1e9c2801c"},"schema_version":"1.0","source":{"id":"1101.4255","kind":"arxiv","version":1}},"canonical_sha256":"698797299964b9d7e0dd84bd29644729db0b9880ab5b162eab846225fd44e34e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"698797299964b9d7e0dd84bd29644729db0b9880ab5b162eab846225fd44e34e","first_computed_at":"2026-05-18T04:31:11.256668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:11.256668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UzZYgRCznWwJ6SpVav8JvwnopNONVc8Lo2XM+5I38hy+yjHraYh7m9DHpsN+V8SBLDOQUaKK6C75ktlNJ0f+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:11.257145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7feccf94acde1a994813d76c3478eebea78a6233bb962933e405551916ad2189","sha256:1c36c2116a5a53eeb4ca260b54a262bc54035e4fd365438bce3d2742a8aa67ef"],"state_sha256":"a6b0d2b119f154dd1c26df7d1405d80932e447ebc083611efc051a2cd2d22143"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dga0o/uGQVNPGFgRKPxDHkZ9mRSPZDiBzCLvRvuZoG8xpDR6xX/lMIBSn9+7APtro1R0tnbtfI2MSQc8LpaqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T10:21:48.955667Z","bundle_sha256":"f6cbccf9f1a022be3ef4294175dd8498c3f4fe21f48949eb8c8bdd5e6b4e251f"}}