{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DERMZRN5AU5GYWIDECWT773GTE","short_pith_number":"pith:DERMZRN5","canonical_record":{"source":{"id":"1203.1034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.EP","submitted_at":"2012-03-05T21:00:01Z","cross_cats_sorted":["cs.MS","math.NA"],"title_canon_sha256":"2175993d86d0adfbc79ecd40555894595be9738df80a074451d6a2b4b9d69af8","abstract_canon_sha256":"aaa2b8a243df6bca4878eea4adcf04360d6269f4bc1ee589cb3e5cd6f2921a50"},"schema_version":"1.0"},"canonical_sha256":"1922ccc5bd053a6c590320ad3fff669937e11c91410e5513fbcb1a5bb8a681cc","source":{"kind":"arxiv","id":"1203.1034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1034","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1034v1","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1034","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"DERMZRN5AU5G","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DERMZRN5AU5GYWID","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DERMZRN5","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DERMZRN5AU5GYWIDECWT773GTE","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.EP","submitted_at":"2012-03-05T21:00:01Z","cross_cats_sorted":["cs.MS","math.NA"],"title_canon_sha256":"2175993d86d0adfbc79ecd40555894595be9738df80a074451d6a2b4b9d69af8","abstract_canon_sha256":"aaa2b8a243df6bca4878eea4adcf04360d6269f4bc1ee589cb3e5cd6f2921a50"},"schema_version":"1.0"},"canonical_sha256":"1922ccc5bd053a6c590320ad3fff669937e11c91410e5513fbcb1a5bb8a681cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:48.874769Z","signature_b64":"bmJYBkryZrAt9goEPY58K91f2s6Wga24FL/YUxas/5TN2GsZofNhMTMFEcZv/oOQYd6G4/Hd0me7dqtRzu8eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1922ccc5bd053a6c590320ad3fff669937e11c91410e5513fbcb1a5bb8a681cc","last_reissued_at":"2026-05-18T04:00:48.874308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:48.874308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1034","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-18T04:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NGyoJhvMz/SzGnuy+4sC4Vc1MP7K2naoWiZhCkk8B25mMQNjZayKxeLRoMYvxUJiY15AMpJ+Tzs5uvuKDYHfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:01:10.416165Z"},"content_sha256":"1fbbd4664f706f267f2f05f974531d0baee2bf6618eafabea62145357303aed8","schema_version":"1.0","event_id":"sha256:1fbbd4664f706f267f2f05f974531d0baee2bf6618eafabea62145357303aed8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DERMZRN5AU5GYWIDECWT773GTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General Complex Polynomial Root Solver and Its Further Optimization for Binary Microlenses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.NA"],"primary_cat":"astro-ph.EP","authors_text":"A. Gould (Department of Astronomy, J. Skowron, Ohio State University)","submitted_at":"2012-03-05T21:00:01Z","abstract_excerpt":"We present a new algorithm to solve polynomial equations, and publish its code, which is 1.6-3 times faster than the ZROOTS subroutine that is commercially available from Numerical Recipes, depending on application. The largest improvement, when compared to naive solvers, comes from a fail-safe procedure that permits us to skip the majority of the calculations in the great majority of cases, without risking catastrophic failure in the few cases that these are actually required. Second, we identify a discriminant that enables a rational choice between Laguerre's Method and Newton's Method (or a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1034","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-18T04:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fngo+c5SCBORPgLyMwbxc0J38AsJhYASn6A990SEOt1tJUeOEm1SrxWrAo86ByMGp7jGFL+/e+WYK2k6jDQ8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:01:10.416883Z"},"content_sha256":"6cf7e44f02329fe658af0be2ba2dbef6542236d812d9520eefe77aa0f859d5ae","schema_version":"1.0","event_id":"sha256:6cf7e44f02329fe658af0be2ba2dbef6542236d812d9520eefe77aa0f859d5ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DERMZRN5AU5GYWIDECWT773GTE/bundle.json","state_url":"https://pith.science/pith/DERMZRN5AU5GYWIDECWT773GTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DERMZRN5AU5GYWIDECWT773GTE/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-05-30T04:01:10Z","links":{"resolver":"https://pith.science/pith/DERMZRN5AU5GYWIDECWT773GTE","bundle":"https://pith.science/pith/DERMZRN5AU5GYWIDECWT773GTE/bundle.json","state":"https://pith.science/pith/DERMZRN5AU5GYWIDECWT773GTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DERMZRN5AU5GYWIDECWT773GTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DERMZRN5AU5GYWIDECWT773GTE","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":"aaa2b8a243df6bca4878eea4adcf04360d6269f4bc1ee589cb3e5cd6f2921a50","cross_cats_sorted":["cs.MS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.EP","submitted_at":"2012-03-05T21:00:01Z","title_canon_sha256":"2175993d86d0adfbc79ecd40555894595be9738df80a074451d6a2b4b9d69af8"},"schema_version":"1.0","source":{"id":"1203.1034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1034","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1034v1","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1034","created_at":"2026-05-18T04:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"DERMZRN5AU5G","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DERMZRN5AU5GYWID","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DERMZRN5","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:6cf7e44f02329fe658af0be2ba2dbef6542236d812d9520eefe77aa0f859d5ae","target":"graph","created_at":"2026-05-18T04:00:48Z","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 present a new algorithm to solve polynomial equations, and publish its code, which is 1.6-3 times faster than the ZROOTS subroutine that is commercially available from Numerical Recipes, depending on application. The largest improvement, when compared to naive solvers, comes from a fail-safe procedure that permits us to skip the majority of the calculations in the great majority of cases, without risking catastrophic failure in the few cases that these are actually required. Second, we identify a discriminant that enables a rational choice between Laguerre's Method and Newton's Method (or a","authors_text":"A. Gould (Department of Astronomy, J. Skowron, Ohio State University)","cross_cats":["cs.MS","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.EP","submitted_at":"2012-03-05T21:00:01Z","title":"General Complex Polynomial Root Solver and Its Further Optimization for Binary Microlenses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1034","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:1fbbd4664f706f267f2f05f974531d0baee2bf6618eafabea62145357303aed8","target":"record","created_at":"2026-05-18T04:00:48Z","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":"aaa2b8a243df6bca4878eea4adcf04360d6269f4bc1ee589cb3e5cd6f2921a50","cross_cats_sorted":["cs.MS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.EP","submitted_at":"2012-03-05T21:00:01Z","title_canon_sha256":"2175993d86d0adfbc79ecd40555894595be9738df80a074451d6a2b4b9d69af8"},"schema_version":"1.0","source":{"id":"1203.1034","kind":"arxiv","version":1}},"canonical_sha256":"1922ccc5bd053a6c590320ad3fff669937e11c91410e5513fbcb1a5bb8a681cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1922ccc5bd053a6c590320ad3fff669937e11c91410e5513fbcb1a5bb8a681cc","first_computed_at":"2026-05-18T04:00:48.874308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:48.874308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bmJYBkryZrAt9goEPY58K91f2s6Wga24FL/YUxas/5TN2GsZofNhMTMFEcZv/oOQYd6G4/Hd0me7dqtRzu8eCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:48.874769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fbbd4664f706f267f2f05f974531d0baee2bf6618eafabea62145357303aed8","sha256:6cf7e44f02329fe658af0be2ba2dbef6542236d812d9520eefe77aa0f859d5ae"],"state_sha256":"a06b8bdccd090be4176da65787dd98edf70cf19b9c295c624d310695ed518d18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWp+pG0ItAnXRKWCVsDRYB95Tiu+cxr+Fw93ZJUcEg6GgkHuEPifH/YJEWEokCQi52576tqihX14VDDRlv8aBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:01:10.420223Z","bundle_sha256":"bd1f72fb70b5f77e55cea4bf772f9a19716298adc3ad7996f264def06d6089de"}}