{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RSJRLJI6OQGHP7UCMTHVGA2YA7","short_pith_number":"pith:RSJRLJI6","schema_version":"1.0","canonical_sha256":"8c9315a51e740c77fe8264cf53035807f68255a37a0a5fa19c4251bb11de78ff","source":{"kind":"arxiv","id":"1412.1792","version":1},"attestation_state":"computed","paper":{"title":"Beyond the Euler characteristic: Approximating the genus of general graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Ken-ichi Kawarabayashi","submitted_at":"2014-12-04T20:13:36Z","abstract_excerpt":"Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive study, the approximability of the Euler genus remains wide open. While the existence of an $O(1)$-approximation is not ruled out, the currently best-known upper bound is a trivial $O(n/g)$-approximation that follows from bounds on the Euler characteristic.\n  In this paper, we give the first non-trivial approximation algorithm for this problem. Specifically, w"},"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":"1412.1792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-04T20:13:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0749140f61182704594cb4c0ddb91e4af3c233d8d226f8901d432ec7042d1a84","abstract_canon_sha256":"215f598cee5694d377e8810d838f258c0fb75e44bd695f52e1685fa950dd39d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:06.490136Z","signature_b64":"ZtRPGpEJzDG0FJqvJXm1AJ4P2GN/WNvszAppstpYouxe6AqceEcwWg6MnfB8I9bxGrp0xR3hW92fo8wY0ShTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c9315a51e740c77fe8264cf53035807f68255a37a0a5fa19c4251bb11de78ff","last_reissued_at":"2026-05-18T02:32:06.489720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:06.489720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond the Euler characteristic: Approximating the genus of general graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Ken-ichi Kawarabayashi","submitted_at":"2014-12-04T20:13:36Z","abstract_excerpt":"Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive study, the approximability of the Euler genus remains wide open. While the existence of an $O(1)$-approximation is not ruled out, the currently best-known upper bound is a trivial $O(n/g)$-approximation that follows from bounds on the Euler characteristic.\n  In this paper, we give the first non-trivial approximation algorithm for this problem. Specifically, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1792","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":"1412.1792","created_at":"2026-05-18T02:32:06.489777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1792v1","created_at":"2026-05-18T02:32:06.489777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1792","created_at":"2026-05-18T02:32:06.489777+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSJRLJI6OQGH","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSJRLJI6OQGHP7UC","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSJRLJI6","created_at":"2026-05-18T12:28:46.137349+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/RSJRLJI6OQGHP7UCMTHVGA2YA7","json":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7.json","graph_json":"https://pith.science/api/pith-number/RSJRLJI6OQGHP7UCMTHVGA2YA7/graph.json","events_json":"https://pith.science/api/pith-number/RSJRLJI6OQGHP7UCMTHVGA2YA7/events.json","paper":"https://pith.science/paper/RSJRLJI6"},"agent_actions":{"view_html":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7","download_json":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7.json","view_paper":"https://pith.science/paper/RSJRLJI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1792&json=true","fetch_graph":"https://pith.science/api/pith-number/RSJRLJI6OQGHP7UCMTHVGA2YA7/graph.json","fetch_events":"https://pith.science/api/pith-number/RSJRLJI6OQGHP7UCMTHVGA2YA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/action/storage_attestation","attest_author":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/action/author_attestation","sign_citation":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/action/citation_signature","submit_replication":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/action/replication_record"}},"created_at":"2026-05-18T02:32:06.489777+00:00","updated_at":"2026-05-18T02:32:06.489777+00:00"}