{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OLQRKLRLX3AHRKIVZ7OT2K655L","short_pith_number":"pith:OLQRKLRL","canonical_record":{"source":{"id":"1406.1709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T15:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"f668f6f1be5de272aa61ae8678efec2ae64412edcf5d6f1f57823de17ecd07d0","abstract_canon_sha256":"e56dad20eb28701985fc4bee51a54c41ac09a8f442002f267fb88ac2aee61ce1"},"schema_version":"1.0"},"canonical_sha256":"72e1152e2bbec078a915cfdd3d2bddeac3dc097fabb5d011a5f7c77f81a440ea","source":{"kind":"arxiv","id":"1406.1709","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1709","created_at":"2026-05-18T02:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1709v1","created_at":"2026-05-18T02:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1709","created_at":"2026-05-18T02:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"OLQRKLRLX3AH","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OLQRKLRLX3AHRKIV","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OLQRKLRL","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OLQRKLRLX3AHRKIVZ7OT2K655L","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T15:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"f668f6f1be5de272aa61ae8678efec2ae64412edcf5d6f1f57823de17ecd07d0","abstract_canon_sha256":"e56dad20eb28701985fc4bee51a54c41ac09a8f442002f267fb88ac2aee61ce1"},"schema_version":"1.0"},"canonical_sha256":"72e1152e2bbec078a915cfdd3d2bddeac3dc097fabb5d011a5f7c77f81a440ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:14.099553Z","signature_b64":"Nnt1JCsmONA586pYq5nBmF9QPrjFp4clntWTMLSwgecOv/31xhPiK0SAo/gentEN71QB2loR5cIKAuAM56OaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72e1152e2bbec078a915cfdd3d2bddeac3dc097fabb5d011a5f7c77f81a440ea","last_reissued_at":"2026-05-18T02:50:14.098932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:14.098932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1709","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-05-18T02:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TTMpmWb3aAtWnKDxbnwU+Jjp24tj3iDhtRxYybzunf4LBzfzsnv7nYa9UbKN9DkoIVOnvs4FNcBGYC2yFDMgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:45:46.811092Z"},"content_sha256":"92671e6760d3591bb893f96ed2c0ab25b56a0f9a52546f53c69c6ed5d8204f17","schema_version":"1.0","event_id":"sha256:92671e6760d3591bb893f96ed2c0ab25b56a0f9a52546f53c69c6ed5d8204f17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OLQRKLRLX3AHRKIVZ7OT2K655L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bijections for pairs of non-crossing lattice paths and walks in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergi Elizalde","submitted_at":"2014-06-06T15:29:58Z","abstract_excerpt":"It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more unfamiliar fact is that the analogous equality obtained by replacing single paths with k-tuples of non-crossing paths holds for every k. This result has appeared in the literature in different contexts involving plane partitions (where it was proved by Proctor), partially ordered sets, Young tableaux, and lattice walks, but no bijective proof for k>1 seems "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1709","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"},"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-05-18T02:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cv8aK6nBTwNnQSXlpcextCiwcGMr2E1CGulx2eHFVHclq1d1tKSsKAb8bdTy8EYndsSiUoTPj7EdHB/PebvsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:45:46.811812Z"},"content_sha256":"633a8ee29972208d5ca1ada6a0309ebb545765db84d134a87e72a92a6956158f","schema_version":"1.0","event_id":"sha256:633a8ee29972208d5ca1ada6a0309ebb545765db84d134a87e72a92a6956158f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLQRKLRLX3AHRKIVZ7OT2K655L/bundle.json","state_url":"https://pith.science/pith/OLQRKLRLX3AHRKIVZ7OT2K655L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLQRKLRLX3AHRKIVZ7OT2K655L/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-06-10T01:45:46Z","links":{"resolver":"https://pith.science/pith/OLQRKLRLX3AHRKIVZ7OT2K655L","bundle":"https://pith.science/pith/OLQRKLRLX3AHRKIVZ7OT2K655L/bundle.json","state":"https://pith.science/pith/OLQRKLRLX3AHRKIVZ7OT2K655L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLQRKLRLX3AHRKIVZ7OT2K655L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OLQRKLRLX3AHRKIVZ7OT2K655L","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":"e56dad20eb28701985fc4bee51a54c41ac09a8f442002f267fb88ac2aee61ce1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T15:29:58Z","title_canon_sha256":"f668f6f1be5de272aa61ae8678efec2ae64412edcf5d6f1f57823de17ecd07d0"},"schema_version":"1.0","source":{"id":"1406.1709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1709","created_at":"2026-05-18T02:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1709v1","created_at":"2026-05-18T02:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1709","created_at":"2026-05-18T02:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"OLQRKLRLX3AH","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OLQRKLRLX3AHRKIV","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OLQRKLRL","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:633a8ee29972208d5ca1ada6a0309ebb545765db84d134a87e72a92a6956158f","target":"graph","created_at":"2026-05-18T02:50:14Z","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"},"paper":{"abstract_excerpt":"It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more unfamiliar fact is that the analogous equality obtained by replacing single paths with k-tuples of non-crossing paths holds for every k. This result has appeared in the literature in different contexts involving plane partitions (where it was proved by Proctor), partially ordered sets, Young tableaux, and lattice walks, but no bijective proof for k>1 seems ","authors_text":"Sergi Elizalde","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T15:29:58Z","title":"Bijections for pairs of non-crossing lattice paths and walks in the plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1709","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:92671e6760d3591bb893f96ed2c0ab25b56a0f9a52546f53c69c6ed5d8204f17","target":"record","created_at":"2026-05-18T02:50:14Z","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":"e56dad20eb28701985fc4bee51a54c41ac09a8f442002f267fb88ac2aee61ce1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-06T15:29:58Z","title_canon_sha256":"f668f6f1be5de272aa61ae8678efec2ae64412edcf5d6f1f57823de17ecd07d0"},"schema_version":"1.0","source":{"id":"1406.1709","kind":"arxiv","version":1}},"canonical_sha256":"72e1152e2bbec078a915cfdd3d2bddeac3dc097fabb5d011a5f7c77f81a440ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72e1152e2bbec078a915cfdd3d2bddeac3dc097fabb5d011a5f7c77f81a440ea","first_computed_at":"2026-05-18T02:50:14.098932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:14.098932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nnt1JCsmONA586pYq5nBmF9QPrjFp4clntWTMLSwgecOv/31xhPiK0SAo/gentEN71QB2loR5cIKAuAM56OaCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:14.099553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92671e6760d3591bb893f96ed2c0ab25b56a0f9a52546f53c69c6ed5d8204f17","sha256:633a8ee29972208d5ca1ada6a0309ebb545765db84d134a87e72a92a6956158f"],"state_sha256":"8f8b72dd66ccbe75d093a7a7ed85b082be81ecaf5f50e83d34da1c9452b00bad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbcD9KJDG7Z0fBfAw1HnBl73NBKjuH3jxCNmRtqAKYqNg/2XbYXE8UBSFOTGdGv6SA3nVvVseZXMDXJx853zBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:45:46.815505Z","bundle_sha256":"e5cbba13d111b0c90aec69afab12352906c394355cf05d5db3ef30774354e533"}}