{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EKO2QVKWWRWVYH7JUAMD6BHHUO","short_pith_number":"pith:EKO2QVKW","canonical_record":{"source":{"id":"1702.08125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-27T02:14:37Z","cross_cats_sorted":[],"title_canon_sha256":"47dc076cd1201c2ef64afda8c2d3717bcf7c893fbd7111abb90942ef5a5b48b6","abstract_canon_sha256":"01a07c21c71a553ff50d457490be0abf1ea00859d71d9dcfb173629d8f97581e"},"schema_version":"1.0"},"canonical_sha256":"229da85556b46d5c1fe9a0183f04e7a38b8f98f930b9151a870ea68ec5503622","source":{"kind":"arxiv","id":"1702.08125","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08125","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08125v1","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08125","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"EKO2QVKWWRWV","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKO2QVKWWRWVYH7J","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKO2QVKW","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EKO2QVKWWRWVYH7JUAMD6BHHUO","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-27T02:14:37Z","cross_cats_sorted":[],"title_canon_sha256":"47dc076cd1201c2ef64afda8c2d3717bcf7c893fbd7111abb90942ef5a5b48b6","abstract_canon_sha256":"01a07c21c71a553ff50d457490be0abf1ea00859d71d9dcfb173629d8f97581e"},"schema_version":"1.0"},"canonical_sha256":"229da85556b46d5c1fe9a0183f04e7a38b8f98f930b9151a870ea68ec5503622","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:55.922705Z","signature_b64":"DPSEcUl5pTSGyW6LI8PskjBeZqVPUFisUJQYWi2vZUm7peZQhJLwCrhriM1rNtCFZmykz2fHtR1JmB7bgVoHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229da85556b46d5c1fe9a0183f04e7a38b8f98f930b9151a870ea68ec5503622","last_reissued_at":"2026-05-18T00:49:55.921980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:55.921980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08125","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-18T00:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDWmluKiPwTIy5zQjrqlPPdkGKRndEG5/pcasqLqSDc7LaQ9FYNEV2n8wXR/CGCD2DsptS/AI18XQpKRjpamCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:39:28.282509Z"},"content_sha256":"082ff92d42b4a73007e13b854207b15a524096f7dc33ee5427d80f0956c8af95","schema_version":"1.0","event_id":"sha256:082ff92d42b4a73007e13b854207b15a524096f7dc33ee5427d80f0956c8af95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EKO2QVKWWRWVYH7JUAMD6BHHUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating functions for permutations which avoid consecutive patterns with multiple descents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey B. Remmel, Quang T. Bach","submitted_at":"2017-02-27T02:14:37Z","abstract_excerpt":"Let $S_n$ denote the group all permutations of $n$. For every permutation $\\sigma$, we let $\\mathrm{des}(\\sigma)$ denote the number of descents in $\\sigma$ and $\\mathrm{LRMin}(\\sigma)$ denote the number of left-to-right minima of $\\sigma$. Given a sequence $\\tau = \\tau_1 \\cdots \\tau_n$ of distinct positive integers, we define the reduction of $\\tau$, $\\mathrm{red}(\\tau)$, to be the permutation of $S_n$ that results by replacing the $i$-th smallest element of $\\tau$ by $i$.\n  If $\\Gamma$ is a set of permutations, we say that a permutation $\\sigma = \\sigma_1 \\ldots \\sigma_n \\in S_n$ has a $\\Gamm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08125","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-18T00:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7NhGAN8F1b0xpjTFIvpTnzn3CZrRjsa07NAOZCd8ZGVN15GIVJwaq//ivjN6oMMkk6J1F+qaK36S6JR6ioJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T00:39:28.282857Z"},"content_sha256":"ac40857df4a79851b0113d009ce1cef7b2ddc02fb299dcea3b5a5447f1fd0dc5","schema_version":"1.0","event_id":"sha256:ac40857df4a79851b0113d009ce1cef7b2ddc02fb299dcea3b5a5447f1fd0dc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKO2QVKWWRWVYH7JUAMD6BHHUO/bundle.json","state_url":"https://pith.science/pith/EKO2QVKWWRWVYH7JUAMD6BHHUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKO2QVKWWRWVYH7JUAMD6BHHUO/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-26T00:39:28Z","links":{"resolver":"https://pith.science/pith/EKO2QVKWWRWVYH7JUAMD6BHHUO","bundle":"https://pith.science/pith/EKO2QVKWWRWVYH7JUAMD6BHHUO/bundle.json","state":"https://pith.science/pith/EKO2QVKWWRWVYH7JUAMD6BHHUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKO2QVKWWRWVYH7JUAMD6BHHUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EKO2QVKWWRWVYH7JUAMD6BHHUO","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":"01a07c21c71a553ff50d457490be0abf1ea00859d71d9dcfb173629d8f97581e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-27T02:14:37Z","title_canon_sha256":"47dc076cd1201c2ef64afda8c2d3717bcf7c893fbd7111abb90942ef5a5b48b6"},"schema_version":"1.0","source":{"id":"1702.08125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08125","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08125v1","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08125","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"EKO2QVKWWRWV","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKO2QVKWWRWVYH7J","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKO2QVKW","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:ac40857df4a79851b0113d009ce1cef7b2ddc02fb299dcea3b5a5447f1fd0dc5","target":"graph","created_at":"2026-05-18T00:49:55Z","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":"Let $S_n$ denote the group all permutations of $n$. For every permutation $\\sigma$, we let $\\mathrm{des}(\\sigma)$ denote the number of descents in $\\sigma$ and $\\mathrm{LRMin}(\\sigma)$ denote the number of left-to-right minima of $\\sigma$. Given a sequence $\\tau = \\tau_1 \\cdots \\tau_n$ of distinct positive integers, we define the reduction of $\\tau$, $\\mathrm{red}(\\tau)$, to be the permutation of $S_n$ that results by replacing the $i$-th smallest element of $\\tau$ by $i$.\n  If $\\Gamma$ is a set of permutations, we say that a permutation $\\sigma = \\sigma_1 \\ldots \\sigma_n \\in S_n$ has a $\\Gamm","authors_text":"Jeffrey B. Remmel, Quang T. Bach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-27T02:14:37Z","title":"Generating functions for permutations which avoid consecutive patterns with multiple descents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08125","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:082ff92d42b4a73007e13b854207b15a524096f7dc33ee5427d80f0956c8af95","target":"record","created_at":"2026-05-18T00:49:55Z","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":"01a07c21c71a553ff50d457490be0abf1ea00859d71d9dcfb173629d8f97581e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-27T02:14:37Z","title_canon_sha256":"47dc076cd1201c2ef64afda8c2d3717bcf7c893fbd7111abb90942ef5a5b48b6"},"schema_version":"1.0","source":{"id":"1702.08125","kind":"arxiv","version":1}},"canonical_sha256":"229da85556b46d5c1fe9a0183f04e7a38b8f98f930b9151a870ea68ec5503622","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"229da85556b46d5c1fe9a0183f04e7a38b8f98f930b9151a870ea68ec5503622","first_computed_at":"2026-05-18T00:49:55.921980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:55.921980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DPSEcUl5pTSGyW6LI8PskjBeZqVPUFisUJQYWi2vZUm7peZQhJLwCrhriM1rNtCFZmykz2fHtR1JmB7bgVoHCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:55.922705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:082ff92d42b4a73007e13b854207b15a524096f7dc33ee5427d80f0956c8af95","sha256:ac40857df4a79851b0113d009ce1cef7b2ddc02fb299dcea3b5a5447f1fd0dc5"],"state_sha256":"ba11a1747b7bae085ac9d95cb104ab0342a7877d67091fbc96fd3b8ed7eddc32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjrERLGCefi/TonUDAsD2OZ9DFv7xUl++IX0B45K190qn0EROk+SfEN/4mQ2/3peKel/7JLWjNbPSVr/uVxLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T00:39:28.284890Z","bundle_sha256":"1860fc0600d60a39a61f07cd169c3513ab549812e4d5d7cd22abb21d4ec1a8a8"}}