{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SIMLYBFCNJCYMU3OSSSS7QT2J7","short_pith_number":"pith:SIMLYBFC","schema_version":"1.0","canonical_sha256":"9218bc04a26a4586536e94a52fc27a4fcbcd90f14232fd727c6d525753069c93","source":{"kind":"arxiv","id":"1502.00981","version":2},"attestation_state":"computed","paper":{"title":"Blobbed topological recursion: properties and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Ga\\\"etan Borot, Sergey Shadrin","submitted_at":"2015-02-03T19:51:34Z","abstract_excerpt":"We study the set of solutions $(\\omega_{g,n})_{g \\geq 0,n \\geq 1}$ of abstract loop equations. We prove that $\\omega_{g,n}$ is determined by its purely holomorphic part: this results in a decomposition that we call \"blobbed topological recursion\". This is a generalization of the theory of the topological recursion, in which the initial data $(\\omega_{0,1},\\omega_{0,2})$ is enriched by non-zero symmetric holomorphic forms in $n$ variables $(\\phi_{g,n})_{2g - 2 + n > 0}$. In particular, we establish for any solution of abstract loop equations: (1) a graphical representation of $\\omega_{g,n}$ in "},"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":"1502.00981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2015-02-03T19:51:34Z","cross_cats_sorted":["math.MP"],"title_canon_sha256":"5c4938a6be4ece1c69dad787bb8d6a61110635029d6917b1c5e7d035bfc42fa3","abstract_canon_sha256":"ef0bd29589bd986b28b64f0c6b2027bbca8e68f4e43077c6dfd9acb01185869e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:48.972552Z","signature_b64":"bPSR1qfh+fE1K4ccmwdGmrazqHO2EU74SqY5E3AISfrNAIa8LaF88N8/C3C4nH/Lpx7XPuHOuBFsb66/BmV6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9218bc04a26a4586536e94a52fc27a4fcbcd90f14232fd727c6d525753069c93","last_reissued_at":"2026-05-18T00:37:48.971993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:48.971993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blobbed topological recursion: properties and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Ga\\\"etan Borot, Sergey Shadrin","submitted_at":"2015-02-03T19:51:34Z","abstract_excerpt":"We study the set of solutions $(\\omega_{g,n})_{g \\geq 0,n \\geq 1}$ of abstract loop equations. We prove that $\\omega_{g,n}$ is determined by its purely holomorphic part: this results in a decomposition that we call \"blobbed topological recursion\". This is a generalization of the theory of the topological recursion, in which the initial data $(\\omega_{0,1},\\omega_{0,2})$ is enriched by non-zero symmetric holomorphic forms in $n$ variables $(\\phi_{g,n})_{2g - 2 + n > 0}$. In particular, we establish for any solution of abstract loop equations: (1) a graphical representation of $\\omega_{g,n}$ in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00981","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":"1502.00981","created_at":"2026-05-18T00:37:48.972075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00981v2","created_at":"2026-05-18T00:37:48.972075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00981","created_at":"2026-05-18T00:37:48.972075+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIMLYBFCNJCY","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIMLYBFCNJCYMU3O","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIMLYBFC","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00117","citing_title":"A bijective topological recursion for maps","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SIMLYBFCNJCYMU3OSSSS7QT2J7","json":"https://pith.science/pith/SIMLYBFCNJCYMU3OSSSS7QT2J7.json","graph_json":"https://pith.science/api/pith-number/SIMLYBFCNJCYMU3OSSSS7QT2J7/graph.json","events_json":"https://pith.science/api/pith-number/SIMLYBFCNJCYMU3OSSSS7QT2J7/events.json","paper":"https://pith.science/paper/SIMLYBFC"},"agent_actions":{"view_html":"https://pith.science/pith/SIMLYBFCNJCYMU3OSSSS7QT2J7","download_json":"https://pith.science/pith/SIMLYBFCNJCYMU3OSSSS7QT2J7.json","view_paper":"https://pith.science/paper/SIMLYBFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00981&json=true","fetch_graph":"https://pith.science/api/pith-number/SIMLYBFCNJCYMU3OSSSS7QT2J7/graph.json","fetch_events":"https://pith.science/api/pith-number/SIMLYBFCNJCYMU3OSSSS7QT2J7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIMLYBFCNJCYMU3OSSSS7QT2J7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIMLYBFCNJCYMU3OSSSS7QT2J7/action/storage_attestation","attest_author":"https://pith.science/pith/SIMLYBFCNJCYMU3OSSSS7QT2J7/action/author_attestation","sign_citation":"https://pith.science/pith/SIMLYBFCNJCYMU3OSSSS7QT2J7/action/citation_signature","submit_replication":"https://pith.science/pith/SIMLYBFCNJCYMU3OSSSS7QT2J7/action/replication_record"}},"created_at":"2026-05-18T00:37:48.972075+00:00","updated_at":"2026-05-18T00:37:48.972075+00:00"}