{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:YUSCUTTNWPEXYZES56E66VQUDF","short_pith_number":"pith:YUSCUTTN","schema_version":"1.0","canonical_sha256":"c5242a4e6db3c97c6492ef89ef5614197eda5e9455a03e2414685b6de0b56bce","source":{"kind":"arxiv","id":"0902.4311","version":2},"attestation_state":"computed","paper":{"title":"A combinatorial approach to the power of 2 in the number of involutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Dongsu Kim, Jang Soo Kim","submitted_at":"2009-02-25T08:16:49Z","abstract_excerpt":"We provide a combinatorial approach to the largest power of $p$ in the number of permutations $\\pi$ with $\\pi^p=1$, for a fixed prime number $p$. With this approach, we find the largest power of $2$ in the number of involutions, in the signed sum of involutions and in the numbers of even or odd involutions."},"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":"0902.4311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-25T08:16:49Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"c7061be6ae218269eba37fa47b12add170df564570435534f7add1b924d5f8bb","abstract_canon_sha256":"a5f18e729225e891e3e21435c1d100411216c15224b5cc417395e40e11ae9878"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:22.333716Z","signature_b64":"Mlz9FlPZYQtIGxGM6m2sq9R7vDaGCw6YQgWUh/h8Me8ToPAP9f12ZXJB+9fpkQy32vv/IcriFEq5IR1Ogk5YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5242a4e6db3c97c6492ef89ef5614197eda5e9455a03e2414685b6de0b56bce","last_reissued_at":"2026-05-18T04:37:22.333096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:22.333096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial approach to the power of 2 in the number of involutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Dongsu Kim, Jang Soo Kim","submitted_at":"2009-02-25T08:16:49Z","abstract_excerpt":"We provide a combinatorial approach to the largest power of $p$ in the number of permutations $\\pi$ with $\\pi^p=1$, for a fixed prime number $p$. With this approach, we find the largest power of $2$ in the number of involutions, in the signed sum of involutions and in the numbers of even or odd involutions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.4311","kind":"arxiv","version":2},"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":"0902.4311","created_at":"2026-05-18T04:37:22.333170+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.4311v2","created_at":"2026-05-18T04:37:22.333170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.4311","created_at":"2026-05-18T04:37:22.333170+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUSCUTTNWPEX","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUSCUTTNWPEXYZES","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUSCUTTN","created_at":"2026-05-18T12:26:02.257875+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/YUSCUTTNWPEXYZES56E66VQUDF","json":"https://pith.science/pith/YUSCUTTNWPEXYZES56E66VQUDF.json","graph_json":"https://pith.science/api/pith-number/YUSCUTTNWPEXYZES56E66VQUDF/graph.json","events_json":"https://pith.science/api/pith-number/YUSCUTTNWPEXYZES56E66VQUDF/events.json","paper":"https://pith.science/paper/YUSCUTTN"},"agent_actions":{"view_html":"https://pith.science/pith/YUSCUTTNWPEXYZES56E66VQUDF","download_json":"https://pith.science/pith/YUSCUTTNWPEXYZES56E66VQUDF.json","view_paper":"https://pith.science/paper/YUSCUTTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.4311&json=true","fetch_graph":"https://pith.science/api/pith-number/YUSCUTTNWPEXYZES56E66VQUDF/graph.json","fetch_events":"https://pith.science/api/pith-number/YUSCUTTNWPEXYZES56E66VQUDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUSCUTTNWPEXYZES56E66VQUDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUSCUTTNWPEXYZES56E66VQUDF/action/storage_attestation","attest_author":"https://pith.science/pith/YUSCUTTNWPEXYZES56E66VQUDF/action/author_attestation","sign_citation":"https://pith.science/pith/YUSCUTTNWPEXYZES56E66VQUDF/action/citation_signature","submit_replication":"https://pith.science/pith/YUSCUTTNWPEXYZES56E66VQUDF/action/replication_record"}},"created_at":"2026-05-18T04:37:22.333170+00:00","updated_at":"2026-05-18T04:37:22.333170+00:00"}