{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6FXOFVP7KHIS44V7GN626X6WKQ","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":"46e7a33c15fa09dcc443a2bd418417307ea488a8e381efea827fa954aa3b33ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-11-05T13:39:48Z","title_canon_sha256":"0b800e37f1ca593f133ec4b808b65183363b0635fbe0228b006e4acc5a0552a3"},"schema_version":"1.0","source":{"id":"1811.01674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01674","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01674v1","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01674","created_at":"2026-05-18T00:01:33Z"},{"alias_kind":"pith_short_12","alias_value":"6FXOFVP7KHIS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6FXOFVP7KHIS44V7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6FXOFVP7","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:7e76ffbad0e14c8aee6e8072d046e54299e9f58a14502ac4ec02b0723ffd7017","target":"graph","created_at":"2026-05-18T00:01:33Z","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$ be a finite group, and let ${\\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\\rm{V}}(G)$ consists of the prime divisors of the numbers in ${\\rm{cd}}(G)$, two distinct vertices $p$ and $q$ being adjacent if and only if $pq$ divides some number in ${\\rm{cd}}(G)$. In this note, we provide an upper bound on the size of ${\\rm{V}}(G)$ in terms of the clique number $\\omega(G)$ (i.e., the maximum size of a subset of ${\\rm{V}}(G)$ inducing a complete subgraph) of","authors_text":"Emanuele Pacifici, Lucia Sanus, Silvio Dolfi, Zeinab Akhlaghi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-11-05T13:39:48Z","title":"Bounding the number of vertices in the degree graph of a finite group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01674","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:728c5925d53124cdf71310a02898d1247883a2c7d9a215fc5fd9c3c23be5c057","target":"record","created_at":"2026-05-18T00:01:33Z","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":"46e7a33c15fa09dcc443a2bd418417307ea488a8e381efea827fa954aa3b33ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2018-11-05T13:39:48Z","title_canon_sha256":"0b800e37f1ca593f133ec4b808b65183363b0635fbe0228b006e4acc5a0552a3"},"schema_version":"1.0","source":{"id":"1811.01674","kind":"arxiv","version":1}},"canonical_sha256":"f16ee2d5ff51d12e72bf337daf5fd6543049f6bad7abcc4416a81623b439fac2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f16ee2d5ff51d12e72bf337daf5fd6543049f6bad7abcc4416a81623b439fac2","first_computed_at":"2026-05-18T00:01:33.589097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:33.589097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0vuw8CJWEYnW9UghbTWuXNJtUlICqkwUPUTAEnjF7U3qKypWGlFq7vRVSAaE1X/U3YPkXJlVqu4jHIyEPX8/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:33.589662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:728c5925d53124cdf71310a02898d1247883a2c7d9a215fc5fd9c3c23be5c057","sha256:7e76ffbad0e14c8aee6e8072d046e54299e9f58a14502ac4ec02b0723ffd7017"],"state_sha256":"70c2f07c9e545db9bfb82bf163063631bfb7156e88e0f27d4aa08dee0330a86e"}