{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:GSDRZH4JBLHSK2KV2TZIMLXZO4","short_pith_number":"pith:GSDRZH4J","schema_version":"1.0","canonical_sha256":"34871c9f890acf256955d4f2862ef97733b49bd8cac58ace903ffca7582bdcc3","source":{"kind":"arxiv","id":"0804.2930","version":2},"attestation_state":"computed","paper":{"title":"Pairs of Noncrossing Free Dyck Paths and Noncrossing Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ellen X.Y. Qu, Richard P. Stanley, Sabrina X.M. Pang, William Y.C. Chen","submitted_at":"2008-04-18T02:50:26Z","abstract_excerpt":"Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length $2n$ and noncrossing partitions of $[2n+1]$ with $n+1$ blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm."},"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":"0804.2930","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-04-18T02:50:26Z","cross_cats_sorted":[],"title_canon_sha256":"7d93d1870140f29d8a94a825e30b938b414c3866a99ce0355cfcf9a4116066d9","abstract_canon_sha256":"e538ed7949fe3850a74ea1979b8fbf1aca85e48357f9d964bfa91fa3cf1ea980"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:13:10.256204Z","signature_b64":"pd/OEKKitYdYoPEBElLvT1syX1X53foMdFBrjxMAi1WmmRLm92yJuFs+MTLRNU9SlreCOV6h3Iw5TmIwbjwzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34871c9f890acf256955d4f2862ef97733b49bd8cac58ace903ffca7582bdcc3","last_reissued_at":"2026-07-04T15:13:10.255765Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:13:10.255765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairs of Noncrossing Free Dyck Paths and Noncrossing Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ellen X.Y. Qu, Richard P. Stanley, Sabrina X.M. Pang, William Y.C. Chen","submitted_at":"2008-04-18T02:50:26Z","abstract_excerpt":"Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length $2n$ and noncrossing partitions of $[2n+1]$ with $n+1$ blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.2930","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/0804.2930/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":"0804.2930","created_at":"2026-07-04T15:13:10.255821+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.2930v2","created_at":"2026-07-04T15:13:10.255821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.2930","created_at":"2026-07-04T15:13:10.255821+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSDRZH4JBLHS","created_at":"2026-07-04T15:13:10.255821+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSDRZH4JBLHSK2KV","created_at":"2026-07-04T15:13:10.255821+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSDRZH4J","created_at":"2026-07-04T15:13:10.255821+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/GSDRZH4JBLHSK2KV2TZIMLXZO4","json":"https://pith.science/pith/GSDRZH4JBLHSK2KV2TZIMLXZO4.json","graph_json":"https://pith.science/api/pith-number/GSDRZH4JBLHSK2KV2TZIMLXZO4/graph.json","events_json":"https://pith.science/api/pith-number/GSDRZH4JBLHSK2KV2TZIMLXZO4/events.json","paper":"https://pith.science/paper/GSDRZH4J"},"agent_actions":{"view_html":"https://pith.science/pith/GSDRZH4JBLHSK2KV2TZIMLXZO4","download_json":"https://pith.science/pith/GSDRZH4JBLHSK2KV2TZIMLXZO4.json","view_paper":"https://pith.science/paper/GSDRZH4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.2930&json=true","fetch_graph":"https://pith.science/api/pith-number/GSDRZH4JBLHSK2KV2TZIMLXZO4/graph.json","fetch_events":"https://pith.science/api/pith-number/GSDRZH4JBLHSK2KV2TZIMLXZO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSDRZH4JBLHSK2KV2TZIMLXZO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSDRZH4JBLHSK2KV2TZIMLXZO4/action/storage_attestation","attest_author":"https://pith.science/pith/GSDRZH4JBLHSK2KV2TZIMLXZO4/action/author_attestation","sign_citation":"https://pith.science/pith/GSDRZH4JBLHSK2KV2TZIMLXZO4/action/citation_signature","submit_replication":"https://pith.science/pith/GSDRZH4JBLHSK2KV2TZIMLXZO4/action/replication_record"}},"created_at":"2026-07-04T15:13:10.255821+00:00","updated_at":"2026-07-04T15:13:10.255821+00:00"}