{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:322XGP7V3KKGKRCMNLHYDAZ4YN","short_pith_number":"pith:322XGP7V","schema_version":"1.0","canonical_sha256":"deb5733ff5da9465444c6acf81833cc349fcf57e02efbb20e836f3cc867ab08d","source":{"kind":"arxiv","id":"2605.25650","version":1},"attestation_state":"computed","paper":{"title":"Khovanov complexes for bipartite links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.GT","math.MP"],"primary_cat":"hep-th","authors_text":"A. Anokhina, A. Morozov, E. Lanina","submitted_at":"2026-05-25T09:57:30Z","abstract_excerpt":"Recently, for a limited class for bipartite links, the complicated Khovanov-Rozansky matrix factorization technique was reduced to an analogue of elementary Kauffman-Khovanov cycle calculus for an arbitrary $N$. In this note, we demonstrate the consistency of such reduction with the computation of the bipartite Khovanov polynomials for $N=2$. Namely, we explain how the Kauffman-Khovanov $2^2$-hypercube is shrinked to the bipartite 3-hypercube."},"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":"2605.25650","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2026-05-25T09:57:30Z","cross_cats_sorted":["math-ph","math.GT","math.MP"],"title_canon_sha256":"783679376ff794a1c0333415f68439e4ab4b08c7ec01797a1eef627907c5a5dd","abstract_canon_sha256":"1681a9fe6713d99a207786d9f2747d82e393cedab6e69bfe5aad7b512e7c65ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:48.214817Z","signature_b64":"SvMffQVRDcE5sbuvavqxeINK8wv6l5/aWdfFPe/c7tpi0Myo9b1/B0bRDzCxPtOL4dWMdaS+yfLSuFnj4sxLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deb5733ff5da9465444c6acf81833cc349fcf57e02efbb20e836f3cc867ab08d","last_reissued_at":"2026-05-26T02:04:48.213880Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:48.213880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Khovanov complexes for bipartite links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.GT","math.MP"],"primary_cat":"hep-th","authors_text":"A. Anokhina, A. Morozov, E. Lanina","submitted_at":"2026-05-25T09:57:30Z","abstract_excerpt":"Recently, for a limited class for bipartite links, the complicated Khovanov-Rozansky matrix factorization technique was reduced to an analogue of elementary Kauffman-Khovanov cycle calculus for an arbitrary $N$. In this note, we demonstrate the consistency of such reduction with the computation of the bipartite Khovanov polynomials for $N=2$. Namely, we explain how the Kauffman-Khovanov $2^2$-hypercube is shrinked to the bipartite 3-hypercube."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25650","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/2605.25650/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":"2605.25650","created_at":"2026-05-26T02:04:48.214053+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25650v1","created_at":"2026-05-26T02:04:48.214053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25650","created_at":"2026-05-26T02:04:48.214053+00:00"},{"alias_kind":"pith_short_12","alias_value":"322XGP7V3KKG","created_at":"2026-05-26T02:04:48.214053+00:00"},{"alias_kind":"pith_short_16","alias_value":"322XGP7V3KKGKRCM","created_at":"2026-05-26T02:04:48.214053+00:00"},{"alias_kind":"pith_short_8","alias_value":"322XGP7V","created_at":"2026-05-26T02:04:48.214053+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/322XGP7V3KKGKRCMNLHYDAZ4YN","json":"https://pith.science/pith/322XGP7V3KKGKRCMNLHYDAZ4YN.json","graph_json":"https://pith.science/api/pith-number/322XGP7V3KKGKRCMNLHYDAZ4YN/graph.json","events_json":"https://pith.science/api/pith-number/322XGP7V3KKGKRCMNLHYDAZ4YN/events.json","paper":"https://pith.science/paper/322XGP7V"},"agent_actions":{"view_html":"https://pith.science/pith/322XGP7V3KKGKRCMNLHYDAZ4YN","download_json":"https://pith.science/pith/322XGP7V3KKGKRCMNLHYDAZ4YN.json","view_paper":"https://pith.science/paper/322XGP7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25650&json=true","fetch_graph":"https://pith.science/api/pith-number/322XGP7V3KKGKRCMNLHYDAZ4YN/graph.json","fetch_events":"https://pith.science/api/pith-number/322XGP7V3KKGKRCMNLHYDAZ4YN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/322XGP7V3KKGKRCMNLHYDAZ4YN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/322XGP7V3KKGKRCMNLHYDAZ4YN/action/storage_attestation","attest_author":"https://pith.science/pith/322XGP7V3KKGKRCMNLHYDAZ4YN/action/author_attestation","sign_citation":"https://pith.science/pith/322XGP7V3KKGKRCMNLHYDAZ4YN/action/citation_signature","submit_replication":"https://pith.science/pith/322XGP7V3KKGKRCMNLHYDAZ4YN/action/replication_record"}},"created_at":"2026-05-26T02:04:48.214053+00:00","updated_at":"2026-05-26T02:04:48.214053+00:00"}