{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:P5W6M6JJ3U3L2SBOE4OOO2XGKF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5b13f8c7bf1b0d92e1b3fd53753e84e3365decafe45e956f2121228f409211e6","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2026-07-31T10:06:00Z","title_canon_sha256":"95f9fe96ed6c51ec8031d8bdcebcf3a727b61296ffc0f2e744eeace06c8209bc"},"schema_version":"1.0","source":{"id":"2608.00117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00117","created_at":"2026-08-04T00:32:36Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00117v1","created_at":"2026-08-04T00:32:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00117","created_at":"2026-08-04T00:32:36Z"},{"alias_kind":"pith_short_12","alias_value":"P5W6M6JJ3U3L","created_at":"2026-08-04T00:32:36Z"},{"alias_kind":"pith_short_16","alias_value":"P5W6M6JJ3U3L2SBO","created_at":"2026-08-04T00:32:36Z"},{"alias_kind":"pith_short_8","alias_value":"P5W6M6JJ","created_at":"2026-08-04T00:32:36Z"}],"graph_snapshots":[{"event_id":"sha256:f8ed0a3363d1aa976d9d59db5c7b3c8b0ba3f45e1e784355bf058aa6949beade","target":"graph","created_at":"2026-08-04T00:32:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.00117/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove bijectively a recursive excision formula for maps of arbitrary topology. This yields the topological recursion formulae governing their enumeration, already at the level of formal generating series and without any analyticity assumption. We extend the result to maps carrying self-avoiding loop models and to stuffed maps, i.e. a variant of maps allowing faces of arbitrary topology. Our results give a precise combinatorial meaning to all terms of the (blobbed) topological recursion known for (stuffed) maps, including the recursion kernel, which had so far been missing. The construction ","authors_text":"Alessandro Giacetto, Ga\\\"etan Borot, Lasse Merkens","cross_cats":["math-ph","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2026-07-31T10:06:00Z","title":"A bijective topological recursion for maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00117","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6a1d99ada77f66033eaf19debc9c63cf22ce3bd79955a79fe5f0f16100e31270","target":"record","created_at":"2026-08-04T00:32:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5b13f8c7bf1b0d92e1b3fd53753e84e3365decafe45e956f2121228f409211e6","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2026-07-31T10:06:00Z","title_canon_sha256":"95f9fe96ed6c51ec8031d8bdcebcf3a727b61296ffc0f2e744eeace06c8209bc"},"schema_version":"1.0","source":{"id":"2608.00117","kind":"arxiv","version":1}},"canonical_sha256":"7f6de67929dd36bd482e271ce76ae651426e65323fcad24e8ef590f2ae019696","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f6de67929dd36bd482e271ce76ae651426e65323fcad24e8ef590f2ae019696","first_computed_at":"2026-08-04T00:32:36.299235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T00:32:36.299235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IDZKDSUfCGHMdXPBsR5toh3sEfYIlEUXKTP+6NX+RiKc9DqfFjtAXnm7IbtrnSEiioWmXR5fHvmcjVtlK3FvBQ==","signature_status":"signed_v1","signed_at":"2026-08-04T00:32:36.300673Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.00117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a1d99ada77f66033eaf19debc9c63cf22ce3bd79955a79fe5f0f16100e31270","sha256:f8ed0a3363d1aa976d9d59db5c7b3c8b0ba3f45e1e784355bf058aa6949beade"],"state_sha256":"deb22d8ba2c96d5720c0e02fb0ad756dbdb54d03fb1f73be7fa5e9b00e9bf98a"}