{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:45MBNNTSHBQX4UWP53M7RC32HX","short_pith_number":"pith:45MBNNTS","canonical_record":{"source":{"id":"0912.0573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-03T03:43:43Z","cross_cats_sorted":[],"title_canon_sha256":"7a14a2f654e85822ee2fb3463b479e91acaa20b75f51e0563ecb65cbb813c988","abstract_canon_sha256":"0ba54115d257ac81a09cbe0e5cc575dc90c22568beb7245b9c948f2abd1a2786"},"schema_version":"1.0"},"canonical_sha256":"e75816b67238617e52cfeed9f88b7a3de09eb8207fb4bc2da51c0b7dc5f14294","source":{"kind":"arxiv","id":"0912.0573","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0573","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0573v1","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0573","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"45MBNNTSHBQX","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"45MBNNTSHBQX4UWP","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"45MBNNTS","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:45MBNNTSHBQX4UWP53M7RC32HX","target":"record","payload":{"canonical_record":{"source":{"id":"0912.0573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-03T03:43:43Z","cross_cats_sorted":[],"title_canon_sha256":"7a14a2f654e85822ee2fb3463b479e91acaa20b75f51e0563ecb65cbb813c988","abstract_canon_sha256":"0ba54115d257ac81a09cbe0e5cc575dc90c22568beb7245b9c948f2abd1a2786"},"schema_version":"1.0"},"canonical_sha256":"e75816b67238617e52cfeed9f88b7a3de09eb8207fb4bc2da51c0b7dc5f14294","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:13.874665Z","signature_b64":"BTqX7wSmIXUH3T8Rb6izQGtehJDlw5XY+meWfwrpFknAqUfgZJH67B+x/+c+KBlKOqoUNdWyfAs+oxvoEpCbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e75816b67238617e52cfeed9f88b7a3de09eb8207fb4bc2da51c0b7dc5f14294","last_reissued_at":"2026-05-18T02:50:13.874016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:13.874016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.0573","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-18T02:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T487Ig+K2BdbxNiUdQWlfSq183guE6BsS4OIGMyAYiAb1pwma8cNE+/4MXBg/O2tPz9CDKeDU5tnjKN3dVHvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:24:06.212358Z"},"content_sha256":"398d262162f9cd72054596c233da2cc4bb081cabd3d9f03c374e8069d3092b4a","schema_version":"1.0","event_id":"sha256:398d262162f9cd72054596c233da2cc4bb081cabd3d9f03c374e8069d3092b4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:45MBNNTSHBQX4UWP53M7RC32HX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumeration by kernel positions for strongly Bernoulli type truncation games on words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G\\'abor Hetyei","submitted_at":"2009-12-03T03:43:43Z","abstract_excerpt":"We find the winning strategy for a class of truncation games played on words. As a consequence of the present author's recent results on some of these games we obtain new formulas for Bernoulli numbers and polynomials of the second kind and a new combinatorial model for the number of connected permutations of given rank. For connected permutations, the decomposition used to find the winning strategy is shown to be bijectively equivalent to King's decomposition, used to recursively generate a transposition Gray code of the connected permutations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0573","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-18T02:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0l6nxAAN/iqBFvHNcvX0EkP2I/Kk+QUrAA61EiNXV/w9S02yWMyXQ7pRNmjRaHFCZI++QSNp7HXZIxQNpvOQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:24:06.212897Z"},"content_sha256":"198de18b221a372a3e4c85d9d1d720af897b03f7fd0cb8ac5657f703506b5f46","schema_version":"1.0","event_id":"sha256:198de18b221a372a3e4c85d9d1d720af897b03f7fd0cb8ac5657f703506b5f46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45MBNNTSHBQX4UWP53M7RC32HX/bundle.json","state_url":"https://pith.science/pith/45MBNNTSHBQX4UWP53M7RC32HX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45MBNNTSHBQX4UWP53M7RC32HX/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-02T01:24:06Z","links":{"resolver":"https://pith.science/pith/45MBNNTSHBQX4UWP53M7RC32HX","bundle":"https://pith.science/pith/45MBNNTSHBQX4UWP53M7RC32HX/bundle.json","state":"https://pith.science/pith/45MBNNTSHBQX4UWP53M7RC32HX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45MBNNTSHBQX4UWP53M7RC32HX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:45MBNNTSHBQX4UWP53M7RC32HX","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":"0ba54115d257ac81a09cbe0e5cc575dc90c22568beb7245b9c948f2abd1a2786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-03T03:43:43Z","title_canon_sha256":"7a14a2f654e85822ee2fb3463b479e91acaa20b75f51e0563ecb65cbb813c988"},"schema_version":"1.0","source":{"id":"0912.0573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0573","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0573v1","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0573","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"45MBNNTSHBQX","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"45MBNNTSHBQX4UWP","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"45MBNNTS","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:198de18b221a372a3e4c85d9d1d720af897b03f7fd0cb8ac5657f703506b5f46","target":"graph","created_at":"2026-05-18T02:50:13Z","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":"We find the winning strategy for a class of truncation games played on words. As a consequence of the present author's recent results on some of these games we obtain new formulas for Bernoulli numbers and polynomials of the second kind and a new combinatorial model for the number of connected permutations of given rank. For connected permutations, the decomposition used to find the winning strategy is shown to be bijectively equivalent to King's decomposition, used to recursively generate a transposition Gray code of the connected permutations.","authors_text":"G\\'abor Hetyei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-03T03:43:43Z","title":"Enumeration by kernel positions for strongly Bernoulli type truncation games on words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0573","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:398d262162f9cd72054596c233da2cc4bb081cabd3d9f03c374e8069d3092b4a","target":"record","created_at":"2026-05-18T02:50:13Z","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":"0ba54115d257ac81a09cbe0e5cc575dc90c22568beb7245b9c948f2abd1a2786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-03T03:43:43Z","title_canon_sha256":"7a14a2f654e85822ee2fb3463b479e91acaa20b75f51e0563ecb65cbb813c988"},"schema_version":"1.0","source":{"id":"0912.0573","kind":"arxiv","version":1}},"canonical_sha256":"e75816b67238617e52cfeed9f88b7a3de09eb8207fb4bc2da51c0b7dc5f14294","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e75816b67238617e52cfeed9f88b7a3de09eb8207fb4bc2da51c0b7dc5f14294","first_computed_at":"2026-05-18T02:50:13.874016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:13.874016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BTqX7wSmIXUH3T8Rb6izQGtehJDlw5XY+meWfwrpFknAqUfgZJH67B+x/+c+KBlKOqoUNdWyfAs+oxvoEpCbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:13.874665Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.0573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:398d262162f9cd72054596c233da2cc4bb081cabd3d9f03c374e8069d3092b4a","sha256:198de18b221a372a3e4c85d9d1d720af897b03f7fd0cb8ac5657f703506b5f46"],"state_sha256":"01f1db92d2f10ae528e6e62164195da27a8cf08cfa022a3734b7efddd0056758"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DWIwaAKlRpGA6rZZAor/8XYdqPTepyyy7vx5iBy3ofTbQDnfYrP3wFBavOlJxL+fzUR9UWUpH7zhdmt0JcRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:24:06.216036Z","bundle_sha256":"5fef3814ee56b460471f0223bf0c0062ec06d3d16fe2140f7bf9665df66c5d1e"}}