{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:33U45SYHOQJI6GQYZRFFTS6TDT","short_pith_number":"pith:33U45SYH","schema_version":"1.0","canonical_sha256":"dee9cecb0774128f1a18cc4a59cbd31cdae9a35a63cc1b5d69030f91487a743b","source":{"kind":"arxiv","id":"1203.5848","version":1},"attestation_state":"computed","paper":{"title":"Generalized higher order spt-functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Ae Ja Yee, Atul Dixit","submitted_at":"2012-03-27T00:49:28Z","abstract_excerpt":"We give a new generalization of the spt-function of G.E. Andrews, namely $\\textup{Spt}_j(n)$, and give its combinatorial interpretation in terms of successive lower-Durfee squares. We then generalize the higher order spt-function $\\textup{spt}_k(n)$, due to F.G. Garvan, to ${}_j\\textup{spt}_{k}(n)$, thus providing a two-fold generalization of $\\textup{spt}(n)$, and give its combinatorial interpretation."},"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":"1203.5848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-03-27T00:49:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"81771f5c365f8b5fcdfd385e126a1efe55912c64711b4d77c113b668cd2995d6","abstract_canon_sha256":"9ba8956f17560622595b9836393084853cffa326dc6f244f711bb34f1c15d1ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:13.275763Z","signature_b64":"cnF32BlwZxDQac+GuC/zVAk1uvlJMWkqQ21UdGqAqWEP7lZU5N+A6XaOLd4kzrYmANLwcGqy4gwEUGZgY3DiBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee9cecb0774128f1a18cc4a59cbd31cdae9a35a63cc1b5d69030f91487a743b","last_reissued_at":"2026-05-18T03:59:13.275046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:13.275046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized higher order spt-functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Ae Ja Yee, Atul Dixit","submitted_at":"2012-03-27T00:49:28Z","abstract_excerpt":"We give a new generalization of the spt-function of G.E. Andrews, namely $\\textup{Spt}_j(n)$, and give its combinatorial interpretation in terms of successive lower-Durfee squares. We then generalize the higher order spt-function $\\textup{spt}_k(n)$, due to F.G. Garvan, to ${}_j\\textup{spt}_{k}(n)$, thus providing a two-fold generalization of $\\textup{spt}(n)$, and give its combinatorial interpretation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5848","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":"1203.5848","created_at":"2026-05-18T03:59:13.275165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.5848v1","created_at":"2026-05-18T03:59:13.275165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5848","created_at":"2026-05-18T03:59:13.275165+00:00"},{"alias_kind":"pith_short_12","alias_value":"33U45SYHOQJI","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"33U45SYHOQJI6GQY","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"33U45SYH","created_at":"2026-05-18T12:26:50.516681+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/33U45SYHOQJI6GQYZRFFTS6TDT","json":"https://pith.science/pith/33U45SYHOQJI6GQYZRFFTS6TDT.json","graph_json":"https://pith.science/api/pith-number/33U45SYHOQJI6GQYZRFFTS6TDT/graph.json","events_json":"https://pith.science/api/pith-number/33U45SYHOQJI6GQYZRFFTS6TDT/events.json","paper":"https://pith.science/paper/33U45SYH"},"agent_actions":{"view_html":"https://pith.science/pith/33U45SYHOQJI6GQYZRFFTS6TDT","download_json":"https://pith.science/pith/33U45SYHOQJI6GQYZRFFTS6TDT.json","view_paper":"https://pith.science/paper/33U45SYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.5848&json=true","fetch_graph":"https://pith.science/api/pith-number/33U45SYHOQJI6GQYZRFFTS6TDT/graph.json","fetch_events":"https://pith.science/api/pith-number/33U45SYHOQJI6GQYZRFFTS6TDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33U45SYHOQJI6GQYZRFFTS6TDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33U45SYHOQJI6GQYZRFFTS6TDT/action/storage_attestation","attest_author":"https://pith.science/pith/33U45SYHOQJI6GQYZRFFTS6TDT/action/author_attestation","sign_citation":"https://pith.science/pith/33U45SYHOQJI6GQYZRFFTS6TDT/action/citation_signature","submit_replication":"https://pith.science/pith/33U45SYHOQJI6GQYZRFFTS6TDT/action/replication_record"}},"created_at":"2026-05-18T03:59:13.275165+00:00","updated_at":"2026-05-18T03:59:13.275165+00:00"}