{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GKWFUEM3S5Y4QPWURBWHQZ5CYS","short_pith_number":"pith:GKWFUEM3","canonical_record":{"source":{"id":"1807.07719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:16:22Z","cross_cats_sorted":[],"title_canon_sha256":"d66ad8efcf261af700b8af5a62bba8267766bf82c8e3994f873bd7ec89064666","abstract_canon_sha256":"e99378a0629339aa5744a0abf2dd0993aaa5783245c3a05f55642be655a365e5"},"schema_version":"1.0"},"canonical_sha256":"32ac5a119b9771c83ed4886c7867a2c49c7f68fa20fb0bb31cc9e3a1085ecbcc","source":{"kind":"arxiv","id":"1807.07719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07719","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07719v1","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07719","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"GKWFUEM3S5Y4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GKWFUEM3S5Y4QPWU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GKWFUEM3","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GKWFUEM3S5Y4QPWURBWHQZ5CYS","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:16:22Z","cross_cats_sorted":[],"title_canon_sha256":"d66ad8efcf261af700b8af5a62bba8267766bf82c8e3994f873bd7ec89064666","abstract_canon_sha256":"e99378a0629339aa5744a0abf2dd0993aaa5783245c3a05f55642be655a365e5"},"schema_version":"1.0"},"canonical_sha256":"32ac5a119b9771c83ed4886c7867a2c49c7f68fa20fb0bb31cc9e3a1085ecbcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:15.827809Z","signature_b64":"m3iQbdRyrQ4ZqIRRKhJMhVKtUmd6ctigPfYVG5UI0GdCBNqraDU/GPHUriI/Ronuldda74x/biRR8HGIuV2pAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32ac5a119b9771c83ed4886c7867a2c49c7f68fa20fb0bb31cc9e3a1085ecbcc","last_reissued_at":"2026-05-18T00:10:15.827069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:15.827069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07719","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-18T00:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7x/VaR1sxNB0S4GWcS+4MXJRWW169F6OdcM//SmQn0PdY09faDjfZDiJloBIH2VYdcm8LwZFeROCpvKNvF05Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:13:05.459827Z"},"content_sha256":"b9b3ea457dadc16fb164fee4bc45a9baa193434a58d2701a2b7e89c2d1c53c37","schema_version":"1.0","event_id":"sha256:b9b3ea457dadc16fb164fee4bc45a9baa193434a58d2701a2b7e89c2d1c53c37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GKWFUEM3S5Y4QPWURBWHQZ5CYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Euclidean Methods for Cubic and Quartic Jacobi Symbols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bryce Sandlund, Eric Bach","submitted_at":"2018-07-20T07:16:22Z","abstract_excerpt":"We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give examples to show that with standard arithmetic, if quotients are computed naively (by using exact norms as denominators, then rounding), the algorithms have $\\Theta(n^3)$ bit complexity. It is a \"folk theorem\" that this can be reduced to $O(n^2)$ by modifying the division procedure. We give a self-contained proof of this, and show that quadratic time is best po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07719","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-18T00:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ewhrAJLJbvOGvtPfPJvPRwmj0y011LFi1N1QpXa72jpNmGoxCI0Ox8q362aWB04xjkKZRzgq7lS4crLJNO4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:13:05.460177Z"},"content_sha256":"587d72141d22388aec8ee20c69b0178bb77c9a64dae5baf8bf49d38925e5d15c","schema_version":"1.0","event_id":"sha256:587d72141d22388aec8ee20c69b0178bb77c9a64dae5baf8bf49d38925e5d15c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKWFUEM3S5Y4QPWURBWHQZ5CYS/bundle.json","state_url":"https://pith.science/pith/GKWFUEM3S5Y4QPWURBWHQZ5CYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKWFUEM3S5Y4QPWURBWHQZ5CYS/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-03T16:13:05Z","links":{"resolver":"https://pith.science/pith/GKWFUEM3S5Y4QPWURBWHQZ5CYS","bundle":"https://pith.science/pith/GKWFUEM3S5Y4QPWURBWHQZ5CYS/bundle.json","state":"https://pith.science/pith/GKWFUEM3S5Y4QPWURBWHQZ5CYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKWFUEM3S5Y4QPWURBWHQZ5CYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GKWFUEM3S5Y4QPWURBWHQZ5CYS","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":"e99378a0629339aa5744a0abf2dd0993aaa5783245c3a05f55642be655a365e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:16:22Z","title_canon_sha256":"d66ad8efcf261af700b8af5a62bba8267766bf82c8e3994f873bd7ec89064666"},"schema_version":"1.0","source":{"id":"1807.07719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07719","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07719v1","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07719","created_at":"2026-05-18T00:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"GKWFUEM3S5Y4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GKWFUEM3S5Y4QPWU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GKWFUEM3","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:587d72141d22388aec8ee20c69b0178bb77c9a64dae5baf8bf49d38925e5d15c","target":"graph","created_at":"2026-05-18T00:10:15Z","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":"We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give examples to show that with standard arithmetic, if quotients are computed naively (by using exact norms as denominators, then rounding), the algorithms have $\\Theta(n^3)$ bit complexity. It is a \"folk theorem\" that this can be reduced to $O(n^2)$ by modifying the division procedure. We give a self-contained proof of this, and show that quadratic time is best po","authors_text":"Bryce Sandlund, Eric Bach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:16:22Z","title":"On Euclidean Methods for Cubic and Quartic Jacobi Symbols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07719","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:b9b3ea457dadc16fb164fee4bc45a9baa193434a58d2701a2b7e89c2d1c53c37","target":"record","created_at":"2026-05-18T00:10:15Z","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":"e99378a0629339aa5744a0abf2dd0993aaa5783245c3a05f55642be655a365e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:16:22Z","title_canon_sha256":"d66ad8efcf261af700b8af5a62bba8267766bf82c8e3994f873bd7ec89064666"},"schema_version":"1.0","source":{"id":"1807.07719","kind":"arxiv","version":1}},"canonical_sha256":"32ac5a119b9771c83ed4886c7867a2c49c7f68fa20fb0bb31cc9e3a1085ecbcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32ac5a119b9771c83ed4886c7867a2c49c7f68fa20fb0bb31cc9e3a1085ecbcc","first_computed_at":"2026-05-18T00:10:15.827069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:15.827069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m3iQbdRyrQ4ZqIRRKhJMhVKtUmd6ctigPfYVG5UI0GdCBNqraDU/GPHUriI/Ronuldda74x/biRR8HGIuV2pAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:15.827809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9b3ea457dadc16fb164fee4bc45a9baa193434a58d2701a2b7e89c2d1c53c37","sha256:587d72141d22388aec8ee20c69b0178bb77c9a64dae5baf8bf49d38925e5d15c"],"state_sha256":"639e69937dc21bb14b85a2708555048a2ab9d07c2856c38a0ebc87929c6ef863"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rn0OJuVu3Mwj6VjNB5dqHl02JqoF3OsByxITt9PFrHR3Wuxy+YrCsI2MdDYQ7bHzMZpOSjccn7zImhLu37+/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:13:05.462187Z","bundle_sha256":"879fe6b19381cd03df9fc987b376d6f017acb7d4c7d85124cea5436858f7f411"}}