{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FD6WHMG636I2ZX6DA5Z7GMM3EA","short_pith_number":"pith:FD6WHMG6","schema_version":"1.0","canonical_sha256":"28fd63b0dedf91acdfc30773f3319b2021926e3afc2619475c7a506faf4cabd9","source":{"kind":"arxiv","id":"1110.5014","version":7},"attestation_state":"computed","paper":{"title":"Enumeration of permutations by number of alternating runs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shi-Mei Ma","submitted_at":"2011-10-23T03:26:08Z","abstract_excerpt":"Let R(n,k) denote the number of permutations of {1,2,...,n} with k alternating runs. We find a grammatical description of the numbers R(n,k) and then present several convolution formulas involving the generating function for the numbers R(n,k). Moreover, we establish a connection between alternating runs and Andre permutations."},"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":"1110.5014","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-23T03:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"d373cdee6d59537f1196bd5f6b648e6ef7a38652c85c1ac63ca4412d5d7289a5","abstract_canon_sha256":"a321b8bfe94e4fda21ed40f883bb994f72e3528191c3325daf8b3049e1191240"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:51.123410Z","signature_b64":"OMn2TG/X5sM3AfxnZh66tCtZf8dR1VHHynzynCGoH0eBHVC9L0+AgbUGIy9j94Xe9e3qLgN5gftBSBykKQyGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28fd63b0dedf91acdfc30773f3319b2021926e3afc2619475c7a506faf4cabd9","last_reissued_at":"2026-05-18T03:39:51.122957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:51.122957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of permutations by number of alternating runs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shi-Mei Ma","submitted_at":"2011-10-23T03:26:08Z","abstract_excerpt":"Let R(n,k) denote the number of permutations of {1,2,...,n} with k alternating runs. We find a grammatical description of the numbers R(n,k) and then present several convolution formulas involving the generating function for the numbers R(n,k). Moreover, we establish a connection between alternating runs and Andre permutations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5014","kind":"arxiv","version":7},"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":"1110.5014","created_at":"2026-05-18T03:39:51.123017+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5014v7","created_at":"2026-05-18T03:39:51.123017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5014","created_at":"2026-05-18T03:39:51.123017+00:00"},{"alias_kind":"pith_short_12","alias_value":"FD6WHMG636I2","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FD6WHMG636I2ZX6D","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FD6WHMG6","created_at":"2026-05-18T12:26:28.662955+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/FD6WHMG636I2ZX6DA5Z7GMM3EA","json":"https://pith.science/pith/FD6WHMG636I2ZX6DA5Z7GMM3EA.json","graph_json":"https://pith.science/api/pith-number/FD6WHMG636I2ZX6DA5Z7GMM3EA/graph.json","events_json":"https://pith.science/api/pith-number/FD6WHMG636I2ZX6DA5Z7GMM3EA/events.json","paper":"https://pith.science/paper/FD6WHMG6"},"agent_actions":{"view_html":"https://pith.science/pith/FD6WHMG636I2ZX6DA5Z7GMM3EA","download_json":"https://pith.science/pith/FD6WHMG636I2ZX6DA5Z7GMM3EA.json","view_paper":"https://pith.science/paper/FD6WHMG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5014&json=true","fetch_graph":"https://pith.science/api/pith-number/FD6WHMG636I2ZX6DA5Z7GMM3EA/graph.json","fetch_events":"https://pith.science/api/pith-number/FD6WHMG636I2ZX6DA5Z7GMM3EA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FD6WHMG636I2ZX6DA5Z7GMM3EA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FD6WHMG636I2ZX6DA5Z7GMM3EA/action/storage_attestation","attest_author":"https://pith.science/pith/FD6WHMG636I2ZX6DA5Z7GMM3EA/action/author_attestation","sign_citation":"https://pith.science/pith/FD6WHMG636I2ZX6DA5Z7GMM3EA/action/citation_signature","submit_replication":"https://pith.science/pith/FD6WHMG636I2ZX6DA5Z7GMM3EA/action/replication_record"}},"created_at":"2026-05-18T03:39:51.123017+00:00","updated_at":"2026-05-18T03:39:51.123017+00:00"}