{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3D5DKASJZAN3R6X7VL76PZWSJZ","short_pith_number":"pith:3D5DKASJ","schema_version":"1.0","canonical_sha256":"d8fa350249c81bb8faffaaffe7e6d24e46041752ee1a1dae918bfbe7ecc5ae63","source":{"kind":"arxiv","id":"1003.5301","version":2},"attestation_state":"computed","paper":{"title":"A note on 2-distant noncrossing partitions and weighted Motzkin paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ira M. Gessel, Jang Soo Kim","submitted_at":"2010-03-27T14:18:23Z","abstract_excerpt":"We prove a conjecture of Drake and Kim: the number of $2$-distant noncrossing partitions of $\\{1,2,...,n\\}$ is equal to the sum of weights of Motzkin paths of length $n$, where the weight of a Motzkin path is a product of certain fractions involving Fibonacci numbers. We provide two proofs of their conjecture: one uses continued fractions and the other is combinatorial."},"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":"1003.5301","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-27T14:18:23Z","cross_cats_sorted":[],"title_canon_sha256":"7a909f19c4b19f4004234df4b907feb3e61054b614426e22634be02b31b14bb0","abstract_canon_sha256":"5930d38497fd28d47245b720d6cfd72be0d535ae81005c71870b78e3dd432f1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:22.123256Z","signature_b64":"h8BnpEEyKr77x1VnZif+zkbBHr2hoSBKikevB5jCKcOJ2YEFw0wJcEh3q69Xzl5Hl4oD7Z6WapuusLztOF8oAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8fa350249c81bb8faffaaffe7e6d24e46041752ee1a1dae918bfbe7ecc5ae63","last_reissued_at":"2026-05-18T04:37:22.122865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:22.122865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on 2-distant noncrossing partitions and weighted Motzkin paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ira M. Gessel, Jang Soo Kim","submitted_at":"2010-03-27T14:18:23Z","abstract_excerpt":"We prove a conjecture of Drake and Kim: the number of $2$-distant noncrossing partitions of $\\{1,2,...,n\\}$ is equal to the sum of weights of Motzkin paths of length $n$, where the weight of a Motzkin path is a product of certain fractions involving Fibonacci numbers. We provide two proofs of their conjecture: one uses continued fractions and the other is combinatorial."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5301","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":""},"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":"1003.5301","created_at":"2026-05-18T04:37:22.122916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.5301v2","created_at":"2026-05-18T04:37:22.122916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5301","created_at":"2026-05-18T04:37:22.122916+00:00"},{"alias_kind":"pith_short_12","alias_value":"3D5DKASJZAN3","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3D5DKASJZAN3R6X7","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3D5DKASJ","created_at":"2026-05-18T12:26:03.138858+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/3D5DKASJZAN3R6X7VL76PZWSJZ","json":"https://pith.science/pith/3D5DKASJZAN3R6X7VL76PZWSJZ.json","graph_json":"https://pith.science/api/pith-number/3D5DKASJZAN3R6X7VL76PZWSJZ/graph.json","events_json":"https://pith.science/api/pith-number/3D5DKASJZAN3R6X7VL76PZWSJZ/events.json","paper":"https://pith.science/paper/3D5DKASJ"},"agent_actions":{"view_html":"https://pith.science/pith/3D5DKASJZAN3R6X7VL76PZWSJZ","download_json":"https://pith.science/pith/3D5DKASJZAN3R6X7VL76PZWSJZ.json","view_paper":"https://pith.science/paper/3D5DKASJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.5301&json=true","fetch_graph":"https://pith.science/api/pith-number/3D5DKASJZAN3R6X7VL76PZWSJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3D5DKASJZAN3R6X7VL76PZWSJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3D5DKASJZAN3R6X7VL76PZWSJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3D5DKASJZAN3R6X7VL76PZWSJZ/action/storage_attestation","attest_author":"https://pith.science/pith/3D5DKASJZAN3R6X7VL76PZWSJZ/action/author_attestation","sign_citation":"https://pith.science/pith/3D5DKASJZAN3R6X7VL76PZWSJZ/action/citation_signature","submit_replication":"https://pith.science/pith/3D5DKASJZAN3R6X7VL76PZWSJZ/action/replication_record"}},"created_at":"2026-05-18T04:37:22.122916+00:00","updated_at":"2026-05-18T04:37:22.122916+00:00"}