{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:P327W445U7WKYKNZAHKEXAD6GY","short_pith_number":"pith:P327W445","schema_version":"1.0","canonical_sha256":"7ef5fb739da7ecac29b901d44b807e363fa68f4e315febcc0b056d154c2f92b1","source":{"kind":"arxiv","id":"1112.3353","version":1},"attestation_state":"computed","paper":{"title":"On the bend-number of planar and outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Heldt, Kolja Knauer, Torsten Ueckerdt","submitted_at":"2011-12-14T21:01:24Z","abstract_excerpt":"The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of outerplanar graphs is 2. Moreover we improve the formerly known lower and upper bound for the maximum bend-number of planar graphs from 2 and 5 to 3 and 4, respectively."},"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":"1112.3353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-14T21:01:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7ba00d1f11769fbc6459b94cff8b9720d82a0ae24731a509cfdde4ff3b71e36a","abstract_canon_sha256":"7227ab0c23c7d8a02c0a69215eedbe6d5d6d39dfbde0efaa2c700e02a1c7c374"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:18.770467Z","signature_b64":"0A20uIm+Tlr1J5gol4faUmrqNUibt0KWx5Su5RhjJ8X9rfr3dm+bX/a2Xy2tWL/9+GxSL1CoOkyDvDFxA/KHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ef5fb739da7ecac29b901d44b807e363fa68f4e315febcc0b056d154c2f92b1","last_reissued_at":"2026-05-18T04:06:18.769758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:18.769758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the bend-number of planar and outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Daniel Heldt, Kolja Knauer, Torsten Ueckerdt","submitted_at":"2011-12-14T21:01:24Z","abstract_excerpt":"The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of outerplanar graphs is 2. Moreover we improve the formerly known lower and upper bound for the maximum bend-number of planar graphs from 2 and 5 to 3 and 4, respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3353","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":"1112.3353","created_at":"2026-05-18T04:06:18.769874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3353v1","created_at":"2026-05-18T04:06:18.769874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3353","created_at":"2026-05-18T04:06:18.769874+00:00"},{"alias_kind":"pith_short_12","alias_value":"P327W445U7WK","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"P327W445U7WKYKNZ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"P327W445","created_at":"2026-05-18T12:26:39.201973+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/P327W445U7WKYKNZAHKEXAD6GY","json":"https://pith.science/pith/P327W445U7WKYKNZAHKEXAD6GY.json","graph_json":"https://pith.science/api/pith-number/P327W445U7WKYKNZAHKEXAD6GY/graph.json","events_json":"https://pith.science/api/pith-number/P327W445U7WKYKNZAHKEXAD6GY/events.json","paper":"https://pith.science/paper/P327W445"},"agent_actions":{"view_html":"https://pith.science/pith/P327W445U7WKYKNZAHKEXAD6GY","download_json":"https://pith.science/pith/P327W445U7WKYKNZAHKEXAD6GY.json","view_paper":"https://pith.science/paper/P327W445","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3353&json=true","fetch_graph":"https://pith.science/api/pith-number/P327W445U7WKYKNZAHKEXAD6GY/graph.json","fetch_events":"https://pith.science/api/pith-number/P327W445U7WKYKNZAHKEXAD6GY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P327W445U7WKYKNZAHKEXAD6GY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P327W445U7WKYKNZAHKEXAD6GY/action/storage_attestation","attest_author":"https://pith.science/pith/P327W445U7WKYKNZAHKEXAD6GY/action/author_attestation","sign_citation":"https://pith.science/pith/P327W445U7WKYKNZAHKEXAD6GY/action/citation_signature","submit_replication":"https://pith.science/pith/P327W445U7WKYKNZAHKEXAD6GY/action/replication_record"}},"created_at":"2026-05-18T04:06:18.769874+00:00","updated_at":"2026-05-18T04:06:18.769874+00:00"}