{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3CQ2M6LP3WKPHMGJFP7VRIQQBM","short_pith_number":"pith:3CQ2M6LP","canonical_record":{"source":{"id":"1810.00993","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T22:02:18Z","cross_cats_sorted":[],"title_canon_sha256":"22d3c302809eab8c5c42fe46494b216fba4180e104589af5bad097da35ee0016","abstract_canon_sha256":"775c9dde12436166b220ce43318e2114996d55eb1e88234ae1fda95759f9b067"},"schema_version":"1.0"},"canonical_sha256":"d8a1a6796fdd94f3b0c92bff58a2100b3d0b54fa17ead1ddcd2016625528a698","source":{"kind":"arxiv","id":"1810.00993","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00993","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00993v6","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00993","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"3CQ2M6LP3WKP","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3CQ2M6LP3WKPHMGJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3CQ2M6LP","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3CQ2M6LP3WKPHMGJFP7VRIQQBM","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00993","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T22:02:18Z","cross_cats_sorted":[],"title_canon_sha256":"22d3c302809eab8c5c42fe46494b216fba4180e104589af5bad097da35ee0016","abstract_canon_sha256":"775c9dde12436166b220ce43318e2114996d55eb1e88234ae1fda95759f9b067"},"schema_version":"1.0"},"canonical_sha256":"d8a1a6796fdd94f3b0c92bff58a2100b3d0b54fa17ead1ddcd2016625528a698","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:19.481819Z","signature_b64":"MMbJ0LYyz/9pYEQ9u9S+BI+clR/RXPGizyFe77LlYUKJuEpeDsaG17VoRb19kDyTH3VsberCj1xoK/UUmYOdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8a1a6796fdd94f3b0c92bff58a2100b3d0b54fa17ead1ddcd2016625528a698","last_reissued_at":"2026-05-17T23:51:19.481128Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:19.481128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00993","source_version":6,"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-17T23:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7epFi0ol8kAec5IY2PdkBaQ5KWhXXsOkBME/qXEQtnihOgtwe+BTlxsZbIePhY+xftUjXv9kbLibdJzzxywCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:58:35.972061Z"},"content_sha256":"9f7ce49c3009c11b4baa30c28ca5b86f80c5dc258b245a250d252799fa428120","schema_version":"1.0","event_id":"sha256:9f7ce49c3009c11b4baa30c28ca5b86f80c5dc258b245a250d252799fa428120"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3CQ2M6LP3WKPHMGJFP7VRIQQBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ballot Permutations and Odd Order Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sam Spiro","submitted_at":"2018-10-01T22:02:18Z","abstract_excerpt":"A permutation $\\pi$ is ballot if, for all $k$, the word $\\pi_1\\cdots \\pi_k$ has at least as many ascents as it has descents. Let $b(n)$ denote the number of ballot permutations of order $n$, and let $p(n)$ denote the number of permutations which have odd order in the symmetric group $S_n$. Callan conjectured that $b(n)=p(n)$ for all $n$, which was proved by Bernardi, Duplantier, and Nadeau.\n  We propose a refinement of Callan's original conjecture. Let $b(n,d)$ denote the number of ballot permutations with $d$ descents. Let $p(n,d)$ denote the number of odd order permutations with $M(\\pi)=d$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00993","kind":"arxiv","version":6},"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-17T23:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8hrIWCuO4ILe4wJEZZDt4t4Pz7WMCeDtc1B8ISCQa35wPMV2RLsW8nY5w1U23rkQkfpJUuqd3gqEp2v+g4PTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:58:35.972414Z"},"content_sha256":"e858eceb410581f83ebbfc173767db60c03767b8bfa27fa25e2a7b5c7d9da836","schema_version":"1.0","event_id":"sha256:e858eceb410581f83ebbfc173767db60c03767b8bfa27fa25e2a7b5c7d9da836"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CQ2M6LP3WKPHMGJFP7VRIQQBM/bundle.json","state_url":"https://pith.science/pith/3CQ2M6LP3WKPHMGJFP7VRIQQBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CQ2M6LP3WKPHMGJFP7VRIQQBM/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-26T16:58:35Z","links":{"resolver":"https://pith.science/pith/3CQ2M6LP3WKPHMGJFP7VRIQQBM","bundle":"https://pith.science/pith/3CQ2M6LP3WKPHMGJFP7VRIQQBM/bundle.json","state":"https://pith.science/pith/3CQ2M6LP3WKPHMGJFP7VRIQQBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CQ2M6LP3WKPHMGJFP7VRIQQBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3CQ2M6LP3WKPHMGJFP7VRIQQBM","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":"775c9dde12436166b220ce43318e2114996d55eb1e88234ae1fda95759f9b067","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T22:02:18Z","title_canon_sha256":"22d3c302809eab8c5c42fe46494b216fba4180e104589af5bad097da35ee0016"},"schema_version":"1.0","source":{"id":"1810.00993","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00993","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00993v6","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00993","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"3CQ2M6LP3WKP","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3CQ2M6LP3WKPHMGJ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3CQ2M6LP","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:e858eceb410581f83ebbfc173767db60c03767b8bfa27fa25e2a7b5c7d9da836","target":"graph","created_at":"2026-05-17T23:51:19Z","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 permutation $\\pi$ is ballot if, for all $k$, the word $\\pi_1\\cdots \\pi_k$ has at least as many ascents as it has descents. Let $b(n)$ denote the number of ballot permutations of order $n$, and let $p(n)$ denote the number of permutations which have odd order in the symmetric group $S_n$. Callan conjectured that $b(n)=p(n)$ for all $n$, which was proved by Bernardi, Duplantier, and Nadeau.\n  We propose a refinement of Callan's original conjecture. Let $b(n,d)$ denote the number of ballot permutations with $d$ descents. Let $p(n,d)$ denote the number of odd order permutations with $M(\\pi)=d$, ","authors_text":"Sam Spiro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T22:02:18Z","title":"Ballot Permutations and Odd Order Permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00993","kind":"arxiv","version":6},"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:9f7ce49c3009c11b4baa30c28ca5b86f80c5dc258b245a250d252799fa428120","target":"record","created_at":"2026-05-17T23:51:19Z","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":"775c9dde12436166b220ce43318e2114996d55eb1e88234ae1fda95759f9b067","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T22:02:18Z","title_canon_sha256":"22d3c302809eab8c5c42fe46494b216fba4180e104589af5bad097da35ee0016"},"schema_version":"1.0","source":{"id":"1810.00993","kind":"arxiv","version":6}},"canonical_sha256":"d8a1a6796fdd94f3b0c92bff58a2100b3d0b54fa17ead1ddcd2016625528a698","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8a1a6796fdd94f3b0c92bff58a2100b3d0b54fa17ead1ddcd2016625528a698","first_computed_at":"2026-05-17T23:51:19.481128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:19.481128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMbJ0LYyz/9pYEQ9u9S+BI+clR/RXPGizyFe77LlYUKJuEpeDsaG17VoRb19kDyTH3VsberCj1xoK/UUmYOdDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:19.481819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00993","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f7ce49c3009c11b4baa30c28ca5b86f80c5dc258b245a250d252799fa428120","sha256:e858eceb410581f83ebbfc173767db60c03767b8bfa27fa25e2a7b5c7d9da836"],"state_sha256":"5bb675a1ca676a82fe6868e3e97baa5883f715945265b18f7ce3c5ed40869a91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBaKsdzUfU29NWUaJbTScySrrHt9tEmAd0b/3EurcHyEMo2zlI7NMqalaByVeZo3zNNY9mwA0ft5aJlee0ujBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T16:58:35.974345Z","bundle_sha256":"1e565a2a9fe248539b22d7b4c4cf39091a1b609cec2839d2b8472cc1e9db0df7"}}