{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KMLC34LQ3VVI2KOBOGEH622L5Q","short_pith_number":"pith:KMLC34LQ","schema_version":"1.0","canonical_sha256":"53162df170dd6a8d29c171887f6b4bec3e466a1e035a1c1e2d745b17f2c0b79f","source":{"kind":"arxiv","id":"1806.04369","version":1},"attestation_state":"computed","paper":{"title":"Complete regular dessins of odd prime power order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kan Hu, Naer Wang, Roman Nedela","submitted_at":"2018-06-12T07:30:43Z","abstract_excerpt":"A dessin is a $2$-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts regularly on the edges. In this paper we employ group-theoretic method to determine and enumerate the isomorphism classes of regular dessins with the complete bipartite underlying graphs of odd prime power order."},"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":"1806.04369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T07:30:43Z","cross_cats_sorted":[],"title_canon_sha256":"832a210557695c5b5ca8476e5ff9c1eeda7dbc337c28a7c3fadcf389407700ac","abstract_canon_sha256":"b78f287e54959164fb18278522d1a4656969367241b398468f95cbaf5502ac72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.717411Z","signature_b64":"byKYq9rthHVM3Rv8IDAqaS0RMxcSvEQeM+OndMHBxbgq/qThv9zEf3xfjlsxc0l3Y52QiKnpYpNeFPqkNEkIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53162df170dd6a8d29c171887f6b4bec3e466a1e035a1c1e2d745b17f2c0b79f","last_reissued_at":"2026-05-18T00:13:35.716851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.716851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete regular dessins of odd prime power order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kan Hu, Naer Wang, Roman Nedela","submitted_at":"2018-06-12T07:30:43Z","abstract_excerpt":"A dessin is a $2$-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts regularly on the edges. In this paper we employ group-theoretic method to determine and enumerate the isomorphism classes of regular dessins with the complete bipartite underlying graphs of odd prime power order."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04369","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":"1806.04369","created_at":"2026-05-18T00:13:35.716933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04369v1","created_at":"2026-05-18T00:13:35.716933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04369","created_at":"2026-05-18T00:13:35.716933+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMLC34LQ3VVI","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMLC34LQ3VVI2KOB","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMLC34LQ","created_at":"2026-05-18T12:32:33.847187+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/KMLC34LQ3VVI2KOBOGEH622L5Q","json":"https://pith.science/pith/KMLC34LQ3VVI2KOBOGEH622L5Q.json","graph_json":"https://pith.science/api/pith-number/KMLC34LQ3VVI2KOBOGEH622L5Q/graph.json","events_json":"https://pith.science/api/pith-number/KMLC34LQ3VVI2KOBOGEH622L5Q/events.json","paper":"https://pith.science/paper/KMLC34LQ"},"agent_actions":{"view_html":"https://pith.science/pith/KMLC34LQ3VVI2KOBOGEH622L5Q","download_json":"https://pith.science/pith/KMLC34LQ3VVI2KOBOGEH622L5Q.json","view_paper":"https://pith.science/paper/KMLC34LQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04369&json=true","fetch_graph":"https://pith.science/api/pith-number/KMLC34LQ3VVI2KOBOGEH622L5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/KMLC34LQ3VVI2KOBOGEH622L5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMLC34LQ3VVI2KOBOGEH622L5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMLC34LQ3VVI2KOBOGEH622L5Q/action/storage_attestation","attest_author":"https://pith.science/pith/KMLC34LQ3VVI2KOBOGEH622L5Q/action/author_attestation","sign_citation":"https://pith.science/pith/KMLC34LQ3VVI2KOBOGEH622L5Q/action/citation_signature","submit_replication":"https://pith.science/pith/KMLC34LQ3VVI2KOBOGEH622L5Q/action/replication_record"}},"created_at":"2026-05-18T00:13:35.716933+00:00","updated_at":"2026-05-18T00:13:35.716933+00:00"}