{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:45LM5JVUO72RDA6ACG2Z36IJRT","short_pith_number":"pith:45LM5JVU","canonical_record":{"source":{"id":"1407.3383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-07-12T13:21:01Z","cross_cats_sorted":[],"title_canon_sha256":"86cd03518c9cfb7d84faf8dbd763af0e200765c5a10deaa7350d7149cad13b39","abstract_canon_sha256":"b2f1745f6a60a49560fd7c16f3b5370c496f4937b16d02afe6b94fe105115ee9"},"schema_version":"1.0"},"canonical_sha256":"e756cea6b477f51183c011b59df9098cc0db813634822df4ddef04c9797c0b79","source":{"kind":"arxiv","id":"1407.3383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3383","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3383v1","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3383","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"45LM5JVUO72R","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"45LM5JVUO72RDA6A","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"45LM5JVU","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:45LM5JVUO72RDA6ACG2Z36IJRT","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-07-12T13:21:01Z","cross_cats_sorted":[],"title_canon_sha256":"86cd03518c9cfb7d84faf8dbd763af0e200765c5a10deaa7350d7149cad13b39","abstract_canon_sha256":"b2f1745f6a60a49560fd7c16f3b5370c496f4937b16d02afe6b94fe105115ee9"},"schema_version":"1.0"},"canonical_sha256":"e756cea6b477f51183c011b59df9098cc0db813634822df4ddef04c9797c0b79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:43.078265Z","signature_b64":"adBy59njWxwQHMSGpngD3x17gliWAxtV3K7zexlATS4mL7OSpw4lWM6lQ2e2zpOa8uWuUKszVPU78F0hwBeFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e756cea6b477f51183c011b59df9098cc0db813634822df4ddef04c9797c0b79","last_reissued_at":"2026-05-18T02:47:43.077682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:43.077682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3383","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iM9D0Rr4J7g3f/b1+KJKU4ElIWEv9zuIQtbHQW0VL2DfPLpi+JHz7tzGOooVj2F5LjtisKfOhp3z+FRwU+6iCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:30:44.310910Z"},"content_sha256":"0dc43643623cc0469551f6e83c7852af4151e2fef868d9349571fd22cf90ff00","schema_version":"1.0","event_id":"sha256:0dc43643623cc0469551f6e83c7852af4151e2fef868d9349571fd22cf90ff00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:45LM5JVUO72RDA6ACG2Z36IJRT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modular SIMD arithmetic in Mathemagix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Gr\\'egoire Lecerf, Guillaume Quintin, Joris van der Hoeven","submitted_at":"2014-07-12T13:21:01Z","abstract_excerpt":"Modular integer arithmetic occurs in many algorithms for computer algebra, cryptography, and error correcting codes. Although recent microprocessors typically offer a wide range of highly optimized arithmetic functions, modular integer operations still require dedicated implementations. In this article, we survey existing algorithms for modular integer arithmetic, and present detailed vectorized counterparts. We also present several applications, such as fast modular Fourier transforms and multiplication of integer polynomials and matrices. The vectorized algorithms have been implemented in C+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3383","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MVUQnpLHbLRqp4gkzV8/ZRweZoAJpOEY8ZwOeqCdilj9a0dC+hnHFJkhWWPhGZ3FaTxOBfGUtdCazTZNnl7kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:30:44.311254Z"},"content_sha256":"5855812edd8d34e3ffa31d5954767bb51c71571651e62fb014e1b948f383133b","schema_version":"1.0","event_id":"sha256:5855812edd8d34e3ffa31d5954767bb51c71571651e62fb014e1b948f383133b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45LM5JVUO72RDA6ACG2Z36IJRT/bundle.json","state_url":"https://pith.science/pith/45LM5JVUO72RDA6ACG2Z36IJRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45LM5JVUO72RDA6ACG2Z36IJRT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T04:30:44Z","links":{"resolver":"https://pith.science/pith/45LM5JVUO72RDA6ACG2Z36IJRT","bundle":"https://pith.science/pith/45LM5JVUO72RDA6ACG2Z36IJRT/bundle.json","state":"https://pith.science/pith/45LM5JVUO72RDA6ACG2Z36IJRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45LM5JVUO72RDA6ACG2Z36IJRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:45LM5JVUO72RDA6ACG2Z36IJRT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b2f1745f6a60a49560fd7c16f3b5370c496f4937b16d02afe6b94fe105115ee9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-07-12T13:21:01Z","title_canon_sha256":"86cd03518c9cfb7d84faf8dbd763af0e200765c5a10deaa7350d7149cad13b39"},"schema_version":"1.0","source":{"id":"1407.3383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3383","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3383v1","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3383","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"45LM5JVUO72R","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"45LM5JVUO72RDA6A","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"45LM5JVU","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:5855812edd8d34e3ffa31d5954767bb51c71571651e62fb014e1b948f383133b","target":"graph","created_at":"2026-05-18T02:47:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Modular integer arithmetic occurs in many algorithms for computer algebra, cryptography, and error correcting codes. Although recent microprocessors typically offer a wide range of highly optimized arithmetic functions, modular integer operations still require dedicated implementations. In this article, we survey existing algorithms for modular integer arithmetic, and present detailed vectorized counterparts. We also present several applications, such as fast modular Fourier transforms and multiplication of integer polynomials and matrices. The vectorized algorithms have been implemented in C+","authors_text":"Gr\\'egoire Lecerf, Guillaume Quintin, Joris van der Hoeven","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-07-12T13:21:01Z","title":"Modular SIMD arithmetic in Mathemagix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3383","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0dc43643623cc0469551f6e83c7852af4151e2fef868d9349571fd22cf90ff00","target":"record","created_at":"2026-05-18T02:47:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b2f1745f6a60a49560fd7c16f3b5370c496f4937b16d02afe6b94fe105115ee9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-07-12T13:21:01Z","title_canon_sha256":"86cd03518c9cfb7d84faf8dbd763af0e200765c5a10deaa7350d7149cad13b39"},"schema_version":"1.0","source":{"id":"1407.3383","kind":"arxiv","version":1}},"canonical_sha256":"e756cea6b477f51183c011b59df9098cc0db813634822df4ddef04c9797c0b79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e756cea6b477f51183c011b59df9098cc0db813634822df4ddef04c9797c0b79","first_computed_at":"2026-05-18T02:47:43.077682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:43.077682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"adBy59njWxwQHMSGpngD3x17gliWAxtV3K7zexlATS4mL7OSpw4lWM6lQ2e2zpOa8uWuUKszVPU78F0hwBeFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:43.078265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dc43643623cc0469551f6e83c7852af4151e2fef868d9349571fd22cf90ff00","sha256:5855812edd8d34e3ffa31d5954767bb51c71571651e62fb014e1b948f383133b"],"state_sha256":"c4e028b515bf81464014731fc2f42e99fb16e32bddb4103ae7b85865a8ef20d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWVY5WUg+iTTIhx8vFrUVyxrpG3yQcFAT4zoab0Xp908LI6nQLSgYM9cjQuTAVRzfYplhfajriEXatuoJ6HBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:30:44.313219Z","bundle_sha256":"634195dece5a11b6b898eb6109487700381b08241e2a25db52f30d2e1f4da7be"}}