{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1996:LWLHZES4N42RGK6L5M4MUMD64I","short_pith_number":"pith:LWLHZES4","canonical_record":{"source":{"id":"alg-geom/9608010","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"alg-geom","submitted_at":"1996-08-13T17:38:29Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"e6bac8487a3d2e28c12da4b9241bde0ef081e0088ae1cee87c93cc9acd8ee7c1","abstract_canon_sha256":"d2023435819ed65f34d6d1e0ad5fc6a18fa576696b35978d3aaf2c476613d60d"},"schema_version":"1.0"},"canonical_sha256":"5d967c925c6f35132bcbeb38ca307ee232ba4e72d7f77b85553afa86813b1235","source":{"kind":"arxiv","id":"alg-geom/9608010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"alg-geom/9608010","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"arxiv_version","alias_value":"alg-geom/9608010v1","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.alg-geom/9608010","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"pith_short_12","alias_value":"LWLHZES4N42R","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"pith_short_16","alias_value":"LWLHZES4N42RGK6L","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"pith_short_8","alias_value":"LWLHZES4","created_at":"2026-07-04T15:08:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1996:LWLHZES4N42RGK6L5M4MUMD64I","target":"record","payload":{"canonical_record":{"source":{"id":"alg-geom/9608010","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"alg-geom","submitted_at":"1996-08-13T17:38:29Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"e6bac8487a3d2e28c12da4b9241bde0ef081e0088ae1cee87c93cc9acd8ee7c1","abstract_canon_sha256":"d2023435819ed65f34d6d1e0ad5fc6a18fa576696b35978d3aaf2c476613d60d"},"schema_version":"1.0"},"canonical_sha256":"5d967c925c6f35132bcbeb38ca307ee232ba4e72d7f77b85553afa86813b1235","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:08:06.629685Z","signature_b64":"jjOcaGnri6IwZhpPC2/kJ7nLtoK0iVdAI16TzLhIr57I47dlYFY5MMsvmQ7083wtSza7dbHsIxPsCbpcISaSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d967c925c6f35132bcbeb38ca307ee232ba4e72d7f77b85553afa86813b1235","last_reissued_at":"2026-07-04T15:08:06.629214Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:08:06.629214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"alg-geom/9608010","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-07-04T15:08:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+PYbwxousDfKtJ+0/67iXAk/wUHhinOGubLCe5QzkJMWcCAJxjmzhzfBii+GHpPzUeaoJh6iwEKcWzUlcNXVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T17:57:38.626190Z"},"content_sha256":"ae2b413849ef8c51511356b45cc57ad56645a8290fabfad119b1a3e03741eede","schema_version":"1.0","event_id":"sha256:ae2b413849ef8c51511356b45cc57ad56645a8290fabfad119b1a3e03741eede"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1996:LWLHZES4N42RGK6L5M4MUMD64I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for diophantine Approximation","license":"","headline":"","cross_cats":["math.AG"],"primary_cat":"alg-geom","authors_text":"J. E. Morais, J. Heintz, J. L. Monta\\~na, K. H\\\"agele, L. M. Pardo, M. Giusti","submitted_at":"1996-08-13T17:38:29Z","abstract_excerpt":"We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new procedure for the decision of consistency of polynomial equation systems whose bit complexity is subexponential, too. As a byproduct, we analyze the division of a polynomial modulo a reduced complete intersection ideal and from this, we obtain an intrinsic lower bound for the logarithmic height of diophantine approximations to a given solution of a zero--dimension"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"alg-geom/9608010","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/alg-geom/9608010/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:08:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"memBkWcfV8uZwaEBXy5XXbF9Q+SCasHg+1tz+hue0Y8oK4UmuIFNdBcl5blKFsMxLMJQICFzm0qERuuIsJYeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T17:57:38.626733Z"},"content_sha256":"52b56554897b7588b1604d92c5efb0ad756270e6932175ff35dc343b90fe2bac","schema_version":"1.0","event_id":"sha256:52b56554897b7588b1604d92c5efb0ad756270e6932175ff35dc343b90fe2bac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWLHZES4N42RGK6L5M4MUMD64I/bundle.json","state_url":"https://pith.science/pith/LWLHZES4N42RGK6L5M4MUMD64I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWLHZES4N42RGK6L5M4MUMD64I/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-08-19T17:57:38Z","links":{"resolver":"https://pith.science/pith/LWLHZES4N42RGK6L5M4MUMD64I","bundle":"https://pith.science/pith/LWLHZES4N42RGK6L5M4MUMD64I/bundle.json","state":"https://pith.science/pith/LWLHZES4N42RGK6L5M4MUMD64I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWLHZES4N42RGK6L5M4MUMD64I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1996:LWLHZES4N42RGK6L5M4MUMD64I","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":"d2023435819ed65f34d6d1e0ad5fc6a18fa576696b35978d3aaf2c476613d60d","cross_cats_sorted":["math.AG"],"license":"","primary_cat":"alg-geom","submitted_at":"1996-08-13T17:38:29Z","title_canon_sha256":"e6bac8487a3d2e28c12da4b9241bde0ef081e0088ae1cee87c93cc9acd8ee7c1"},"schema_version":"1.0","source":{"id":"alg-geom/9608010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"alg-geom/9608010","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"arxiv_version","alias_value":"alg-geom/9608010v1","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.alg-geom/9608010","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"pith_short_12","alias_value":"LWLHZES4N42R","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"pith_short_16","alias_value":"LWLHZES4N42RGK6L","created_at":"2026-07-04T15:08:06Z"},{"alias_kind":"pith_short_8","alias_value":"LWLHZES4","created_at":"2026-07-04T15:08:06Z"}],"graph_snapshots":[{"event_id":"sha256:52b56554897b7588b1604d92c5efb0ad756270e6932175ff35dc343b90fe2bac","target":"graph","created_at":"2026-07-04T15:08:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/alg-geom/9608010/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new procedure for the decision of consistency of polynomial equation systems whose bit complexity is subexponential, too. As a byproduct, we analyze the division of a polynomial modulo a reduced complete intersection ideal and from this, we obtain an intrinsic lower bound for the logarithmic height of diophantine approximations to a given solution of a zero--dimension","authors_text":"J. E. Morais, J. Heintz, J. L. Monta\\~na, K. H\\\"agele, L. M. Pardo, M. Giusti","cross_cats":["math.AG"],"headline":"","license":"","primary_cat":"alg-geom","submitted_at":"1996-08-13T17:38:29Z","title":"Lower Bounds for diophantine Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"alg-geom/9608010","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:ae2b413849ef8c51511356b45cc57ad56645a8290fabfad119b1a3e03741eede","target":"record","created_at":"2026-07-04T15:08:06Z","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":"d2023435819ed65f34d6d1e0ad5fc6a18fa576696b35978d3aaf2c476613d60d","cross_cats_sorted":["math.AG"],"license":"","primary_cat":"alg-geom","submitted_at":"1996-08-13T17:38:29Z","title_canon_sha256":"e6bac8487a3d2e28c12da4b9241bde0ef081e0088ae1cee87c93cc9acd8ee7c1"},"schema_version":"1.0","source":{"id":"alg-geom/9608010","kind":"arxiv","version":1}},"canonical_sha256":"5d967c925c6f35132bcbeb38ca307ee232ba4e72d7f77b85553afa86813b1235","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d967c925c6f35132bcbeb38ca307ee232ba4e72d7f77b85553afa86813b1235","first_computed_at":"2026-07-04T15:08:06.629214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:08:06.629214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jjOcaGnri6IwZhpPC2/kJ7nLtoK0iVdAI16TzLhIr57I47dlYFY5MMsvmQ7083wtSza7dbHsIxPsCbpcISaSCg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:08:06.629685Z","signed_message":"canonical_sha256_bytes"},"source_id":"alg-geom/9608010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae2b413849ef8c51511356b45cc57ad56645a8290fabfad119b1a3e03741eede","sha256:52b56554897b7588b1604d92c5efb0ad756270e6932175ff35dc343b90fe2bac"],"state_sha256":"aee847e9af2a144de4d9866ed6c607c44f0bb7b806c84dc80ea9883b8885a6f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ajqco5CVweW1ETNG+oTvDZ7OZpELE4rkYM+cPTZhvhZam6rbiaFsN/06bOay685h+0rtjqIUaBtN89CuceVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T17:57:38.633299Z","bundle_sha256":"708cd3f4a3c651f5fa4a0643174f8c24285f7dcd5f3c9abf4dbeddb656096c71"}}