{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3H3DE4A2PE4ZEUU3PVI5OWG26U","short_pith_number":"pith:3H3DE4A2","schema_version":"1.0","canonical_sha256":"d9f632701a793992529b7d51d758daf53be3da01ae85ebbd145c62dd5688691a","source":{"kind":"arxiv","id":"1201.5810","version":1},"attestation_state":"computed","paper":{"title":"A General Solver Based on Sparse Resultants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.AC"],"primary_cat":"cs.SC","authors_text":"Ioannis Z. Emiris","submitted_at":"2012-01-27T16:01:53Z","abstract_excerpt":"Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its degree is a function of the mixed volumes of the Newton polytopes. We sketch the sparse resultant constructions of Canny and Emiris and show how they reduce the problem of root-finding to an eigenproblem. A novel method for achieving this reduction is presented which does not increase the dimension of the problem. Together with an implementation of the spar"},"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.5810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-01-27T16:01:53Z","cross_cats_sorted":["cs.NA","math.AC"],"title_canon_sha256":"5fbe2a3d7463925e92a70712b5a4a8f1c54e9d5a7afe8b5154b4788f0e14a584","abstract_canon_sha256":"51615d49815193362b5e2ff1cbcb87cf108f1e3cdd7b7926347344ccc306e885"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:44.465393Z","signature_b64":"MhGZ8l+hn6pQk20KzYO4RA4BkvjtIW28A4jDMe8GQiqvNlA7nwhnTK1E+w+JLnUknJe/lhfviGUWuTrdmTjBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9f632701a793992529b7d51d758daf53be3da01ae85ebbd145c62dd5688691a","last_reissued_at":"2026-05-18T04:03:44.464369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:44.464369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Solver Based on Sparse Resultants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.AC"],"primary_cat":"cs.SC","authors_text":"Ioannis Z. Emiris","submitted_at":"2012-01-27T16:01:53Z","abstract_excerpt":"Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its degree is a function of the mixed volumes of the Newton polytopes. We sketch the sparse resultant constructions of Canny and Emiris and show how they reduce the problem of root-finding to an eigenproblem. A novel method for achieving this reduction is presented which does not increase the dimension of the problem. Together with an implementation of the spar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5810","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":"1201.5810","created_at":"2026-05-18T04:03:44.464457+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5810v1","created_at":"2026-05-18T04:03:44.464457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5810","created_at":"2026-05-18T04:03:44.464457+00:00"},{"alias_kind":"pith_short_12","alias_value":"3H3DE4A2PE4Z","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3H3DE4A2PE4ZEUU3","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3H3DE4A2","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.06572","citing_title":"Solving Minimal Problems Without Matrix Inversion Using FFT-Based Interpolation","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3H3DE4A2PE4ZEUU3PVI5OWG26U","json":"https://pith.science/pith/3H3DE4A2PE4ZEUU3PVI5OWG26U.json","graph_json":"https://pith.science/api/pith-number/3H3DE4A2PE4ZEUU3PVI5OWG26U/graph.json","events_json":"https://pith.science/api/pith-number/3H3DE4A2PE4ZEUU3PVI5OWG26U/events.json","paper":"https://pith.science/paper/3H3DE4A2"},"agent_actions":{"view_html":"https://pith.science/pith/3H3DE4A2PE4ZEUU3PVI5OWG26U","download_json":"https://pith.science/pith/3H3DE4A2PE4ZEUU3PVI5OWG26U.json","view_paper":"https://pith.science/paper/3H3DE4A2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5810&json=true","fetch_graph":"https://pith.science/api/pith-number/3H3DE4A2PE4ZEUU3PVI5OWG26U/graph.json","fetch_events":"https://pith.science/api/pith-number/3H3DE4A2PE4ZEUU3PVI5OWG26U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3H3DE4A2PE4ZEUU3PVI5OWG26U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3H3DE4A2PE4ZEUU3PVI5OWG26U/action/storage_attestation","attest_author":"https://pith.science/pith/3H3DE4A2PE4ZEUU3PVI5OWG26U/action/author_attestation","sign_citation":"https://pith.science/pith/3H3DE4A2PE4ZEUU3PVI5OWG26U/action/citation_signature","submit_replication":"https://pith.science/pith/3H3DE4A2PE4ZEUU3PVI5OWG26U/action/replication_record"}},"created_at":"2026-05-18T04:03:44.464457+00:00","updated_at":"2026-05-18T04:03:44.464457+00:00"}