{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QQVZX5H6BW2ORSLRCGIKZI2LE5","short_pith_number":"pith:QQVZX5H6","schema_version":"1.0","canonical_sha256":"842b9bf4fe0db4e8c9711190aca34b276550a30261b7a54308ccce41fa4bec45","source":{"kind":"arxiv","id":"1411.1850","version":1},"attestation_state":"computed","paper":{"title":"Stick numbers of $2$-bridge knots and links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Seungsang Oh, Sungjong No, Youngsik Huh","submitted_at":"2014-11-07T07:08:51Z","abstract_excerpt":"Negami found an upper bound on the stick number $s(K)$ of a nontrivial knot $K$ in terms of the minimal crossing number $c(K)$ of the knot which is $s(K) \\leq 2 c(K)$. Furthermore McCabe proved $s(K) \\leq c(K) + 3$ for a $2$-bridge knot or link, except in the case of the unlink and the Hopf link. In this paper we construct any $2$-bridge knot or link $K$ of at least six crossings by using only $c(K)+2$ straight sticks. This gives a new upper bound on stick numbers of $2$-bridge knots and links in terms of crossing numbers."},"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":"1411.1850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2014-11-07T07:08:51Z","cross_cats_sorted":[],"title_canon_sha256":"ad2df3e866123c2569c8c040dd3ba5ef8db77e52218c45d0c92283ab452b36f8","abstract_canon_sha256":"c669bbf676fe4b68ab268e8d2cc9146e4de62e1edb442d55c9e43017cf8792e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:25.795420Z","signature_b64":"n7VJxpq3doQNuUteLOgNp+PcUZrLCItmhhV/6KcnKTmorJSUGbANep1DtIkj9C72j9TPr5e827Ky3qzQ2HyeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"842b9bf4fe0db4e8c9711190aca34b276550a30261b7a54308ccce41fa4bec45","last_reissued_at":"2026-05-18T02:38:25.794836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:25.794836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stick numbers of $2$-bridge knots and links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Seungsang Oh, Sungjong No, Youngsik Huh","submitted_at":"2014-11-07T07:08:51Z","abstract_excerpt":"Negami found an upper bound on the stick number $s(K)$ of a nontrivial knot $K$ in terms of the minimal crossing number $c(K)$ of the knot which is $s(K) \\leq 2 c(K)$. Furthermore McCabe proved $s(K) \\leq c(K) + 3$ for a $2$-bridge knot or link, except in the case of the unlink and the Hopf link. In this paper we construct any $2$-bridge knot or link $K$ of at least six crossings by using only $c(K)+2$ straight sticks. This gives a new upper bound on stick numbers of $2$-bridge knots and links in terms of crossing numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1850","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":"1411.1850","created_at":"2026-05-18T02:38:25.794917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1850v1","created_at":"2026-05-18T02:38:25.794917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1850","created_at":"2026-05-18T02:38:25.794917+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQVZX5H6BW2O","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQVZX5H6BW2ORSLR","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQVZX5H6","created_at":"2026-05-18T12:28:46.137349+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/QQVZX5H6BW2ORSLRCGIKZI2LE5","json":"https://pith.science/pith/QQVZX5H6BW2ORSLRCGIKZI2LE5.json","graph_json":"https://pith.science/api/pith-number/QQVZX5H6BW2ORSLRCGIKZI2LE5/graph.json","events_json":"https://pith.science/api/pith-number/QQVZX5H6BW2ORSLRCGIKZI2LE5/events.json","paper":"https://pith.science/paper/QQVZX5H6"},"agent_actions":{"view_html":"https://pith.science/pith/QQVZX5H6BW2ORSLRCGIKZI2LE5","download_json":"https://pith.science/pith/QQVZX5H6BW2ORSLRCGIKZI2LE5.json","view_paper":"https://pith.science/paper/QQVZX5H6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1850&json=true","fetch_graph":"https://pith.science/api/pith-number/QQVZX5H6BW2ORSLRCGIKZI2LE5/graph.json","fetch_events":"https://pith.science/api/pith-number/QQVZX5H6BW2ORSLRCGIKZI2LE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQVZX5H6BW2ORSLRCGIKZI2LE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQVZX5H6BW2ORSLRCGIKZI2LE5/action/storage_attestation","attest_author":"https://pith.science/pith/QQVZX5H6BW2ORSLRCGIKZI2LE5/action/author_attestation","sign_citation":"https://pith.science/pith/QQVZX5H6BW2ORSLRCGIKZI2LE5/action/citation_signature","submit_replication":"https://pith.science/pith/QQVZX5H6BW2ORSLRCGIKZI2LE5/action/replication_record"}},"created_at":"2026-05-18T02:38:25.794917+00:00","updated_at":"2026-05-18T02:38:25.794917+00:00"}