{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SXI7EJ4RW6IKBPOFKZHBP7J2O4","short_pith_number":"pith:SXI7EJ4R","schema_version":"1.0","canonical_sha256":"95d1f22791b790a0bdc5564e17fd3a77051d4bdc9f213b14183a69db94f17517","source":{"kind":"arxiv","id":"1902.00152","version":1},"attestation_state":"computed","paper":{"title":"Simultaneous current graph constructions for minimum triangulations and complete graph embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Timothy Sun","submitted_at":"2019-02-01T02:25:54Z","abstract_excerpt":"The problems of the genus of the complete graphs and minimum triangulations for each surface were both solved using the theory of current graphs, and each of them divided into twelve different cases, depending on the residue modulo 12 of the number of vertices. Cases 8 and 11 were of particular difficulty for both problems, with multiple families of current graphs developed to solve these cases. We solve these cases in a unified manner with families of current graphs applicable to both problems. Additionally, we give new constructions to both problems for Cases 6 and 9, which greatly simplify "},"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":"1902.00152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-01T02:25:54Z","cross_cats_sorted":[],"title_canon_sha256":"e26d8ac3bf658db24bc76ea4fe5ae41517ecca6bc53d40c5e55828a303a41274","abstract_canon_sha256":"844ef31773db0b524c6b648859b5ec47dfb5c8bc03ed8acce165a3c6905e26fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.172159Z","signature_b64":"DAIrQMJlo+0ZjKXWTv5jyZoBc2pqQ2XGYDwgrnBx+xKvjrLN5asOE5TnedXsI8eS7A0nSM9eGtku6Fe9lLubAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95d1f22791b790a0bdc5564e17fd3a77051d4bdc9f213b14183a69db94f17517","last_reissued_at":"2026-05-17T23:54:58.171715Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.171715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous current graph constructions for minimum triangulations and complete graph embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Timothy Sun","submitted_at":"2019-02-01T02:25:54Z","abstract_excerpt":"The problems of the genus of the complete graphs and minimum triangulations for each surface were both solved using the theory of current graphs, and each of them divided into twelve different cases, depending on the residue modulo 12 of the number of vertices. Cases 8 and 11 were of particular difficulty for both problems, with multiple families of current graphs developed to solve these cases. We solve these cases in a unified manner with families of current graphs applicable to both problems. Additionally, we give new constructions to both problems for Cases 6 and 9, which greatly simplify "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00152","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":"1902.00152","created_at":"2026-05-17T23:54:58.171799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00152v1","created_at":"2026-05-17T23:54:58.171799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00152","created_at":"2026-05-17T23:54:58.171799+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXI7EJ4RW6IK","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXI7EJ4RW6IKBPOF","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXI7EJ4R","created_at":"2026-05-18T12:33:27.125529+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/SXI7EJ4RW6IKBPOFKZHBP7J2O4","json":"https://pith.science/pith/SXI7EJ4RW6IKBPOFKZHBP7J2O4.json","graph_json":"https://pith.science/api/pith-number/SXI7EJ4RW6IKBPOFKZHBP7J2O4/graph.json","events_json":"https://pith.science/api/pith-number/SXI7EJ4RW6IKBPOFKZHBP7J2O4/events.json","paper":"https://pith.science/paper/SXI7EJ4R"},"agent_actions":{"view_html":"https://pith.science/pith/SXI7EJ4RW6IKBPOFKZHBP7J2O4","download_json":"https://pith.science/pith/SXI7EJ4RW6IKBPOFKZHBP7J2O4.json","view_paper":"https://pith.science/paper/SXI7EJ4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00152&json=true","fetch_graph":"https://pith.science/api/pith-number/SXI7EJ4RW6IKBPOFKZHBP7J2O4/graph.json","fetch_events":"https://pith.science/api/pith-number/SXI7EJ4RW6IKBPOFKZHBP7J2O4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXI7EJ4RW6IKBPOFKZHBP7J2O4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXI7EJ4RW6IKBPOFKZHBP7J2O4/action/storage_attestation","attest_author":"https://pith.science/pith/SXI7EJ4RW6IKBPOFKZHBP7J2O4/action/author_attestation","sign_citation":"https://pith.science/pith/SXI7EJ4RW6IKBPOFKZHBP7J2O4/action/citation_signature","submit_replication":"https://pith.science/pith/SXI7EJ4RW6IKBPOFKZHBP7J2O4/action/replication_record"}},"created_at":"2026-05-17T23:54:58.171799+00:00","updated_at":"2026-05-17T23:54:58.171799+00:00"}