{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RSJRLJI6OQGHP7UCMTHVGA2YA7","short_pith_number":"pith:RSJRLJI6","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"},"canonical_sha256":"8c9315a51e740c77fe8264cf53035807f68255a37a0a5fa19c4251bb11de78ff","source":{"kind":"arxiv","id":"1412.1792","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RSJRLJI6OQGHP7UCMTHVGA2YA7","target":"record","payload":{"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"},"canonical_sha256":"8c9315a51e740c77fe8264cf53035807f68255a37a0a5fa19c4251bb11de78ff","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"},"source_kind":"arxiv","source_id":"1412.1792","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BlaJ7mKBGZgEk3mReYhCH4WsLrnDHUtPEdhbJ+H4hYP5RsYxAP/ewPx0UBJ8kW1gKZAqsVAa+0dzx0REJVvvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:44:20.998133Z"},"content_sha256":"c2e4ba5598f7dc00e12436abb97826fc066a4c04d54d16a5c3fd8fb9ee1c3030","schema_version":"1.0","event_id":"sha256:c2e4ba5598f7dc00e12436abb97826fc066a4c04d54d16a5c3fd8fb9ee1c3030"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RSJRLJI6OQGHP7UCMTHVGA2YA7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BB0sRVgR4EyTnJEODrqUyIGgMbbsjoCSVkcbfrxVBzGbiUbfKD3mwEiYGpcqR9kl+PP3BkwM/h8GDMY35lR0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:44:20.998501Z"},"content_sha256":"bebd2fbabc1fe74b0b2922f9b087b5eda9de3abdb66bfb86467e66d0a1e717f9","schema_version":"1.0","event_id":"sha256:bebd2fbabc1fe74b0b2922f9b087b5eda9de3abdb66bfb86467e66d0a1e717f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/bundle.json","state_url":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T03:44:20Z","links":{"resolver":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7","bundle":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/bundle.json","state":"https://pith.science/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSJRLJI6OQGHP7UCMTHVGA2YA7/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NGiO9woB9ccF0ovrkG1D2wGqH+kLrQsdTEaOJm/YoKB2K0s5B9U7OuWTraFuErxGByIdHBHr4bV2lRm4k8CBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:44:21.000518Z","bundle_sha256":"ae7034cfa8774a5881a706ce9ac00f1e0cdb174cfca019c8ee2ad3a882ada661"}}