{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AI4A66A7MF46RAAQPU3BMKDHTE","short_pith_number":"pith:AI4A66A7","schema_version":"1.0","canonical_sha256":"02380f781f6179e880107d361628679926b404ee965528f8a7023eb4461c701f","source":{"kind":"arxiv","id":"1202.5393","version":2},"attestation_state":"computed","paper":{"title":"The maximal degree of the Khovanov homology of a cable link","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Keiji Tagami","submitted_at":"2012-02-24T08:37:47Z","abstract_excerpt":"In this paper, we study the Khovanov homology of cable links. We first estimate the maximal homological degree term of the Khovanov homology of the ($2k+1$, $(2k+1)n$)-torus link and give a lower bound of its homological thickness. Specifically, we show that the homological thickness of the ($2k+1$, $(2k+1)n$)-torus link is greater than or equal to $k^{2}n+2$. Next, we study the maximal homological degree of the Khovanov homology of the ($p$, $pn$)-cabling of any knot with sufficiently large $n$. Furthermore, we compute the maximal homological degree term of the Khovanov homology of such a lin"},"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":"1202.5393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2012-02-24T08:37:47Z","cross_cats_sorted":[],"title_canon_sha256":"adfad50b168b3c94583e534e64ef3cc90cf5cc264320dce07134e6eb2c37d742","abstract_canon_sha256":"49b06ec4169c5542a5181eed76b0170fa6fe7c2c011521a8dabd25493936673b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.574210Z","signature_b64":"H4x5+9yfAIq+pvlJsFO1qpyn0fABbf2YCiXkpOfe1y0i6avRnogVe1RIRv709J88BKJknEPqKmWzve0Q9g7lDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02380f781f6179e880107d361628679926b404ee965528f8a7023eb4461c701f","last_reissued_at":"2026-05-18T02:21:17.573505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.573505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximal degree of the Khovanov homology of a cable link","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Keiji Tagami","submitted_at":"2012-02-24T08:37:47Z","abstract_excerpt":"In this paper, we study the Khovanov homology of cable links. We first estimate the maximal homological degree term of the Khovanov homology of the ($2k+1$, $(2k+1)n$)-torus link and give a lower bound of its homological thickness. Specifically, we show that the homological thickness of the ($2k+1$, $(2k+1)n$)-torus link is greater than or equal to $k^{2}n+2$. Next, we study the maximal homological degree of the Khovanov homology of the ($p$, $pn$)-cabling of any knot with sufficiently large $n$. Furthermore, we compute the maximal homological degree term of the Khovanov homology of such a lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5393","kind":"arxiv","version":2},"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":"1202.5393","created_at":"2026-05-18T02:21:17.573618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5393v2","created_at":"2026-05-18T02:21:17.573618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5393","created_at":"2026-05-18T02:21:17.573618+00:00"},{"alias_kind":"pith_short_12","alias_value":"AI4A66A7MF46","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AI4A66A7MF46RAAQ","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AI4A66A7","created_at":"2026-05-18T12:26:58.693483+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/AI4A66A7MF46RAAQPU3BMKDHTE","json":"https://pith.science/pith/AI4A66A7MF46RAAQPU3BMKDHTE.json","graph_json":"https://pith.science/api/pith-number/AI4A66A7MF46RAAQPU3BMKDHTE/graph.json","events_json":"https://pith.science/api/pith-number/AI4A66A7MF46RAAQPU3BMKDHTE/events.json","paper":"https://pith.science/paper/AI4A66A7"},"agent_actions":{"view_html":"https://pith.science/pith/AI4A66A7MF46RAAQPU3BMKDHTE","download_json":"https://pith.science/pith/AI4A66A7MF46RAAQPU3BMKDHTE.json","view_paper":"https://pith.science/paper/AI4A66A7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5393&json=true","fetch_graph":"https://pith.science/api/pith-number/AI4A66A7MF46RAAQPU3BMKDHTE/graph.json","fetch_events":"https://pith.science/api/pith-number/AI4A66A7MF46RAAQPU3BMKDHTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AI4A66A7MF46RAAQPU3BMKDHTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AI4A66A7MF46RAAQPU3BMKDHTE/action/storage_attestation","attest_author":"https://pith.science/pith/AI4A66A7MF46RAAQPU3BMKDHTE/action/author_attestation","sign_citation":"https://pith.science/pith/AI4A66A7MF46RAAQPU3BMKDHTE/action/citation_signature","submit_replication":"https://pith.science/pith/AI4A66A7MF46RAAQPU3BMKDHTE/action/replication_record"}},"created_at":"2026-05-18T02:21:17.573618+00:00","updated_at":"2026-05-18T02:21:17.573618+00:00"}