{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:N5I5TAEFJBQOCSGXACXIEEVQ4E","short_pith_number":"pith:N5I5TAEF","schema_version":"1.0","canonical_sha256":"6f51d980854860e148d700ae8212b0e120e940596b91d556017b70165ce0e30f","source":{"kind":"arxiv","id":"1005.0830","version":1},"attestation_state":"computed","paper":{"title":"Generic design of Chinese remaindering schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SC","authors_text":"Jean-Guillaume Dumas (LJK), Jean-Louis Roch (INRIA Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Thierry Gautier (INRIA Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble)","submitted_at":"2010-05-05T19:45:22Z","abstract_excerpt":"We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a radix ladder, for the intermediate storage and computations. Our design is structured into three main modules: a black box residue computation in charge of computing each residue; a Chinese remaindering controller in charge of launching the computation and of the termination decision; an integer builder in charge of the reconstruction computation. We then sho"},"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":"1005.0830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-05-05T19:45:22Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0e23707e4b17e6d0d1174a2ef29fc5909d3753be33a87b22f52fdb4dddd4f745","abstract_canon_sha256":"f9c7267ac9031e6216b4112914a1a03585810b6d2779bb8a7db817dfe6a39155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:15.104119Z","signature_b64":"wdXwWQvBmvvul/sh6J6K7Qrr3wW7S2Y9hMHn3K+Zh3Q3IV0Uyo+LY+rPld2F0xhUKWoo1vx0FvjUm1ohfGJRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f51d980854860e148d700ae8212b0e120e940596b91d556017b70165ce0e30f","last_reissued_at":"2026-05-18T04:41:15.103552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:15.103552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generic design of Chinese remaindering schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SC","authors_text":"Jean-Guillaume Dumas (LJK), Jean-Louis Roch (INRIA Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Thierry Gautier (INRIA Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble)","submitted_at":"2010-05-05T19:45:22Z","abstract_excerpt":"We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a radix ladder, for the intermediate storage and computations. Our design is structured into three main modules: a black box residue computation in charge of computing each residue; a Chinese remaindering controller in charge of launching the computation and of the termination decision; an integer builder in charge of the reconstruction computation. We then sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0830","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":"1005.0830","created_at":"2026-05-18T04:41:15.103627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.0830v1","created_at":"2026-05-18T04:41:15.103627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0830","created_at":"2026-05-18T04:41:15.103627+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5I5TAEFJBQO","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5I5TAEFJBQOCSGX","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5I5TAEF","created_at":"2026-05-18T12:26:10.704358+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/N5I5TAEFJBQOCSGXACXIEEVQ4E","json":"https://pith.science/pith/N5I5TAEFJBQOCSGXACXIEEVQ4E.json","graph_json":"https://pith.science/api/pith-number/N5I5TAEFJBQOCSGXACXIEEVQ4E/graph.json","events_json":"https://pith.science/api/pith-number/N5I5TAEFJBQOCSGXACXIEEVQ4E/events.json","paper":"https://pith.science/paper/N5I5TAEF"},"agent_actions":{"view_html":"https://pith.science/pith/N5I5TAEFJBQOCSGXACXIEEVQ4E","download_json":"https://pith.science/pith/N5I5TAEFJBQOCSGXACXIEEVQ4E.json","view_paper":"https://pith.science/paper/N5I5TAEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.0830&json=true","fetch_graph":"https://pith.science/api/pith-number/N5I5TAEFJBQOCSGXACXIEEVQ4E/graph.json","fetch_events":"https://pith.science/api/pith-number/N5I5TAEFJBQOCSGXACXIEEVQ4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5I5TAEFJBQOCSGXACXIEEVQ4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5I5TAEFJBQOCSGXACXIEEVQ4E/action/storage_attestation","attest_author":"https://pith.science/pith/N5I5TAEFJBQOCSGXACXIEEVQ4E/action/author_attestation","sign_citation":"https://pith.science/pith/N5I5TAEFJBQOCSGXACXIEEVQ4E/action/citation_signature","submit_replication":"https://pith.science/pith/N5I5TAEFJBQOCSGXACXIEEVQ4E/action/replication_record"}},"created_at":"2026-05-18T04:41:15.103627+00:00","updated_at":"2026-05-18T04:41:15.103627+00:00"}