{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:O6DSNOUJZJ23LKMFTU3BPRECJ4","short_pith_number":"pith:O6DSNOUJ","schema_version":"1.0","canonical_sha256":"778726ba89ca75b5a9859d3617c4824f002aa06b096a6be7fdb6d74b2e7738e8","source":{"kind":"arxiv","id":"1203.0843","version":1},"attestation_state":"computed","paper":{"title":"Joint-tree model and the maximum genus of graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghua Dong, Ning Wang, Yanpei Liu, Yuanqiu Huang","submitted_at":"2012-03-05T09:46:39Z","abstract_excerpt":"The vertex v of a graph G is called a 1-critical-vertex for the maximum genus of the graph, or for simplicity called 1-critical-vertex, if G-v is a connected graph and {\\deg}M(G - v) = {\\deg}M(G) - 1. In this paper, through the joint-tree model, we obtained some types of 1-critical-vertex, and get the upper embeddability of the Spiral Snm ."},"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":"1203.0843","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2012-03-05T09:46:39Z","cross_cats_sorted":[],"title_canon_sha256":"29969822769d9e41136826c6f3accfb27f00a059d8be144eee6ab2a282c89c6e","abstract_canon_sha256":"3655933f8f53690eb93b3ca40b16cb883612f598b47ad6386e92dccb66a0e1d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:50.397546Z","signature_b64":"vhfk0H6eKEIuQ2m5VDTIshvunF8vQ4HvkF3GcbnRTovIAnMcT5AcZbtVIBDQ+2KP11e/l+OPVztE/CcF2jJBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"778726ba89ca75b5a9859d3617c4824f002aa06b096a6be7fdb6d74b2e7738e8","last_reissued_at":"2026-05-18T04:00:50.396626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:50.396626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint-tree model and the maximum genus of graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghua Dong, Ning Wang, Yanpei Liu, Yuanqiu Huang","submitted_at":"2012-03-05T09:46:39Z","abstract_excerpt":"The vertex v of a graph G is called a 1-critical-vertex for the maximum genus of the graph, or for simplicity called 1-critical-vertex, if G-v is a connected graph and {\\deg}M(G - v) = {\\deg}M(G) - 1. In this paper, through the joint-tree model, we obtained some types of 1-critical-vertex, and get the upper embeddability of the Spiral Snm ."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0843","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":"1203.0843","created_at":"2026-05-18T04:00:50.396702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.0843v1","created_at":"2026-05-18T04:00:50.396702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0843","created_at":"2026-05-18T04:00:50.396702+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6DSNOUJZJ23","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6DSNOUJZJ23LKMF","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6DSNOUJ","created_at":"2026-05-18T12:27:16.716162+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/O6DSNOUJZJ23LKMFTU3BPRECJ4","json":"https://pith.science/pith/O6DSNOUJZJ23LKMFTU3BPRECJ4.json","graph_json":"https://pith.science/api/pith-number/O6DSNOUJZJ23LKMFTU3BPRECJ4/graph.json","events_json":"https://pith.science/api/pith-number/O6DSNOUJZJ23LKMFTU3BPRECJ4/events.json","paper":"https://pith.science/paper/O6DSNOUJ"},"agent_actions":{"view_html":"https://pith.science/pith/O6DSNOUJZJ23LKMFTU3BPRECJ4","download_json":"https://pith.science/pith/O6DSNOUJZJ23LKMFTU3BPRECJ4.json","view_paper":"https://pith.science/paper/O6DSNOUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.0843&json=true","fetch_graph":"https://pith.science/api/pith-number/O6DSNOUJZJ23LKMFTU3BPRECJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/O6DSNOUJZJ23LKMFTU3BPRECJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6DSNOUJZJ23LKMFTU3BPRECJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6DSNOUJZJ23LKMFTU3BPRECJ4/action/storage_attestation","attest_author":"https://pith.science/pith/O6DSNOUJZJ23LKMFTU3BPRECJ4/action/author_attestation","sign_citation":"https://pith.science/pith/O6DSNOUJZJ23LKMFTU3BPRECJ4/action/citation_signature","submit_replication":"https://pith.science/pith/O6DSNOUJZJ23LKMFTU3BPRECJ4/action/replication_record"}},"created_at":"2026-05-18T04:00:50.396702+00:00","updated_at":"2026-05-18T04:00:50.396702+00:00"}