{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DMDW2TRL3CUMPKM34K7CUZIP6S","short_pith_number":"pith:DMDW2TRL","schema_version":"1.0","canonical_sha256":"1b076d4e2bd8a8c7a99be2be2a650ff48e9b384681e761d09217233a0c2b91f6","source":{"kind":"arxiv","id":"2106.08057","version":2},"attestation_state":"computed","paper":{"title":"The $(k,l)$-Euler theorem and the combinatorics of $(k,l)$-sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Isaac Konan","submitted_at":"2021-06-15T11:30:08Z","abstract_excerpt":"In 1997, Bousquet-M\\'elou and Eriksson stated a broad generalization of Euler's distinct-odd partition theorem, namely the $(k,l)$-Euler theorem. Their identity involved the $(k,l)$-lecture-hall partitions, which, unlike usual difference conditions of partitions in Rogers-Ramanujan type identities, satisfy some ratio constraints. In a 2008 paper, in response to a question suggested by Richard Stanley, Savage and Yee provided a simple bijection for the $l$-lecture-hall partitions (the case $k=l$), whose specialization in $l=2$ corresponds to Sylvester's bijection. Subsequently, as an open quest"},"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":"2106.08057","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-06-15T11:30:08Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"7f7d5e4f7423417410c7b336928fe549731670a72055a2f4bff6d2a8ac9b564b","abstract_canon_sha256":"ef70913ac9a216ec698dc6979ea52a85d28ec869acb579ef5b83c9a2e07cfab5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:56.566967Z","signature_b64":"6nQ6uEaLkJeWUV5qg16dJzr25kNk9CiddiX7XoTOn72ItWmpqs3tKTxDMtxSgMKTX0ezkiksKVYTXJrc2EsCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b076d4e2bd8a8c7a99be2be2a650ff48e9b384681e761d09217233a0c2b91f6","last_reissued_at":"2026-07-05T02:49:56.566533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:56.566533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $(k,l)$-Euler theorem and the combinatorics of $(k,l)$-sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Isaac Konan","submitted_at":"2021-06-15T11:30:08Z","abstract_excerpt":"In 1997, Bousquet-M\\'elou and Eriksson stated a broad generalization of Euler's distinct-odd partition theorem, namely the $(k,l)$-Euler theorem. Their identity involved the $(k,l)$-lecture-hall partitions, which, unlike usual difference conditions of partitions in Rogers-Ramanujan type identities, satisfy some ratio constraints. In a 2008 paper, in response to a question suggested by Richard Stanley, Savage and Yee provided a simple bijection for the $l$-lecture-hall partitions (the case $k=l$), whose specialization in $l=2$ corresponds to Sylvester's bijection. Subsequently, as an open quest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08057","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.08057/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.08057","created_at":"2026-07-05T02:49:56.566598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.08057v2","created_at":"2026-07-05T02:49:56.566598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08057","created_at":"2026-07-05T02:49:56.566598+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMDW2TRL3CUM","created_at":"2026-07-05T02:49:56.566598+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMDW2TRL3CUMPKM3","created_at":"2026-07-05T02:49:56.566598+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMDW2TRL","created_at":"2026-07-05T02:49:56.566598+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12615","citing_title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DMDW2TRL3CUMPKM34K7CUZIP6S","json":"https://pith.science/pith/DMDW2TRL3CUMPKM34K7CUZIP6S.json","graph_json":"https://pith.science/api/pith-number/DMDW2TRL3CUMPKM34K7CUZIP6S/graph.json","events_json":"https://pith.science/api/pith-number/DMDW2TRL3CUMPKM34K7CUZIP6S/events.json","paper":"https://pith.science/paper/DMDW2TRL"},"agent_actions":{"view_html":"https://pith.science/pith/DMDW2TRL3CUMPKM34K7CUZIP6S","download_json":"https://pith.science/pith/DMDW2TRL3CUMPKM34K7CUZIP6S.json","view_paper":"https://pith.science/paper/DMDW2TRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.08057&json=true","fetch_graph":"https://pith.science/api/pith-number/DMDW2TRL3CUMPKM34K7CUZIP6S/graph.json","fetch_events":"https://pith.science/api/pith-number/DMDW2TRL3CUMPKM34K7CUZIP6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMDW2TRL3CUMPKM34K7CUZIP6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMDW2TRL3CUMPKM34K7CUZIP6S/action/storage_attestation","attest_author":"https://pith.science/pith/DMDW2TRL3CUMPKM34K7CUZIP6S/action/author_attestation","sign_citation":"https://pith.science/pith/DMDW2TRL3CUMPKM34K7CUZIP6S/action/citation_signature","submit_replication":"https://pith.science/pith/DMDW2TRL3CUMPKM34K7CUZIP6S/action/replication_record"}},"created_at":"2026-07-05T02:49:56.566598+00:00","updated_at":"2026-07-05T02:49:56.566598+00:00"}