{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:L2XDWM4LKOV3TMOP6RFXHX5QU6","short_pith_number":"pith:L2XDWM4L","schema_version":"1.0","canonical_sha256":"5eae3b338b53abb9b1cff44b73dfb0a7833c27d1ba24a010c7f925c1783ce3ec","source":{"kind":"arxiv","id":"1201.4344","version":2},"attestation_state":"computed","paper":{"title":"On the intrinsic complexity of elimination problems in effective Algebraic Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andres Rojas Paredes, Bart Kuijpers, Joos Heintz","submitted_at":"2012-01-20T17:16:22Z","abstract_excerpt":"The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective algebraic geometry and show the intrinsically exponential complexity character of elimination in this complexity model."},"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":"1201.4344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-20T17:16:22Z","cross_cats_sorted":[],"title_canon_sha256":"622bc425b21623d840cdedf66aaba3db9a755936dbb940ab641f56f381495270","abstract_canon_sha256":"ccd4ffd03734774b4ac44308e86c6a2970fee7c0c1cdaf8acf0f2093b7b9e341"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:02.799726Z","signature_b64":"KZ8hds8+k6k2ysL5V6Ag1f0kI2Cy4Yd18o++i8QibsZG7eQzuLcauHWaMPO+L2wXxYjSnGV7e9gLONHbHiP0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eae3b338b53abb9b1cff44b73dfb0a7833c27d1ba24a010c7f925c1783ce3ec","last_reissued_at":"2026-05-18T03:57:02.798806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:02.798806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the intrinsic complexity of elimination problems in effective Algebraic Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andres Rojas Paredes, Bart Kuijpers, Joos Heintz","submitted_at":"2012-01-20T17:16:22Z","abstract_excerpt":"The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation model which captures all known symbolic elimination algorithms in effective algebraic geometry and show the intrinsically exponential complexity character of elimination in this complexity model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4344","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.4344","created_at":"2026-05-18T03:57:02.798978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4344v2","created_at":"2026-05-18T03:57:02.798978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4344","created_at":"2026-05-18T03:57:02.798978+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2XDWM4LKOV3","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2XDWM4LKOV3TMOP","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2XDWM4L","created_at":"2026-05-18T12:27:11.947152+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/L2XDWM4LKOV3TMOP6RFXHX5QU6","json":"https://pith.science/pith/L2XDWM4LKOV3TMOP6RFXHX5QU6.json","graph_json":"https://pith.science/api/pith-number/L2XDWM4LKOV3TMOP6RFXHX5QU6/graph.json","events_json":"https://pith.science/api/pith-number/L2XDWM4LKOV3TMOP6RFXHX5QU6/events.json","paper":"https://pith.science/paper/L2XDWM4L"},"agent_actions":{"view_html":"https://pith.science/pith/L2XDWM4LKOV3TMOP6RFXHX5QU6","download_json":"https://pith.science/pith/L2XDWM4LKOV3TMOP6RFXHX5QU6.json","view_paper":"https://pith.science/paper/L2XDWM4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4344&json=true","fetch_graph":"https://pith.science/api/pith-number/L2XDWM4LKOV3TMOP6RFXHX5QU6/graph.json","fetch_events":"https://pith.science/api/pith-number/L2XDWM4LKOV3TMOP6RFXHX5QU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2XDWM4LKOV3TMOP6RFXHX5QU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2XDWM4LKOV3TMOP6RFXHX5QU6/action/storage_attestation","attest_author":"https://pith.science/pith/L2XDWM4LKOV3TMOP6RFXHX5QU6/action/author_attestation","sign_citation":"https://pith.science/pith/L2XDWM4LKOV3TMOP6RFXHX5QU6/action/citation_signature","submit_replication":"https://pith.science/pith/L2XDWM4LKOV3TMOP6RFXHX5QU6/action/replication_record"}},"created_at":"2026-05-18T03:57:02.798978+00:00","updated_at":"2026-05-18T03:57:02.798978+00:00"}