{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DMBAZ32UNZDR4PYS3DRNRTPD4K","short_pith_number":"pith:DMBAZ32U","schema_version":"1.0","canonical_sha256":"1b020cef546e471e3f12d8e2d8cde3e292d9ec5e5ce0365952ed1a83bc9f1fd3","source":{"kind":"arxiv","id":"1307.7390","version":1},"attestation_state":"computed","paper":{"title":"Congruence successions in compositions","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mark C. Wilson, Mark Shattuck, Toufik Mansour","submitted_at":"2013-07-28T18:13:04Z","abstract_excerpt":"A \\emph{composition} is a sequence of positive integers, called \\emph{parts}, having a fixed sum. By an \\emph{$m$-congruence succession}, we will mean a pair of adjacent parts $x$ and $y$ within a composition such that $x\\equiv y(\\text{mod} m)$. Here, we consider the problem of counting the compositions of size $n$ according to the number of $m$-congruence successions, extending recent results concerning successions on subsets and permutations. A general formula is obtained, which reduces in the limiting case to the known generating function formula for the number of Carlitz compositions. Spec"},"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":"1307.7390","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-07-28T18:13:04Z","cross_cats_sorted":[],"title_canon_sha256":"5a35071257114d11e45a09a09ef95215a17f806b66d28e9737337f7fa00fbe6d","abstract_canon_sha256":"43e299b8fc061326d4c7217f578e9586184832ebd3ed826058d4485957eab18e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:23.424928Z","signature_b64":"ZVHZqVAm6qwozL6qbXr4wMtxBqiM5mkjQMXQ1gixpAPJQSOIbkc54hV+v3tWm6yFjMCXmFZ+hquvzCWWGqlXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b020cef546e471e3f12d8e2d8cde3e292d9ec5e5ce0365952ed1a83bc9f1fd3","last_reissued_at":"2026-05-18T03:17:23.424172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:23.424172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Congruence successions in compositions","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mark C. Wilson, Mark Shattuck, Toufik Mansour","submitted_at":"2013-07-28T18:13:04Z","abstract_excerpt":"A \\emph{composition} is a sequence of positive integers, called \\emph{parts}, having a fixed sum. By an \\emph{$m$-congruence succession}, we will mean a pair of adjacent parts $x$ and $y$ within a composition such that $x\\equiv y(\\text{mod} m)$. Here, we consider the problem of counting the compositions of size $n$ according to the number of $m$-congruence successions, extending recent results concerning successions on subsets and permutations. A general formula is obtained, which reduces in the limiting case to the known generating function formula for the number of Carlitz compositions. Spec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7390","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":"1307.7390","created_at":"2026-05-18T03:17:23.424296+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.7390v1","created_at":"2026-05-18T03:17:23.424296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7390","created_at":"2026-05-18T03:17:23.424296+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMBAZ32UNZDR","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMBAZ32UNZDR4PYS","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMBAZ32U","created_at":"2026-05-18T12:27:43.054852+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/DMBAZ32UNZDR4PYS3DRNRTPD4K","json":"https://pith.science/pith/DMBAZ32UNZDR4PYS3DRNRTPD4K.json","graph_json":"https://pith.science/api/pith-number/DMBAZ32UNZDR4PYS3DRNRTPD4K/graph.json","events_json":"https://pith.science/api/pith-number/DMBAZ32UNZDR4PYS3DRNRTPD4K/events.json","paper":"https://pith.science/paper/DMBAZ32U"},"agent_actions":{"view_html":"https://pith.science/pith/DMBAZ32UNZDR4PYS3DRNRTPD4K","download_json":"https://pith.science/pith/DMBAZ32UNZDR4PYS3DRNRTPD4K.json","view_paper":"https://pith.science/paper/DMBAZ32U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.7390&json=true","fetch_graph":"https://pith.science/api/pith-number/DMBAZ32UNZDR4PYS3DRNRTPD4K/graph.json","fetch_events":"https://pith.science/api/pith-number/DMBAZ32UNZDR4PYS3DRNRTPD4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMBAZ32UNZDR4PYS3DRNRTPD4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMBAZ32UNZDR4PYS3DRNRTPD4K/action/storage_attestation","attest_author":"https://pith.science/pith/DMBAZ32UNZDR4PYS3DRNRTPD4K/action/author_attestation","sign_citation":"https://pith.science/pith/DMBAZ32UNZDR4PYS3DRNRTPD4K/action/citation_signature","submit_replication":"https://pith.science/pith/DMBAZ32UNZDR4PYS3DRNRTPD4K/action/replication_record"}},"created_at":"2026-05-18T03:17:23.424296+00:00","updated_at":"2026-05-18T03:17:23.424296+00:00"}