{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4GCJJLXKIB3EZBM7YMLP5BCHWE","short_pith_number":"pith:4GCJJLXK","canonical_record":{"source":{"id":"1910.09844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-22T09:02:05Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"6d450c1b325b4f87e86c234bfc7fec596695861aae56c410a453867f99ee1058","abstract_canon_sha256":"287fa10cea6c6bd97feeb2ce75a56dd62dacb952924dcb4fed83280ddb53448e"},"schema_version":"1.0"},"canonical_sha256":"e18494aeea40764c859fc316fe8447b103fc4a7e07df420ec49cd9908f491da2","source":{"kind":"arxiv","id":"1910.09844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.09844","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1910.09844v1","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09844","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"4GCJJLXKIB3E","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"pith_short_16","alias_value":"4GCJJLXKIB3EZBM7","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"pith_short_8","alias_value":"4GCJJLXK","created_at":"2026-07-05T00:14:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4GCJJLXKIB3EZBM7YMLP5BCHWE","target":"record","payload":{"canonical_record":{"source":{"id":"1910.09844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-22T09:02:05Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"6d450c1b325b4f87e86c234bfc7fec596695861aae56c410a453867f99ee1058","abstract_canon_sha256":"287fa10cea6c6bd97feeb2ce75a56dd62dacb952924dcb4fed83280ddb53448e"},"schema_version":"1.0"},"canonical_sha256":"e18494aeea40764c859fc316fe8447b103fc4a7e07df420ec49cd9908f491da2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:14:02.999009Z","signature_b64":"rLr/7YQCUEdFhX+fiXUwlZ6/pSsBXwZdmAZtfu6nDxKH6dg9jWwc8+GZTyWe/PYgc4kE6Wase05+Hmnuf+d6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e18494aeea40764c859fc316fe8447b103fc4a7e07df420ec49cd9908f491da2","last_reissued_at":"2026-07-05T00:14:02.998650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:14:02.998650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.09844","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-07-05T00:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UaKphqiOQhjh39lIg8gFYNzZngSvbITqoGfeThEfZVPWgqm5D6IMpjZ2pRrteMTCiFiXVBL/hzJVnKegb8HRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:05:15.090205Z"},"content_sha256":"7f3140a14bae400273c7edb7ff7161181a6e717b4f2f695142db1fc8702dee2c","schema_version":"1.0","event_id":"sha256:7f3140a14bae400273c7edb7ff7161181a6e717b4f2f695142db1fc8702dee2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4GCJJLXKIB3EZBM7YMLP5BCHWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattice paths inside a table: Rows and columns linear combinations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Mohammad Farrokhi Derakhshandeh Ghouchan","submitted_at":"2019-10-22T09:02:05Z","abstract_excerpt":"A lattice path inside the $m\\times n$ table $T$ is a sequence $\\nu_1,\\ldots,\\nu_k$ of cells such that $\\nu_{j+1}-\\nu_j\\in\\{(1,-1),(1,0),(1,1)\\}$ for all $j=1,\\ldots,k-1$. The number of lattice paths in $T$ from the first column to the $(x,y)$-cell is written into that cell. We present a precise description of the minimal linear recurrences among rows, columns, and columns sums. As a result, we obtain several formulas for the number of all lattice paths from the first column to the last column of $T$, that is, the $n^{th}$ column sum. Our methods are based on three classes of operators, which w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.09844","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.09844/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"},"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-07-05T00:14:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GA1Dok24PEh8L2xgplNubafixnB0fMBlg9BA2h29fseIw21iGIDGe8oo8GQ9o4uPJRK+912oV+wlHmfKT7X9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:05:15.090598Z"},"content_sha256":"8d07c76396afd7050eb6a3e1a93f2d4b5a7550c9f2c201d19e04e1be97aa2ef4","schema_version":"1.0","event_id":"sha256:8d07c76396afd7050eb6a3e1a93f2d4b5a7550c9f2c201d19e04e1be97aa2ef4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GCJJLXKIB3EZBM7YMLP5BCHWE/bundle.json","state_url":"https://pith.science/pith/4GCJJLXKIB3EZBM7YMLP5BCHWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GCJJLXKIB3EZBM7YMLP5BCHWE/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-07-05T08:05:15Z","links":{"resolver":"https://pith.science/pith/4GCJJLXKIB3EZBM7YMLP5BCHWE","bundle":"https://pith.science/pith/4GCJJLXKIB3EZBM7YMLP5BCHWE/bundle.json","state":"https://pith.science/pith/4GCJJLXKIB3EZBM7YMLP5BCHWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GCJJLXKIB3EZBM7YMLP5BCHWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4GCJJLXKIB3EZBM7YMLP5BCHWE","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":"287fa10cea6c6bd97feeb2ce75a56dd62dacb952924dcb4fed83280ddb53448e","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-22T09:02:05Z","title_canon_sha256":"6d450c1b325b4f87e86c234bfc7fec596695861aae56c410a453867f99ee1058"},"schema_version":"1.0","source":{"id":"1910.09844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.09844","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"arxiv_version","alias_value":"1910.09844v1","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09844","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"pith_short_12","alias_value":"4GCJJLXKIB3E","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"pith_short_16","alias_value":"4GCJJLXKIB3EZBM7","created_at":"2026-07-05T00:14:02Z"},{"alias_kind":"pith_short_8","alias_value":"4GCJJLXK","created_at":"2026-07-05T00:14:02Z"}],"graph_snapshots":[{"event_id":"sha256:8d07c76396afd7050eb6a3e1a93f2d4b5a7550c9f2c201d19e04e1be97aa2ef4","target":"graph","created_at":"2026-07-05T00:14:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.09844/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A lattice path inside the $m\\times n$ table $T$ is a sequence $\\nu_1,\\ldots,\\nu_k$ of cells such that $\\nu_{j+1}-\\nu_j\\in\\{(1,-1),(1,0),(1,1)\\}$ for all $j=1,\\ldots,k-1$. The number of lattice paths in $T$ from the first column to the $(x,y)$-cell is written into that cell. We present a precise description of the minimal linear recurrences among rows, columns, and columns sums. As a result, we obtain several formulas for the number of all lattice paths from the first column to the last column of $T$, that is, the $n^{th}$ column sum. Our methods are based on three classes of operators, which w","authors_text":"Mohammad Farrokhi Derakhshandeh Ghouchan","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-22T09:02:05Z","title":"Lattice paths inside a table: Rows and columns linear combinations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.09844","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:7f3140a14bae400273c7edb7ff7161181a6e717b4f2f695142db1fc8702dee2c","target":"record","created_at":"2026-07-05T00:14:02Z","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":"287fa10cea6c6bd97feeb2ce75a56dd62dacb952924dcb4fed83280ddb53448e","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-22T09:02:05Z","title_canon_sha256":"6d450c1b325b4f87e86c234bfc7fec596695861aae56c410a453867f99ee1058"},"schema_version":"1.0","source":{"id":"1910.09844","kind":"arxiv","version":1}},"canonical_sha256":"e18494aeea40764c859fc316fe8447b103fc4a7e07df420ec49cd9908f491da2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e18494aeea40764c859fc316fe8447b103fc4a7e07df420ec49cd9908f491da2","first_computed_at":"2026-07-05T00:14:02.998650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:14:02.998650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rLr/7YQCUEdFhX+fiXUwlZ6/pSsBXwZdmAZtfu6nDxKH6dg9jWwc8+GZTyWe/PYgc4kE6Wase05+Hmnuf+d6BA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:14:02.999009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.09844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f3140a14bae400273c7edb7ff7161181a6e717b4f2f695142db1fc8702dee2c","sha256:8d07c76396afd7050eb6a3e1a93f2d4b5a7550c9f2c201d19e04e1be97aa2ef4"],"state_sha256":"a8d08dea4b6b8e4b5a5f2b3578ca1709a8663edcf3c36f4748132870318f6534"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sO539BEQ2WuSnGzqusx3ujHtzi2ev/O8hL/5HqV5NGp90E19wjKMmTw8ImmDgQLe93mFdP0AK4saKrRZ6NfICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:05:15.092676Z","bundle_sha256":"94b682414e26d21dfde71c6131761e7c14d190b31292de5e3c7b4ce8259b2b47"}}