{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TERLQIDHYP2G2VKSORURDECBND","short_pith_number":"pith:TERLQIDH","schema_version":"1.0","canonical_sha256":"9922b82067c3f46d5552746911904168c5bee52b6a2fd8f373c8793e097fb33d","source":{"kind":"arxiv","id":"1708.07831","version":1},"attestation_state":"computed","paper":{"title":"On the automorphism group of the m-coloured random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Peter J. Cameron, Sam Tarzi","submitted_at":"2017-08-25T17:31:37Z","abstract_excerpt":"Let $R_m$ be the (unique) universal homogeneous $m$-edge-coloured countable complete graph ($m\\ge2$), and $G_m$ its group of colour-preserving automorphisms. The group $G_m$ was shown to be simple by John Truss. We examine the automorphism group of $G_m$, and show that it is the group of permutations of $R_m$ which induce permutations on the colours, and hence an extension of $G_m$ by the symmetric group of degree $m$. We show further that the extension splits if and only if $m$ is odd, and in the case where $m$ is even and not divisible by~$8$ we find the smallest supplement for $G_m$ in its "},"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":"1708.07831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-25T17:31:37Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"df78ea49e6b587a292a9571b949d48c3bbc6dd934f404a953cc2cd64fd34a1bb","abstract_canon_sha256":"9841a7bc331221d0b77b31d04b412127c5d228d58216bbbbf04bc33ff6db2915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:37.910624Z","signature_b64":"9ICUKA+w86McFyUEsTKDISiN2VI6tsR/LBWgHb5dKafDnq60NqZneEX6m/gZ0imtpgn2wMbHmBtbbJcSb7XrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9922b82067c3f46d5552746911904168c5bee52b6a2fd8f373c8793e097fb33d","last_reissued_at":"2026-05-18T00:36:37.909872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:37.909872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the automorphism group of the m-coloured random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Peter J. Cameron, Sam Tarzi","submitted_at":"2017-08-25T17:31:37Z","abstract_excerpt":"Let $R_m$ be the (unique) universal homogeneous $m$-edge-coloured countable complete graph ($m\\ge2$), and $G_m$ its group of colour-preserving automorphisms. The group $G_m$ was shown to be simple by John Truss. We examine the automorphism group of $G_m$, and show that it is the group of permutations of $R_m$ which induce permutations on the colours, and hence an extension of $G_m$ by the symmetric group of degree $m$. We show further that the extension splits if and only if $m$ is odd, and in the case where $m$ is even and not divisible by~$8$ we find the smallest supplement for $G_m$ in its "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07831","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":"1708.07831","created_at":"2026-05-18T00:36:37.909982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07831v1","created_at":"2026-05-18T00:36:37.909982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07831","created_at":"2026-05-18T00:36:37.909982+00:00"},{"alias_kind":"pith_short_12","alias_value":"TERLQIDHYP2G","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TERLQIDHYP2G2VKS","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TERLQIDH","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/TERLQIDHYP2G2VKSORURDECBND","json":"https://pith.science/pith/TERLQIDHYP2G2VKSORURDECBND.json","graph_json":"https://pith.science/api/pith-number/TERLQIDHYP2G2VKSORURDECBND/graph.json","events_json":"https://pith.science/api/pith-number/TERLQIDHYP2G2VKSORURDECBND/events.json","paper":"https://pith.science/paper/TERLQIDH"},"agent_actions":{"view_html":"https://pith.science/pith/TERLQIDHYP2G2VKSORURDECBND","download_json":"https://pith.science/pith/TERLQIDHYP2G2VKSORURDECBND.json","view_paper":"https://pith.science/paper/TERLQIDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07831&json=true","fetch_graph":"https://pith.science/api/pith-number/TERLQIDHYP2G2VKSORURDECBND/graph.json","fetch_events":"https://pith.science/api/pith-number/TERLQIDHYP2G2VKSORURDECBND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TERLQIDHYP2G2VKSORURDECBND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TERLQIDHYP2G2VKSORURDECBND/action/storage_attestation","attest_author":"https://pith.science/pith/TERLQIDHYP2G2VKSORURDECBND/action/author_attestation","sign_citation":"https://pith.science/pith/TERLQIDHYP2G2VKSORURDECBND/action/citation_signature","submit_replication":"https://pith.science/pith/TERLQIDHYP2G2VKSORURDECBND/action/replication_record"}},"created_at":"2026-05-18T00:36:37.909982+00:00","updated_at":"2026-05-18T00:36:37.909982+00:00"}