{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UMJCXNPAOI7U3QCDOXVLDY6QRO","short_pith_number":"pith:UMJCXNPA","schema_version":"1.0","canonical_sha256":"a3122bb5e0723f4dc04375eab1e3d08b8ae0dfa218a0df1d1cc96cbd682fee3a","source":{"kind":"arxiv","id":"1201.5659","version":2},"attestation_state":"computed","paper":{"title":"Enumeration of nilpotent loops up to isotopy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Lucien Clavier","submitted_at":"2012-01-26T21:48:59Z","abstract_excerpt":"We modify tools introduced by Daniel Daly and Petr Vojtechovsky in order to count, for any odd prime q, the number of nilpotent loops of order 2q up to isotopy, instead of isomorphy."},"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":"1201.5659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-01-26T21:48:59Z","cross_cats_sorted":[],"title_canon_sha256":"38571e34087eb9d5a65a238f485d599b42b97433388d4376ccbf340222dffa54","abstract_canon_sha256":"d457121e9c0cd847b3b4c3d3f501a678366263cc05b927ed681f40872d35a7bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:59.015850Z","signature_b64":"O9fjdoybgGIYbgLRk8W1unMoi6h5okqxTf3K30V7Qfh7DlyK+mT22Ui0QCdKzcSlszqAg5yjW729BHkFz3AODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3122bb5e0723f4dc04375eab1e3d08b8ae0dfa218a0df1d1cc96cbd682fee3a","last_reissued_at":"2026-05-18T03:46:59.015062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:59.015062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of nilpotent loops up to isotopy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Lucien Clavier","submitted_at":"2012-01-26T21:48:59Z","abstract_excerpt":"We modify tools introduced by Daniel Daly and Petr Vojtechovsky in order to count, for any odd prime q, the number of nilpotent loops of order 2q up to isotopy, instead of isomorphy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5659","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":"1201.5659","created_at":"2026-05-18T03:46:59.015190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5659v2","created_at":"2026-05-18T03:46:59.015190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5659","created_at":"2026-05-18T03:46:59.015190+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMJCXNPAOI7U","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMJCXNPAOI7U3QCD","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMJCXNPA","created_at":"2026-05-18T12:27:23.164592+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/UMJCXNPAOI7U3QCDOXVLDY6QRO","json":"https://pith.science/pith/UMJCXNPAOI7U3QCDOXVLDY6QRO.json","graph_json":"https://pith.science/api/pith-number/UMJCXNPAOI7U3QCDOXVLDY6QRO/graph.json","events_json":"https://pith.science/api/pith-number/UMJCXNPAOI7U3QCDOXVLDY6QRO/events.json","paper":"https://pith.science/paper/UMJCXNPA"},"agent_actions":{"view_html":"https://pith.science/pith/UMJCXNPAOI7U3QCDOXVLDY6QRO","download_json":"https://pith.science/pith/UMJCXNPAOI7U3QCDOXVLDY6QRO.json","view_paper":"https://pith.science/paper/UMJCXNPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5659&json=true","fetch_graph":"https://pith.science/api/pith-number/UMJCXNPAOI7U3QCDOXVLDY6QRO/graph.json","fetch_events":"https://pith.science/api/pith-number/UMJCXNPAOI7U3QCDOXVLDY6QRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMJCXNPAOI7U3QCDOXVLDY6QRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMJCXNPAOI7U3QCDOXVLDY6QRO/action/storage_attestation","attest_author":"https://pith.science/pith/UMJCXNPAOI7U3QCDOXVLDY6QRO/action/author_attestation","sign_citation":"https://pith.science/pith/UMJCXNPAOI7U3QCDOXVLDY6QRO/action/citation_signature","submit_replication":"https://pith.science/pith/UMJCXNPAOI7U3QCDOXVLDY6QRO/action/replication_record"}},"created_at":"2026-05-18T03:46:59.015190+00:00","updated_at":"2026-05-18T03:46:59.015190+00:00"}