{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BWGNWBIZ5EUIGBPY4SJBQMGA4J","short_pith_number":"pith:BWGNWBIZ","schema_version":"1.0","canonical_sha256":"0d8cdb0519e9288305f8e4921830c0e261b63b09eb2802c5d9679887cf729c76","source":{"kind":"arxiv","id":"1803.10920","version":3},"attestation_state":"computed","paper":{"title":"Lattice Walk Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bryan Ek","submitted_at":"2018-03-29T04:35:10Z","abstract_excerpt":"Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for automatically describing generating functions of walks restricted to any step set in a 2D lattice. We always obtain a closed system of relations for generating functions of walks that are bounded, semi-bounded, or unbounded. For bounded walks, this leads to explicit rational solutions! For semi-bounded or unbounded walks, we may get lucky and obtain algebraic"},"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":"1803.10920","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-29T04:35:10Z","cross_cats_sorted":[],"title_canon_sha256":"7f9eb9c61a6d79c9c4013a2e63fee7cc962151edc685c08854257312efa5fbb6","abstract_canon_sha256":"61e2befa2da7b68ba33fac39473722be075373a17166e12f0d589370aa77f85a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:25.082746Z","signature_b64":"rh/ZeFSMt8GqcQhOIqsEJcbdsHdCxgCW/PUVbyLROnXtwORDJCUV7KGC2Z3GZqcZzBf2MiX/plzHTXHMUyzwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d8cdb0519e9288305f8e4921830c0e261b63b09eb2802c5d9679887cf729c76","last_reissued_at":"2026-05-18T00:18:25.082121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:25.082121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattice Walk Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bryan Ek","submitted_at":"2018-03-29T04:35:10Z","abstract_excerpt":"Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for automatically describing generating functions of walks restricted to any step set in a 2D lattice. We always obtain a closed system of relations for generating functions of walks that are bounded, semi-bounded, or unbounded. For bounded walks, this leads to explicit rational solutions! For semi-bounded or unbounded walks, we may get lucky and obtain algebraic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10920","kind":"arxiv","version":3},"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":"1803.10920","created_at":"2026-05-18T00:18:25.082201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10920v3","created_at":"2026-05-18T00:18:25.082201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10920","created_at":"2026-05-18T00:18:25.082201+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWGNWBIZ5EUI","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWGNWBIZ5EUIGBPY","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWGNWBIZ","created_at":"2026-05-18T12:32:16.446611+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/BWGNWBIZ5EUIGBPY4SJBQMGA4J","json":"https://pith.science/pith/BWGNWBIZ5EUIGBPY4SJBQMGA4J.json","graph_json":"https://pith.science/api/pith-number/BWGNWBIZ5EUIGBPY4SJBQMGA4J/graph.json","events_json":"https://pith.science/api/pith-number/BWGNWBIZ5EUIGBPY4SJBQMGA4J/events.json","paper":"https://pith.science/paper/BWGNWBIZ"},"agent_actions":{"view_html":"https://pith.science/pith/BWGNWBIZ5EUIGBPY4SJBQMGA4J","download_json":"https://pith.science/pith/BWGNWBIZ5EUIGBPY4SJBQMGA4J.json","view_paper":"https://pith.science/paper/BWGNWBIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10920&json=true","fetch_graph":"https://pith.science/api/pith-number/BWGNWBIZ5EUIGBPY4SJBQMGA4J/graph.json","fetch_events":"https://pith.science/api/pith-number/BWGNWBIZ5EUIGBPY4SJBQMGA4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWGNWBIZ5EUIGBPY4SJBQMGA4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWGNWBIZ5EUIGBPY4SJBQMGA4J/action/storage_attestation","attest_author":"https://pith.science/pith/BWGNWBIZ5EUIGBPY4SJBQMGA4J/action/author_attestation","sign_citation":"https://pith.science/pith/BWGNWBIZ5EUIGBPY4SJBQMGA4J/action/citation_signature","submit_replication":"https://pith.science/pith/BWGNWBIZ5EUIGBPY4SJBQMGA4J/action/replication_record"}},"created_at":"2026-05-18T00:18:25.082201+00:00","updated_at":"2026-05-18T00:18:25.082201+00:00"}