{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:HUNL3GCWWZ6CVECSP22E4NNQ3H","short_pith_number":"pith:HUNL3GCW","schema_version":"1.0","canonical_sha256":"3d1abd9856b67c2a90527eb44e35b0d9eb927b23b149d66e3e0d1e6a6a59da74","source":{"kind":"arxiv","id":"0705.3445","version":2},"attestation_state":"computed","paper":{"title":"Admissible orders of Jordan loops","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Kyle Pula, Michael K. Kinyon, Petr Vojtechovsky","submitted_at":"2007-05-23T18:51:57Z","abstract_excerpt":"A commutative loop is Jordan if it satisfies the identity $x^2 (y x) = (x^2 y) x$. Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order $n$ exists if and only if $n\\geq 6$ and $n\\neq 9$. We also consider whether powers of elements in Jordan loops are well-defined, and we construct an infinite family of finite simple nonassociative Jordan loops."},"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":"0705.3445","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.GR","submitted_at":"2007-05-23T18:51:57Z","cross_cats_sorted":[],"title_canon_sha256":"e807b1e18bf48ff578a1f7059383d32eedb90ca3071d7790396c9af1054f500f","abstract_canon_sha256":"f20d397b869641b7281e6c9b1278b828a785c70e70dd7635e727e00d2bb9053b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:17.314926Z","signature_b64":"i7sDF1YAHGiBu5XwEZn8gDEY/3ujIkui+1OwPllaBp6qSJFXefIzlBdjQ6XNzxczMTf2V/iMeTFj8GhijCtlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d1abd9856b67c2a90527eb44e35b0d9eb927b23b149d66e3e0d1e6a6a59da74","last_reissued_at":"2026-05-18T04:15:17.314346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:17.314346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Admissible orders of Jordan loops","license":"","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Kyle Pula, Michael K. Kinyon, Petr Vojtechovsky","submitted_at":"2007-05-23T18:51:57Z","abstract_excerpt":"A commutative loop is Jordan if it satisfies the identity $x^2 (y x) = (x^2 y) x$. Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order $n$ exists if and only if $n\\geq 6$ and $n\\neq 9$. We also consider whether powers of elements in Jordan loops are well-defined, and we construct an infinite family of finite simple nonassociative Jordan loops."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.3445","kind":"arxiv","version":2},"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":"0705.3445","created_at":"2026-05-18T04:15:17.314428+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.3445v2","created_at":"2026-05-18T04:15:17.314428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.3445","created_at":"2026-05-18T04:15:17.314428+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUNL3GCWWZ6C","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUNL3GCWWZ6CVECS","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUNL3GCW","created_at":"2026-05-18T12:25:55.427421+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/HUNL3GCWWZ6CVECSP22E4NNQ3H","json":"https://pith.science/pith/HUNL3GCWWZ6CVECSP22E4NNQ3H.json","graph_json":"https://pith.science/api/pith-number/HUNL3GCWWZ6CVECSP22E4NNQ3H/graph.json","events_json":"https://pith.science/api/pith-number/HUNL3GCWWZ6CVECSP22E4NNQ3H/events.json","paper":"https://pith.science/paper/HUNL3GCW"},"agent_actions":{"view_html":"https://pith.science/pith/HUNL3GCWWZ6CVECSP22E4NNQ3H","download_json":"https://pith.science/pith/HUNL3GCWWZ6CVECSP22E4NNQ3H.json","view_paper":"https://pith.science/paper/HUNL3GCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.3445&json=true","fetch_graph":"https://pith.science/api/pith-number/HUNL3GCWWZ6CVECSP22E4NNQ3H/graph.json","fetch_events":"https://pith.science/api/pith-number/HUNL3GCWWZ6CVECSP22E4NNQ3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUNL3GCWWZ6CVECSP22E4NNQ3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUNL3GCWWZ6CVECSP22E4NNQ3H/action/storage_attestation","attest_author":"https://pith.science/pith/HUNL3GCWWZ6CVECSP22E4NNQ3H/action/author_attestation","sign_citation":"https://pith.science/pith/HUNL3GCWWZ6CVECSP22E4NNQ3H/action/citation_signature","submit_replication":"https://pith.science/pith/HUNL3GCWWZ6CVECSP22E4NNQ3H/action/replication_record"}},"created_at":"2026-05-18T04:15:17.314428+00:00","updated_at":"2026-05-18T04:15:17.314428+00:00"}