{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NJPRJYSLHYY4PEWLWAONWX6E3F","short_pith_number":"pith:NJPRJYSL","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"},"canonical_sha256":"6a5f14e24b3e31c792cbb01cdb5fc4d97579ede94bcc89cfd816038fb9d5bd11","source":{"kind":"arxiv","id":"1808.10366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10366","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10366v1","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10366","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"NJPRJYSLHYY4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJPRJYSLHYY4PEWL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJPRJYSL","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NJPRJYSLHYY4PEWLWAONWX6E3F","target":"record","payload":{"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"},"canonical_sha256":"6a5f14e24b3e31c792cbb01cdb5fc4d97579ede94bcc89cfd816038fb9d5bd11","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"},"source_kind":"arxiv","source_id":"1808.10366","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ne3b2WXpKtRaVz8Mlx+TZ/b5l8e6AzcVE9hFKwr56VGB9tgWaaUt2pAil2rMfKKXFref7Qs/X3FvqeHxj/J8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:13:01.986411Z"},"content_sha256":"c586c9e92e8ef0fa7ee7bc310410ff722217f145e8e3cebab24331804f1ebb96","schema_version":"1.0","event_id":"sha256:c586c9e92e8ef0fa7ee7bc310410ff722217f145e8e3cebab24331804f1ebb96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NJPRJYSLHYY4PEWLWAONWX6E3F","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGB9BzX+sBqFlJ/shNNUc9KZfPq9lSXNfowSn2d3quehzi9lDn9CVMHYZ2e6+TgMcGr9FMh0PsPS+qjxCJzeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T23:13:01.986758Z"},"content_sha256":"2201f32ce899f6d88c26adf52d48e4b95634ce0617ef5919482a7dab9916e448","schema_version":"1.0","event_id":"sha256:2201f32ce899f6d88c26adf52d48e4b95634ce0617ef5919482a7dab9916e448"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/bundle.json","state_url":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T23:13:01Z","links":{"resolver":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F","bundle":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/bundle.json","state":"https://pith.science/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJPRJYSLHYY4PEWLWAONWX6E3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NJPRJYSLHYY4PEWLWAONWX6E3F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"428104641af924474ac2abca4b84a91c78dd58b19760859ba9d86112895a9c9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-30T15:51:44Z","title_canon_sha256":"9c335f88626e432592db8b68463bb2a14902b5a1cc5f10e0d1ea2dd9baa9226f"},"schema_version":"1.0","source":{"id":"1808.10366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10366","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10366v1","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10366","created_at":"2026-05-18T00:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"NJPRJYSLHYY4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NJPRJYSLHYY4PEWL","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NJPRJYSL","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2201f32ce899f6d88c26adf52d48e4b95634ce0617ef5919482a7dab9916e448","target":"graph","created_at":"2026-05-18T00:06:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"J\\'er\\^ome Urhausen, Tamara Mchedlidze","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-30T15:51:44Z","title":"$\\beta$-Stars or On Extending a Drawing of a Connected Subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10366","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c586c9e92e8ef0fa7ee7bc310410ff722217f145e8e3cebab24331804f1ebb96","target":"record","created_at":"2026-05-18T00:06:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"428104641af924474ac2abca4b84a91c78dd58b19760859ba9d86112895a9c9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-30T15:51:44Z","title_canon_sha256":"9c335f88626e432592db8b68463bb2a14902b5a1cc5f10e0d1ea2dd9baa9226f"},"schema_version":"1.0","source":{"id":"1808.10366","kind":"arxiv","version":1}},"canonical_sha256":"6a5f14e24b3e31c792cbb01cdb5fc4d97579ede94bcc89cfd816038fb9d5bd11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a5f14e24b3e31c792cbb01cdb5fc4d97579ede94bcc89cfd816038fb9d5bd11","first_computed_at":"2026-05-18T00:06:49.015906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:49.015906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eKpHSIT4X/YSzxQfWbjRha7lbUwOFJXWzfK4HL/pjyTD5MA7p+4P5anVssn7Y36kTwBpwiHCc4PYNaWsLJh1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:49.016543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c586c9e92e8ef0fa7ee7bc310410ff722217f145e8e3cebab24331804f1ebb96","sha256:2201f32ce899f6d88c26adf52d48e4b95634ce0617ef5919482a7dab9916e448"],"state_sha256":"19192fe89a547ff78f9804084126606fe78938f81fd58c7e74b6ebac45eb9b3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5oSvyZWZkcDHaak/3e+lMaDQhw97WVucjNaVwxO6D5TwC5GOT9rHrWm4EeKSjHR/C7NqHJXHWqDWO9uRd9q1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T23:13:01.988727Z","bundle_sha256":"8ce45bde4c24fcf76db6ba605e4e6c30c76444042530102f7af164476784f53b"}}