{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:S3RHNPIPSMWIQRNBCOCVSKVA4T","short_pith_number":"pith:S3RHNPIP","schema_version":"1.0","canonical_sha256":"96e276bd0f932c8845a11385592aa0e4f0a60652762c2337ee6b15d42ba7897a","source":{"kind":"arxiv","id":"2102.06959","version":1},"attestation_state":"computed","paper":{"title":"Euclidean Affine Functions and Applications to Calendar Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Cassio Neri, Lorenz Schneider","submitted_at":"2021-02-13T17:04:59Z","abstract_excerpt":"We study properties of Euclidean affine functions (EAFs), namely those of the form $f(r) = (\\alpha\\cdot r + \\beta)/\\delta$, and their closely related expression $\\mathring{f}(r) = (\\alpha\\cdot r + \\beta)\\%\\delta$, where $r$, $\\alpha$, $\\beta$ and $\\delta$ are integers, and where $/$ and $\\%$ respectively denote the quotient and remainder of Euclidean division. We derive algebraic relations and numerical approximations that are important for the efficient evaluation of these expressions in modern CPUs. Since simple division and remainder are particular cases of EAFs (when $\\alpha = 1$ and $\\bet"},"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":"2102.06959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-02-13T17:04:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2cadd3d6bdfaf796d39746868b2d6d5a6e74586b555b9605f92dbba7006c2124","abstract_canon_sha256":"f1b7f19fef2c90cadbb7ea19e80a03e936ef8f4b67ba85b9cd99a19f18b7bbd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:34.855342Z","signature_b64":"sP4cJQJLD2uQEqt2WoCEXS+OE9S2mR++f4zBdhKXMCACKtCzJE9tKZ90v7+bgBF6RFZf/eZV4S7+ieSGiUcuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96e276bd0f932c8845a11385592aa0e4f0a60652762c2337ee6b15d42ba7897a","last_reissued_at":"2026-07-05T09:57:34.854913Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:34.854913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Euclidean Affine Functions and Applications to Calendar Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Cassio Neri, Lorenz Schneider","submitted_at":"2021-02-13T17:04:59Z","abstract_excerpt":"We study properties of Euclidean affine functions (EAFs), namely those of the form $f(r) = (\\alpha\\cdot r + \\beta)/\\delta$, and their closely related expression $\\mathring{f}(r) = (\\alpha\\cdot r + \\beta)\\%\\delta$, where $r$, $\\alpha$, $\\beta$ and $\\delta$ are integers, and where $/$ and $\\%$ respectively denote the quotient and remainder of Euclidean division. We derive algebraic relations and numerical approximations that are important for the efficient evaluation of these expressions in modern CPUs. Since simple division and remainder are particular cases of EAFs (when $\\alpha = 1$ and $\\bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06959","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.06959/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":"2102.06959","created_at":"2026-07-05T09:57:34.854969+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.06959v1","created_at":"2026-07-05T09:57:34.854969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06959","created_at":"2026-07-05T09:57:34.854969+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3RHNPIPSMWI","created_at":"2026-07-05T09:57:34.854969+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3RHNPIPSMWIQRNB","created_at":"2026-07-05T09:57:34.854969+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3RHNPIP","created_at":"2026-07-05T09:57:34.854969+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":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S3RHNPIPSMWIQRNBCOCVSKVA4T","json":"https://pith.science/pith/S3RHNPIPSMWIQRNBCOCVSKVA4T.json","graph_json":"https://pith.science/api/pith-number/S3RHNPIPSMWIQRNBCOCVSKVA4T/graph.json","events_json":"https://pith.science/api/pith-number/S3RHNPIPSMWIQRNBCOCVSKVA4T/events.json","paper":"https://pith.science/paper/S3RHNPIP"},"agent_actions":{"view_html":"https://pith.science/pith/S3RHNPIPSMWIQRNBCOCVSKVA4T","download_json":"https://pith.science/pith/S3RHNPIPSMWIQRNBCOCVSKVA4T.json","view_paper":"https://pith.science/paper/S3RHNPIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.06959&json=true","fetch_graph":"https://pith.science/api/pith-number/S3RHNPIPSMWIQRNBCOCVSKVA4T/graph.json","fetch_events":"https://pith.science/api/pith-number/S3RHNPIPSMWIQRNBCOCVSKVA4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3RHNPIPSMWIQRNBCOCVSKVA4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3RHNPIPSMWIQRNBCOCVSKVA4T/action/storage_attestation","attest_author":"https://pith.science/pith/S3RHNPIPSMWIQRNBCOCVSKVA4T/action/author_attestation","sign_citation":"https://pith.science/pith/S3RHNPIPSMWIQRNBCOCVSKVA4T/action/citation_signature","submit_replication":"https://pith.science/pith/S3RHNPIPSMWIQRNBCOCVSKVA4T/action/replication_record"}},"created_at":"2026-07-05T09:57:34.854969+00:00","updated_at":"2026-07-05T09:57:34.854969+00:00"}