{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DXH2ETJ4JLY7J5R4AVBYF66SS7","short_pith_number":"pith:DXH2ETJ4","schema_version":"1.0","canonical_sha256":"1dcfa24d3c4af1f4f63c054382fbd297d17fe775f69088de628b0b094931dbd8","source":{"kind":"arxiv","id":"1312.6342","version":2},"attestation_state":"computed","paper":{"title":"Checkerboard embeddings of *-graphs into nonorientable surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Tyler Friesen, Vassily Olegovich Manturov","submitted_at":"2013-12-22T04:35:06Z","abstract_excerpt":"This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of nonorientable surfaces into which such graphs may be embedded. In a previous paper by the authors, the problem of calculating whether a given *-graph in which all vertices have degree 4 or 6 admits a Z2-homologically trivial embedding into a given orientable surface was shown to be equivalent to a problem on matrices. Here we extend those results to nonorientable surfaces. The embeddability condition that we obtain yields quadratic-time algorithms to determine whether a "},"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":"1312.6342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-22T04:35:06Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"4d06d2630d61065646bfb096ce535e9b7748bf83c1b00504eb1e69b919ac169e","abstract_canon_sha256":"b75870808d608a3ea56a2db99469a8bc0aa9ce29a89ecad5f2a238f6685286db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:31.483211Z","signature_b64":"b27WscFosf5C2vhOSJPDuu4vaXI+rijmXSR5JH2jE0g12aPXR3Yy49yzf8dMcSaNJHCDOEiCw3Kn0jPxTcDFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dcfa24d3c4af1f4f63c054382fbd297d17fe775f69088de628b0b094931dbd8","last_reissued_at":"2026-05-18T03:03:31.482657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:31.482657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Checkerboard embeddings of *-graphs into nonorientable surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Tyler Friesen, Vassily Olegovich Manturov","submitted_at":"2013-12-22T04:35:06Z","abstract_excerpt":"This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of nonorientable surfaces into which such graphs may be embedded. In a previous paper by the authors, the problem of calculating whether a given *-graph in which all vertices have degree 4 or 6 admits a Z2-homologically trivial embedding into a given orientable surface was shown to be equivalent to a problem on matrices. Here we extend those results to nonorientable surfaces. The embeddability condition that we obtain yields quadratic-time algorithms to determine whether a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6342","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":"1312.6342","created_at":"2026-05-18T03:03:31.482746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6342v2","created_at":"2026-05-18T03:03:31.482746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6342","created_at":"2026-05-18T03:03:31.482746+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXH2ETJ4JLY7","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXH2ETJ4JLY7J5R4","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXH2ETJ4","created_at":"2026-05-18T12:27:43.054852+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/DXH2ETJ4JLY7J5R4AVBYF66SS7","json":"https://pith.science/pith/DXH2ETJ4JLY7J5R4AVBYF66SS7.json","graph_json":"https://pith.science/api/pith-number/DXH2ETJ4JLY7J5R4AVBYF66SS7/graph.json","events_json":"https://pith.science/api/pith-number/DXH2ETJ4JLY7J5R4AVBYF66SS7/events.json","paper":"https://pith.science/paper/DXH2ETJ4"},"agent_actions":{"view_html":"https://pith.science/pith/DXH2ETJ4JLY7J5R4AVBYF66SS7","download_json":"https://pith.science/pith/DXH2ETJ4JLY7J5R4AVBYF66SS7.json","view_paper":"https://pith.science/paper/DXH2ETJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6342&json=true","fetch_graph":"https://pith.science/api/pith-number/DXH2ETJ4JLY7J5R4AVBYF66SS7/graph.json","fetch_events":"https://pith.science/api/pith-number/DXH2ETJ4JLY7J5R4AVBYF66SS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXH2ETJ4JLY7J5R4AVBYF66SS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXH2ETJ4JLY7J5R4AVBYF66SS7/action/storage_attestation","attest_author":"https://pith.science/pith/DXH2ETJ4JLY7J5R4AVBYF66SS7/action/author_attestation","sign_citation":"https://pith.science/pith/DXH2ETJ4JLY7J5R4AVBYF66SS7/action/citation_signature","submit_replication":"https://pith.science/pith/DXH2ETJ4JLY7J5R4AVBYF66SS7/action/replication_record"}},"created_at":"2026-05-18T03:03:31.482746+00:00","updated_at":"2026-05-18T03:03:31.482746+00:00"}