{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:AWBYCSD2UG5O6CSIYBLC3JPSO6","short_pith_number":"pith:AWBYCSD2","canonical_record":{"source":{"id":"0905.0609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-05T13:58:16Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e82d2d56d3708e34db669ded1d4986f57a61d684e039f2150090c3dde6be0a86","abstract_canon_sha256":"feebcdb7a38bdad6e8a549282be9e5029448196ae9f4dda1f1857c474d854240"},"schema_version":"1.0"},"canonical_sha256":"058381487aa1baef0a48c0562da5f277898d264b1b2d30201bebbc3aca188f75","source":{"kind":"arxiv","id":"0905.0609","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.0609","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"0905.0609v2","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0609","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"AWBYCSD2UG5O","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"pith_short_16","alias_value":"AWBYCSD2UG5O6CSI","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"pith_short_8","alias_value":"AWBYCSD2","created_at":"2026-07-04T15:45:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:AWBYCSD2UG5O6CSIYBLC3JPSO6","target":"record","payload":{"canonical_record":{"source":{"id":"0905.0609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-05T13:58:16Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e82d2d56d3708e34db669ded1d4986f57a61d684e039f2150090c3dde6be0a86","abstract_canon_sha256":"feebcdb7a38bdad6e8a549282be9e5029448196ae9f4dda1f1857c474d854240"},"schema_version":"1.0"},"canonical_sha256":"058381487aa1baef0a48c0562da5f277898d264b1b2d30201bebbc3aca188f75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:45:09.235727Z","signature_b64":"ebNzet2Doetq5u8ulj1PB33Rh+X3ZHDjP8PEMdlsoKmHd6v4R5OVz3v2h7UosarJyUzNiV+ZU9vLxZBmc4DBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"058381487aa1baef0a48c0562da5f277898d264b1b2d30201bebbc3aca188f75","last_reissued_at":"2026-07-04T15:45:09.235361Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:45:09.235361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.0609","source_version":2,"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-04T15:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22jSiynkXgiL0Byg01XubBs5c+FgGrYWTQU2JFytErpa5olueTzXHAZtEsu80eebNOk8+l41Njf+szYoBbpbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:39:01.338469Z"},"content_sha256":"f29f6791b28544c8894c1a483086675b33b4d639702e3fc7eb3f264d678f9be5","schema_version":"1.0","event_id":"sha256:f29f6791b28544c8894c1a483086675b33b4d639702e3fc7eb3f264d678f9be5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:AWBYCSD2UG5O6CSIYBLC3JPSO6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting nondecreasing integer sequences that lie below a barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Herbert S. Wilf, Robin Pemantle","submitted_at":"2009-05-05T13:58:16Z","abstract_excerpt":"Given a barrier $0 \\leq b_0 \\leq b_1 \\leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \\leq a_0 \\leq a_1 \\leq ... \\leq a_n$ for which $a_j \\leq b_j$ for all $0 \\leq j \\leq n$. Known formul\\ae for $f(n)$ include an $n \\times n$ determinant whose entries are binomial coefficients (Kreweras, 1965) and, in the special case of $b_j = rj+s$, a short explicit formula (Proctor, 1988, p.320). A relatively easy bivariate recursion, decomposing all sequences according to $n$ and $a_n$, leads to a bivariate generating function, then a univariate generating function, then a linear r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0609","kind":"arxiv","version":2},"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/0905.0609/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-04T15:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZTWCna4/PPXa/smqor+Zdi9uZvpq3lMhkKsdN+iCibCNG5bsUQ7Ht2Kht6LPGSTz5uxADsZhi0/ANk3nbbwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:39:01.338838Z"},"content_sha256":"ad5ca9df083335a404fef40d33b8b933874d79d18ea01fdea0b8e4eefd637dc0","schema_version":"1.0","event_id":"sha256:ad5ca9df083335a404fef40d33b8b933874d79d18ea01fdea0b8e4eefd637dc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWBYCSD2UG5O6CSIYBLC3JPSO6/bundle.json","state_url":"https://pith.science/pith/AWBYCSD2UG5O6CSIYBLC3JPSO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWBYCSD2UG5O6CSIYBLC3JPSO6/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-05T07:39:01Z","links":{"resolver":"https://pith.science/pith/AWBYCSD2UG5O6CSIYBLC3JPSO6","bundle":"https://pith.science/pith/AWBYCSD2UG5O6CSIYBLC3JPSO6/bundle.json","state":"https://pith.science/pith/AWBYCSD2UG5O6CSIYBLC3JPSO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWBYCSD2UG5O6CSIYBLC3JPSO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:AWBYCSD2UG5O6CSIYBLC3JPSO6","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":"feebcdb7a38bdad6e8a549282be9e5029448196ae9f4dda1f1857c474d854240","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-05T13:58:16Z","title_canon_sha256":"e82d2d56d3708e34db669ded1d4986f57a61d684e039f2150090c3dde6be0a86"},"schema_version":"1.0","source":{"id":"0905.0609","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.0609","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"0905.0609v2","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0609","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"AWBYCSD2UG5O","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"pith_short_16","alias_value":"AWBYCSD2UG5O6CSI","created_at":"2026-07-04T15:45:09Z"},{"alias_kind":"pith_short_8","alias_value":"AWBYCSD2","created_at":"2026-07-04T15:45:09Z"}],"graph_snapshots":[{"event_id":"sha256:ad5ca9df083335a404fef40d33b8b933874d79d18ea01fdea0b8e4eefd637dc0","target":"graph","created_at":"2026-07-04T15:45:09Z","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/0905.0609/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a barrier $0 \\leq b_0 \\leq b_1 \\leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \\leq a_0 \\leq a_1 \\leq ... \\leq a_n$ for which $a_j \\leq b_j$ for all $0 \\leq j \\leq n$. Known formul\\ae for $f(n)$ include an $n \\times n$ determinant whose entries are binomial coefficients (Kreweras, 1965) and, in the special case of $b_j = rj+s$, a short explicit formula (Proctor, 1988, p.320). A relatively easy bivariate recursion, decomposing all sequences according to $n$ and $a_n$, leads to a bivariate generating function, then a univariate generating function, then a linear r","authors_text":"Herbert S. Wilf, Robin Pemantle","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-05T13:58:16Z","title":"Counting nondecreasing integer sequences that lie below a barrier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0609","kind":"arxiv","version":2},"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:f29f6791b28544c8894c1a483086675b33b4d639702e3fc7eb3f264d678f9be5","target":"record","created_at":"2026-07-04T15:45:09Z","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":"feebcdb7a38bdad6e8a549282be9e5029448196ae9f4dda1f1857c474d854240","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-05T13:58:16Z","title_canon_sha256":"e82d2d56d3708e34db669ded1d4986f57a61d684e039f2150090c3dde6be0a86"},"schema_version":"1.0","source":{"id":"0905.0609","kind":"arxiv","version":2}},"canonical_sha256":"058381487aa1baef0a48c0562da5f277898d264b1b2d30201bebbc3aca188f75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"058381487aa1baef0a48c0562da5f277898d264b1b2d30201bebbc3aca188f75","first_computed_at":"2026-07-04T15:45:09.235361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:45:09.235361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ebNzet2Doetq5u8ulj1PB33Rh+X3ZHDjP8PEMdlsoKmHd6v4R5OVz3v2h7UosarJyUzNiV+ZU9vLxZBmc4DBCg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:45:09.235727Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.0609","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f29f6791b28544c8894c1a483086675b33b4d639702e3fc7eb3f264d678f9be5","sha256:ad5ca9df083335a404fef40d33b8b933874d79d18ea01fdea0b8e4eefd637dc0"],"state_sha256":"a64138d08bfe8831ac83fbc4cb843c07db46b3ee534fe62e13fd8846a0d61ceb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcarFJ/C4qiBgehsTnEB+Vz30+UBCmYf0gI4197eZw7pTar0Zoug66M55sPOEhbRx0wTAK69YRq7ccUAXGlyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:39:01.340732Z","bundle_sha256":"4f29825a5da30ce1ec36e106518aa125aabbf31a4a32947962d8dcded0c3c6f0"}}