{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GSQOPNSKQP6ZEUW4RCPJQB5XBM","short_pith_number":"pith:GSQOPNSK","schema_version":"1.0","canonical_sha256":"34a0e7b64a83fd9252dc889e9807b70b1966db8acc26bd6534a7bab6d0db2fb4","source":{"kind":"arxiv","id":"1201.6483","version":1},"attestation_state":"computed","paper":{"title":"The thickness of amalgamations of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiangheng Kong, Yan Yang","submitted_at":"2012-01-31T09:21:14Z","abstract_excerpt":"The thickness $\\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. As a topological invariant of a graph, it is a measurement of the closeness to planarity of a graph, and it also has important applications to VLSI design. In this paper, the thickness of graphs that are obtained by vertex-amalgamation and bar-amalgamation of any two graphs whose thicknesses are known are obtained, respectively. And the lower and upper bounds for the thickness of graphs that are obtained by edge-amalgamation and 2-vertex-amalgamation of any tw"},"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":"1201.6483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-31T09:21:14Z","cross_cats_sorted":[],"title_canon_sha256":"3c00f542be8685e3e547af3d03402fbbb08d3854fb323f41eef5561003b6bd08","abstract_canon_sha256":"437e4dcd89552caaea089c70c11b71eece3fceeca9f265579434eef98e0a2139"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:31.396817Z","signature_b64":"jWKt4aTbNrHeUKrk2eg5+YTo5eBUfKt/7Wwl7YjbGMRjOD6oW+okHosyOFEMhhuRjNeTROytLM1xXAjRKiJWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34a0e7b64a83fd9252dc889e9807b70b1966db8acc26bd6534a7bab6d0db2fb4","last_reissued_at":"2026-05-18T04:03:31.396133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:31.396133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The thickness of amalgamations of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiangheng Kong, Yan Yang","submitted_at":"2012-01-31T09:21:14Z","abstract_excerpt":"The thickness $\\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. As a topological invariant of a graph, it is a measurement of the closeness to planarity of a graph, and it also has important applications to VLSI design. In this paper, the thickness of graphs that are obtained by vertex-amalgamation and bar-amalgamation of any two graphs whose thicknesses are known are obtained, respectively. And the lower and upper bounds for the thickness of graphs that are obtained by edge-amalgamation and 2-vertex-amalgamation of any tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6483","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":"1201.6483","created_at":"2026-05-18T04:03:31.396222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6483v1","created_at":"2026-05-18T04:03:31.396222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6483","created_at":"2026-05-18T04:03:31.396222+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSQOPNSKQP6Z","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSQOPNSKQP6ZEUW4","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSQOPNSK","created_at":"2026-05-18T12:27:06.952714+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/GSQOPNSKQP6ZEUW4RCPJQB5XBM","json":"https://pith.science/pith/GSQOPNSKQP6ZEUW4RCPJQB5XBM.json","graph_json":"https://pith.science/api/pith-number/GSQOPNSKQP6ZEUW4RCPJQB5XBM/graph.json","events_json":"https://pith.science/api/pith-number/GSQOPNSKQP6ZEUW4RCPJQB5XBM/events.json","paper":"https://pith.science/paper/GSQOPNSK"},"agent_actions":{"view_html":"https://pith.science/pith/GSQOPNSKQP6ZEUW4RCPJQB5XBM","download_json":"https://pith.science/pith/GSQOPNSKQP6ZEUW4RCPJQB5XBM.json","view_paper":"https://pith.science/paper/GSQOPNSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6483&json=true","fetch_graph":"https://pith.science/api/pith-number/GSQOPNSKQP6ZEUW4RCPJQB5XBM/graph.json","fetch_events":"https://pith.science/api/pith-number/GSQOPNSKQP6ZEUW4RCPJQB5XBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSQOPNSKQP6ZEUW4RCPJQB5XBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSQOPNSKQP6ZEUW4RCPJQB5XBM/action/storage_attestation","attest_author":"https://pith.science/pith/GSQOPNSKQP6ZEUW4RCPJQB5XBM/action/author_attestation","sign_citation":"https://pith.science/pith/GSQOPNSKQP6ZEUW4RCPJQB5XBM/action/citation_signature","submit_replication":"https://pith.science/pith/GSQOPNSKQP6ZEUW4RCPJQB5XBM/action/replication_record"}},"created_at":"2026-05-18T04:03:31.396222+00:00","updated_at":"2026-05-18T04:03:31.396222+00:00"}