{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AIFJVDAXV23D6XEYCN2IUXYF4F","short_pith_number":"pith:AIFJVDAX","schema_version":"1.0","canonical_sha256":"020a9a8c17aeb63f5c9813748a5f05e145de5d0511ce34125bf2a836c09a5556","source":{"kind":"arxiv","id":"1308.0709","version":1},"attestation_state":"computed","paper":{"title":"Supercoiled Tangles and Stick Numbers of 2-bridge Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Erik Insko, Rolland Trapp","submitted_at":"2013-08-03T15:51:05Z","abstract_excerpt":"Utilizing both twisting and writhing, we construct integral tangles with few sticks, leading to an efficient method for constructing polygonal 2-bridge links. Let L be a two bridge link with crossing number c, stick number s, and n tangles. It is shown that s is less than or equal to 2/3 c + 2n+3 . We also show that if c > 12n+3, then minimal stick representatives do not admit minimal crossing projections."},"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":"1308.0709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-08-03T15:51:05Z","cross_cats_sorted":[],"title_canon_sha256":"2266247049507c012894f27e9c0c79c80ae3fdab7b699ebd34c06a407bc7b388","abstract_canon_sha256":"c8d716f5723967079bab2455fb98a03c366511568add1d3fe33bb3fc8734a13a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:48.434195Z","signature_b64":"iJgpYXJh/ea4AI/5GGHcJBsNwAZa3OihDQSdbZUP9NQUTHKeCzOgO0uv/RXTf2N5YPGLdg07w0gZruuSCMqhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"020a9a8c17aeb63f5c9813748a5f05e145de5d0511ce34125bf2a836c09a5556","last_reissued_at":"2026-05-18T03:16:48.433410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:48.433410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supercoiled Tangles and Stick Numbers of 2-bridge Links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Erik Insko, Rolland Trapp","submitted_at":"2013-08-03T15:51:05Z","abstract_excerpt":"Utilizing both twisting and writhing, we construct integral tangles with few sticks, leading to an efficient method for constructing polygonal 2-bridge links. Let L be a two bridge link with crossing number c, stick number s, and n tangles. It is shown that s is less than or equal to 2/3 c + 2n+3 . We also show that if c > 12n+3, then minimal stick representatives do not admit minimal crossing projections."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0709","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":"1308.0709","created_at":"2026-05-18T03:16:48.433542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0709v1","created_at":"2026-05-18T03:16:48.433542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0709","created_at":"2026-05-18T03:16:48.433542+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIFJVDAXV23D","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIFJVDAXV23D6XEY","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIFJVDAX","created_at":"2026-05-18T12:27:38.830355+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/AIFJVDAXV23D6XEYCN2IUXYF4F","json":"https://pith.science/pith/AIFJVDAXV23D6XEYCN2IUXYF4F.json","graph_json":"https://pith.science/api/pith-number/AIFJVDAXV23D6XEYCN2IUXYF4F/graph.json","events_json":"https://pith.science/api/pith-number/AIFJVDAXV23D6XEYCN2IUXYF4F/events.json","paper":"https://pith.science/paper/AIFJVDAX"},"agent_actions":{"view_html":"https://pith.science/pith/AIFJVDAXV23D6XEYCN2IUXYF4F","download_json":"https://pith.science/pith/AIFJVDAXV23D6XEYCN2IUXYF4F.json","view_paper":"https://pith.science/paper/AIFJVDAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0709&json=true","fetch_graph":"https://pith.science/api/pith-number/AIFJVDAXV23D6XEYCN2IUXYF4F/graph.json","fetch_events":"https://pith.science/api/pith-number/AIFJVDAXV23D6XEYCN2IUXYF4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIFJVDAXV23D6XEYCN2IUXYF4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIFJVDAXV23D6XEYCN2IUXYF4F/action/storage_attestation","attest_author":"https://pith.science/pith/AIFJVDAXV23D6XEYCN2IUXYF4F/action/author_attestation","sign_citation":"https://pith.science/pith/AIFJVDAXV23D6XEYCN2IUXYF4F/action/citation_signature","submit_replication":"https://pith.science/pith/AIFJVDAXV23D6XEYCN2IUXYF4F/action/replication_record"}},"created_at":"2026-05-18T03:16:48.433542+00:00","updated_at":"2026-05-18T03:16:48.433542+00:00"}