{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UEC2JMOUGMSECQFYOP5V4SFM2E","short_pith_number":"pith:UEC2JMOU","canonical_record":{"source":{"id":"1610.01175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-04T20:04:12Z","cross_cats_sorted":[],"title_canon_sha256":"709d03c652468e551079cbca31ff7093bb49efe29e51b92440324231feeb0709","abstract_canon_sha256":"aae570203c7c9a501934771c911cde3ed5f3e1c50164654d8d692c6b976915a9"},"schema_version":"1.0"},"canonical_sha256":"a105a4b1d433244140b873fb5e48acd11a027cb6ce6529b7ae444cb7a50bd9d4","source":{"kind":"arxiv","id":"1610.01175","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01175","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01175v2","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01175","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"pith_short_12","alias_value":"UEC2JMOUGMSE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UEC2JMOUGMSECQFY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UEC2JMOU","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UEC2JMOUGMSECQFYOP5V4SFM2E","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-04T20:04:12Z","cross_cats_sorted":[],"title_canon_sha256":"709d03c652468e551079cbca31ff7093bb49efe29e51b92440324231feeb0709","abstract_canon_sha256":"aae570203c7c9a501934771c911cde3ed5f3e1c50164654d8d692c6b976915a9"},"schema_version":"1.0"},"canonical_sha256":"a105a4b1d433244140b873fb5e48acd11a027cb6ce6529b7ae444cb7a50bd9d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:14.405584Z","signature_b64":"spsiuGDwVoH0JC59wGt/V9jCrG7pPd2AhtEW5KAJpdW01TxgU4+RadbAn+Z12eFWt0ASCubwhNNGwqerwgd8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a105a4b1d433244140b873fb5e48acd11a027cb6ce6529b7ae444cb7a50bd9d4","last_reissued_at":"2026-05-18T00:36:14.404950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:14.404950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01175","source_version":2,"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-18T00:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PeWxrASgLMAh/kV+y4mn1V0RHh18Jk63zPlrT+vBprooMUwie/77nhLwxVhNSjUi2sjbtaVrHQlB/y0qK6iXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:05:22.830293Z"},"content_sha256":"09393e1d80b7aae03207053cd23a2f5035b8086d6188d27396d6be87e4d6ef9d","schema_version":"1.0","event_id":"sha256:09393e1d80b7aae03207053cd23a2f5035b8086d6188d27396d6be87e4d6ef9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UEC2JMOUGMSECQFYOP5V4SFM2E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Algorithmic Significance and Analysis of the Method of DaYan Deriving One","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bao Li, Guangwu Xu","submitted_at":"2016-10-04T20:04:12Z","abstract_excerpt":"Modulo inverse is an important arithmetic operation. Many famous algorithms in public key cryptography require to compute modulo inverse. It is argued that the method of DaYan deriving one of Jiushao Qin provides the most concise and transparent way of computing modulo inverse. Based on the rule of taking the least positive remainder in division, this paper presents a more precise algorithmic description of the method of DaYan deriving one to reflect Qin's original idea. Our form of the algorithm is straightforward and different from the ones in the literature. Some additional information can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01175","kind":"arxiv","version":2},"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-18T00:36:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Tja2eaA17IPl65FP9Zu1k1xRp66Fsw1V532ddem9hxw0WzRLW/TCL2kv/cCSdbH7yyQWylPYrIiLHbYHVSrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:05:22.831046Z"},"content_sha256":"1bb5724745c829dc883535e8a99a8ae7c5181ea679e11776bfb3a503e2361e1b","schema_version":"1.0","event_id":"sha256:1bb5724745c829dc883535e8a99a8ae7c5181ea679e11776bfb3a503e2361e1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UEC2JMOUGMSECQFYOP5V4SFM2E/bundle.json","state_url":"https://pith.science/pith/UEC2JMOUGMSECQFYOP5V4SFM2E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UEC2JMOUGMSECQFYOP5V4SFM2E/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-07T21:05:22Z","links":{"resolver":"https://pith.science/pith/UEC2JMOUGMSECQFYOP5V4SFM2E","bundle":"https://pith.science/pith/UEC2JMOUGMSECQFYOP5V4SFM2E/bundle.json","state":"https://pith.science/pith/UEC2JMOUGMSECQFYOP5V4SFM2E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UEC2JMOUGMSECQFYOP5V4SFM2E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UEC2JMOUGMSECQFYOP5V4SFM2E","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":"aae570203c7c9a501934771c911cde3ed5f3e1c50164654d8d692c6b976915a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-04T20:04:12Z","title_canon_sha256":"709d03c652468e551079cbca31ff7093bb49efe29e51b92440324231feeb0709"},"schema_version":"1.0","source":{"id":"1610.01175","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01175","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01175v2","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01175","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"pith_short_12","alias_value":"UEC2JMOUGMSE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UEC2JMOUGMSECQFY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UEC2JMOU","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:1bb5724745c829dc883535e8a99a8ae7c5181ea679e11776bfb3a503e2361e1b","target":"graph","created_at":"2026-05-18T00:36:14Z","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":"Modulo inverse is an important arithmetic operation. Many famous algorithms in public key cryptography require to compute modulo inverse. It is argued that the method of DaYan deriving one of Jiushao Qin provides the most concise and transparent way of computing modulo inverse. Based on the rule of taking the least positive remainder in division, this paper presents a more precise algorithmic description of the method of DaYan deriving one to reflect Qin's original idea. Our form of the algorithm is straightforward and different from the ones in the literature. Some additional information can ","authors_text":"Bao Li, Guangwu Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-04T20:04:12Z","title":"On the Algorithmic Significance and Analysis of the Method of DaYan Deriving One"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01175","kind":"arxiv","version":2},"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:09393e1d80b7aae03207053cd23a2f5035b8086d6188d27396d6be87e4d6ef9d","target":"record","created_at":"2026-05-18T00:36:14Z","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":"aae570203c7c9a501934771c911cde3ed5f3e1c50164654d8d692c6b976915a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-04T20:04:12Z","title_canon_sha256":"709d03c652468e551079cbca31ff7093bb49efe29e51b92440324231feeb0709"},"schema_version":"1.0","source":{"id":"1610.01175","kind":"arxiv","version":2}},"canonical_sha256":"a105a4b1d433244140b873fb5e48acd11a027cb6ce6529b7ae444cb7a50bd9d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a105a4b1d433244140b873fb5e48acd11a027cb6ce6529b7ae444cb7a50bd9d4","first_computed_at":"2026-05-18T00:36:14.404950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:14.404950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"spsiuGDwVoH0JC59wGt/V9jCrG7pPd2AhtEW5KAJpdW01TxgU4+RadbAn+Z12eFWt0ASCubwhNNGwqerwgd8Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:14.405584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01175","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09393e1d80b7aae03207053cd23a2f5035b8086d6188d27396d6be87e4d6ef9d","sha256:1bb5724745c829dc883535e8a99a8ae7c5181ea679e11776bfb3a503e2361e1b"],"state_sha256":"8c3d32026cc6f2f39275a47177d7937c98c62306283c1558a8b2d8cf360a738c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LmHwlcVcfFK6phmnFQEiwi7/zYNhpiooE9Ad6LzrdLiO9zcKQbXz0noayOeBDOc9KMrGpJdhLbciO4AogZKpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:05:22.835100Z","bundle_sha256":"5b1f7f201dceff57ed637b415ff2889948fc8540dde152f150fcad1285d32356"}}