{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MGQCA3MXMYWP27AYUG5PEH7BCY","short_pith_number":"pith:MGQCA3MX","schema_version":"1.0","canonical_sha256":"61a0206d97662cfd7c18a1baf21fe1161197f630cae6eba224f8b6ba07e5b474","source":{"kind":"arxiv","id":"1509.05660","version":1},"attestation_state":"computed","paper":{"title":"Closest multiplication tables of groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Ian M. Wanless, Petr Vojt\\v{e}chovsk\\'y","submitted_at":"2015-09-18T15:22:07Z","abstract_excerpt":"Suppose that all groups of order $n$ are defined on the same set $G$ of cardinality $n$, and let the \\emph{distance} of two groups of order $n$ be the number of pairs $(a,b)\\in G\\times G$ where the two group operations differ. Given a group $G(\\circ)$ of order $n$, we find all groups of order $n$, up to isomorphism, that are closest to $G(\\circ)$."},"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":"1509.05660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-09-18T15:22:07Z","cross_cats_sorted":[],"title_canon_sha256":"c3cdd646f141dd3250d5dc87e704998db2558eeb0be1b29a83d481db5b5142ff","abstract_canon_sha256":"db458bb3afaf8f7436025804bbc04a930836ad3d06a41ac9a5922460abe63515"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.666786Z","signature_b64":"q9hCb8pLbTUip8OrBtSG3zr5aUIESgOX8mhOx3jqJO0BwIB6lJALFyDJWAxNaQ3QSUKotaBJ0n8H98PkISBNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61a0206d97662cfd7c18a1baf21fe1161197f630cae6eba224f8b6ba07e5b474","last_reissued_at":"2026-05-18T01:32:42.666262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.666262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closest multiplication tables of groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Ian M. Wanless, Petr Vojt\\v{e}chovsk\\'y","submitted_at":"2015-09-18T15:22:07Z","abstract_excerpt":"Suppose that all groups of order $n$ are defined on the same set $G$ of cardinality $n$, and let the \\emph{distance} of two groups of order $n$ be the number of pairs $(a,b)\\in G\\times G$ where the two group operations differ. Given a group $G(\\circ)$ of order $n$, we find all groups of order $n$, up to isomorphism, that are closest to $G(\\circ)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05660","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":"1509.05660","created_at":"2026-05-18T01:32:42.666376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05660v1","created_at":"2026-05-18T01:32:42.666376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05660","created_at":"2026-05-18T01:32:42.666376+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGQCA3MXMYWP","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGQCA3MXMYWP27AY","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGQCA3MX","created_at":"2026-05-18T12:29:32.376354+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/MGQCA3MXMYWP27AYUG5PEH7BCY","json":"https://pith.science/pith/MGQCA3MXMYWP27AYUG5PEH7BCY.json","graph_json":"https://pith.science/api/pith-number/MGQCA3MXMYWP27AYUG5PEH7BCY/graph.json","events_json":"https://pith.science/api/pith-number/MGQCA3MXMYWP27AYUG5PEH7BCY/events.json","paper":"https://pith.science/paper/MGQCA3MX"},"agent_actions":{"view_html":"https://pith.science/pith/MGQCA3MXMYWP27AYUG5PEH7BCY","download_json":"https://pith.science/pith/MGQCA3MXMYWP27AYUG5PEH7BCY.json","view_paper":"https://pith.science/paper/MGQCA3MX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05660&json=true","fetch_graph":"https://pith.science/api/pith-number/MGQCA3MXMYWP27AYUG5PEH7BCY/graph.json","fetch_events":"https://pith.science/api/pith-number/MGQCA3MXMYWP27AYUG5PEH7BCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGQCA3MXMYWP27AYUG5PEH7BCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGQCA3MXMYWP27AYUG5PEH7BCY/action/storage_attestation","attest_author":"https://pith.science/pith/MGQCA3MXMYWP27AYUG5PEH7BCY/action/author_attestation","sign_citation":"https://pith.science/pith/MGQCA3MXMYWP27AYUG5PEH7BCY/action/citation_signature","submit_replication":"https://pith.science/pith/MGQCA3MXMYWP27AYUG5PEH7BCY/action/replication_record"}},"created_at":"2026-05-18T01:32:42.666376+00:00","updated_at":"2026-05-18T01:32:42.666376+00:00"}