{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5M42IXO2TTHYVG4KO6I52UDV72","short_pith_number":"pith:5M42IXO2","canonical_record":{"source":{"id":"1907.07795","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T22:11:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5a372f471a9bfcf73e3c5824af16f87969c82b891367c1706aa7e830a2bd27e4","abstract_canon_sha256":"3fdf8c625e0065b446398b7bc7c298e75b10624d1993eca29ade0f8241b0444d"},"schema_version":"1.0"},"canonical_sha256":"eb39a45dda9ccf8a9b8a7791dd5075feb130f285261acf3ba9646eb60cecae51","source":{"kind":"arxiv","id":"1907.07795","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07795","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07795v1","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07795","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"pith_short_12","alias_value":"5M42IXO2TTHY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5M42IXO2TTHYVG4K","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5M42IXO2","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5M42IXO2TTHYVG4KO6I52UDV72","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07795","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T22:11:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5a372f471a9bfcf73e3c5824af16f87969c82b891367c1706aa7e830a2bd27e4","abstract_canon_sha256":"3fdf8c625e0065b446398b7bc7c298e75b10624d1993eca29ade0f8241b0444d"},"schema_version":"1.0"},"canonical_sha256":"eb39a45dda9ccf8a9b8a7791dd5075feb130f285261acf3ba9646eb60cecae51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:16.299834Z","signature_b64":"aBQxY/Xh3hLrIEE4wGssHGgehuW/+ZxQWEV8/He39X+hZQrMscOuVT22VsM++RxdWCAE7NSGVf6BC+90g54fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb39a45dda9ccf8a9b8a7791dd5075feb130f285261acf3ba9646eb60cecae51","last_reissued_at":"2026-05-17T23:40:16.299072Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:16.299072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07795","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-17T23:40:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtCDP6JKVpAcRsx0rAt+hCNldvPilag4guXu1HAqSd4Y4OljwB1b3rv2YtTxQcS8pI6fMd0TLP50fUgEfofUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:57:49.050802Z"},"content_sha256":"74e715c378986e512497b649c3a7632636896380a18f19384122aa46e6bfaf4e","schema_version":"1.0","event_id":"sha256:74e715c378986e512497b649c3a7632636896380a18f19384122aa46e6bfaf4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5M42IXO2TTHYVG4KO6I52UDV72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient computation of the Jacobi symbol","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Niels M\\\"oller","submitted_at":"2019-07-17T22:11:22Z","abstract_excerpt":"The family of left-to-right GCD algorithms reduces input numbers by repeatedly subtracting the smaller number, or multiple of the smaller number, from the larger number. This paper describes how to extend any such algorithm to compute the Jacobi symbol, using a single table lookup per reduction. For both quadratic time GCD algorithms (Euclid, Lehmer) and subquadratic algorithms (Knuth, Sch\\\"onhage, M\\\"oller), the additional cost is linear, roughly one table lookup per quotient in the quotient sequence. This method was used for the 2010 rewrite of the Jacobi symbol computation in GMP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07795","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-17T23:40:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VpWTrEA2kNBvDHB8jhmGBqWI6I5Fr8CRZHqsjJg5PJ5yZSR9288EPajCNQUH5sc+LH7foxo6+fCOCmE/dZXABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:57:49.051150Z"},"content_sha256":"e8fc11f0f8fe35515faf4472632d07a4d1131f5300cd948831b311ebb6d15fc6","schema_version":"1.0","event_id":"sha256:e8fc11f0f8fe35515faf4472632d07a4d1131f5300cd948831b311ebb6d15fc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5M42IXO2TTHYVG4KO6I52UDV72/bundle.json","state_url":"https://pith.science/pith/5M42IXO2TTHYVG4KO6I52UDV72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5M42IXO2TTHYVG4KO6I52UDV72/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-11T10:57:49Z","links":{"resolver":"https://pith.science/pith/5M42IXO2TTHYVG4KO6I52UDV72","bundle":"https://pith.science/pith/5M42IXO2TTHYVG4KO6I52UDV72/bundle.json","state":"https://pith.science/pith/5M42IXO2TTHYVG4KO6I52UDV72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5M42IXO2TTHYVG4KO6I52UDV72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5M42IXO2TTHYVG4KO6I52UDV72","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":"3fdf8c625e0065b446398b7bc7c298e75b10624d1993eca29ade0f8241b0444d","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T22:11:22Z","title_canon_sha256":"5a372f471a9bfcf73e3c5824af16f87969c82b891367c1706aa7e830a2bd27e4"},"schema_version":"1.0","source":{"id":"1907.07795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07795","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07795v1","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07795","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"pith_short_12","alias_value":"5M42IXO2TTHY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5M42IXO2TTHYVG4K","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5M42IXO2","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:e8fc11f0f8fe35515faf4472632d07a4d1131f5300cd948831b311ebb6d15fc6","target":"graph","created_at":"2026-05-17T23:40:16Z","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":"The family of left-to-right GCD algorithms reduces input numbers by repeatedly subtracting the smaller number, or multiple of the smaller number, from the larger number. This paper describes how to extend any such algorithm to compute the Jacobi symbol, using a single table lookup per reduction. For both quadratic time GCD algorithms (Euclid, Lehmer) and subquadratic algorithms (Knuth, Sch\\\"onhage, M\\\"oller), the additional cost is linear, roughly one table lookup per quotient in the quotient sequence. This method was used for the 2010 rewrite of the Jacobi symbol computation in GMP.","authors_text":"Niels M\\\"oller","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T22:11:22Z","title":"Efficient computation of the Jacobi symbol"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07795","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:74e715c378986e512497b649c3a7632636896380a18f19384122aa46e6bfaf4e","target":"record","created_at":"2026-05-17T23:40:16Z","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":"3fdf8c625e0065b446398b7bc7c298e75b10624d1993eca29ade0f8241b0444d","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-07-17T22:11:22Z","title_canon_sha256":"5a372f471a9bfcf73e3c5824af16f87969c82b891367c1706aa7e830a2bd27e4"},"schema_version":"1.0","source":{"id":"1907.07795","kind":"arxiv","version":1}},"canonical_sha256":"eb39a45dda9ccf8a9b8a7791dd5075feb130f285261acf3ba9646eb60cecae51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb39a45dda9ccf8a9b8a7791dd5075feb130f285261acf3ba9646eb60cecae51","first_computed_at":"2026-05-17T23:40:16.299072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:16.299072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aBQxY/Xh3hLrIEE4wGssHGgehuW/+ZxQWEV8/He39X+hZQrMscOuVT22VsM++RxdWCAE7NSGVf6BC+90g54fAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:16.299834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74e715c378986e512497b649c3a7632636896380a18f19384122aa46e6bfaf4e","sha256:e8fc11f0f8fe35515faf4472632d07a4d1131f5300cd948831b311ebb6d15fc6"],"state_sha256":"a3c7fff26024e4d00052d7fd0313250381c673c78b47ef2f99111a4b0559404e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RL/+weFg6zP3eF28BlAv376HdRwLPNpyWBGyJjlr+ozz2S7YQeEwvYBMTc1scPDApD7OxwrSy3i7TtvAF4gmBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:57:49.053144Z","bundle_sha256":"c69010c2cdfce80a24a10b3601b23df714bdf44f319c29307210d6010e6b1470"}}