{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HCE53ZSR5OMZ5HOGSE6B4SS6PI","short_pith_number":"pith:HCE53ZSR","canonical_record":{"source":{"id":"1911.12594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-11-28T08:46:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"528579134396419273cc04944e9f12a391656876ac867ff6c090a2d22abfbc84","abstract_canon_sha256":"9edac38518e555f52849c8f30de30a26c65b53b34d12ea03cbbd38f91deb9053"},"schema_version":"1.0"},"canonical_sha256":"3889dde651eb999e9dc6913c1e4a5e7a388525d0067952091c28c462dabebd83","source":{"kind":"arxiv","id":"1911.12594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.12594","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"arxiv_version","alias_value":"1911.12594v1","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12594","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"pith_short_12","alias_value":"HCE53ZSR5OMZ","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"pith_short_16","alias_value":"HCE53ZSR5OMZ5HOG","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"pith_short_8","alias_value":"HCE53ZSR","created_at":"2026-07-05T00:22:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HCE53ZSR5OMZ5HOGSE6B4SS6PI","target":"record","payload":{"canonical_record":{"source":{"id":"1911.12594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-11-28T08:46:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"528579134396419273cc04944e9f12a391656876ac867ff6c090a2d22abfbc84","abstract_canon_sha256":"9edac38518e555f52849c8f30de30a26c65b53b34d12ea03cbbd38f91deb9053"},"schema_version":"1.0"},"canonical_sha256":"3889dde651eb999e9dc6913c1e4a5e7a388525d0067952091c28c462dabebd83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:22:47.084655Z","signature_b64":"rMLGuEFIgi6lv5l3DfeHruL1chV0pHY2b5oeeddEBe5nSEnMQpVUi5pwUqyZlDalGF6Z/QLikKTK0i+4C6cVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3889dde651eb999e9dc6913c1e4a5e7a388525d0067952091c28c462dabebd83","last_reissued_at":"2026-07-05T00:22:47.084175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:22:47.084175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.12594","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-07-05T00:22:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l7F1UEba5ABRuk/hyEL8ijitV5CQbaDjkA2cl5T5ySEMIvQfnYzFY2athV3wCYmuXa3EOwispQt7xod7vKeqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:33:55.124271Z"},"content_sha256":"c9fe4949cce3ec959e2ee23fd63830bcbea572637547dd586fb964c12c385665","schema_version":"1.0","event_id":"sha256:c9fe4949cce3ec959e2ee23fd63830bcbea572637547dd586fb964c12c385665"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HCE53ZSR5OMZ5HOGSE6B4SS6PI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factorization graphs of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Ali Azimi, Mohammad Farrokhi Derakhshandeh Ghouchan","submitted_at":"2019-11-28T08:46:31Z","abstract_excerpt":"We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization graphs. Also, we obtain a classification of all groups with claw-free, $K_{1,4}$-free, and square-free factorization graphs, excluding the non-solvable groups in the latter case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12594","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.12594/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-05T00:22:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqkcNNvEO+OiCPdULf+BmwM23lg+FKumskP4HQMFlg/nYOivql5Awnznv0KPRqo0PjHHVWhvoEQPeaVP5XRJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:33:55.124787Z"},"content_sha256":"4319aeb1667f26145be757e094ccb895b859f13132ed42d4de3e90ef157cdeea","schema_version":"1.0","event_id":"sha256:4319aeb1667f26145be757e094ccb895b859f13132ed42d4de3e90ef157cdeea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCE53ZSR5OMZ5HOGSE6B4SS6PI/bundle.json","state_url":"https://pith.science/pith/HCE53ZSR5OMZ5HOGSE6B4SS6PI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCE53ZSR5OMZ5HOGSE6B4SS6PI/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-07-05T10:33:55Z","links":{"resolver":"https://pith.science/pith/HCE53ZSR5OMZ5HOGSE6B4SS6PI","bundle":"https://pith.science/pith/HCE53ZSR5OMZ5HOGSE6B4SS6PI/bundle.json","state":"https://pith.science/pith/HCE53ZSR5OMZ5HOGSE6B4SS6PI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCE53ZSR5OMZ5HOGSE6B4SS6PI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HCE53ZSR5OMZ5HOGSE6B4SS6PI","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":"9edac38518e555f52849c8f30de30a26c65b53b34d12ea03cbbd38f91deb9053","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-11-28T08:46:31Z","title_canon_sha256":"528579134396419273cc04944e9f12a391656876ac867ff6c090a2d22abfbc84"},"schema_version":"1.0","source":{"id":"1911.12594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.12594","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"arxiv_version","alias_value":"1911.12594v1","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12594","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"pith_short_12","alias_value":"HCE53ZSR5OMZ","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"pith_short_16","alias_value":"HCE53ZSR5OMZ5HOG","created_at":"2026-07-05T00:22:47Z"},{"alias_kind":"pith_short_8","alias_value":"HCE53ZSR","created_at":"2026-07-05T00:22:47Z"}],"graph_snapshots":[{"event_id":"sha256:4319aeb1667f26145be757e094ccb895b859f13132ed42d4de3e90ef157cdeea","target":"graph","created_at":"2026-07-05T00:22:47Z","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/1911.12594/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization graphs. Also, we obtain a classification of all groups with claw-free, $K_{1,4}$-free, and square-free factorization graphs, excluding the non-solvable groups in the latter case.","authors_text":"Ali Azimi, Mohammad Farrokhi Derakhshandeh Ghouchan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-11-28T08:46:31Z","title":"Factorization graphs of finite groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12594","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:c9fe4949cce3ec959e2ee23fd63830bcbea572637547dd586fb964c12c385665","target":"record","created_at":"2026-07-05T00:22:47Z","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":"9edac38518e555f52849c8f30de30a26c65b53b34d12ea03cbbd38f91deb9053","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-11-28T08:46:31Z","title_canon_sha256":"528579134396419273cc04944e9f12a391656876ac867ff6c090a2d22abfbc84"},"schema_version":"1.0","source":{"id":"1911.12594","kind":"arxiv","version":1}},"canonical_sha256":"3889dde651eb999e9dc6913c1e4a5e7a388525d0067952091c28c462dabebd83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3889dde651eb999e9dc6913c1e4a5e7a388525d0067952091c28c462dabebd83","first_computed_at":"2026-07-05T00:22:47.084175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:22:47.084175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rMLGuEFIgi6lv5l3DfeHruL1chV0pHY2b5oeeddEBe5nSEnMQpVUi5pwUqyZlDalGF6Z/QLikKTK0i+4C6cVDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:22:47.084655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.12594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9fe4949cce3ec959e2ee23fd63830bcbea572637547dd586fb964c12c385665","sha256:4319aeb1667f26145be757e094ccb895b859f13132ed42d4de3e90ef157cdeea"],"state_sha256":"64ce54ef20a80738dbc07f128a17883ad0fee9357a5ebeb52aba66ec4cf1a038"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajXpSiyeaVoSWi4iJoz4dta5FohjuqkhF2R/DBiKdLNVkpPUJMurOsPofGgDlF50H/BSh0YNY0EymzoUufZlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T10:33:55.127645Z","bundle_sha256":"09bf6a2ee7115adff8b1734a50cf6f8f172dd0efd76be4a16d08e7472f00e75f"}}