{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DMLHDYGZ7Q2UDBF4K5Q46MTPS7","short_pith_number":"pith:DMLHDYGZ","schema_version":"1.0","canonical_sha256":"1b1671e0d9fc354184bc5761cf326f97da7885ce72f11aca273a397181ccc94e","source":{"kind":"arxiv","id":"1611.02901","version":2},"attestation_state":"computed","paper":{"title":"Bipartite graphs and their dessins d'enfants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruben A. Hidalgo","submitted_at":"2016-11-09T12:45:37Z","abstract_excerpt":"Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins d'enfants, together their automorphims group, monodromy group and duality type."},"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":"1611.02901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-09T12:45:37Z","cross_cats_sorted":[],"title_canon_sha256":"99032654cf70f5f7ebf5b2d1b70dbd68ae56ee2d20effa12bf652751ada792f9","abstract_canon_sha256":"9270bad298cf42e7bd70fc140b94c8aa127f04512d820ee36a2ac99a999cf5e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:52.214632Z","signature_b64":"ByrdQj53jDtDa8VgiNb3cnmsdxd0IDbPxIDimAi4FlBi2zirhEJRafGmn9YYSfSS3TPFgo8pJFtDM6LrARJeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b1671e0d9fc354184bc5761cf326f97da7885ce72f11aca273a397181ccc94e","last_reissued_at":"2026-05-18T00:36:52.214172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:52.214172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bipartite graphs and their dessins d'enfants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruben A. Hidalgo","submitted_at":"2016-11-09T12:45:37Z","abstract_excerpt":"Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins d'enfants, together their automorphims group, monodromy group and duality type."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02901","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":"1611.02901","created_at":"2026-05-18T00:36:52.214235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02901v2","created_at":"2026-05-18T00:36:52.214235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02901","created_at":"2026-05-18T00:36:52.214235+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMLHDYGZ7Q2U","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMLHDYGZ7Q2UDBF4","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMLHDYGZ","created_at":"2026-05-18T12:30:12.583610+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/DMLHDYGZ7Q2UDBF4K5Q46MTPS7","json":"https://pith.science/pith/DMLHDYGZ7Q2UDBF4K5Q46MTPS7.json","graph_json":"https://pith.science/api/pith-number/DMLHDYGZ7Q2UDBF4K5Q46MTPS7/graph.json","events_json":"https://pith.science/api/pith-number/DMLHDYGZ7Q2UDBF4K5Q46MTPS7/events.json","paper":"https://pith.science/paper/DMLHDYGZ"},"agent_actions":{"view_html":"https://pith.science/pith/DMLHDYGZ7Q2UDBF4K5Q46MTPS7","download_json":"https://pith.science/pith/DMLHDYGZ7Q2UDBF4K5Q46MTPS7.json","view_paper":"https://pith.science/paper/DMLHDYGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02901&json=true","fetch_graph":"https://pith.science/api/pith-number/DMLHDYGZ7Q2UDBF4K5Q46MTPS7/graph.json","fetch_events":"https://pith.science/api/pith-number/DMLHDYGZ7Q2UDBF4K5Q46MTPS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMLHDYGZ7Q2UDBF4K5Q46MTPS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMLHDYGZ7Q2UDBF4K5Q46MTPS7/action/storage_attestation","attest_author":"https://pith.science/pith/DMLHDYGZ7Q2UDBF4K5Q46MTPS7/action/author_attestation","sign_citation":"https://pith.science/pith/DMLHDYGZ7Q2UDBF4K5Q46MTPS7/action/citation_signature","submit_replication":"https://pith.science/pith/DMLHDYGZ7Q2UDBF4K5Q46MTPS7/action/replication_record"}},"created_at":"2026-05-18T00:36:52.214235+00:00","updated_at":"2026-05-18T00:36:52.214235+00:00"}