{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:F7UPNNSAXXFFIKW3OIFLYF3MQZ","short_pith_number":"pith:F7UPNNSA","schema_version":"1.0","canonical_sha256":"2fe8f6b640bdca542adb720abc176c867b684384471a54a5bfcfe6f951801260","source":{"kind":"arxiv","id":"0806.4300","version":1},"attestation_state":"computed","paper":{"title":"Proof of Ira Gessel's Lattice Path Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christoph Koutschan, Doron Zeilberger, Manuel Kauers","submitted_at":"2008-06-26T15:42:29Z","abstract_excerpt":"We present a computer-aided, yet fully rigorous, proof of Ira Gessel's tantalizingly simply-stated conjecture that the number of ways of walking $2n$ steps in the region $x+y \\geq 0, y \\geq 0$ of the square-lattice with unit steps in the east, west, north, and south directions, that start and end at the origin, equals $16^n\\frac{(5/6)_n(1/2)_n}{(5/3)_n(2)_n}$ ."},"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":"0806.4300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-06-26T15:42:29Z","cross_cats_sorted":[],"title_canon_sha256":"8e85a5215f370e2b376fd053fc79541808e873a7a6f7830f06c831dc1dee17fd","abstract_canon_sha256":"a738a803a9c4ee15493d83556156bc8a25b1d8c8dbd6add0a002ad31c51868b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:15:46.021513Z","signature_b64":"I3fk0Gg2yfnVI9Ct0Be9rbhhPVLZ6dCiekZkrWfV6tQ2YxsUpiTn0ogyBk8hE9HfJxg1ibYoN8uw/JEB5pvcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fe8f6b640bdca542adb720abc176c867b684384471a54a5bfcfe6f951801260","last_reissued_at":"2026-05-18T02:15:46.020770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:15:46.020770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proof of Ira Gessel's Lattice Path Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christoph Koutschan, Doron Zeilberger, Manuel Kauers","submitted_at":"2008-06-26T15:42:29Z","abstract_excerpt":"We present a computer-aided, yet fully rigorous, proof of Ira Gessel's tantalizingly simply-stated conjecture that the number of ways of walking $2n$ steps in the region $x+y \\geq 0, y \\geq 0$ of the square-lattice with unit steps in the east, west, north, and south directions, that start and end at the origin, equals $16^n\\frac{(5/6)_n(1/2)_n}{(5/3)_n(2)_n}$ ."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.4300","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":"0806.4300","created_at":"2026-05-18T02:15:46.020892+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.4300v1","created_at":"2026-05-18T02:15:46.020892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.4300","created_at":"2026-05-18T02:15:46.020892+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7UPNNSAXXFF","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7UPNNSAXXFFIKW3","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7UPNNSA","created_at":"2026-05-18T12:25:57.157939+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/F7UPNNSAXXFFIKW3OIFLYF3MQZ","json":"https://pith.science/pith/F7UPNNSAXXFFIKW3OIFLYF3MQZ.json","graph_json":"https://pith.science/api/pith-number/F7UPNNSAXXFFIKW3OIFLYF3MQZ/graph.json","events_json":"https://pith.science/api/pith-number/F7UPNNSAXXFFIKW3OIFLYF3MQZ/events.json","paper":"https://pith.science/paper/F7UPNNSA"},"agent_actions":{"view_html":"https://pith.science/pith/F7UPNNSAXXFFIKW3OIFLYF3MQZ","download_json":"https://pith.science/pith/F7UPNNSAXXFFIKW3OIFLYF3MQZ.json","view_paper":"https://pith.science/paper/F7UPNNSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.4300&json=true","fetch_graph":"https://pith.science/api/pith-number/F7UPNNSAXXFFIKW3OIFLYF3MQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/F7UPNNSAXXFFIKW3OIFLYF3MQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7UPNNSAXXFFIKW3OIFLYF3MQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7UPNNSAXXFFIKW3OIFLYF3MQZ/action/storage_attestation","attest_author":"https://pith.science/pith/F7UPNNSAXXFFIKW3OIFLYF3MQZ/action/author_attestation","sign_citation":"https://pith.science/pith/F7UPNNSAXXFFIKW3OIFLYF3MQZ/action/citation_signature","submit_replication":"https://pith.science/pith/F7UPNNSAXXFFIKW3OIFLYF3MQZ/action/replication_record"}},"created_at":"2026-05-18T02:15:46.020892+00:00","updated_at":"2026-05-18T02:15:46.020892+00:00"}