{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GBL2G7WCXLK237EKEMLFS6DI2L","short_pith_number":"pith:GBL2G7WC","schema_version":"1.0","canonical_sha256":"3057a37ec2bad5adfc8a2316597868d2e1db9c031aa2be5e6c208b7231324b5d","source":{"kind":"arxiv","id":"1306.5428","version":1},"attestation_state":"computed","paper":{"title":"On Permutations with Bounded Drop Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joanna N. Chen, William Y.C. Chen","submitted_at":"2013-06-23T16:01:43Z","abstract_excerpt":"The maximum drop size of a permutation $\\pi$ of $[n]=\\{1,2,\\ldots, n\\}$ is defined to be the maximum value of $i-\\pi(i)$. Chung, Claesson, Dukes and Graham obtained polynomials $P_k(x)$ that can be used to determine the number of permutations of $[n]$ with $d$ descents and maximum drop size not larger than $k$. Furthermore, Chung and Graham gave combinatorial interpretations of the coefficients of $Q_k(x)=x^k P_k(x)$ and $R_{n,k}(x)=Q_k(x)(1+x+\\cdots+x^k)^{n-k}$, and raised the question of finding a bijective proof of the symmetry property of $R_{n,k}(x)$. In this paper, we establish a bijecti"},"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":"1306.5428","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-23T16:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"5c8512ec851905dcc096b634f9e262b85067a9f0cd15a4c8a4c07ea355062f4f","abstract_canon_sha256":"8327ae65c5e861561e49beab9f3a1165c9a22f3a5a47cc4059d6c96578e695b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:08.143555Z","signature_b64":"+r5LJKtdpfwiI+1i8TWJV/qI+iRsztrrH2lrD4iHSdg4O4cGxkNbNi72rc/D7jLXamEN+hmi/iGA39RV0sGxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3057a37ec2bad5adfc8a2316597868d2e1db9c031aa2be5e6c208b7231324b5d","last_reissued_at":"2026-05-18T03:20:08.142819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:08.142819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Permutations with Bounded Drop Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joanna N. Chen, William Y.C. Chen","submitted_at":"2013-06-23T16:01:43Z","abstract_excerpt":"The maximum drop size of a permutation $\\pi$ of $[n]=\\{1,2,\\ldots, n\\}$ is defined to be the maximum value of $i-\\pi(i)$. Chung, Claesson, Dukes and Graham obtained polynomials $P_k(x)$ that can be used to determine the number of permutations of $[n]$ with $d$ descents and maximum drop size not larger than $k$. Furthermore, Chung and Graham gave combinatorial interpretations of the coefficients of $Q_k(x)=x^k P_k(x)$ and $R_{n,k}(x)=Q_k(x)(1+x+\\cdots+x^k)^{n-k}$, and raised the question of finding a bijective proof of the symmetry property of $R_{n,k}(x)$. In this paper, we establish a bijecti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5428","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":"1306.5428","created_at":"2026-05-18T03:20:08.142942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5428v1","created_at":"2026-05-18T03:20:08.142942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5428","created_at":"2026-05-18T03:20:08.142942+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBL2G7WCXLK2","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBL2G7WCXLK237EK","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBL2G7WC","created_at":"2026-05-18T12:27:45.050594+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/GBL2G7WCXLK237EKEMLFS6DI2L","json":"https://pith.science/pith/GBL2G7WCXLK237EKEMLFS6DI2L.json","graph_json":"https://pith.science/api/pith-number/GBL2G7WCXLK237EKEMLFS6DI2L/graph.json","events_json":"https://pith.science/api/pith-number/GBL2G7WCXLK237EKEMLFS6DI2L/events.json","paper":"https://pith.science/paper/GBL2G7WC"},"agent_actions":{"view_html":"https://pith.science/pith/GBL2G7WCXLK237EKEMLFS6DI2L","download_json":"https://pith.science/pith/GBL2G7WCXLK237EKEMLFS6DI2L.json","view_paper":"https://pith.science/paper/GBL2G7WC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5428&json=true","fetch_graph":"https://pith.science/api/pith-number/GBL2G7WCXLK237EKEMLFS6DI2L/graph.json","fetch_events":"https://pith.science/api/pith-number/GBL2G7WCXLK237EKEMLFS6DI2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBL2G7WCXLK237EKEMLFS6DI2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBL2G7WCXLK237EKEMLFS6DI2L/action/storage_attestation","attest_author":"https://pith.science/pith/GBL2G7WCXLK237EKEMLFS6DI2L/action/author_attestation","sign_citation":"https://pith.science/pith/GBL2G7WCXLK237EKEMLFS6DI2L/action/citation_signature","submit_replication":"https://pith.science/pith/GBL2G7WCXLK237EKEMLFS6DI2L/action/replication_record"}},"created_at":"2026-05-18T03:20:08.142942+00:00","updated_at":"2026-05-18T03:20:08.142942+00:00"}