{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZBQI6UC6OATJJNNLG6MXWCC3XW","short_pith_number":"pith:ZBQI6UC6","schema_version":"1.0","canonical_sha256":"c8608f505e702694b5ab37997b085bbd8397345ce6b17a33d5eb3e6e50b3b9d6","source":{"kind":"arxiv","id":"1901.07133","version":1},"attestation_state":"computed","paper":{"title":"A classification of the m-graphical regular representation of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia-Li Du, Pablo Spiga, Yan-Quan Feng","submitted_at":"2019-01-22T01:00:30Z","abstract_excerpt":"In this paper we extend the classical notion of digraphical and graphical regular representation of a group and we classify, by means of an explicit description, the finite groups satisfying this generalization. A graph or digraph is called regular if each vertex has the same valency, or, the same out-valency and the same in-valency, respectively. An m-(di)graphical regular representation (respectively, m-GRR and m-DRR, for short) of a group G is a regular (di)graph whose automorphism group is isomorphic to G and acts semiregularly on the vertex set with m orbits. When m=1, this definition agr"},"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":"1901.07133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-22T01:00:30Z","cross_cats_sorted":[],"title_canon_sha256":"8cad4c82f73da1b91cd452bd26d43c958a23364af301ade567d56665ec3bcfc4","abstract_canon_sha256":"4cd0f1311c85e0c18e132c684eeb970f1a45d25b2a0eb243f80e88c54347beca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:48.059231Z","signature_b64":"TcxGmvBcchdI8nIPqMawMZBbqiIJU2eQ5JNfh0Zil6+B8AQUNGVapKn3pwQ2kJoLKPFjHXkY9whP6vXkAUpXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8608f505e702694b5ab37997b085bbd8397345ce6b17a33d5eb3e6e50b3b9d6","last_reissued_at":"2026-05-17T23:55:48.058763Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:48.058763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A classification of the m-graphical regular representation of finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia-Li Du, Pablo Spiga, Yan-Quan Feng","submitted_at":"2019-01-22T01:00:30Z","abstract_excerpt":"In this paper we extend the classical notion of digraphical and graphical regular representation of a group and we classify, by means of an explicit description, the finite groups satisfying this generalization. A graph or digraph is called regular if each vertex has the same valency, or, the same out-valency and the same in-valency, respectively. An m-(di)graphical regular representation (respectively, m-GRR and m-DRR, for short) of a group G is a regular (di)graph whose automorphism group is isomorphic to G and acts semiregularly on the vertex set with m orbits. When m=1, this definition agr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07133","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":"1901.07133","created_at":"2026-05-17T23:55:48.058836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07133v1","created_at":"2026-05-17T23:55:48.058836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07133","created_at":"2026-05-17T23:55:48.058836+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBQI6UC6OATJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBQI6UC6OATJJNNL","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBQI6UC6","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04551","citing_title":"Existence of non-Cayley Haar graphs","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZBQI6UC6OATJJNNLG6MXWCC3XW","json":"https://pith.science/pith/ZBQI6UC6OATJJNNLG6MXWCC3XW.json","graph_json":"https://pith.science/api/pith-number/ZBQI6UC6OATJJNNLG6MXWCC3XW/graph.json","events_json":"https://pith.science/api/pith-number/ZBQI6UC6OATJJNNLG6MXWCC3XW/events.json","paper":"https://pith.science/paper/ZBQI6UC6"},"agent_actions":{"view_html":"https://pith.science/pith/ZBQI6UC6OATJJNNLG6MXWCC3XW","download_json":"https://pith.science/pith/ZBQI6UC6OATJJNNLG6MXWCC3XW.json","view_paper":"https://pith.science/paper/ZBQI6UC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07133&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBQI6UC6OATJJNNLG6MXWCC3XW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBQI6UC6OATJJNNLG6MXWCC3XW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBQI6UC6OATJJNNLG6MXWCC3XW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBQI6UC6OATJJNNLG6MXWCC3XW/action/storage_attestation","attest_author":"https://pith.science/pith/ZBQI6UC6OATJJNNLG6MXWCC3XW/action/author_attestation","sign_citation":"https://pith.science/pith/ZBQI6UC6OATJJNNLG6MXWCC3XW/action/citation_signature","submit_replication":"https://pith.science/pith/ZBQI6UC6OATJJNNLG6MXWCC3XW/action/replication_record"}},"created_at":"2026-05-17T23:55:48.058836+00:00","updated_at":"2026-05-17T23:55:48.058836+00:00"}