{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YURWTDUQEUZKKE7UQZWG7UM7SF","short_pith_number":"pith:YURWTDUQ","schema_version":"1.0","canonical_sha256":"c523698e902532a513f4866c6fd19f917a3e42d5186b090e9a6c711e98964201","source":{"kind":"arxiv","id":"1506.00133","version":1},"attestation_state":"computed","paper":{"title":"Characterizing congruence preserving functions $Z/nZ\\to Z/mZ$ via rational polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.NT","authors_text":"Irene Guessarian, Patrick Cegielski, Serge Grigorieff","submitted_at":"2015-05-30T15:52:32Z","abstract_excerpt":"We introduce a basis of rational polynomial-like functions $P_0,\\ldots,P_{n-1}$ for the free module of functions $Z/nZ\\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the functions $lcm(k)\\,P_k$ where $lcm(k)$ is the least common multiple of $2,\\ldots,k$ (viewed in $Z/mZ$). As a consequence, when $n\\geq m$, the number of such functions is independent of $n$."},"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":"1506.00133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-05-30T15:52:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e2ec85d5e21036dfad3db5aac72933119293e26ff00a93ecb94eeade0647b511","abstract_canon_sha256":"9f557f79744b7d5b18ffde25c761f463d84cfcc9c9858100f37ab814d6fb27a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:55.391278Z","signature_b64":"gPwuALZjIXelG7XY3glSSIohBO5aQNfTvjT19RHaCN6pXsIHJ1k6oq7s+VBlBbcDqHWm0vAa6Ukqo/wGrUVqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c523698e902532a513f4866c6fd19f917a3e42d5186b090e9a6c711e98964201","last_reissued_at":"2026-05-18T01:59:55.390645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:55.390645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing congruence preserving functions $Z/nZ\\to Z/mZ$ via rational polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.NT","authors_text":"Irene Guessarian, Patrick Cegielski, Serge Grigorieff","submitted_at":"2015-05-30T15:52:32Z","abstract_excerpt":"We introduce a basis of rational polynomial-like functions $P_0,\\ldots,P_{n-1}$ for the free module of functions $Z/nZ\\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the functions $lcm(k)\\,P_k$ where $lcm(k)$ is the least common multiple of $2,\\ldots,k$ (viewed in $Z/mZ$). As a consequence, when $n\\geq m$, the number of such functions is independent of $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00133","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":"1506.00133","created_at":"2026-05-18T01:59:55.390734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00133v1","created_at":"2026-05-18T01:59:55.390734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00133","created_at":"2026-05-18T01:59:55.390734+00:00"},{"alias_kind":"pith_short_12","alias_value":"YURWTDUQEUZK","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YURWTDUQEUZKKE7U","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YURWTDUQ","created_at":"2026-05-18T12:29:52.810259+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/YURWTDUQEUZKKE7UQZWG7UM7SF","json":"https://pith.science/pith/YURWTDUQEUZKKE7UQZWG7UM7SF.json","graph_json":"https://pith.science/api/pith-number/YURWTDUQEUZKKE7UQZWG7UM7SF/graph.json","events_json":"https://pith.science/api/pith-number/YURWTDUQEUZKKE7UQZWG7UM7SF/events.json","paper":"https://pith.science/paper/YURWTDUQ"},"agent_actions":{"view_html":"https://pith.science/pith/YURWTDUQEUZKKE7UQZWG7UM7SF","download_json":"https://pith.science/pith/YURWTDUQEUZKKE7UQZWG7UM7SF.json","view_paper":"https://pith.science/paper/YURWTDUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00133&json=true","fetch_graph":"https://pith.science/api/pith-number/YURWTDUQEUZKKE7UQZWG7UM7SF/graph.json","fetch_events":"https://pith.science/api/pith-number/YURWTDUQEUZKKE7UQZWG7UM7SF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YURWTDUQEUZKKE7UQZWG7UM7SF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YURWTDUQEUZKKE7UQZWG7UM7SF/action/storage_attestation","attest_author":"https://pith.science/pith/YURWTDUQEUZKKE7UQZWG7UM7SF/action/author_attestation","sign_citation":"https://pith.science/pith/YURWTDUQEUZKKE7UQZWG7UM7SF/action/citation_signature","submit_replication":"https://pith.science/pith/YURWTDUQEUZKKE7UQZWG7UM7SF/action/replication_record"}},"created_at":"2026-05-18T01:59:55.390734+00:00","updated_at":"2026-05-18T01:59:55.390734+00:00"}