{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FGK4P43H57WRUY4G4WK6M4DKIM","short_pith_number":"pith:FGK4P43H","schema_version":"1.0","canonical_sha256":"2995c7f367efed1a6386e595e6706a4312194f846d73d27e017db2ecd6870922","source":{"kind":"arxiv","id":"1301.7714","version":1},"attestation_state":"computed","paper":{"title":"Even and Odd Pairs of Lattice Paths with Multiple Intersections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ira M. Gessel, Walter Shur","submitted_at":"2013-01-31T18:29:15Z","abstract_excerpt":"Let M(n,k,r,s) be the number of ordered paths in the plane, with unit steps E or N, that intersect k times in which the first path ends at the point (r,n-r) and the second path ends at the point (s,n-s). Our main object of study in this paper is the sum of the numbers M(n,k,r,s) over r and s where r+s is fixed. We consider even and odd values of r+s separately, and we derive a simpler formula for M(n,k,r,s) than previously appeared in the literature."},"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":"1301.7714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-31T18:29:15Z","cross_cats_sorted":[],"title_canon_sha256":"3e2d6aa3af4231db5fc72eec5afd556959c457bf0c7c4e6d2359bfdf3c5f0654","abstract_canon_sha256":"699b2fed02d01f7b55a7152084dd934825f6a8d27d14c390aecc1bd5867991ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:48.862544Z","signature_b64":"wrRGMmPsTwJtSNuIlNB6TyNyErPPJ6Mfa+8irxQ+60zF1PlghmSNKqQ3taZgcy678Z49KTVuJ2ZmN4V6NCimBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2995c7f367efed1a6386e595e6706a4312194f846d73d27e017db2ecd6870922","last_reissued_at":"2026-05-18T03:34:48.861976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:48.861976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Even and Odd Pairs of Lattice Paths with Multiple Intersections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ira M. Gessel, Walter Shur","submitted_at":"2013-01-31T18:29:15Z","abstract_excerpt":"Let M(n,k,r,s) be the number of ordered paths in the plane, with unit steps E or N, that intersect k times in which the first path ends at the point (r,n-r) and the second path ends at the point (s,n-s). Our main object of study in this paper is the sum of the numbers M(n,k,r,s) over r and s where r+s is fixed. We consider even and odd values of r+s separately, and we derive a simpler formula for M(n,k,r,s) than previously appeared in the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7714","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":"1301.7714","created_at":"2026-05-18T03:34:48.862087+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7714v1","created_at":"2026-05-18T03:34:48.862087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7714","created_at":"2026-05-18T03:34:48.862087+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGK4P43H57WR","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGK4P43H57WRUY4G","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGK4P43H","created_at":"2026-05-18T12:27:45.050594+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/FGK4P43H57WRUY4G4WK6M4DKIM","json":"https://pith.science/pith/FGK4P43H57WRUY4G4WK6M4DKIM.json","graph_json":"https://pith.science/api/pith-number/FGK4P43H57WRUY4G4WK6M4DKIM/graph.json","events_json":"https://pith.science/api/pith-number/FGK4P43H57WRUY4G4WK6M4DKIM/events.json","paper":"https://pith.science/paper/FGK4P43H"},"agent_actions":{"view_html":"https://pith.science/pith/FGK4P43H57WRUY4G4WK6M4DKIM","download_json":"https://pith.science/pith/FGK4P43H57WRUY4G4WK6M4DKIM.json","view_paper":"https://pith.science/paper/FGK4P43H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7714&json=true","fetch_graph":"https://pith.science/api/pith-number/FGK4P43H57WRUY4G4WK6M4DKIM/graph.json","fetch_events":"https://pith.science/api/pith-number/FGK4P43H57WRUY4G4WK6M4DKIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGK4P43H57WRUY4G4WK6M4DKIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGK4P43H57WRUY4G4WK6M4DKIM/action/storage_attestation","attest_author":"https://pith.science/pith/FGK4P43H57WRUY4G4WK6M4DKIM/action/author_attestation","sign_citation":"https://pith.science/pith/FGK4P43H57WRUY4G4WK6M4DKIM/action/citation_signature","submit_replication":"https://pith.science/pith/FGK4P43H57WRUY4G4WK6M4DKIM/action/replication_record"}},"created_at":"2026-05-18T03:34:48.862087+00:00","updated_at":"2026-05-18T03:34:48.862087+00:00"}