{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:LUBRAZBXIEIMKWCC2QON5CRD5R","short_pith_number":"pith:LUBRAZBX","canonical_record":{"source":{"id":"math/0601684","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-01-27T18:51:04Z","cross_cats_sorted":[],"title_canon_sha256":"f5ca885839bcfe1cce589119af233f4406df3c27426cc9b75aea36b53660d6cd","abstract_canon_sha256":"30751fdd11b5049093eedb499b309b3eb720347bef455efe86402a87075c5b56"},"schema_version":"1.0"},"canonical_sha256":"5d031064374110c55842d41cde8a23ec741cee08956b7552657110b42d28b4b0","source":{"kind":"arxiv","id":"math/0601684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0601684","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"arxiv_version","alias_value":"math/0601684v1","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601684","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"pith_short_12","alias_value":"LUBRAZBXIEIM","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"pith_short_16","alias_value":"LUBRAZBXIEIMKWCC","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"pith_short_8","alias_value":"LUBRAZBX","created_at":"2026-07-04T15:43:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:LUBRAZBXIEIMKWCC2QON5CRD5R","target":"record","payload":{"canonical_record":{"source":{"id":"math/0601684","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-01-27T18:51:04Z","cross_cats_sorted":[],"title_canon_sha256":"f5ca885839bcfe1cce589119af233f4406df3c27426cc9b75aea36b53660d6cd","abstract_canon_sha256":"30751fdd11b5049093eedb499b309b3eb720347bef455efe86402a87075c5b56"},"schema_version":"1.0"},"canonical_sha256":"5d031064374110c55842d41cde8a23ec741cee08956b7552657110b42d28b4b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:43:58.091776Z","signature_b64":"QWCW6RfR3osKWuNb/JPT316dG+G0LVseONgyg2qqLaSQgA+haJYucq6vFC0cu2/EIeExaI+HwVVdEFXHqmb+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d031064374110c55842d41cde8a23ec741cee08956b7552657110b42d28b4b0","last_reissued_at":"2026-07-04T15:43:58.091450Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:43:58.091450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0601684","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-07-04T15:43:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajd8+7m5AiJ5ev+Z8dQXTxz5g6DQpRHx8AsFiz/HiEEEwzH5h+hoz6UwRpGRR+JNjp412u1vnM2fMrXCtgDNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:17:43.398101Z"},"content_sha256":"cdbe8b4d0ae63c33254df769baaf0d8917aa93f13589030b30d80a6bba4f9aec","schema_version":"1.0","event_id":"sha256:cdbe8b4d0ae63c33254df769baaf0d8917aa93f13589030b30d80a6bba4f9aec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:LUBRAZBXIEIMKWCC2QON5CRD5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bijective counting of tree-rooted maps and shuffles of parenthesis systems","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Olivier Bernardi (LaBRI)","submitted_at":"2006-01-27T18:51:04Z","abstract_excerpt":"The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size $n$ is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains this result. We prove that our bijection is isomorphic to a former recursive construction on shuffles of parenthesis systems due to Cori, Dulucq and Viennot."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601684","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0601684/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"},"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-07-04T15:43:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W4c6PCvLIjYVdHUaMQRXHrsNEGbMbON8f04TWcOiqcUQsXOCdWxvBUqjqpT2nIPTAuDqnpUhuuszdiEtLLWmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T19:17:43.399040Z"},"content_sha256":"f6a3d19fdc6cfe9c24036e8ac6ed8b9c489c4a182e2c61986cd6d071bc1d9109","schema_version":"1.0","event_id":"sha256:f6a3d19fdc6cfe9c24036e8ac6ed8b9c489c4a182e2c61986cd6d071bc1d9109"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUBRAZBXIEIMKWCC2QON5CRD5R/bundle.json","state_url":"https://pith.science/pith/LUBRAZBXIEIMKWCC2QON5CRD5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUBRAZBXIEIMKWCC2QON5CRD5R/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-08-15T19:17:43Z","links":{"resolver":"https://pith.science/pith/LUBRAZBXIEIMKWCC2QON5CRD5R","bundle":"https://pith.science/pith/LUBRAZBXIEIMKWCC2QON5CRD5R/bundle.json","state":"https://pith.science/pith/LUBRAZBXIEIMKWCC2QON5CRD5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUBRAZBXIEIMKWCC2QON5CRD5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:LUBRAZBXIEIMKWCC2QON5CRD5R","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":"30751fdd11b5049093eedb499b309b3eb720347bef455efe86402a87075c5b56","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2006-01-27T18:51:04Z","title_canon_sha256":"f5ca885839bcfe1cce589119af233f4406df3c27426cc9b75aea36b53660d6cd"},"schema_version":"1.0","source":{"id":"math/0601684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0601684","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"arxiv_version","alias_value":"math/0601684v1","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601684","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"pith_short_12","alias_value":"LUBRAZBXIEIM","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"pith_short_16","alias_value":"LUBRAZBXIEIMKWCC","created_at":"2026-07-04T15:43:58Z"},{"alias_kind":"pith_short_8","alias_value":"LUBRAZBX","created_at":"2026-07-04T15:43:58Z"}],"graph_snapshots":[{"event_id":"sha256:f6a3d19fdc6cfe9c24036e8ac6ed8b9c489c4a182e2c61986cd6d071bc1d9109","target":"graph","created_at":"2026-07-04T15:43:58Z","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/math/0601684/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size $n$ is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains this result. We prove that our bijection is isomorphic to a former recursive construction on shuffles of parenthesis systems due to Cori, Dulucq and Viennot.","authors_text":"Olivier Bernardi (LaBRI)","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2006-01-27T18:51:04Z","title":"Bijective counting of tree-rooted maps and shuffles of parenthesis systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601684","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:cdbe8b4d0ae63c33254df769baaf0d8917aa93f13589030b30d80a6bba4f9aec","target":"record","created_at":"2026-07-04T15:43:58Z","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":"30751fdd11b5049093eedb499b309b3eb720347bef455efe86402a87075c5b56","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2006-01-27T18:51:04Z","title_canon_sha256":"f5ca885839bcfe1cce589119af233f4406df3c27426cc9b75aea36b53660d6cd"},"schema_version":"1.0","source":{"id":"math/0601684","kind":"arxiv","version":1}},"canonical_sha256":"5d031064374110c55842d41cde8a23ec741cee08956b7552657110b42d28b4b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d031064374110c55842d41cde8a23ec741cee08956b7552657110b42d28b4b0","first_computed_at":"2026-07-04T15:43:58.091450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:43:58.091450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QWCW6RfR3osKWuNb/JPT316dG+G0LVseONgyg2qqLaSQgA+haJYucq6vFC0cu2/EIeExaI+HwVVdEFXHqmb+Dw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:43:58.091776Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0601684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdbe8b4d0ae63c33254df769baaf0d8917aa93f13589030b30d80a6bba4f9aec","sha256:f6a3d19fdc6cfe9c24036e8ac6ed8b9c489c4a182e2c61986cd6d071bc1d9109"],"state_sha256":"f865e167f6f72132311c8d03c1aeb3b9eff5cbae7f98997a00c67aabeac8d49a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNftqI7tEN/DwNjemTc0bDGp/zmnz77aUaC65V1O8caone6wC6/Xrq+qyM/AvISnDtFqkcgksK6LhzhfJwo/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T19:17:43.405610Z","bundle_sha256":"eab55bbd7b02c3848e54628dd030294b9d61bbd684676e60182650ffe9e50f80"}}