{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EFZYJGA5V6VUHQVIJOLXJ3POW2","short_pith_number":"pith:EFZYJGA5","schema_version":"1.0","canonical_sha256":"217384981dafab43c2a84b9774edeeb683bdaff3949856b63cda6c5ec99522fb","source":{"kind":"arxiv","id":"2104.10084","version":2},"attestation_state":"computed","paper":{"title":"Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"math.CO","authors_text":"Emmanuel Guitter, Gr\\'egory Miermont, J\\'er\\'emie Bouttier","submitted_at":"2021-04-20T16:07:39Z","abstract_excerpt":"We consider planar maps with three boundaries, colloquially called pairs of pants. In the case of bipartite maps with controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively by Collet and Fusy. In this paper, we obtain an even simpler formula for \\emph{tight} pairs of pants, namely for maps whose boundaries have minimal length in their homotopy class. We follow a bijective approach based on the slice decomposition, which we extend by introducing new fundamental building blocks called bigeodesic triangles and diangles, and by working"},"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":"2104.10084","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-04-20T16:07:39Z","cross_cats_sorted":["math-ph","math.MP","math.PR"],"title_canon_sha256":"307fd0e2bea89b7007fd3dfd891a832598f6046e094691235c98225c6a63efd8","abstract_canon_sha256":"7a9b6f41c296e4942a4d5c70a9b6e55642c0780538fa1c81e70a167a4b278dad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:59.907269Z","signature_b64":"M8ZyOsF9vSdRk1y7buZYovn0PvdbIJjlAmWe7CsWfD1i9fZ+Ql0skQLCScKdlst1qZmpLAIaBl8K9tUVDX/9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"217384981dafab43c2a84b9774edeeb683bdaff3949856b63cda6c5ec99522fb","last_reissued_at":"2026-07-05T05:18:59.906803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:59.906803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"math.CO","authors_text":"Emmanuel Guitter, Gr\\'egory Miermont, J\\'er\\'emie Bouttier","submitted_at":"2021-04-20T16:07:39Z","abstract_excerpt":"We consider planar maps with three boundaries, colloquially called pairs of pants. In the case of bipartite maps with controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively by Collet and Fusy. In this paper, we obtain an even simpler formula for \\emph{tight} pairs of pants, namely for maps whose boundaries have minimal length in their homotopy class. We follow a bijective approach based on the slice decomposition, which we extend by introducing new fundamental building blocks called bigeodesic triangles and diangles, and by working"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.10084","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.10084/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":"2104.10084","created_at":"2026-07-05T05:18:59.906866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.10084v2","created_at":"2026-07-05T05:18:59.906866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.10084","created_at":"2026-07-05T05:18:59.906866+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFZYJGA5V6VU","created_at":"2026-07-05T05:18:59.906866+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFZYJGA5V6VUHQVI","created_at":"2026-07-05T05:18:59.906866+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFZYJGA5","created_at":"2026-07-05T05:18:59.906866+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":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EFZYJGA5V6VUHQVIJOLXJ3POW2","json":"https://pith.science/pith/EFZYJGA5V6VUHQVIJOLXJ3POW2.json","graph_json":"https://pith.science/api/pith-number/EFZYJGA5V6VUHQVIJOLXJ3POW2/graph.json","events_json":"https://pith.science/api/pith-number/EFZYJGA5V6VUHQVIJOLXJ3POW2/events.json","paper":"https://pith.science/paper/EFZYJGA5"},"agent_actions":{"view_html":"https://pith.science/pith/EFZYJGA5V6VUHQVIJOLXJ3POW2","download_json":"https://pith.science/pith/EFZYJGA5V6VUHQVIJOLXJ3POW2.json","view_paper":"https://pith.science/paper/EFZYJGA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.10084&json=true","fetch_graph":"https://pith.science/api/pith-number/EFZYJGA5V6VUHQVIJOLXJ3POW2/graph.json","fetch_events":"https://pith.science/api/pith-number/EFZYJGA5V6VUHQVIJOLXJ3POW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFZYJGA5V6VUHQVIJOLXJ3POW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFZYJGA5V6VUHQVIJOLXJ3POW2/action/storage_attestation","attest_author":"https://pith.science/pith/EFZYJGA5V6VUHQVIJOLXJ3POW2/action/author_attestation","sign_citation":"https://pith.science/pith/EFZYJGA5V6VUHQVIJOLXJ3POW2/action/citation_signature","submit_replication":"https://pith.science/pith/EFZYJGA5V6VUHQVIJOLXJ3POW2/action/replication_record"}},"created_at":"2026-07-05T05:18:59.906866+00:00","updated_at":"2026-07-05T05:18:59.906866+00:00"}