{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JXKLAMBESFDUB7V65T2TJOUHU3","short_pith_number":"pith:JXKLAMBE","schema_version":"1.0","canonical_sha256":"4dd4b03024914740febeecf534ba87a6d1e6380f7281d1f68fe2dff1c1fc0c1b","source":{"kind":"arxiv","id":"1010.2653","version":1},"attestation_state":"computed","paper":{"title":"A Bijection for Partitions with Initial Repetitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"William J. Keith","submitted_at":"2010-10-13T13:09:32Z","abstract_excerpt":"A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the generalizations that usually arise from such proofs."},"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":"1010.2653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-13T13:09:32Z","cross_cats_sorted":[],"title_canon_sha256":"994efdd9f6bc5dafe4cd6152097fb9b947ce1ee87d945f8c9b36170fc61854b5","abstract_canon_sha256":"80b36b4e1e9ccdb6c809d21bc6241e0dcb3fcca7c4aae71930b1c0a2fdc694ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:19.881394Z","signature_b64":"60lDAvqYPWg3QyXX48Tfto2l2lE3XJtQOqfNtGGjXwgsxjICimBm91jhjd9uKBAE/SFt/qh1eNA0jpgFv3VnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dd4b03024914740febeecf534ba87a6d1e6380f7281d1f68fe2dff1c1fc0c1b","last_reissued_at":"2026-05-18T04:39:19.880783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:19.880783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bijection for Partitions with Initial Repetitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"William J. Keith","submitted_at":"2010-10-13T13:09:32Z","abstract_excerpt":"A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the generalizations that usually arise from such proofs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2653","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":"1010.2653","created_at":"2026-05-18T04:39:19.880876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2653v1","created_at":"2026-05-18T04:39:19.880876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2653","created_at":"2026-05-18T04:39:19.880876+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXKLAMBESFDU","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXKLAMBESFDUB7V6","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXKLAMBE","created_at":"2026-05-18T12:26:09.077623+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/JXKLAMBESFDUB7V65T2TJOUHU3","json":"https://pith.science/pith/JXKLAMBESFDUB7V65T2TJOUHU3.json","graph_json":"https://pith.science/api/pith-number/JXKLAMBESFDUB7V65T2TJOUHU3/graph.json","events_json":"https://pith.science/api/pith-number/JXKLAMBESFDUB7V65T2TJOUHU3/events.json","paper":"https://pith.science/paper/JXKLAMBE"},"agent_actions":{"view_html":"https://pith.science/pith/JXKLAMBESFDUB7V65T2TJOUHU3","download_json":"https://pith.science/pith/JXKLAMBESFDUB7V65T2TJOUHU3.json","view_paper":"https://pith.science/paper/JXKLAMBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2653&json=true","fetch_graph":"https://pith.science/api/pith-number/JXKLAMBESFDUB7V65T2TJOUHU3/graph.json","fetch_events":"https://pith.science/api/pith-number/JXKLAMBESFDUB7V65T2TJOUHU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXKLAMBESFDUB7V65T2TJOUHU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXKLAMBESFDUB7V65T2TJOUHU3/action/storage_attestation","attest_author":"https://pith.science/pith/JXKLAMBESFDUB7V65T2TJOUHU3/action/author_attestation","sign_citation":"https://pith.science/pith/JXKLAMBESFDUB7V65T2TJOUHU3/action/citation_signature","submit_replication":"https://pith.science/pith/JXKLAMBESFDUB7V65T2TJOUHU3/action/replication_record"}},"created_at":"2026-05-18T04:39:19.880876+00:00","updated_at":"2026-05-18T04:39:19.880876+00:00"}