{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RSJRLJI6OQGHP7UCMTHVGA2YA7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"215f598cee5694d377e8810d838f258c0fb75e44bd695f52e1685fa950dd39d8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-04T20:13:36Z","title_canon_sha256":"0749140f61182704594cb4c0ddb91e4af3c233d8d226f8901d432ec7042d1a84"},"schema_version":"1.0","source":{"id":"1412.1792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1792","created_at":"2026-05-18T02:32:06Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1792v1","created_at":"2026-05-18T02:32:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1792","created_at":"2026-05-18T02:32:06Z"},{"alias_kind":"pith_short_12","alias_value":"RSJRLJI6OQGH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RSJRLJI6OQGHP7UC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RSJRLJI6","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:bebd2fbabc1fe74b0b2922f9b087b5eda9de3abdb66bfb86467e66d0a1e717f9","target":"graph","created_at":"2026-05-18T02:32:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anastasios Sidiropoulos, Ken-ichi Kawarabayashi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-04T20:13:36Z","title":"Beyond the Euler characteristic: Approximating the genus of general graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1792","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c2e4ba5598f7dc00e12436abb97826fc066a4c04d54d16a5c3fd8fb9ee1c3030","target":"record","created_at":"2026-05-18T02:32:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"215f598cee5694d377e8810d838f258c0fb75e44bd695f52e1685fa950dd39d8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-04T20:13:36Z","title_canon_sha256":"0749140f61182704594cb4c0ddb91e4af3c233d8d226f8901d432ec7042d1a84"},"schema_version":"1.0","source":{"id":"1412.1792","kind":"arxiv","version":1}},"canonical_sha256":"8c9315a51e740c77fe8264cf53035807f68255a37a0a5fa19c4251bb11de78ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c9315a51e740c77fe8264cf53035807f68255a37a0a5fa19c4251bb11de78ff","first_computed_at":"2026-05-18T02:32:06.489720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:06.489720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZtRPGpEJzDG0FJqvJXm1AJ4P2GN/WNvszAppstpYouxe6AqceEcwWg6MnfB8I9bxGrp0xR3hW92fo8wY0ShTDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:06.490136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2e4ba5598f7dc00e12436abb97826fc066a4c04d54d16a5c3fd8fb9ee1c3030","sha256:bebd2fbabc1fe74b0b2922f9b087b5eda9de3abdb66bfb86467e66d0a1e717f9"],"state_sha256":"55a9459926534b7ceed36c6a4753de77666425363b9cb8f62c43dbf624d67e7f"}