{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EBZBITWY7BEIXWSMVPGBZZ2IBI","short_pith_number":"pith:EBZBITWY","canonical_record":{"source":{"id":"1906.08515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-06-20T09:30:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8cf74ab1f4cf8417925d1d4bacfb0606f289b2b3dfdaa07acfae5c26f75c2f11","abstract_canon_sha256":"9c423dfda0f588a0afdd7c8f0e8b05298ccff687790b5ac7020795502bd17786"},"schema_version":"1.0"},"canonical_sha256":"2072144ed8f8488bda4cabcc1ce7480a2af81eac061f555f97ec430134133658","source":{"kind":"arxiv","id":"1906.08515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08515","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08515v1","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08515","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"EBZBITWY7BEI","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EBZBITWY7BEIXWSM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EBZBITWY","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EBZBITWY7BEIXWSMVPGBZZ2IBI","target":"record","payload":{"canonical_record":{"source":{"id":"1906.08515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-06-20T09:30:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8cf74ab1f4cf8417925d1d4bacfb0606f289b2b3dfdaa07acfae5c26f75c2f11","abstract_canon_sha256":"9c423dfda0f588a0afdd7c8f0e8b05298ccff687790b5ac7020795502bd17786"},"schema_version":"1.0"},"canonical_sha256":"2072144ed8f8488bda4cabcc1ce7480a2af81eac061f555f97ec430134133658","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:52.278367Z","signature_b64":"vA96UkCxaAgQP3Ek7uwM39bli7OE3xYxp73fb6Vrr853ZifdYEKU3vPPgyWjYWHfqHVo/0u/IpXCzxDRyeI2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2072144ed8f8488bda4cabcc1ce7480a2af81eac061f555f97ec430134133658","last_reissued_at":"2026-05-17T23:42:52.277907Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:52.277907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.08515","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-17T23:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+u5tDbI0/Th8qTlPipT0Kw+ZejF12z53TUX1ZwfiIgHPpREGPZj/ext/dkUNEAGwUYVssJXK6lsOtllLbBCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:36:38.617604Z"},"content_sha256":"b3943e73873d445ef49008cc393d87ba31bc5f2ba5a9c65463cd2b369f6dfdac","schema_version":"1.0","event_id":"sha256:b3943e73873d445ef49008cc393d87ba31bc5f2ba5a9c65463cd2b369f6dfdac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EBZBITWY7BEIXWSMVPGBZZ2IBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An overview on the bipartite divisor graph for the set of irreducible character degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Pablo Spiga, Roghayeh Hafezieh","submitted_at":"2019-06-20T09:30:12Z","abstract_excerpt":"Let $G$ be a finite group. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity character degrees, where a prime number $p$ is declared to be adjacent to a character degree $m$ if and only if $p$ divides $m$. This graph is bipartite and it encodes two of the most widely studied graphs associated to the character degrees of a finite group: the prime graph and the divisor graph on the set of irreducible character degrees.\n  The scope of this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08515","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-17T23:42:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0x4JAq0d5b6hWcxjpMYVdSpPkH+96zrLrjnPvq0IkNxB+i9ef1neio+jFs+JWvdJWNxwSs257WJwWec97vpwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:36:38.618363Z"},"content_sha256":"96a59cc28cce76d22d84f0a090eb8550a2b5df2e56e07aa42ef1698e9df01adb","schema_version":"1.0","event_id":"sha256:96a59cc28cce76d22d84f0a090eb8550a2b5df2e56e07aa42ef1698e9df01adb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBZBITWY7BEIXWSMVPGBZZ2IBI/bundle.json","state_url":"https://pith.science/pith/EBZBITWY7BEIXWSMVPGBZZ2IBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBZBITWY7BEIXWSMVPGBZZ2IBI/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-26T08:36:38Z","links":{"resolver":"https://pith.science/pith/EBZBITWY7BEIXWSMVPGBZZ2IBI","bundle":"https://pith.science/pith/EBZBITWY7BEIXWSMVPGBZZ2IBI/bundle.json","state":"https://pith.science/pith/EBZBITWY7BEIXWSMVPGBZZ2IBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBZBITWY7BEIXWSMVPGBZZ2IBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EBZBITWY7BEIXWSMVPGBZZ2IBI","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":"9c423dfda0f588a0afdd7c8f0e8b05298ccff687790b5ac7020795502bd17786","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-06-20T09:30:12Z","title_canon_sha256":"8cf74ab1f4cf8417925d1d4bacfb0606f289b2b3dfdaa07acfae5c26f75c2f11"},"schema_version":"1.0","source":{"id":"1906.08515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08515","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08515v1","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08515","created_at":"2026-05-17T23:42:52Z"},{"alias_kind":"pith_short_12","alias_value":"EBZBITWY7BEI","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EBZBITWY7BEIXWSM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EBZBITWY","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:96a59cc28cce76d22d84f0a090eb8550a2b5df2e56e07aa42ef1698e9df01adb","target":"graph","created_at":"2026-05-17T23:42:52Z","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. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity character degrees, where a prime number $p$ is declared to be adjacent to a character degree $m$ if and only if $p$ divides $m$. This graph is bipartite and it encodes two of the most widely studied graphs associated to the character degrees of a finite group: the prime graph and the divisor graph on the set of irreducible character degrees.\n  The scope of this p","authors_text":"Pablo Spiga, Roghayeh Hafezieh","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-06-20T09:30:12Z","title":"An overview on the bipartite divisor graph for the set of irreducible character degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08515","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:b3943e73873d445ef49008cc393d87ba31bc5f2ba5a9c65463cd2b369f6dfdac","target":"record","created_at":"2026-05-17T23:42:52Z","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":"9c423dfda0f588a0afdd7c8f0e8b05298ccff687790b5ac7020795502bd17786","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-06-20T09:30:12Z","title_canon_sha256":"8cf74ab1f4cf8417925d1d4bacfb0606f289b2b3dfdaa07acfae5c26f75c2f11"},"schema_version":"1.0","source":{"id":"1906.08515","kind":"arxiv","version":1}},"canonical_sha256":"2072144ed8f8488bda4cabcc1ce7480a2af81eac061f555f97ec430134133658","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2072144ed8f8488bda4cabcc1ce7480a2af81eac061f555f97ec430134133658","first_computed_at":"2026-05-17T23:42:52.277907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:52.277907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vA96UkCxaAgQP3Ek7uwM39bli7OE3xYxp73fb6Vrr853ZifdYEKU3vPPgyWjYWHfqHVo/0u/IpXCzxDRyeI2Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:52.278367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.08515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3943e73873d445ef49008cc393d87ba31bc5f2ba5a9c65463cd2b369f6dfdac","sha256:96a59cc28cce76d22d84f0a090eb8550a2b5df2e56e07aa42ef1698e9df01adb"],"state_sha256":"9004279687d736d2666a3b865a28d4a89c5ab1c99c519f2c21b4853659a6a911"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3W8bYM8BFm2s2FD4iQO3qMtpnvH/lOHtpxtiKkPH3tYROfLH+0v+mA3lFZfmOGLXd+l9MS/YYqmIb9n/G7rAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:36:38.622497Z","bundle_sha256":"0b229b6867015f583dea4ca2b8e963068cc31ff8f1bea9be643b5fd25bb8a8a2"}}