{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6GSU45VLDHNSGEVHRO44OZRH2H","short_pith_number":"pith:6GSU45VL","schema_version":"1.0","canonical_sha256":"f1a54e76ab19db2312a78bb9c76627d1e59c43518d300f6b9db4fe414cf487e6","source":{"kind":"arxiv","id":"1308.5638","version":1},"attestation_state":"computed","paper":{"title":"Splitting numbers of links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Jae Choon Cha, Mark Powell, Stefan Friedl","submitted_at":"2013-08-26T16:57:46Z","abstract_excerpt":"The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering links and Alexander invariants. As an application, we completely determine the splitting numbers of links with 9 or fewer crossings. Also, with these techniques, we either reprove or improve upon the lower bounds for splitting numbers of links computed by J. Batson and C. Seed using Khovanov homology."},"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.5638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-08-26T16:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"bb72e3eab3adbaa41e2222d60cc7bd063f710caaf0781c14bef1b0ff59f39cbd","abstract_canon_sha256":"286696336837a762128b2aca746ee511a0c27449724a6943cbb42ce4f006a937"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:03.930916Z","signature_b64":"90WfCs/vGoULF1ECiUQgWXHB9gpK49Us3aHvedC7QTsz5qsOaQMYdpqaS+uaMWtISCoLVP9zQw/Mf/tfQzYtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1a54e76ab19db2312a78bb9c76627d1e59c43518d300f6b9db4fe414cf487e6","last_reissued_at":"2026-05-18T03:15:03.930134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:03.930134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Splitting numbers of links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Jae Choon Cha, Mark Powell, Stefan Friedl","submitted_at":"2013-08-26T16:57:46Z","abstract_excerpt":"The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering links and Alexander invariants. As an application, we completely determine the splitting numbers of links with 9 or fewer crossings. Also, with these techniques, we either reprove or improve upon the lower bounds for splitting numbers of links computed by J. Batson and C. Seed using Khovanov homology."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5638","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.5638","created_at":"2026-05-18T03:15:03.930264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5638v1","created_at":"2026-05-18T03:15:03.930264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5638","created_at":"2026-05-18T03:15:03.930264+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GSU45VLDHNS","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GSU45VLDHNSGEVH","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GSU45VL","created_at":"2026-05-18T12:27:36.564083+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/6GSU45VLDHNSGEVHRO44OZRH2H","json":"https://pith.science/pith/6GSU45VLDHNSGEVHRO44OZRH2H.json","graph_json":"https://pith.science/api/pith-number/6GSU45VLDHNSGEVHRO44OZRH2H/graph.json","events_json":"https://pith.science/api/pith-number/6GSU45VLDHNSGEVHRO44OZRH2H/events.json","paper":"https://pith.science/paper/6GSU45VL"},"agent_actions":{"view_html":"https://pith.science/pith/6GSU45VLDHNSGEVHRO44OZRH2H","download_json":"https://pith.science/pith/6GSU45VLDHNSGEVHRO44OZRH2H.json","view_paper":"https://pith.science/paper/6GSU45VL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5638&json=true","fetch_graph":"https://pith.science/api/pith-number/6GSU45VLDHNSGEVHRO44OZRH2H/graph.json","fetch_events":"https://pith.science/api/pith-number/6GSU45VLDHNSGEVHRO44OZRH2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GSU45VLDHNSGEVHRO44OZRH2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GSU45VLDHNSGEVHRO44OZRH2H/action/storage_attestation","attest_author":"https://pith.science/pith/6GSU45VLDHNSGEVHRO44OZRH2H/action/author_attestation","sign_citation":"https://pith.science/pith/6GSU45VLDHNSGEVHRO44OZRH2H/action/citation_signature","submit_replication":"https://pith.science/pith/6GSU45VLDHNSGEVHRO44OZRH2H/action/replication_record"}},"created_at":"2026-05-18T03:15:03.930264+00:00","updated_at":"2026-05-18T03:15:03.930264+00:00"}