{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NJPRJYSLHYY4PEWLWAONWX6E3F","short_pith_number":"pith:NJPRJYSL","schema_version":"1.0","canonical_sha256":"6a5f14e24b3e31c792cbb01cdb5fc4d97579ede94bcc89cfd816038fb9d5bd11","source":{"kind":"arxiv","id":"1808.10366","version":1},"attestation_state":"computed","paper":{"title":"$\\beta$-Stars or On Extending a Drawing of a Connected Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"J\\'er\\^ome Urhausen, Tamara Mchedlidze","submitted_at":"2018-08-30T15:51:44Z","abstract_excerpt":"We consider the problem of extending the drawing of a subgraph of a given plane graph to a drawing of the entire graph using straight-line and polyline edges. We define the notion of star complexity of a polygon and show that a drawing $\\Gamma_H$ of an induced connected subgraph $H$ can be extended with at most $\\min\\{ h/2, \\beta + \\log_2(h) + 1\\}$ bends per edge, where $\\beta$ is the largest star complexity of a face of $\\Gamma_H$ and $h$ is the size of the largest face of $H$. This result significantly improves the previously known upper bound of $72|V(H)|$ [5] for the case where $H$ is conn"},"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":"1808.10366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-30T15:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"9c335f88626e432592db8b68463bb2a14902b5a1cc5f10e0d1ea2dd9baa9226f","abstract_canon_sha256":"428104641af924474ac2abca4b84a91c78dd58b19760859ba9d86112895a9c9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:49.016543Z","signature_b64":"eKpHSIT4X/YSzxQfWbjRha7lbUwOFJXWzfK4HL/pjyTD5MA7p+4P5anVssn7Y36kTwBpwiHCc4PYNaWsLJh1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a5f14e24b3e31c792cbb01cdb5fc4d97579ede94bcc89cfd816038fb9d5bd11","last_reissued_at":"2026-05-18T00:06:49.015906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:49.015906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\beta$-Stars or On Extending a Drawing of a Connected Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"J\\'er\\^ome Urhausen, Tamara Mchedlidze","submitted_at":"2018-08-30T15:51:44Z","abstract_excerpt":"We consider the problem of extending the drawing of a subgraph of a given plane graph to a drawing of the entire graph using straight-line and polyline edges. We define the notion of star complexity of a polygon and show that a drawing $\\Gamma_H$ of an induced connected subgraph $H$ can be extended with at most $\\min\\{ h/2, \\beta + \\log_2(h) + 1\\}$ bends per edge, where $\\beta$ is the largest star complexity of a face of $\\Gamma_H$ and $h$ is the size of the largest face of $H$. This result significantly improves the previously known upper bound of $72|V(H)|$ [5] for the case where $H$ is conn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10366","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":"1808.10366","created_at":"2026-05-18T00:06:49.016000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10366v1","created_at":"2026-05-18T00:06:49.016000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10366","created_at":"2026-05-18T00:06:49.016000+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJPRJYSLHYY4","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJPRJYSLHYY4PEWL","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJPRJYSL","created_at":"2026-05-18T12:32:40.477152+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/NJPRJYSLHYY4PEWLWAONWX6E3F","json":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F.json","graph_json":"https://pith.science/api/pith-number/NJPRJYSLHYY4PEWLWAONWX6E3F/graph.json","events_json":"https://pith.science/api/pith-number/NJPRJYSLHYY4PEWLWAONWX6E3F/events.json","paper":"https://pith.science/paper/NJPRJYSL"},"agent_actions":{"view_html":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F","download_json":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F.json","view_paper":"https://pith.science/paper/NJPRJYSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10366&json=true","fetch_graph":"https://pith.science/api/pith-number/NJPRJYSLHYY4PEWLWAONWX6E3F/graph.json","fetch_events":"https://pith.science/api/pith-number/NJPRJYSLHYY4PEWLWAONWX6E3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/action/storage_attestation","attest_author":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/action/author_attestation","sign_citation":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/action/citation_signature","submit_replication":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/action/replication_record"}},"created_at":"2026-05-18T00:06:49.016000+00:00","updated_at":"2026-05-18T00:06:49.016000+00:00"}