{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TVFJX5BT3VYUEICFRKFTY6XRFA","short_pith_number":"pith:TVFJX5BT","schema_version":"1.0","canonical_sha256":"9d4a9bf433dd714220458a8b3c7af1281abcc6ed91d6cf7d90ad8e69130c1186","source":{"kind":"arxiv","id":"1707.09586","version":1},"attestation_state":"computed","paper":{"title":"Lambda number of the power graph of a finite group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng, Xuanlong Ma","submitted_at":"2017-07-30T06:47:47Z","abstract_excerpt":"The power graph $\\Gamma_G$ of a finite group $G$ is the graph with the vertex set $G$, where two distinct elements are adjacent if one is a power of the other. An $L(2, 1)$-labeling of a graph $\\Gamma$ is an assignment of labels from nonnegative integers to all vertices of $\\Gamma$ such that vertices at distance two get different labels and adjacent vertices get labels that are at least $2$ apart. The lambda number of $\\Gamma$, denoted by $\\lambda(\\Gamma)$, is the minimum span over all $L(2, 1)$-labelings of $\\Gamma$. In this paper, we obtain bounds for $\\lambda(\\Gamma_G)$, and give necessary "},"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":"1707.09586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-30T06:47:47Z","cross_cats_sorted":[],"title_canon_sha256":"9e8dfa9b127936e84da6e81e16d9e4e15a70528173f2c93c07bfdf616bfccab2","abstract_canon_sha256":"f01b095cb8634954532c48763b41f8629744da6cd23eb8a7375bf7e5998321a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:10.873491Z","signature_b64":"1gs2hUmHQCCiYQ82QN39KoiKA3JDk0KqctLnVHn5SCdKp187SRHgtHgy1jmEpj6mGs4W7fIVeddPWua4RTK5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d4a9bf433dd714220458a8b3c7af1281abcc6ed91d6cf7d90ad8e69130c1186","last_reissued_at":"2026-05-18T00:39:10.872796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:10.872796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lambda number of the power graph of a finite group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Min Feng, Xuanlong Ma","submitted_at":"2017-07-30T06:47:47Z","abstract_excerpt":"The power graph $\\Gamma_G$ of a finite group $G$ is the graph with the vertex set $G$, where two distinct elements are adjacent if one is a power of the other. An $L(2, 1)$-labeling of a graph $\\Gamma$ is an assignment of labels from nonnegative integers to all vertices of $\\Gamma$ such that vertices at distance two get different labels and adjacent vertices get labels that are at least $2$ apart. The lambda number of $\\Gamma$, denoted by $\\lambda(\\Gamma)$, is the minimum span over all $L(2, 1)$-labelings of $\\Gamma$. In this paper, we obtain bounds for $\\lambda(\\Gamma_G)$, and give necessary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09586","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":"1707.09586","created_at":"2026-05-18T00:39:10.872898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09586v1","created_at":"2026-05-18T00:39:10.872898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09586","created_at":"2026-05-18T00:39:10.872898+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVFJX5BT3VYU","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVFJX5BT3VYUEICF","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVFJX5BT","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TVFJX5BT3VYUEICFRKFTY6XRFA","json":"https://pith.science/pith/TVFJX5BT3VYUEICFRKFTY6XRFA.json","graph_json":"https://pith.science/api/pith-number/TVFJX5BT3VYUEICFRKFTY6XRFA/graph.json","events_json":"https://pith.science/api/pith-number/TVFJX5BT3VYUEICFRKFTY6XRFA/events.json","paper":"https://pith.science/paper/TVFJX5BT"},"agent_actions":{"view_html":"https://pith.science/pith/TVFJX5BT3VYUEICFRKFTY6XRFA","download_json":"https://pith.science/pith/TVFJX5BT3VYUEICFRKFTY6XRFA.json","view_paper":"https://pith.science/paper/TVFJX5BT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09586&json=true","fetch_graph":"https://pith.science/api/pith-number/TVFJX5BT3VYUEICFRKFTY6XRFA/graph.json","fetch_events":"https://pith.science/api/pith-number/TVFJX5BT3VYUEICFRKFTY6XRFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVFJX5BT3VYUEICFRKFTY6XRFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVFJX5BT3VYUEICFRKFTY6XRFA/action/storage_attestation","attest_author":"https://pith.science/pith/TVFJX5BT3VYUEICFRKFTY6XRFA/action/author_attestation","sign_citation":"https://pith.science/pith/TVFJX5BT3VYUEICFRKFTY6XRFA/action/citation_signature","submit_replication":"https://pith.science/pith/TVFJX5BT3VYUEICFRKFTY6XRFA/action/replication_record"}},"created_at":"2026-05-18T00:39:10.872898+00:00","updated_at":"2026-05-18T00:39:10.872898+00:00"}