{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VBDIZCYRVZVGFOCPOTSQYWCAHD","short_pith_number":"pith:VBDIZCYR","schema_version":"1.0","canonical_sha256":"a8468c8b11ae6a62b84f74e50c584038edf4fa4f3772f1ad59199748e9a330ea","source":{"kind":"arxiv","id":"1712.04699","version":1},"attestation_state":"computed","paper":{"title":"On Generalized Edge Corona Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Freydoon Rahbarnia, Irandokht Rezaee Abdolhosseinzadeh","submitted_at":"2017-12-13T10:57:09Z","abstract_excerpt":"Let $G$ be a simple graph with $m$ edges and $H_i$, $1\\leq i \\leq m$ be simple graphs too. The generalized edge corona product of graphs $G$ and $H_1, ..., H_m$, denoted by $G \\diamond (H_1, ..., H_m)$, is obtained by taking one copy of graphs $G$, $H_1, ..., H_m$ and joining two end vertices of $i$-th edge of $G$ to every vertex of $H_i$, $1\\leq i \\leq m$. In this paper, some results regarding the $k$-distance chromatic number of Generalized edge corona product of graphs are presented. Also, as a consequence of our results, we compute this invariant for the graphs $K_n \\diamond (H_1, ..., H_m"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.04699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-13T10:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"f1dd2082b230d278558bc63513c4335d67a065bc7e67ce1e0e4908140a94e0bf","abstract_canon_sha256":"bc5b2cd132d4ff6f2c148cf3800a9c6e137e99c8d84c5a3d1bec043350618ae0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.686475Z","signature_b64":"dMaGMTQOtJ3xD9Me3bSgxR7qZ5EWcvR0WjPZSrMXeNJCZz+1DiXHifR/5FBaAdzYBymm7kinzbP0HAc65OgDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8468c8b11ae6a62b84f74e50c584038edf4fa4f3772f1ad59199748e9a330ea","last_reissued_at":"2026-05-18T00:28:03.685976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.685976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Generalized Edge Corona Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Freydoon Rahbarnia, Irandokht Rezaee Abdolhosseinzadeh","submitted_at":"2017-12-13T10:57:09Z","abstract_excerpt":"Let $G$ be a simple graph with $m$ edges and $H_i$, $1\\leq i \\leq m$ be simple graphs too. The generalized edge corona product of graphs $G$ and $H_1, ..., H_m$, denoted by $G \\diamond (H_1, ..., H_m)$, is obtained by taking one copy of graphs $G$, $H_1, ..., H_m$ and joining two end vertices of $i$-th edge of $G$ to every vertex of $H_i$, $1\\leq i \\leq m$. In this paper, some results regarding the $k$-distance chromatic number of Generalized edge corona product of graphs are presented. Also, as a consequence of our results, we compute this invariant for the graphs $K_n \\diamond (H_1, ..., H_m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04699","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.04699","created_at":"2026-05-18T00:28:03.686042+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04699v1","created_at":"2026-05-18T00:28:03.686042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04699","created_at":"2026-05-18T00:28:03.686042+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBDIZCYRVZVG","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBDIZCYRVZVGFOCP","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBDIZCYR","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13139","citing_title":"On the strong geodeticity in the corona type product of graphs","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBDIZCYRVZVGFOCPOTSQYWCAHD","json":"https://pith.science/pith/VBDIZCYRVZVGFOCPOTSQYWCAHD.json","graph_json":"https://pith.science/api/pith-number/VBDIZCYRVZVGFOCPOTSQYWCAHD/graph.json","events_json":"https://pith.science/api/pith-number/VBDIZCYRVZVGFOCPOTSQYWCAHD/events.json","paper":"https://pith.science/paper/VBDIZCYR"},"agent_actions":{"view_html":"https://pith.science/pith/VBDIZCYRVZVGFOCPOTSQYWCAHD","download_json":"https://pith.science/pith/VBDIZCYRVZVGFOCPOTSQYWCAHD.json","view_paper":"https://pith.science/paper/VBDIZCYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04699&json=true","fetch_graph":"https://pith.science/api/pith-number/VBDIZCYRVZVGFOCPOTSQYWCAHD/graph.json","fetch_events":"https://pith.science/api/pith-number/VBDIZCYRVZVGFOCPOTSQYWCAHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBDIZCYRVZVGFOCPOTSQYWCAHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBDIZCYRVZVGFOCPOTSQYWCAHD/action/storage_attestation","attest_author":"https://pith.science/pith/VBDIZCYRVZVGFOCPOTSQYWCAHD/action/author_attestation","sign_citation":"https://pith.science/pith/VBDIZCYRVZVGFOCPOTSQYWCAHD/action/citation_signature","submit_replication":"https://pith.science/pith/VBDIZCYRVZVGFOCPOTSQYWCAHD/action/replication_record"}},"created_at":"2026-05-18T00:28:03.686042+00:00","updated_at":"2026-05-18T00:28:03.686042+00:00"}