{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OX5GW7JTXH6DXISSAQSTBP5V6U","short_pith_number":"pith:OX5GW7JT","schema_version":"1.0","canonical_sha256":"75fa6b7d33b9fc3ba252042530bfb5f539fda7c9e59ad31d6d87551c6456f3f8","source":{"kind":"arxiv","id":"1203.2428","version":1},"attestation_state":"computed","paper":{"title":"The Non-Nilpotent Graph of a Semigroup","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"E. Jespers, M. H. Shahzamanian","submitted_at":"2012-03-12T09:12:38Z","abstract_excerpt":"We associate a graph ${\\mathcal N}_{S}$ with a semigroup $S$ (called the upper non-nilpotent graph of $S$). The vertices of this graph are the elements of $S$ and two vertices are adjacent if they generate a semigroup that is not nilpotent (in the sense of Malcev). In case $S$ is a group this graph has been introduced by A. Abdollahi and M. Zarrin and some remarkable properties have been proved. The aim of this paper is to study this graph (and some related graphs, such as the non-commuting graph) and to discover the algebraic structure of $S$ determined by the associated graph. It is shown th"},"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":"1203.2428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-03-12T09:12:38Z","cross_cats_sorted":[],"title_canon_sha256":"895ea94b6510b4f53052b3dc9766c9c23d1b697d63b63c237dd94bf671872c8c","abstract_canon_sha256":"388d9a7042f9b537cd2f1e2a44a5469c0d0e28761e17a595961c2f263189bb69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:36.172444Z","signature_b64":"mQdjYk88+0kcJg2XFK5qAvYpu5k6Me/tBLrCzVShimeUfi/VpWFRll1YXgBjKRuymott2IrlT7tAQTyaokM4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75fa6b7d33b9fc3ba252042530bfb5f539fda7c9e59ad31d6d87551c6456f3f8","last_reissued_at":"2026-05-18T02:57:36.171779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:36.171779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Non-Nilpotent Graph of a Semigroup","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"E. Jespers, M. H. Shahzamanian","submitted_at":"2012-03-12T09:12:38Z","abstract_excerpt":"We associate a graph ${\\mathcal N}_{S}$ with a semigroup $S$ (called the upper non-nilpotent graph of $S$). The vertices of this graph are the elements of $S$ and two vertices are adjacent if they generate a semigroup that is not nilpotent (in the sense of Malcev). In case $S$ is a group this graph has been introduced by A. Abdollahi and M. Zarrin and some remarkable properties have been proved. The aim of this paper is to study this graph (and some related graphs, such as the non-commuting graph) and to discover the algebraic structure of $S$ determined by the associated graph. It is shown th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2428","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":"1203.2428","created_at":"2026-05-18T02:57:36.171874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2428v1","created_at":"2026-05-18T02:57:36.171874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2428","created_at":"2026-05-18T02:57:36.171874+00:00"},{"alias_kind":"pith_short_12","alias_value":"OX5GW7JTXH6D","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OX5GW7JTXH6DXISS","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OX5GW7JT","created_at":"2026-05-18T12:27:16.716162+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/OX5GW7JTXH6DXISSAQSTBP5V6U","json":"https://pith.science/pith/OX5GW7JTXH6DXISSAQSTBP5V6U.json","graph_json":"https://pith.science/api/pith-number/OX5GW7JTXH6DXISSAQSTBP5V6U/graph.json","events_json":"https://pith.science/api/pith-number/OX5GW7JTXH6DXISSAQSTBP5V6U/events.json","paper":"https://pith.science/paper/OX5GW7JT"},"agent_actions":{"view_html":"https://pith.science/pith/OX5GW7JTXH6DXISSAQSTBP5V6U","download_json":"https://pith.science/pith/OX5GW7JTXH6DXISSAQSTBP5V6U.json","view_paper":"https://pith.science/paper/OX5GW7JT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2428&json=true","fetch_graph":"https://pith.science/api/pith-number/OX5GW7JTXH6DXISSAQSTBP5V6U/graph.json","fetch_events":"https://pith.science/api/pith-number/OX5GW7JTXH6DXISSAQSTBP5V6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OX5GW7JTXH6DXISSAQSTBP5V6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OX5GW7JTXH6DXISSAQSTBP5V6U/action/storage_attestation","attest_author":"https://pith.science/pith/OX5GW7JTXH6DXISSAQSTBP5V6U/action/author_attestation","sign_citation":"https://pith.science/pith/OX5GW7JTXH6DXISSAQSTBP5V6U/action/citation_signature","submit_replication":"https://pith.science/pith/OX5GW7JTXH6DXISSAQSTBP5V6U/action/replication_record"}},"created_at":"2026-05-18T02:57:36.171874+00:00","updated_at":"2026-05-18T02:57:36.171874+00:00"}