{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HPX2IWGSSTVQ5C7FEELRZ7AFCE","short_pith_number":"pith:HPX2IWGS","schema_version":"1.0","canonical_sha256":"3befa458d294eb0e8be521171cfc05111b0cbbf3f8ffa2041f1acdd8c34f5c57","source":{"kind":"arxiv","id":"1008.3459","version":1},"attestation_state":"computed","paper":{"title":"Bit-size estimates for triangular sets in positive dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Abdulilah Kadri, \\'Eric Schost, Xavier Dahan","submitted_at":"2010-08-20T08:43:03Z","abstract_excerpt":"We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the underlying algebraic sets. We illustrate the use of these results in the context of a modular algorithm. This extends results by the first and last author, which were confined to the case of dimension 0. Our strategy is to get back to dimension 0 by evaluation and inter- polation techniques. Even though the main tool (height theory) remains the same, new difficult"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1008.3459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-08-20T08:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"84880173de8618a3142d15e6f50fb8468c54be1547f16b2d601eeb8037182f65","abstract_canon_sha256":"1a3037d1ea1727ec32ff510db0f52f91adcdcaac83e1b522ebd33e552e522ec8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:55.168371Z","signature_b64":"LNdpeYsYHSVfPVnbUzhyEtsVzgoFxn/xEBonctausVSkGlxdAnsIctREiQ8+wyTIJXm+nSkuWUYyvZnoCk+mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3befa458d294eb0e8be521171cfc05111b0cbbf3f8ffa2041f1acdd8c34f5c57","last_reissued_at":"2026-05-18T04:34:55.167948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:55.167948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bit-size estimates for triangular sets in positive dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Abdulilah Kadri, \\'Eric Schost, Xavier Dahan","submitted_at":"2010-08-20T08:43:03Z","abstract_excerpt":"We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the underlying algebraic sets. We illustrate the use of these results in the context of a modular algorithm. This extends results by the first and last author, which were confined to the case of dimension 0. Our strategy is to get back to dimension 0 by evaluation and inter- polation techniques. Even though the main tool (height theory) remains the same, new difficult"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3459","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1008.3459","created_at":"2026-05-18T04:34:55.168004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3459v1","created_at":"2026-05-18T04:34:55.168004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3459","created_at":"2026-05-18T04:34:55.168004+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPX2IWGSSTVQ","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPX2IWGSSTVQ5C7F","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPX2IWGS","created_at":"2026-05-18T12:26:07.630475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HPX2IWGSSTVQ5C7FEELRZ7AFCE","json":"https://pith.science/pith/HPX2IWGSSTVQ5C7FEELRZ7AFCE.json","graph_json":"https://pith.science/api/pith-number/HPX2IWGSSTVQ5C7FEELRZ7AFCE/graph.json","events_json":"https://pith.science/api/pith-number/HPX2IWGSSTVQ5C7FEELRZ7AFCE/events.json","paper":"https://pith.science/paper/HPX2IWGS"},"agent_actions":{"view_html":"https://pith.science/pith/HPX2IWGSSTVQ5C7FEELRZ7AFCE","download_json":"https://pith.science/pith/HPX2IWGSSTVQ5C7FEELRZ7AFCE.json","view_paper":"https://pith.science/paper/HPX2IWGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3459&json=true","fetch_graph":"https://pith.science/api/pith-number/HPX2IWGSSTVQ5C7FEELRZ7AFCE/graph.json","fetch_events":"https://pith.science/api/pith-number/HPX2IWGSSTVQ5C7FEELRZ7AFCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPX2IWGSSTVQ5C7FEELRZ7AFCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPX2IWGSSTVQ5C7FEELRZ7AFCE/action/storage_attestation","attest_author":"https://pith.science/pith/HPX2IWGSSTVQ5C7FEELRZ7AFCE/action/author_attestation","sign_citation":"https://pith.science/pith/HPX2IWGSSTVQ5C7FEELRZ7AFCE/action/citation_signature","submit_replication":"https://pith.science/pith/HPX2IWGSSTVQ5C7FEELRZ7AFCE/action/replication_record"}},"created_at":"2026-05-18T04:34:55.168004+00:00","updated_at":"2026-05-18T04:34:55.168004+00:00"}