{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MICUCFHVZ65W7RHR4SV4XRS3QJ","short_pith_number":"pith:MICUCFHV","schema_version":"1.0","canonical_sha256":"62054114f5cfbb6fc4f1e4abcbc65b82533f353590c29143a653a430b0739b7e","source":{"kind":"arxiv","id":"1206.3221","version":2},"attestation_state":"computed","paper":{"title":"Compositions of Integers With Bounded Parts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Darren Glass","submitted_at":"2012-06-14T19:38:32Z","abstract_excerpt":"In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function describing the number of $k$-tuples whose entries are bounded in this way and sum to a fixed value $g$."},"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":"1206.3221","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-06-14T19:38:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7b0f3b102cd8a588f54b3b34d11a6b129ddd1c246a1a64ecd21ccd0e3d29d93e","abstract_canon_sha256":"7218f5255183332a9be9d975729acf8f3c4bfaf8bf1db2bca831dd649077189b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.819599Z","signature_b64":"GZq9Wc9/R04M06P0fwI5+L2h7NUkpjxe3A91vrX3l4996bHzZeskbEWsy0seWqv432rigu2WN2UgXRkkAy1hDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62054114f5cfbb6fc4f1e4abcbc65b82533f353590c29143a653a430b0739b7e","last_reissued_at":"2026-05-18T03:27:32.819073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.819073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositions of Integers With Bounded Parts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Darren Glass","submitted_at":"2012-06-14T19:38:32Z","abstract_excerpt":"In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function describing the number of $k$-tuples whose entries are bounded in this way and sum to a fixed value $g$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3221","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":"1206.3221","created_at":"2026-05-18T03:27:32.819164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3221v2","created_at":"2026-05-18T03:27:32.819164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3221","created_at":"2026-05-18T03:27:32.819164+00:00"},{"alias_kind":"pith_short_12","alias_value":"MICUCFHVZ65W","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MICUCFHVZ65W7RHR","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MICUCFHV","created_at":"2026-05-18T12:27:14.488303+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/MICUCFHVZ65W7RHR4SV4XRS3QJ","json":"https://pith.science/pith/MICUCFHVZ65W7RHR4SV4XRS3QJ.json","graph_json":"https://pith.science/api/pith-number/MICUCFHVZ65W7RHR4SV4XRS3QJ/graph.json","events_json":"https://pith.science/api/pith-number/MICUCFHVZ65W7RHR4SV4XRS3QJ/events.json","paper":"https://pith.science/paper/MICUCFHV"},"agent_actions":{"view_html":"https://pith.science/pith/MICUCFHVZ65W7RHR4SV4XRS3QJ","download_json":"https://pith.science/pith/MICUCFHVZ65W7RHR4SV4XRS3QJ.json","view_paper":"https://pith.science/paper/MICUCFHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3221&json=true","fetch_graph":"https://pith.science/api/pith-number/MICUCFHVZ65W7RHR4SV4XRS3QJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MICUCFHVZ65W7RHR4SV4XRS3QJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MICUCFHVZ65W7RHR4SV4XRS3QJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MICUCFHVZ65W7RHR4SV4XRS3QJ/action/storage_attestation","attest_author":"https://pith.science/pith/MICUCFHVZ65W7RHR4SV4XRS3QJ/action/author_attestation","sign_citation":"https://pith.science/pith/MICUCFHVZ65W7RHR4SV4XRS3QJ/action/citation_signature","submit_replication":"https://pith.science/pith/MICUCFHVZ65W7RHR4SV4XRS3QJ/action/replication_record"}},"created_at":"2026-05-18T03:27:32.819164+00:00","updated_at":"2026-05-18T03:27:32.819164+00:00"}