{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ASRFQETEAW22XLGJO2GMMVUIZL","short_pith_number":"pith:ASRFQETE","schema_version":"1.0","canonical_sha256":"04a258126405b5abacc9768cc65688cafa57364977f5e563d09b87232bfb95fc","source":{"kind":"arxiv","id":"2507.15060","version":1},"attestation_state":"computed","paper":{"title":"Morse matchings and Khovanov homology of 4-strand torus links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Tuomas Kelom\\\"aki","submitted_at":"2025-07-20T17:51:42Z","abstract_excerpt":"Given a link or a tangle diagram, we define algorithmic Morse theoretic simplifications on their Khovanov homology. In contrast to Bar-Natan's scanning algorithm, the cancellations are postponed until the end and performed in one go. Although our novel approach is computationally inferior to Bar-Natan's algorithm, it side-steps the need for a large amount of iterations, making it more fitting for theoretical analysis. Our main application is towards integral Khovanov homology of 4-strand torus links, for which we compute non-trivial Khovanov homology groups in all homological degrees and find "},"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":"2507.15060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2025-07-20T17:51:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a5a4bd5764a585be9f10afa11aa4e060a8a842c320f48ea2544a00ae4ea15ed1","abstract_canon_sha256":"92efb4239a4714ecd21ab187115294a77111a9a70eba8cc632aafcc0e723f2e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:17.845917Z","signature_b64":"alR5wOn5IXG72K+AKvm96EpI8CKiAwv/i4t+tbgkVkIQkUNcXCJKvwiYllig84rxIiLRzgRdD/VZDFFts5caDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04a258126405b5abacc9768cc65688cafa57364977f5e563d09b87232bfb95fc","last_reissued_at":"2026-07-05T11:40:17.845475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:17.845475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Morse matchings and Khovanov homology of 4-strand torus links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GT","authors_text":"Tuomas Kelom\\\"aki","submitted_at":"2025-07-20T17:51:42Z","abstract_excerpt":"Given a link or a tangle diagram, we define algorithmic Morse theoretic simplifications on their Khovanov homology. In contrast to Bar-Natan's scanning algorithm, the cancellations are postponed until the end and performed in one go. Although our novel approach is computationally inferior to Bar-Natan's algorithm, it side-steps the need for a large amount of iterations, making it more fitting for theoretical analysis. Our main application is towards integral Khovanov homology of 4-strand torus links, for which we compute non-trivial Khovanov homology groups in all homological degrees and find "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15060","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.15060/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.15060","created_at":"2026-07-05T11:40:17.845539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15060v1","created_at":"2026-07-05T11:40:17.845539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15060","created_at":"2026-07-05T11:40:17.845539+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASRFQETEAW22","created_at":"2026-07-05T11:40:17.845539+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASRFQETEAW22XLGJ","created_at":"2026-07-05T11:40:17.845539+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASRFQETE","created_at":"2026-07-05T11:40:17.845539+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/ASRFQETEAW22XLGJO2GMMVUIZL","json":"https://pith.science/pith/ASRFQETEAW22XLGJO2GMMVUIZL.json","graph_json":"https://pith.science/api/pith-number/ASRFQETEAW22XLGJO2GMMVUIZL/graph.json","events_json":"https://pith.science/api/pith-number/ASRFQETEAW22XLGJO2GMMVUIZL/events.json","paper":"https://pith.science/paper/ASRFQETE"},"agent_actions":{"view_html":"https://pith.science/pith/ASRFQETEAW22XLGJO2GMMVUIZL","download_json":"https://pith.science/pith/ASRFQETEAW22XLGJO2GMMVUIZL.json","view_paper":"https://pith.science/paper/ASRFQETE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15060&json=true","fetch_graph":"https://pith.science/api/pith-number/ASRFQETEAW22XLGJO2GMMVUIZL/graph.json","fetch_events":"https://pith.science/api/pith-number/ASRFQETEAW22XLGJO2GMMVUIZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASRFQETEAW22XLGJO2GMMVUIZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASRFQETEAW22XLGJO2GMMVUIZL/action/storage_attestation","attest_author":"https://pith.science/pith/ASRFQETEAW22XLGJO2GMMVUIZL/action/author_attestation","sign_citation":"https://pith.science/pith/ASRFQETEAW22XLGJO2GMMVUIZL/action/citation_signature","submit_replication":"https://pith.science/pith/ASRFQETEAW22XLGJO2GMMVUIZL/action/replication_record"}},"created_at":"2026-07-05T11:40:17.845539+00:00","updated_at":"2026-07-05T11:40:17.845539+00:00"}