{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LCW7BGVNTWNRZD45HBCDEMVDT5","short_pith_number":"pith:LCW7BGVN","canonical_record":{"source":{"id":"1511.07644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-11-24T11:02:23Z","cross_cats_sorted":[],"title_canon_sha256":"63767ebb3f8c6464ff03735b92bc14ad14aa04bf04abe34582691fb1ce8e967d","abstract_canon_sha256":"8385089b3e0a350eaa8eef8094914ab6ae8f1621d62fac82c3fa3d96611368e3"},"schema_version":"1.0"},"canonical_sha256":"58adf09aad9d9b1c8f9d38443232a39f44a7fd4964187fb3fa734451a036acb4","source":{"kind":"arxiv","id":"1511.07644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07644","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07644v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07644","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"LCW7BGVNTWNR","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LCW7BGVNTWNRZD45","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LCW7BGVN","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LCW7BGVNTWNRZD45HBCDEMVDT5","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-11-24T11:02:23Z","cross_cats_sorted":[],"title_canon_sha256":"63767ebb3f8c6464ff03735b92bc14ad14aa04bf04abe34582691fb1ce8e967d","abstract_canon_sha256":"8385089b3e0a350eaa8eef8094914ab6ae8f1621d62fac82c3fa3d96611368e3"},"schema_version":"1.0"},"canonical_sha256":"58adf09aad9d9b1c8f9d38443232a39f44a7fd4964187fb3fa734451a036acb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.090140Z","signature_b64":"MudVtaMuRkVOJuIkSyFa7Lm3ZcEUWAUnq8J29tLoBDTwbSGN7OoG4hgf9PMrGuQA2oBd5J05GJtRaLlO2dWbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58adf09aad9d9b1c8f9d38443232a39f44a7fd4964187fb3fa734451a036acb4","last_reissued_at":"2026-05-18T01:26:04.089551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.089551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07644","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-18T01:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4pq1wIuGs4inYNW546xqcMTIUVWZMcuKKLrZ+WhRmOftME05KIA3uhHPKvH1fj8PH5rw+7yhpkjrtAFdpm6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:05:15.518986Z"},"content_sha256":"32dfc12e574e5c3badeb604735a78a8bf875b284191b7905797867d0a90a7e08","schema_version":"1.0","event_id":"sha256:32dfc12e574e5c3badeb604735a78a8bf875b284191b7905797867d0a90a7e08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LCW7BGVNTWNRZD45HBCDEMVDT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bipartite divisor graph for the set of irreducible character degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Roghayeh Hafezieh","submitted_at":"2015-11-24T11:02:23Z","abstract_excerpt":"Let $G$ be a finite group. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\\{\\chi(1) : \\chi\\in Irr(G)\\}$. Let $\\rho(G)$ be the set of all primes which divide some character degree of $G$. In this paper we introduce the bipartite divisor graph for $cd(G)$ as an undirected bipartite graph with vertex set $\\rho(G)\\cup (cd(G)\\setminus\\{1\\})$, such that an element $p$ of $\\rho(G)$ is adjacent to an element $m$ of $cd(G)\\setminus\\{1\\}$ if and only if $p$ divides $m$. We denote this graph simply by $B(G)$. Then by means of combinato"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07644","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-18T01:26:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFJnbfUJuJJ6Vx0Pn3aJTqtXrFqG2k+LuNGfdqbTqOHaaZHNq6NSC2B7l86r2YZKtGBFEIRf9fFumIWZucquDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:05:15.519716Z"},"content_sha256":"8b1488e73752f75a98cfbfb2e5ff79744212115fc62098969b0ee595973889d4","schema_version":"1.0","event_id":"sha256:8b1488e73752f75a98cfbfb2e5ff79744212115fc62098969b0ee595973889d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCW7BGVNTWNRZD45HBCDEMVDT5/bundle.json","state_url":"https://pith.science/pith/LCW7BGVNTWNRZD45HBCDEMVDT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCW7BGVNTWNRZD45HBCDEMVDT5/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-06-06T23:05:15Z","links":{"resolver":"https://pith.science/pith/LCW7BGVNTWNRZD45HBCDEMVDT5","bundle":"https://pith.science/pith/LCW7BGVNTWNRZD45HBCDEMVDT5/bundle.json","state":"https://pith.science/pith/LCW7BGVNTWNRZD45HBCDEMVDT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCW7BGVNTWNRZD45HBCDEMVDT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LCW7BGVNTWNRZD45HBCDEMVDT5","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":"8385089b3e0a350eaa8eef8094914ab6ae8f1621d62fac82c3fa3d96611368e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-11-24T11:02:23Z","title_canon_sha256":"63767ebb3f8c6464ff03735b92bc14ad14aa04bf04abe34582691fb1ce8e967d"},"schema_version":"1.0","source":{"id":"1511.07644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07644","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07644v1","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07644","created_at":"2026-05-18T01:26:04Z"},{"alias_kind":"pith_short_12","alias_value":"LCW7BGVNTWNR","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LCW7BGVNTWNRZD45","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LCW7BGVN","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:8b1488e73752f75a98cfbfb2e5ff79744212115fc62098969b0ee595973889d4","target":"graph","created_at":"2026-05-18T01:26:04Z","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. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\\{\\chi(1) : \\chi\\in Irr(G)\\}$. Let $\\rho(G)$ be the set of all primes which divide some character degree of $G$. In this paper we introduce the bipartite divisor graph for $cd(G)$ as an undirected bipartite graph with vertex set $\\rho(G)\\cup (cd(G)\\setminus\\{1\\})$, such that an element $p$ of $\\rho(G)$ is adjacent to an element $m$ of $cd(G)\\setminus\\{1\\}$ if and only if $p$ divides $m$. We denote this graph simply by $B(G)$. Then by means of combinato","authors_text":"Roghayeh Hafezieh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-11-24T11:02:23Z","title":"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":"1511.07644","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:32dfc12e574e5c3badeb604735a78a8bf875b284191b7905797867d0a90a7e08","target":"record","created_at":"2026-05-18T01:26:04Z","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":"8385089b3e0a350eaa8eef8094914ab6ae8f1621d62fac82c3fa3d96611368e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-11-24T11:02:23Z","title_canon_sha256":"63767ebb3f8c6464ff03735b92bc14ad14aa04bf04abe34582691fb1ce8e967d"},"schema_version":"1.0","source":{"id":"1511.07644","kind":"arxiv","version":1}},"canonical_sha256":"58adf09aad9d9b1c8f9d38443232a39f44a7fd4964187fb3fa734451a036acb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58adf09aad9d9b1c8f9d38443232a39f44a7fd4964187fb3fa734451a036acb4","first_computed_at":"2026-05-18T01:26:04.089551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:04.089551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MudVtaMuRkVOJuIkSyFa7Lm3ZcEUWAUnq8J29tLoBDTwbSGN7OoG4hgf9PMrGuQA2oBd5J05GJtRaLlO2dWbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:04.090140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32dfc12e574e5c3badeb604735a78a8bf875b284191b7905797867d0a90a7e08","sha256:8b1488e73752f75a98cfbfb2e5ff79744212115fc62098969b0ee595973889d4"],"state_sha256":"099aabe9e276805c31d90bf5eec5cee7c075d9a17798811a09913f63281626fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YKYHOYqNQm2ZVPtMvHAWc7/E3DavvAOOUkGuiNwts8uDRKd9/HHKqS2hDEfGyMsHMaV+Ff2MzfUUIVXigWhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:05:15.523501Z","bundle_sha256":"5d46962165ff64b7efcda3e42ae660576fb1394cfa725d65e94568123d4b3a99"}}