{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VWOR6KDEQVMK6YP4AQ2AHCXOMJ","short_pith_number":"pith:VWOR6KDE","schema_version":"1.0","canonical_sha256":"ad9d1f28648558af61fc0434038aee6256614ce1c1dc0fb4d63c324abb6b6d82","source":{"kind":"arxiv","id":"1806.09719","version":1},"attestation_state":"computed","paper":{"title":"Bisected vertex leveling of plane graphs: braid index, arc index and delta diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Hyungkee Yoo, Seungsang Oh, Sungjong No","submitted_at":"2018-06-25T22:34:34Z","abstract_excerpt":"In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index $\\alpha(L)$ for any knot or non-split link $L$, which are $b(L) \\leq \\frac{1}{2} c(L) + 1$ and $\\alpha(L) \\leq c(L) + 2$. We also find a quadratic upper bound of the minimal crossing number of delta diagrams of $L$."},"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":"1806.09719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2018-06-25T22:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"16669ebb6e293dbeed28f5d77c4d14733c86eae5bf4282d0462b2eb93898726d","abstract_canon_sha256":"f32c025a56f60bf62ac1bc080b09f24476918c94f6afa3c5bcfe4bda2de9d7a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:23.634202Z","signature_b64":"ApKWQzqWB9voLK+JIXBK3ZvxIJSfCaUB5bNLEjC3V2LTCklPNopQGmrUz5hzw3ZPzY3JhC3xlSE94/oGqnlGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad9d1f28648558af61fc0434038aee6256614ce1c1dc0fb4d63c324abb6b6d82","last_reissued_at":"2026-05-18T00:12:23.633461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:23.633461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bisected vertex leveling of plane graphs: braid index, arc index and delta diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Hyungkee Yoo, Seungsang Oh, Sungjong No","submitted_at":"2018-06-25T22:34:34Z","abstract_excerpt":"In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index $b(L)$ and arc index $\\alpha(L)$ for any knot or non-split link $L$, which are $b(L) \\leq \\frac{1}{2} c(L) + 1$ and $\\alpha(L) \\leq c(L) + 2$. We also find a quadratic upper bound of the minimal crossing number of delta diagrams of $L$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09719","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":"1806.09719","created_at":"2026-05-18T00:12:23.633561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09719v1","created_at":"2026-05-18T00:12:23.633561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09719","created_at":"2026-05-18T00:12:23.633561+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWOR6KDEQVMK","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWOR6KDEQVMK6YP4","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWOR6KDE","created_at":"2026-05-18T12:32:59.047623+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/VWOR6KDEQVMK6YP4AQ2AHCXOMJ","json":"https://pith.science/pith/VWOR6KDEQVMK6YP4AQ2AHCXOMJ.json","graph_json":"https://pith.science/api/pith-number/VWOR6KDEQVMK6YP4AQ2AHCXOMJ/graph.json","events_json":"https://pith.science/api/pith-number/VWOR6KDEQVMK6YP4AQ2AHCXOMJ/events.json","paper":"https://pith.science/paper/VWOR6KDE"},"agent_actions":{"view_html":"https://pith.science/pith/VWOR6KDEQVMK6YP4AQ2AHCXOMJ","download_json":"https://pith.science/pith/VWOR6KDEQVMK6YP4AQ2AHCXOMJ.json","view_paper":"https://pith.science/paper/VWOR6KDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09719&json=true","fetch_graph":"https://pith.science/api/pith-number/VWOR6KDEQVMK6YP4AQ2AHCXOMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VWOR6KDEQVMK6YP4AQ2AHCXOMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWOR6KDEQVMK6YP4AQ2AHCXOMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWOR6KDEQVMK6YP4AQ2AHCXOMJ/action/storage_attestation","attest_author":"https://pith.science/pith/VWOR6KDEQVMK6YP4AQ2AHCXOMJ/action/author_attestation","sign_citation":"https://pith.science/pith/VWOR6KDEQVMK6YP4AQ2AHCXOMJ/action/citation_signature","submit_replication":"https://pith.science/pith/VWOR6KDEQVMK6YP4AQ2AHCXOMJ/action/replication_record"}},"created_at":"2026-05-18T00:12:23.633561+00:00","updated_at":"2026-05-18T00:12:23.633561+00:00"}