{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:NMZOLUZKM56JH2F7ZGTNT7BO3Z","short_pith_number":"pith:NMZOLUZK","schema_version":"1.0","canonical_sha256":"6b32e5d32a677c93e8bfc9a6d9fc2ede5cddaf6ef7f05d07ece9db4fec07d245","source":{"kind":"arxiv","id":"0705.3453","version":1},"attestation_state":"computed","paper":{"title":"Graphs on surfaces and Khovanov homology","license":"","headline":"","cross_cats":["math.CO","math.QA"],"primary_cat":"math.GT","authors_text":"Abhijit Champanerkar, Ilya Kofman, Neal Stoltzfus","submitted_at":"2007-05-23T19:50:53Z","abstract_excerpt":"Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$, there is an associated ribbon graph whose quasi-trees correspond bijectively to spanning trees of the graph obtained by checkerboard coloring $L$. This correspondence preserves the bigrading used for the spanning tree model of Khovanov homology, whose Euler characteristic is the Jones polynomial of $L$. Thus, Khovanov homology can be expressed in terms of ri"},"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":"0705.3453","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GT","submitted_at":"2007-05-23T19:50:53Z","cross_cats_sorted":["math.CO","math.QA"],"title_canon_sha256":"168138e662dbf34a399141d2cb981028ef1c97c7589ddc95c3e000995ea55eef","abstract_canon_sha256":"b4832adab9a8c378011f5ad44e73e10b5dca48699beb6558c83a142243692c97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:31.250388Z","signature_b64":"bEhGqxUSGjUeqcsQQk2/KudrGt2szWphX5SCrxYJkqPLpUMaPMjmwel6NNzCLz2WRgcYCkY24/S/8R9QUXmPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b32e5d32a677c93e8bfc9a6d9fc2ede5cddaf6ef7f05d07ece9db4fec07d245","last_reissued_at":"2026-05-18T01:22:31.249881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:31.249881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs on surfaces and Khovanov homology","license":"","headline":"","cross_cats":["math.CO","math.QA"],"primary_cat":"math.GT","authors_text":"Abhijit Champanerkar, Ilya Kofman, Neal Stoltzfus","submitted_at":"2007-05-23T19:50:53Z","abstract_excerpt":"Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$, there is an associated ribbon graph whose quasi-trees correspond bijectively to spanning trees of the graph obtained by checkerboard coloring $L$. This correspondence preserves the bigrading used for the spanning tree model of Khovanov homology, whose Euler characteristic is the Jones polynomial of $L$. Thus, Khovanov homology can be expressed in terms of ri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.3453","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":"0705.3453","created_at":"2026-05-18T01:22:31.249953+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.3453v1","created_at":"2026-05-18T01:22:31.249953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.3453","created_at":"2026-05-18T01:22:31.249953+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMZOLUZKM56J","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMZOLUZKM56JH2F7","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMZOLUZK","created_at":"2026-05-18T12:25:55.427421+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/NMZOLUZKM56JH2F7ZGTNT7BO3Z","json":"https://pith.science/pith/NMZOLUZKM56JH2F7ZGTNT7BO3Z.json","graph_json":"https://pith.science/api/pith-number/NMZOLUZKM56JH2F7ZGTNT7BO3Z/graph.json","events_json":"https://pith.science/api/pith-number/NMZOLUZKM56JH2F7ZGTNT7BO3Z/events.json","paper":"https://pith.science/paper/NMZOLUZK"},"agent_actions":{"view_html":"https://pith.science/pith/NMZOLUZKM56JH2F7ZGTNT7BO3Z","download_json":"https://pith.science/pith/NMZOLUZKM56JH2F7ZGTNT7BO3Z.json","view_paper":"https://pith.science/paper/NMZOLUZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.3453&json=true","fetch_graph":"https://pith.science/api/pith-number/NMZOLUZKM56JH2F7ZGTNT7BO3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/NMZOLUZKM56JH2F7ZGTNT7BO3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMZOLUZKM56JH2F7ZGTNT7BO3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMZOLUZKM56JH2F7ZGTNT7BO3Z/action/storage_attestation","attest_author":"https://pith.science/pith/NMZOLUZKM56JH2F7ZGTNT7BO3Z/action/author_attestation","sign_citation":"https://pith.science/pith/NMZOLUZKM56JH2F7ZGTNT7BO3Z/action/citation_signature","submit_replication":"https://pith.science/pith/NMZOLUZKM56JH2F7ZGTNT7BO3Z/action/replication_record"}},"created_at":"2026-05-18T01:22:31.249953+00:00","updated_at":"2026-05-18T01:22:31.249953+00:00"}