{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:2NCFJL6REBYQOXCMUFGXNVVTKB","short_pith_number":"pith:2NCFJL6R","schema_version":"1.0","canonical_sha256":"d34454afd12071075c4ca14d76d6b3505e2b650dd2f9d0ec2a5085acef56a323","source":{"kind":"arxiv","id":"0903.5379","version":1},"attestation_state":"computed","paper":{"title":"A Bijection between well-labelled positive paths and matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bertrand Duplantier (IPHT), Olivier Bernardi (LM-Orsay), Philippe Nadeau","submitted_at":"2009-03-31T06:54:21Z","abstract_excerpt":"A well-labelled positive path of size n is a pair (p,\\sigma) made of a word p=p_1p_2...p_{n-1} on the alphabet {-1, 0,+1} such that the sum of the letters of any prefix is non-negative, together with a permutation \\sigma of {1,2,...,n} such that p_i=-1 implies \\sigma(i)<\\sigma(i+1), while p_i=1 implies \\sigma(i)>\\sigma(i+1). We establish a bijection between well-labelled positive paths of size $n$ and matchings (i.e. fixed-point free involutions) on {1,2,...,2n}. This proves that the number of well-labelled positive paths is (2n-1)!!. By specialising our bijection, we also prove that the numbe"},"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":"0903.5379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-03-31T06:54:21Z","cross_cats_sorted":[],"title_canon_sha256":"56420712ae07812c1db779173890392bade5bb3f65135e11254b90f041752dd9","abstract_canon_sha256":"33b5a70bcf73c80bf2838c4e6f515347d26a0c915c95e0ce779b1b4d51407728"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:00.774275Z","signature_b64":"u3wK0tWjBIvNv6oUPb0Tu8qrcG6m/YsBoUIdalHd1V6MT+wuO8oppS+W7OWBodj/QjTIJwhnOUKXiYqioldqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d34454afd12071075c4ca14d76d6b3505e2b650dd2f9d0ec2a5085acef56a323","last_reissued_at":"2026-05-18T04:40:00.773775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:00.773775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bijection between well-labelled positive paths and matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bertrand Duplantier (IPHT), Olivier Bernardi (LM-Orsay), Philippe Nadeau","submitted_at":"2009-03-31T06:54:21Z","abstract_excerpt":"A well-labelled positive path of size n is a pair (p,\\sigma) made of a word p=p_1p_2...p_{n-1} on the alphabet {-1, 0,+1} such that the sum of the letters of any prefix is non-negative, together with a permutation \\sigma of {1,2,...,n} such that p_i=-1 implies \\sigma(i)<\\sigma(i+1), while p_i=1 implies \\sigma(i)>\\sigma(i+1). We establish a bijection between well-labelled positive paths of size $n$ and matchings (i.e. fixed-point free involutions) on {1,2,...,2n}. This proves that the number of well-labelled positive paths is (2n-1)!!. By specialising our bijection, we also prove that the numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.5379","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":"0903.5379","created_at":"2026-05-18T04:40:00.773863+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.5379v1","created_at":"2026-05-18T04:40:00.773863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.5379","created_at":"2026-05-18T04:40:00.773863+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NCFJL6REBYQ","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NCFJL6REBYQOXCM","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NCFJL6R","created_at":"2026-05-18T12:25:58.018023+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/2NCFJL6REBYQOXCMUFGXNVVTKB","json":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB.json","graph_json":"https://pith.science/api/pith-number/2NCFJL6REBYQOXCMUFGXNVVTKB/graph.json","events_json":"https://pith.science/api/pith-number/2NCFJL6REBYQOXCMUFGXNVVTKB/events.json","paper":"https://pith.science/paper/2NCFJL6R"},"agent_actions":{"view_html":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB","download_json":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB.json","view_paper":"https://pith.science/paper/2NCFJL6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.5379&json=true","fetch_graph":"https://pith.science/api/pith-number/2NCFJL6REBYQOXCMUFGXNVVTKB/graph.json","fetch_events":"https://pith.science/api/pith-number/2NCFJL6REBYQOXCMUFGXNVVTKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/action/storage_attestation","attest_author":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/action/author_attestation","sign_citation":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/action/citation_signature","submit_replication":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/action/replication_record"}},"created_at":"2026-05-18T04:40:00.773863+00:00","updated_at":"2026-05-18T04:40:00.773863+00:00"}