{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V2H2V5RVIPXH4L5IGJI2YNHLS3","short_pith_number":"pith:V2H2V5RV","schema_version":"1.0","canonical_sha256":"ae8faaf63543ee7e2fa83251ac34eb96e63de9d80eb46cc7640f6620d3f04605","source":{"kind":"arxiv","id":"1707.06206","version":1},"attestation_state":"computed","paper":{"title":"Simple right conjugacy closed loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Mark Greer","submitted_at":"2017-07-19T17:18:35Z","abstract_excerpt":"We give a general construction for right conjugacy closed loops, using $GL(2,q)$ for $q$ a prime power. Under certain conditions, the loops constructed are simple, giving the first general construction for finite, simple right conjugacy closed loops. We give a complete description of the isomorphism classes for the construction, yielding an exact count of non isomorphic loops for each $q$."},"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.06206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-07-19T17:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"b54ca910cef3d933d736dd80d69b3c072bf96f61139ee85c05fef3f0a300c9e2","abstract_canon_sha256":"7dbf810fd954f24318101f879ef225feebeabcdad2a37ab34675201b9b76a5bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:57.290353Z","signature_b64":"Vrn7VeiTFAYCX67aIX4FGlOpOaiDdJHHdLyux2UgdPyxq38XyhtSrRydz1Z/9GW7sF16mAOHBXCOqKi5iO7bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae8faaf63543ee7e2fa83251ac34eb96e63de9d80eb46cc7640f6620d3f04605","last_reissued_at":"2026-05-18T00:39:57.289784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:57.289784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple right conjugacy closed loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Mark Greer","submitted_at":"2017-07-19T17:18:35Z","abstract_excerpt":"We give a general construction for right conjugacy closed loops, using $GL(2,q)$ for $q$ a prime power. Under certain conditions, the loops constructed are simple, giving the first general construction for finite, simple right conjugacy closed loops. We give a complete description of the isomorphism classes for the construction, yielding an exact count of non isomorphic loops for each $q$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06206","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.06206","created_at":"2026-05-18T00:39:57.289869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06206v1","created_at":"2026-05-18T00:39:57.289869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06206","created_at":"2026-05-18T00:39:57.289869+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2H2V5RVIPXH","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2H2V5RVIPXH4L5I","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2H2V5RV","created_at":"2026-05-18T12:31:49.984773+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/V2H2V5RVIPXH4L5IGJI2YNHLS3","json":"https://pith.science/pith/V2H2V5RVIPXH4L5IGJI2YNHLS3.json","graph_json":"https://pith.science/api/pith-number/V2H2V5RVIPXH4L5IGJI2YNHLS3/graph.json","events_json":"https://pith.science/api/pith-number/V2H2V5RVIPXH4L5IGJI2YNHLS3/events.json","paper":"https://pith.science/paper/V2H2V5RV"},"agent_actions":{"view_html":"https://pith.science/pith/V2H2V5RVIPXH4L5IGJI2YNHLS3","download_json":"https://pith.science/pith/V2H2V5RVIPXH4L5IGJI2YNHLS3.json","view_paper":"https://pith.science/paper/V2H2V5RV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06206&json=true","fetch_graph":"https://pith.science/api/pith-number/V2H2V5RVIPXH4L5IGJI2YNHLS3/graph.json","fetch_events":"https://pith.science/api/pith-number/V2H2V5RVIPXH4L5IGJI2YNHLS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2H2V5RVIPXH4L5IGJI2YNHLS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2H2V5RVIPXH4L5IGJI2YNHLS3/action/storage_attestation","attest_author":"https://pith.science/pith/V2H2V5RVIPXH4L5IGJI2YNHLS3/action/author_attestation","sign_citation":"https://pith.science/pith/V2H2V5RVIPXH4L5IGJI2YNHLS3/action/citation_signature","submit_replication":"https://pith.science/pith/V2H2V5RVIPXH4L5IGJI2YNHLS3/action/replication_record"}},"created_at":"2026-05-18T00:39:57.289869+00:00","updated_at":"2026-05-18T00:39:57.289869+00:00"}