{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZV4UYGCX77RFBIAP6TLE2LO3UA","short_pith_number":"pith:ZV4UYGCX","canonical_record":{"source":{"id":"1512.04995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T22:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"aa9adb99f3f2d3fce64a2c477357b2a3cd771d9e6d7a2c83c7ddba94266b15a9","abstract_canon_sha256":"dad47a59bf52d5173dfe7c504036f3b8c9c2da7500cedae51b137e435c27e509"},"schema_version":"1.0"},"canonical_sha256":"cd794c1857ffe250a00ff4d64d2ddba01f420c9b18793e5bd75b6f139a0ba1c3","source":{"kind":"arxiv","id":"1512.04995","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04995","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04995v1","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04995","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZV4UYGCX77RF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZV4UYGCX77RFBIAP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZV4UYGCX","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZV4UYGCX77RFBIAP6TLE2LO3UA","target":"record","payload":{"canonical_record":{"source":{"id":"1512.04995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T22:32:40Z","cross_cats_sorted":[],"title_canon_sha256":"aa9adb99f3f2d3fce64a2c477357b2a3cd771d9e6d7a2c83c7ddba94266b15a9","abstract_canon_sha256":"dad47a59bf52d5173dfe7c504036f3b8c9c2da7500cedae51b137e435c27e509"},"schema_version":"1.0"},"canonical_sha256":"cd794c1857ffe250a00ff4d64d2ddba01f420c9b18793e5bd75b6f139a0ba1c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:13.784216Z","signature_b64":"KBpFJYjyW5kJ8X7wkcHgsIjAlzr4ciFh7yjwVUw/mvCv0EDf1xCenmJDGPgYlw4ntjXfSy+4fJkITdvfi7LbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd794c1857ffe250a00ff4d64d2ddba01f420c9b18793e5bd75b6f139a0ba1c3","last_reissued_at":"2026-05-18T01:24:13.783625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:13.783625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.04995","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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ETR77gmGt4eq2A3AGsmdlrqHP9+SSA4PdZWY8rDt3m60U7TwS33vJrvNwrUmohNs4mKd8AaeeizDL+TnDrZKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:06:18.062999Z"},"content_sha256":"f01eb83f0be4c0b0481037b214872852499b69cf0e8acc212602360fbad21821","schema_version":"1.0","event_id":"sha256:f01eb83f0be4c0b0481037b214872852499b69cf0e8acc212602360fbad21821"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZV4UYGCX77RFBIAP6TLE2LO3UA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thickness and Outerthickness for Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baogang Xu, Xiaoya Zha","submitted_at":"2015-12-15T22:32:40Z","abstract_excerpt":"We consider the thickness $\\theta (G))$ and outerthickness $\\theta _o(G)$ of a graph G in terms of its orientable and nonorientable genus. Dean and Hutchinson provided upper bounds for thickness of graphs in terms of their orientable genus. More recently, Concalves proved that the outerthickness of any planar graph is at most 2. In this paper, we apply the method of deleting spanning disks of embeddings to approximate the thickness and outerthickness of graphs. We first obtain better upper bounds for thickness. We then use a similar approach to provide upper bounds for outerthickness of graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04995","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-18T01:24:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ImEBKyRhEaUcZSuMhzUbbm7IBb0fwIuQ3Z5f9HKniyvRtAHflx8gC3O0oI53yTJrrGnigTLxlztZawFPS16eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:06:18.063353Z"},"content_sha256":"a7a188a0ebbbd72cce70267eeb335b6a273c9feec6ced850318ad6c1fe0282b5","schema_version":"1.0","event_id":"sha256:a7a188a0ebbbd72cce70267eeb335b6a273c9feec6ced850318ad6c1fe0282b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZV4UYGCX77RFBIAP6TLE2LO3UA/bundle.json","state_url":"https://pith.science/pith/ZV4UYGCX77RFBIAP6TLE2LO3UA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZV4UYGCX77RFBIAP6TLE2LO3UA/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-20T04:06:18Z","links":{"resolver":"https://pith.science/pith/ZV4UYGCX77RFBIAP6TLE2LO3UA","bundle":"https://pith.science/pith/ZV4UYGCX77RFBIAP6TLE2LO3UA/bundle.json","state":"https://pith.science/pith/ZV4UYGCX77RFBIAP6TLE2LO3UA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZV4UYGCX77RFBIAP6TLE2LO3UA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZV4UYGCX77RFBIAP6TLE2LO3UA","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":"dad47a59bf52d5173dfe7c504036f3b8c9c2da7500cedae51b137e435c27e509","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T22:32:40Z","title_canon_sha256":"aa9adb99f3f2d3fce64a2c477357b2a3cd771d9e6d7a2c83c7ddba94266b15a9"},"schema_version":"1.0","source":{"id":"1512.04995","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04995","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04995v1","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04995","created_at":"2026-05-18T01:24:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZV4UYGCX77RF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZV4UYGCX77RFBIAP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZV4UYGCX","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:a7a188a0ebbbd72cce70267eeb335b6a273c9feec6ced850318ad6c1fe0282b5","target":"graph","created_at":"2026-05-18T01:24:13Z","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":"We consider the thickness $\\theta (G))$ and outerthickness $\\theta _o(G)$ of a graph G in terms of its orientable and nonorientable genus. Dean and Hutchinson provided upper bounds for thickness of graphs in terms of their orientable genus. More recently, Concalves proved that the outerthickness of any planar graph is at most 2. In this paper, we apply the method of deleting spanning disks of embeddings to approximate the thickness and outerthickness of graphs. We first obtain better upper bounds for thickness. We then use a similar approach to provide upper bounds for outerthickness of graphs","authors_text":"Baogang Xu, Xiaoya Zha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T22:32:40Z","title":"Thickness and Outerthickness for Embedded Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04995","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:f01eb83f0be4c0b0481037b214872852499b69cf0e8acc212602360fbad21821","target":"record","created_at":"2026-05-18T01:24:13Z","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":"dad47a59bf52d5173dfe7c504036f3b8c9c2da7500cedae51b137e435c27e509","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-15T22:32:40Z","title_canon_sha256":"aa9adb99f3f2d3fce64a2c477357b2a3cd771d9e6d7a2c83c7ddba94266b15a9"},"schema_version":"1.0","source":{"id":"1512.04995","kind":"arxiv","version":1}},"canonical_sha256":"cd794c1857ffe250a00ff4d64d2ddba01f420c9b18793e5bd75b6f139a0ba1c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd794c1857ffe250a00ff4d64d2ddba01f420c9b18793e5bd75b6f139a0ba1c3","first_computed_at":"2026-05-18T01:24:13.783625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:13.783625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KBpFJYjyW5kJ8X7wkcHgsIjAlzr4ciFh7yjwVUw/mvCv0EDf1xCenmJDGPgYlw4ntjXfSy+4fJkITdvfi7LbDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:13.784216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04995","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f01eb83f0be4c0b0481037b214872852499b69cf0e8acc212602360fbad21821","sha256:a7a188a0ebbbd72cce70267eeb335b6a273c9feec6ced850318ad6c1fe0282b5"],"state_sha256":"1a6fed260adf05b8efcb747e1ea9a32e61b2baa12d5107229aec29e25aec92cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNR3sjR6rE15P0I0l/VpT6hc9IA6XP7uP65mA8gt7Z0KAuY5l7sohRIXPkycUplQnDW2P7mEAMCndHq4FuC5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:06:18.065267Z","bundle_sha256":"dfff8171a170ffef131d7376770a798b8341988f135853d589bee56019acc936"}}