{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TLCO6C527P76SICH22SYMCDJ6V","short_pith_number":"pith:TLCO6C52","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"},"canonical_sha256":"9ac4ef0bbafbffe92047d6a5860869f5410ecaba2839eb983cb2179ebd03c9cc","source":{"kind":"arxiv","id":"1603.01422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01422","created_at":"2026-05-18T01:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01422v1","created_at":"2026-05-18T01:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01422","created_at":"2026-05-18T01:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"TLCO6C527P76","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TLCO6C527P76SICH","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TLCO6C52","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TLCO6C527P76SICH22SYMCDJ6V","target":"record","payload":{"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"},"canonical_sha256":"9ac4ef0bbafbffe92047d6a5860869f5410ecaba2839eb983cb2179ebd03c9cc","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"},"source_kind":"arxiv","source_id":"1603.01422","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-18T01:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Btt+Z0wsNSB+lMlhXobvI22KYaHOqSLr2Yp0TE5k13ZF5U6u71SpfuJxfrA8743oPhhOcDFGOPxSLWHlgxtuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:56:46.818378Z"},"content_sha256":"0d48d08e87c84879b9683bad6ed4edc82144f909bdc550b4046c0a002d6f73a5","schema_version":"1.0","event_id":"sha256:0d48d08e87c84879b9683bad6ed4edc82144f909bdc550b4046c0a002d6f73a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TLCO6C527P76SICH22SYMCDJ6V","target":"graph","payload":{"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"},"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-18T01:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLIN5Y/DzZdf9IHybUzJshNsiEBacIg5mRp671noklH7VfTTi6/BDTm2MNxvrfWIfps98WpvIeJh1nvOdqIGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:56:46.818725Z"},"content_sha256":"366643a36c36b7cc6ff241defcd568e1224d75a0751d3911d513973cb85dab79","schema_version":"1.0","event_id":"sha256:366643a36c36b7cc6ff241defcd568e1224d75a0751d3911d513973cb85dab79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V/bundle.json","state_url":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLCO6C527P76SICH22SYMCDJ6V/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-02T22:56:46Z","links":{"resolver":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V","bundle":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V/bundle.json","state":"https://pith.science/pith/TLCO6C527P76SICH22SYMCDJ6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLCO6C527P76SICH22SYMCDJ6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TLCO6C527P76SICH22SYMCDJ6V","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":"c70cc27e92293a0b69361e5b86a3cd6f7da6f29a5afd501b671feb476888144f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-04T11:17:08Z","title_canon_sha256":"04ac6d043716e053de7e137213d5120b6af9fc8a4d1c732f144b3830c5cb5548"},"schema_version":"1.0","source":{"id":"1603.01422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01422","created_at":"2026-05-18T01:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01422v1","created_at":"2026-05-18T01:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01422","created_at":"2026-05-18T01:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"TLCO6C527P76","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TLCO6C527P76SICH","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TLCO6C52","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:366643a36c36b7cc6ff241defcd568e1224d75a0751d3911d513973cb85dab79","target":"graph","created_at":"2026-05-18T01:19:36Z","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":"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.","authors_text":"Dirk Oliver Theis, Kairi Kangro, Mozhgan Pourmoradnasseri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-04T11:17:08Z","title":"Short note on the number of 1-ascents in dispersed dyck paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01422","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:0d48d08e87c84879b9683bad6ed4edc82144f909bdc550b4046c0a002d6f73a5","target":"record","created_at":"2026-05-18T01:19:36Z","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":"c70cc27e92293a0b69361e5b86a3cd6f7da6f29a5afd501b671feb476888144f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-04T11:17:08Z","title_canon_sha256":"04ac6d043716e053de7e137213d5120b6af9fc8a4d1c732f144b3830c5cb5548"},"schema_version":"1.0","source":{"id":"1603.01422","kind":"arxiv","version":1}},"canonical_sha256":"9ac4ef0bbafbffe92047d6a5860869f5410ecaba2839eb983cb2179ebd03c9cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ac4ef0bbafbffe92047d6a5860869f5410ecaba2839eb983cb2179ebd03c9cc","first_computed_at":"2026-05-18T01:19:36.063921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:36.063921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fVHls6mzQ0XTgAoeMPlJKPCZbPybv04ylmqsGNlbBEvaEl2EOSWNSzXYqkhtxajvJ/fT6O6polvWdrzVgGscDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:36.064509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d48d08e87c84879b9683bad6ed4edc82144f909bdc550b4046c0a002d6f73a5","sha256:366643a36c36b7cc6ff241defcd568e1224d75a0751d3911d513973cb85dab79"],"state_sha256":"382870e48ec1b1a02d8e7b3f22b0d39de764aea7202350a2abf0833c2dd617b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crEFmEAjzKJS9hTEBh6YgI2sHs4Gm2xyJxbD+bFlQ2zAmj+LZ1NmTiRE5l0PWowog8sQSipsnKAsMtwGsY5BCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:56:46.820623Z","bundle_sha256":"59d790bb46af092dc95712beab61b6327fad1be8f09db9a93950038cba8eebbe"}}