{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q4GC6FKEQZAJR3AWQKZP6S5WVE","short_pith_number":"pith:Q4GC6FKE","schema_version":"1.0","canonical_sha256":"870c2f1544864098ec1682b2ff4bb6a929179299659a8478196ae741b6c2de0a","source":{"kind":"arxiv","id":"1512.03592","version":1},"attestation_state":"computed","paper":{"title":"An upper bound on stick numbers of knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Seungsang Oh, Youngsik Huh","submitted_at":"2015-12-11T10:49:00Z","abstract_excerpt":"In 1991, 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)$. In this paper we improve this upper bound to $s(K) \\leq \\frac{3}{2} (c(K)+1)$. Moreover if $K$ is a non-alternating prime knot, then $s(K) \\leq \\frac{3}{2} c(K)$."},"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":"1512.03592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-12-11T10:49:00Z","cross_cats_sorted":[],"title_canon_sha256":"410a24b5985c9e6fb8b204ef80f9f71976cf6d045fae9492cb87a547c54f3117","abstract_canon_sha256":"64549b770c46a3c7882c9dd35ec427710fe8de696629cf26347a227ca68f79bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:31.970619Z","signature_b64":"w0I+i50l3iU9COFibEyY0zMz/kxgTZK5NHsJxeCmvz3Hu62q6dmwopAIN+uZK2oyfaisj7oK4jZfKqRJcMNlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"870c2f1544864098ec1682b2ff4bb6a929179299659a8478196ae741b6c2de0a","last_reissued_at":"2026-05-18T01:24:31.970062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:31.970062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An upper bound on stick numbers of knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Seungsang Oh, Youngsik Huh","submitted_at":"2015-12-11T10:49:00Z","abstract_excerpt":"In 1991, 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)$. In this paper we improve this upper bound to $s(K) \\leq \\frac{3}{2} (c(K)+1)$. Moreover if $K$ is a non-alternating prime knot, then $s(K) \\leq \\frac{3}{2} c(K)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03592","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":"1512.03592","created_at":"2026-05-18T01:24:31.970150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03592v1","created_at":"2026-05-18T01:24:31.970150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03592","created_at":"2026-05-18T01:24:31.970150+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4GC6FKEQZAJ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4GC6FKEQZAJR3AW","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4GC6FKE","created_at":"2026-05-18T12:29:37.295048+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/Q4GC6FKEQZAJR3AWQKZP6S5WVE","json":"https://pith.science/pith/Q4GC6FKEQZAJR3AWQKZP6S5WVE.json","graph_json":"https://pith.science/api/pith-number/Q4GC6FKEQZAJR3AWQKZP6S5WVE/graph.json","events_json":"https://pith.science/api/pith-number/Q4GC6FKEQZAJR3AWQKZP6S5WVE/events.json","paper":"https://pith.science/paper/Q4GC6FKE"},"agent_actions":{"view_html":"https://pith.science/pith/Q4GC6FKEQZAJR3AWQKZP6S5WVE","download_json":"https://pith.science/pith/Q4GC6FKEQZAJR3AWQKZP6S5WVE.json","view_paper":"https://pith.science/paper/Q4GC6FKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03592&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4GC6FKEQZAJR3AWQKZP6S5WVE/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4GC6FKEQZAJR3AWQKZP6S5WVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4GC6FKEQZAJR3AWQKZP6S5WVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4GC6FKEQZAJR3AWQKZP6S5WVE/action/storage_attestation","attest_author":"https://pith.science/pith/Q4GC6FKEQZAJR3AWQKZP6S5WVE/action/author_attestation","sign_citation":"https://pith.science/pith/Q4GC6FKEQZAJR3AWQKZP6S5WVE/action/citation_signature","submit_replication":"https://pith.science/pith/Q4GC6FKEQZAJR3AWQKZP6S5WVE/action/replication_record"}},"created_at":"2026-05-18T01:24:31.970150+00:00","updated_at":"2026-05-18T01:24:31.970150+00:00"}