{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:75MRZDJHCM7TNT2WAY4QO3OU2I","short_pith_number":"pith:75MRZDJH","canonical_record":{"source":{"id":"1105.5992","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-05-30T13:34:27Z","cross_cats_sorted":[],"title_canon_sha256":"1b6cb471fd45832fc620a2f6be4b73dc7793f240122364736d784dd1d60778cb","abstract_canon_sha256":"468681254c9e8fd1cb1327f666da28006df24021db9a8efd3b43a4560a002e88"},"schema_version":"1.0"},"canonical_sha256":"ff591c8d27133f36cf560639076dd4d2050e875746d8a318504c0d68bbd30f01","source":{"kind":"arxiv","id":"1105.5992","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5992","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5992v2","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5992","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"75MRZDJHCM7T","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"75MRZDJHCM7TNT2W","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"75MRZDJH","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:75MRZDJHCM7TNT2WAY4QO3OU2I","target":"record","payload":{"canonical_record":{"source":{"id":"1105.5992","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-05-30T13:34:27Z","cross_cats_sorted":[],"title_canon_sha256":"1b6cb471fd45832fc620a2f6be4b73dc7793f240122364736d784dd1d60778cb","abstract_canon_sha256":"468681254c9e8fd1cb1327f666da28006df24021db9a8efd3b43a4560a002e88"},"schema_version":"1.0"},"canonical_sha256":"ff591c8d27133f36cf560639076dd4d2050e875746d8a318504c0d68bbd30f01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:59.002868Z","signature_b64":"EJIVT2X/mYdnOonusX3KzBDfcTVv+DrIWwd+qw8XphvjETYqMTdBTAmheQ5Mi8Cljc+chMTlo7hR12db0MxJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff591c8d27133f36cf560639076dd4d2050e875746d8a318504c0d68bbd30f01","last_reissued_at":"2026-05-18T03:41:59.002296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:59.002296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.5992","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-18T03:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65lQ3ApsnP+0vAV4vX7nAFTGiQyGHcta8Y3xvenm85WYwmQhg+0+SV4ATRDJ8SI7RyDKBPD7/ffjGgq16vgJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:29:23.200169Z"},"content_sha256":"21a12e042a2a108b9bd71b064c8949b37566fcb80ca21eb42521c43dde8fe497","schema_version":"1.0","event_id":"sha256:21a12e042a2a108b9bd71b064c8949b37566fcb80ca21eb42521c43dde8fe497"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:75MRZDJHCM7TNT2WAY4QO3OU2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust certified numerical homotopy tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Anton Leykin, Carlos Beltr\\'an","submitted_at":"2011-05-30T13:34:27Z","abstract_excerpt":"We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial zero are rational our algorithm involves only rational computations and if the homotopy is well posed an approximate zero with integer coordinates of the target system is obtained. The total bit complexity is linear in the length of the path in the condition metric, and polynomial in the logarithm of the maximum of the condition number along the path, and in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5992","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-18T03:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hapWlUM39fgGO7cJ+AOOqJyU18wGoTC+xJsSkBCs9gc2Q6djpBHycn5bQ9+Bxe+wKTcZgGEFzsEDCnns8XazCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:29:23.200525Z"},"content_sha256":"0ff9c445e7b7dbc22f94f9509b527187555dad1643d98b22c21580afbb6afa0f","schema_version":"1.0","event_id":"sha256:0ff9c445e7b7dbc22f94f9509b527187555dad1643d98b22c21580afbb6afa0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75MRZDJHCM7TNT2WAY4QO3OU2I/bundle.json","state_url":"https://pith.science/pith/75MRZDJHCM7TNT2WAY4QO3OU2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75MRZDJHCM7TNT2WAY4QO3OU2I/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-02T19:29:23Z","links":{"resolver":"https://pith.science/pith/75MRZDJHCM7TNT2WAY4QO3OU2I","bundle":"https://pith.science/pith/75MRZDJHCM7TNT2WAY4QO3OU2I/bundle.json","state":"https://pith.science/pith/75MRZDJHCM7TNT2WAY4QO3OU2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75MRZDJHCM7TNT2WAY4QO3OU2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:75MRZDJHCM7TNT2WAY4QO3OU2I","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":"468681254c9e8fd1cb1327f666da28006df24021db9a8efd3b43a4560a002e88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-05-30T13:34:27Z","title_canon_sha256":"1b6cb471fd45832fc620a2f6be4b73dc7793f240122364736d784dd1d60778cb"},"schema_version":"1.0","source":{"id":"1105.5992","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5992","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5992v2","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5992","created_at":"2026-05-18T03:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"75MRZDJHCM7T","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"75MRZDJHCM7TNT2W","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"75MRZDJH","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:0ff9c445e7b7dbc22f94f9509b527187555dad1643d98b22c21580afbb6afa0f","target":"graph","created_at":"2026-05-18T03:41:59Z","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 describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial zero are rational our algorithm involves only rational computations and if the homotopy is well posed an approximate zero with integer coordinates of the target system is obtained. The total bit complexity is linear in the length of the path in the condition metric, and polynomial in the logarithm of the maximum of the condition number along the path, and in","authors_text":"Anton Leykin, Carlos Beltr\\'an","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-05-30T13:34:27Z","title":"Robust certified numerical homotopy tracking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5992","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:21a12e042a2a108b9bd71b064c8949b37566fcb80ca21eb42521c43dde8fe497","target":"record","created_at":"2026-05-18T03:41:59Z","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":"468681254c9e8fd1cb1327f666da28006df24021db9a8efd3b43a4560a002e88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-05-30T13:34:27Z","title_canon_sha256":"1b6cb471fd45832fc620a2f6be4b73dc7793f240122364736d784dd1d60778cb"},"schema_version":"1.0","source":{"id":"1105.5992","kind":"arxiv","version":2}},"canonical_sha256":"ff591c8d27133f36cf560639076dd4d2050e875746d8a318504c0d68bbd30f01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff591c8d27133f36cf560639076dd4d2050e875746d8a318504c0d68bbd30f01","first_computed_at":"2026-05-18T03:41:59.002296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:59.002296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EJIVT2X/mYdnOonusX3KzBDfcTVv+DrIWwd+qw8XphvjETYqMTdBTAmheQ5Mi8Cljc+chMTlo7hR12db0MxJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:59.002868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5992","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21a12e042a2a108b9bd71b064c8949b37566fcb80ca21eb42521c43dde8fe497","sha256:0ff9c445e7b7dbc22f94f9509b527187555dad1643d98b22c21580afbb6afa0f"],"state_sha256":"177b484ac97522023b0639443ba4bb92d14c02189edbdb0a6b1168153c1c10a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKvtItNM1oZ1FSBLduDXJDFBVlMduoFv2FQeRS18TQQb55BBnm5N+EHkpt9zjRjG4aCjRPstf7RiPR5jKMpFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:29:23.202430Z","bundle_sha256":"172e019e896f694d97996720e7da60d3e4bfc80b687eb39c203c1d8d204b6b18"}}