{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:HRVUNYSVL4RUTJ3R6JQNU6D6J3","short_pith_number":"pith:HRVUNYSV","canonical_record":{"source":{"id":"2004.01175","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-02T17:55:52Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"6c7946700a9ff65cf5f60b473201e1663b7aa53621fa9b5bc7ca3bf3aa8abff8","abstract_canon_sha256":"6fc404cb55635c1c8f6c318ff5fcae61cc8a6573d85aafeab741cae94f688060"},"schema_version":"1.0"},"canonical_sha256":"3c6b46e2555f2349a771f260da787e4edb5f31be9d311561d8293a64b626bb5b","source":{"kind":"arxiv","id":"2004.01175","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.01175","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2004.01175v4","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.01175","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"HRVUNYSVL4RU","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"HRVUNYSVL4RUTJ3R","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"HRVUNYSV","created_at":"2026-07-05T03:19:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:HRVUNYSVL4RUTJ3R6JQNU6D6J3","target":"record","payload":{"canonical_record":{"source":{"id":"2004.01175","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-02T17:55:52Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"6c7946700a9ff65cf5f60b473201e1663b7aa53621fa9b5bc7ca3bf3aa8abff8","abstract_canon_sha256":"6fc404cb55635c1c8f6c318ff5fcae61cc8a6573d85aafeab741cae94f688060"},"schema_version":"1.0"},"canonical_sha256":"3c6b46e2555f2349a771f260da787e4edb5f31be9d311561d8293a64b626bb5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:31.103917Z","signature_b64":"3ct77BRy7+8w8Vxq8uAVQbd3lJV0//sjsfNc9KoD33v4cYqpEZbF5r7fkhfKwvN8EfBrYm/yAkA5uIjgt2XfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c6b46e2555f2349a771f260da787e4edb5f31be9d311561d8293a64b626bb5b","last_reissued_at":"2026-07-05T03:19:31.103519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:31.103519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.01175","source_version":4,"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-07-05T03:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IN40TtzC0TkTxnRJXmXV2+mqVu6j/6uH2Vvg9nMudOk3gFZizqtiLL4AJNRYAKodqdsTo9+ZPBAUN0pWvihXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T11:23:47.799079Z"},"content_sha256":"a56c3bcda9d4b59c7dfba0e0db3bdc666dd59995933d233094e228a81d650889","schema_version":"1.0","event_id":"sha256:a56c3bcda9d4b59c7dfba0e0db3bdc666dd59995933d233094e228a81d650889"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:HRVUNYSVL4RUTJ3R6JQNU6D6J3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the clique number of Paley graphs of prime power order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Chi Hoi Yip","submitted_at":"2020-04-02T17:55:52Z","abstract_excerpt":"Finding a reasonably good upper bound for the clique number of Paley graphs is an open problem in additive combinatorics. A recent breakthrough by Hanson and Petridis using Stepanov's method gives an improved upper bound on Paley graphs defined on a prime field $\\mathbb{F}_p$, where $p \\equiv 1 \\pmod 4$. We extend their idea to the finite field $\\mathbb{F}_q$, where $q=p^{2s+1}$ for a prime $p\\equiv 1 \\pmod 4$ and a non-negative integer $s$. We show the clique number of the Paley graph over $\\mathbb{F}_{p^{2s+1}}$ is at most $\\min \\bigg(p^s \\bigg\\lceil \\sqrt{\\frac{p}{2}} \\bigg\\rceil, \\sqrt{\\fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.01175","kind":"arxiv","version":4},"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/2004.01175/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"},"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-07-05T03:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cii7NEVReqh4vIiFJAGFuq+lCpdidKC61ZJcjD/P8V1bFXsW9V9hblnwaxE6hVXqCRJiSxo1dxJ/6fQzpPaOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T11:23:47.799598Z"},"content_sha256":"6aa5e6a0b33fead495849545d681455442f731a0c7b28e29e1c22d1b91a82d48","schema_version":"1.0","event_id":"sha256:6aa5e6a0b33fead495849545d681455442f731a0c7b28e29e1c22d1b91a82d48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRVUNYSVL4RUTJ3R6JQNU6D6J3/bundle.json","state_url":"https://pith.science/pith/HRVUNYSVL4RUTJ3R6JQNU6D6J3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRVUNYSVL4RUTJ3R6JQNU6D6J3/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-08-01T11:23:47Z","links":{"resolver":"https://pith.science/pith/HRVUNYSVL4RUTJ3R6JQNU6D6J3","bundle":"https://pith.science/pith/HRVUNYSVL4RUTJ3R6JQNU6D6J3/bundle.json","state":"https://pith.science/pith/HRVUNYSVL4RUTJ3R6JQNU6D6J3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRVUNYSVL4RUTJ3R6JQNU6D6J3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HRVUNYSVL4RUTJ3R6JQNU6D6J3","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":"6fc404cb55635c1c8f6c318ff5fcae61cc8a6573d85aafeab741cae94f688060","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-02T17:55:52Z","title_canon_sha256":"6c7946700a9ff65cf5f60b473201e1663b7aa53621fa9b5bc7ca3bf3aa8abff8"},"schema_version":"1.0","source":{"id":"2004.01175","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.01175","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2004.01175v4","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.01175","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"HRVUNYSVL4RU","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"HRVUNYSVL4RUTJ3R","created_at":"2026-07-05T03:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"HRVUNYSV","created_at":"2026-07-05T03:19:31Z"}],"graph_snapshots":[{"event_id":"sha256:6aa5e6a0b33fead495849545d681455442f731a0c7b28e29e1c22d1b91a82d48","target":"graph","created_at":"2026-07-05T03:19:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.01175/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding a reasonably good upper bound for the clique number of Paley graphs is an open problem in additive combinatorics. A recent breakthrough by Hanson and Petridis using Stepanov's method gives an improved upper bound on Paley graphs defined on a prime field $\\mathbb{F}_p$, where $p \\equiv 1 \\pmod 4$. We extend their idea to the finite field $\\mathbb{F}_q$, where $q=p^{2s+1}$ for a prime $p\\equiv 1 \\pmod 4$ and a non-negative integer $s$. We show the clique number of the Paley graph over $\\mathbb{F}_{p^{2s+1}}$ is at most $\\min \\bigg(p^s \\bigg\\lceil \\sqrt{\\frac{p}{2}} \\bigg\\rceil, \\sqrt{\\fr","authors_text":"Chi Hoi Yip","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-02T17:55:52Z","title":"On the clique number of Paley graphs of prime power order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.01175","kind":"arxiv","version":4},"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:a56c3bcda9d4b59c7dfba0e0db3bdc666dd59995933d233094e228a81d650889","target":"record","created_at":"2026-07-05T03:19:31Z","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":"6fc404cb55635c1c8f6c318ff5fcae61cc8a6573d85aafeab741cae94f688060","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-02T17:55:52Z","title_canon_sha256":"6c7946700a9ff65cf5f60b473201e1663b7aa53621fa9b5bc7ca3bf3aa8abff8"},"schema_version":"1.0","source":{"id":"2004.01175","kind":"arxiv","version":4}},"canonical_sha256":"3c6b46e2555f2349a771f260da787e4edb5f31be9d311561d8293a64b626bb5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c6b46e2555f2349a771f260da787e4edb5f31be9d311561d8293a64b626bb5b","first_computed_at":"2026-07-05T03:19:31.103519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:19:31.103519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ct77BRy7+8w8Vxq8uAVQbd3lJV0//sjsfNc9KoD33v4cYqpEZbF5r7fkhfKwvN8EfBrYm/yAkA5uIjgt2XfCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:19:31.103917Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.01175","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a56c3bcda9d4b59c7dfba0e0db3bdc666dd59995933d233094e228a81d650889","sha256:6aa5e6a0b33fead495849545d681455442f731a0c7b28e29e1c22d1b91a82d48"],"state_sha256":"372403f301d9b5491ced0bd038fcf41f041d276657cb8b18431d45f949f7b01f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aXy4vOF9rhtt9z2uD4y6UGr7+7NEZO8ano59bAbU7riZIJt/9OBaTlK/1GAljDuBenR2E2zHfzkNOaA2nHFhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T11:23:47.806278Z","bundle_sha256":"880fc8154c3b41456258c3fbfd956c0418be86ebc0ba2e3dbeec7a3ba36aa5a6"}}