{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VSHHZAZONYYGTVNB2CKMWN7VXM","short_pith_number":"pith:VSHHZAZO","schema_version":"1.0","canonical_sha256":"ac8e7c832e6e3069d5a1d094cb37f5bb2b91a904dbd2f70b6ba6ce743cd6be25","source":{"kind":"arxiv","id":"1602.07816","version":2},"attestation_state":"computed","paper":{"title":"Relating Graph Thickness to Planar Layers and Bend Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Debajyoti Mondal, Stephane Durocher","submitted_at":"2016-02-25T06:14:19Z","abstract_excerpt":"The thickness of a graph $G=(V,E)$ with $n$ vertices is the minimum number of planar subgraphs of $G$ whose union is $G$. A polyline drawing of $G$ in $\\mathbb{R}^2$ is a drawing $\\Gamma$ of $G$, where each vertex is mapped to a point and each edge is mapped to a polygonal chain. Bend and layer complexities are two important aesthetics of such a drawing. The bend complexity of $\\Gamma$ is the maximum number of bends per edge in $\\Gamma$, and the layer complexity of $\\Gamma$ is the minimum integer $r$ such that the set of polygonal chains in $\\Gamma$ can be partitioned into $r$ disjoint sets, w"},"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":"1602.07816","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-25T06:14:19Z","cross_cats_sorted":[],"title_canon_sha256":"698fb3414e64218b9cb01f025127da8f2c2d91dc3f0c02f852f557b58dfef2c2","abstract_canon_sha256":"4b1836db2bd272638a9aa768f8c7a168e93eff521e354c11450674496d6a2523"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:02.420102Z","signature_b64":"kp2+tcbqPmlyQUB9xFAZ/BeP3/JvnlaYyUinvGtr8uwGapA0LhiBEJL1mdvVTaGZ8n+H02AloLYsAKsjSfCbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac8e7c832e6e3069d5a1d094cb37f5bb2b91a904dbd2f70b6ba6ce743cd6be25","last_reissued_at":"2026-05-18T01:16:02.419311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:02.419311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relating Graph Thickness to Planar Layers and Bend Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Debajyoti Mondal, Stephane Durocher","submitted_at":"2016-02-25T06:14:19Z","abstract_excerpt":"The thickness of a graph $G=(V,E)$ with $n$ vertices is the minimum number of planar subgraphs of $G$ whose union is $G$. A polyline drawing of $G$ in $\\mathbb{R}^2$ is a drawing $\\Gamma$ of $G$, where each vertex is mapped to a point and each edge is mapped to a polygonal chain. Bend and layer complexities are two important aesthetics of such a drawing. The bend complexity of $\\Gamma$ is the maximum number of bends per edge in $\\Gamma$, and the layer complexity of $\\Gamma$ is the minimum integer $r$ such that the set of polygonal chains in $\\Gamma$ can be partitioned into $r$ disjoint sets, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07816","kind":"arxiv","version":2},"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":"1602.07816","created_at":"2026-05-18T01:16:02.419449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07816v2","created_at":"2026-05-18T01:16:02.419449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07816","created_at":"2026-05-18T01:16:02.419449+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSHHZAZONYYG","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSHHZAZONYYGTVNB","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSHHZAZO","created_at":"2026-05-18T12:30:48.956258+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/VSHHZAZONYYGTVNB2CKMWN7VXM","json":"https://pith.science/pith/VSHHZAZONYYGTVNB2CKMWN7VXM.json","graph_json":"https://pith.science/api/pith-number/VSHHZAZONYYGTVNB2CKMWN7VXM/graph.json","events_json":"https://pith.science/api/pith-number/VSHHZAZONYYGTVNB2CKMWN7VXM/events.json","paper":"https://pith.science/paper/VSHHZAZO"},"agent_actions":{"view_html":"https://pith.science/pith/VSHHZAZONYYGTVNB2CKMWN7VXM","download_json":"https://pith.science/pith/VSHHZAZONYYGTVNB2CKMWN7VXM.json","view_paper":"https://pith.science/paper/VSHHZAZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07816&json=true","fetch_graph":"https://pith.science/api/pith-number/VSHHZAZONYYGTVNB2CKMWN7VXM/graph.json","fetch_events":"https://pith.science/api/pith-number/VSHHZAZONYYGTVNB2CKMWN7VXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSHHZAZONYYGTVNB2CKMWN7VXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSHHZAZONYYGTVNB2CKMWN7VXM/action/storage_attestation","attest_author":"https://pith.science/pith/VSHHZAZONYYGTVNB2CKMWN7VXM/action/author_attestation","sign_citation":"https://pith.science/pith/VSHHZAZONYYGTVNB2CKMWN7VXM/action/citation_signature","submit_replication":"https://pith.science/pith/VSHHZAZONYYGTVNB2CKMWN7VXM/action/replication_record"}},"created_at":"2026-05-18T01:16:02.419449+00:00","updated_at":"2026-05-18T01:16:02.419449+00:00"}