{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:2NCFJL6REBYQOXCMUFGXNVVTKB","short_pith_number":"pith:2NCFJL6R","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"},"canonical_sha256":"d34454afd12071075c4ca14d76d6b3505e2b650dd2f9d0ec2a5085acef56a323","source":{"kind":"arxiv","id":"0903.5379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.5379","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"0903.5379v1","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.5379","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"2NCFJL6REBYQ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2NCFJL6REBYQOXCM","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2NCFJL6R","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:2NCFJL6REBYQOXCMUFGXNVVTKB","target":"record","payload":{"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"},"canonical_sha256":"d34454afd12071075c4ca14d76d6b3505e2b650dd2f9d0ec2a5085acef56a323","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"},"source_kind":"arxiv","source_id":"0903.5379","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPgojHcqwQCb26KKn0s7MJe4TkbW+bxjiAwvNh3oQii9xe8tnagVtCYTb/TvfVIgCP7/t2XXjg8dK51Pp4eKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:09:55.321175Z"},"content_sha256":"330b0e19bd7a00c9132747ec3e44ac96074be2ab76f39e232cd772b7f0898ba2","schema_version":"1.0","event_id":"sha256:330b0e19bd7a00c9132747ec3e44ac96074be2ab76f39e232cd772b7f0898ba2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:2NCFJL6REBYQOXCMUFGXNVVTKB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wzxigmr7h+6AUfP+8WZfe7o8y3DAUvCqQjO/GpDuhwnY/HkC69u2kL7EAukXPCBN1PpBhsAVGfYSothtbNMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:09:55.321531Z"},"content_sha256":"a271502c0a799e0a80f18113e6947addf8ee662834405b913ad4bc22e1e44258","schema_version":"1.0","event_id":"sha256:a271502c0a799e0a80f18113e6947addf8ee662834405b913ad4bc22e1e44258"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/bundle.json","state_url":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T23:09:55Z","links":{"resolver":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB","bundle":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/bundle.json","state":"https://pith.science/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NCFJL6REBYQOXCMUFGXNVVTKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:2NCFJL6REBYQOXCMUFGXNVVTKB","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":"33b5a70bcf73c80bf2838c4e6f515347d26a0c915c95e0ce779b1b4d51407728","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-03-31T06:54:21Z","title_canon_sha256":"56420712ae07812c1db779173890392bade5bb3f65135e11254b90f041752dd9"},"schema_version":"1.0","source":{"id":"0903.5379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.5379","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"0903.5379v1","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.5379","created_at":"2026-05-18T04:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"2NCFJL6REBYQ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2NCFJL6REBYQOXCM","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2NCFJL6R","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:a271502c0a799e0a80f18113e6947addf8ee662834405b913ad4bc22e1e44258","target":"graph","created_at":"2026-05-18T04:40:00Z","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"},"paper":{"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","authors_text":"Bertrand Duplantier (IPHT), Olivier Bernardi (LM-Orsay), Philippe Nadeau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-03-31T06:54:21Z","title":"A Bijection between well-labelled positive paths and matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.5379","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:330b0e19bd7a00c9132747ec3e44ac96074be2ab76f39e232cd772b7f0898ba2","target":"record","created_at":"2026-05-18T04:40:00Z","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":"33b5a70bcf73c80bf2838c4e6f515347d26a0c915c95e0ce779b1b4d51407728","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-03-31T06:54:21Z","title_canon_sha256":"56420712ae07812c1db779173890392bade5bb3f65135e11254b90f041752dd9"},"schema_version":"1.0","source":{"id":"0903.5379","kind":"arxiv","version":1}},"canonical_sha256":"d34454afd12071075c4ca14d76d6b3505e2b650dd2f9d0ec2a5085acef56a323","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d34454afd12071075c4ca14d76d6b3505e2b650dd2f9d0ec2a5085acef56a323","first_computed_at":"2026-05-18T04:40:00.773775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:00.773775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u3wK0tWjBIvNv6oUPb0Tu8qrcG6m/YsBoUIdalHd1V6MT+wuO8oppS+W7OWBodj/QjTIJwhnOUKXiYqioldqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:00.774275Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.5379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:330b0e19bd7a00c9132747ec3e44ac96074be2ab76f39e232cd772b7f0898ba2","sha256:a271502c0a799e0a80f18113e6947addf8ee662834405b913ad4bc22e1e44258"],"state_sha256":"b55dd90e36649ab2d27e0bcd9880ed1761c30ffe6880ab3ca1a6769e88b060f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+Fm2GHlX2z/fC2hfmlYK5uMZyCU2ngzm30uOdeypIkvGK/NzQ3HbHszkC/YG0jvI3sQ40rHaFo8Wn6Cu1goBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:09:55.323457Z","bundle_sha256":"977bf96c818d1043d800b5919f265c8899425bf6ba8632115507f20a38348ba8"}}