{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P5F6IGD6NTDURPJ4KBLREDCJ6T","short_pith_number":"pith:P5F6IGD6","schema_version":"1.0","canonical_sha256":"7f4be4187e6cc748bd3c5057120c49f4d8b79f918b21ef0998868471711daaff","source":{"kind":"arxiv","id":"1905.07431","version":1},"attestation_state":"computed","paper":{"title":"Rational Groups and a Characterization of a Class of Permutation Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Cecil Andrew Ellard","submitted_at":"2019-05-17T18:37:02Z","abstract_excerpt":"We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation group in which any two elements fixing the same number of letters are conjugate."},"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":"1905.07431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-05-17T18:37:02Z","cross_cats_sorted":[],"title_canon_sha256":"3d8d2e33fc83c19af308e4afe8a5484d452c8d73aee948ec037c2fcaa812a514","abstract_canon_sha256":"00d737a59ea20a830547e7e3f8006a8b1e6e9825e56041d1d0cdfa57237a958a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:51.366238Z","signature_b64":"CGs/bkJ7O0HJosZYW08Kp0DOy0Wxxjcqh3V2WxpfaYhmboHXtKEU4PTRn9AaHzwztgen2nHxNu9j150COT0wAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f4be4187e6cc748bd3c5057120c49f4d8b79f918b21ef0998868471711daaff","last_reissued_at":"2026-05-17T23:45:51.365761Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:51.365761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rational Groups and a Characterization of a Class of Permutation Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Cecil Andrew Ellard","submitted_at":"2019-05-17T18:37:02Z","abstract_excerpt":"We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation group in which any two elements fixing the same number of letters are conjugate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07431","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":"1905.07431","created_at":"2026-05-17T23:45:51.365836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07431v1","created_at":"2026-05-17T23:45:51.365836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07431","created_at":"2026-05-17T23:45:51.365836+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5F6IGD6NTDU","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5F6IGD6NTDURPJ4","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5F6IGD6","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07828","citing_title":"The Sym(3) Conjecture and Alt(8)","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P5F6IGD6NTDURPJ4KBLREDCJ6T","json":"https://pith.science/pith/P5F6IGD6NTDURPJ4KBLREDCJ6T.json","graph_json":"https://pith.science/api/pith-number/P5F6IGD6NTDURPJ4KBLREDCJ6T/graph.json","events_json":"https://pith.science/api/pith-number/P5F6IGD6NTDURPJ4KBLREDCJ6T/events.json","paper":"https://pith.science/paper/P5F6IGD6"},"agent_actions":{"view_html":"https://pith.science/pith/P5F6IGD6NTDURPJ4KBLREDCJ6T","download_json":"https://pith.science/pith/P5F6IGD6NTDURPJ4KBLREDCJ6T.json","view_paper":"https://pith.science/paper/P5F6IGD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07431&json=true","fetch_graph":"https://pith.science/api/pith-number/P5F6IGD6NTDURPJ4KBLREDCJ6T/graph.json","fetch_events":"https://pith.science/api/pith-number/P5F6IGD6NTDURPJ4KBLREDCJ6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5F6IGD6NTDURPJ4KBLREDCJ6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5F6IGD6NTDURPJ4KBLREDCJ6T/action/storage_attestation","attest_author":"https://pith.science/pith/P5F6IGD6NTDURPJ4KBLREDCJ6T/action/author_attestation","sign_citation":"https://pith.science/pith/P5F6IGD6NTDURPJ4KBLREDCJ6T/action/citation_signature","submit_replication":"https://pith.science/pith/P5F6IGD6NTDURPJ4KBLREDCJ6T/action/replication_record"}},"created_at":"2026-05-17T23:45:51.365836+00:00","updated_at":"2026-05-17T23:45:51.365836+00:00"}