{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TLCO6C527P76SICH22SYMCDJ6V","short_pith_number":"pith:TLCO6C52","schema_version":"1.0","canonical_sha256":"9ac4ef0bbafbffe92047d6a5860869f5410ecaba2839eb983cb2179ebd03c9cc","source":{"kind":"arxiv","id":"1603.01422","version":1},"attestation_state":"computed","paper":{"title":"Short note on the number of 1-ascents in dispersed dyck paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dirk Oliver Theis, Kairi Kangro, Mozhgan Pourmoradnasseri","submitted_at":"2016-03-04T11:17:08Z","abstract_excerpt":"A dispersed Dyck path (DDP) of length n is a lattice path on $N\\times N$ from (0,0) to (n,0) in which the following steps are allowed: \"up\" (x, y) $\\to$ (x+1, y+1); \"down\" (x, y) $\\to$ (x+1, y-1); and \"right\" (x,0) $\\to$ (x+1,0). An ascent in a DDP is an inclusion-wise maximal sequence of consecutive up steps. A 1-ascent is an ascent consisting of exactly 1 up step. We give a closed formula for the total number of 1-ascents in all dispersed Dyck paths of length n, A191386 in Sloane's OEIS. Previously, only implicit generating function relations and asymptotics were known."},"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":"1603.01422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-04T11:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"04ac6d043716e053de7e137213d5120b6af9fc8a4d1c732f144b3830c5cb5548","abstract_canon_sha256":"c70cc27e92293a0b69361e5b86a3cd6f7da6f29a5afd501b671feb476888144f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:36.064509Z","signature_b64":"fVHls6mzQ0XTgAoeMPlJKPCZbPybv04ylmqsGNlbBEvaEl2EOSWNSzXYqkhtxajvJ/fT6O6polvWdrzVgGscDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ac4ef0bbafbffe92047d6a5860869f5410ecaba2839eb983cb2179ebd03c9cc","last_reissued_at":"2026-05-18T01:19:36.063921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:36.063921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short note on the number of 1-ascents in dispersed dyck paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dirk Oliver Theis, Kairi Kangro, Mozhgan Pourmoradnasseri","submitted_at":"2016-03-04T11:17:08Z","abstract_excerpt":"A dispersed Dyck path (DDP) of length n is a lattice path on $N\\times N$ from (0,0) to (n,0) in which the following steps are allowed: \"up\" (x, y) $\\to$ (x+1, y+1); \"down\" (x, y) $\\to$ (x+1, y-1); and \"right\" (x,0) $\\to$ (x+1,0). An ascent in a DDP is an inclusion-wise maximal sequence of consecutive up steps. A 1-ascent is an ascent consisting of exactly 1 up step. We give a closed formula for the total number of 1-ascents in all dispersed Dyck paths of length n, A191386 in Sloane's OEIS. Previously, only implicit generating function relations and asymptotics were known."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01422","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":"1603.01422","created_at":"2026-05-18T01:19:36.064020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01422v1","created_at":"2026-05-18T01:19:36.064020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01422","created_at":"2026-05-18T01:19:36.064020+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLCO6C527P76","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLCO6C527P76SICH","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLCO6C52","created_at":"2026-05-18T12:30:44.179134+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/TLCO6C527P76SICH22SYMCDJ6V","json":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V.json","graph_json":"https://pith.science/api/pith-number/TLCO6C527P76SICH22SYMCDJ6V/graph.json","events_json":"https://pith.science/api/pith-number/TLCO6C527P76SICH22SYMCDJ6V/events.json","paper":"https://pith.science/paper/TLCO6C52"},"agent_actions":{"view_html":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V","download_json":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V.json","view_paper":"https://pith.science/paper/TLCO6C52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01422&json=true","fetch_graph":"https://pith.science/api/pith-number/TLCO6C527P76SICH22SYMCDJ6V/graph.json","fetch_events":"https://pith.science/api/pith-number/TLCO6C527P76SICH22SYMCDJ6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V/action/storage_attestation","attest_author":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V/action/author_attestation","sign_citation":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V/action/citation_signature","submit_replication":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V/action/replication_record"}},"created_at":"2026-05-18T01:19:36.064020+00:00","updated_at":"2026-05-18T01:19:36.064020+00:00"}