{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DA62UIIOJ2GEBYV7UKQDRGZ4Q3","short_pith_number":"pith:DA62UIIO","schema_version":"1.0","canonical_sha256":"183daa210e4e8c40e2bfa2a0389b3c86cafd82f33675663141767a80ae48013d","source":{"kind":"arxiv","id":"1403.1140","version":1},"attestation_state":"computed","paper":{"title":"Matrix Methods for Solving Algebraic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.MS","authors_text":"Ioannis Z. Emiris","submitted_at":"2014-03-05T14:14:12Z","abstract_excerpt":"We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining an overconstrained system and constructing a Sylvester-type matrix of its sparse resultant. Third, C code for a Sylvester-type matrix of the sparse resultant and a superset of all common roots of the initial well-constrained system by computing the eigen-decomposition of a square matrix obtained from the resultant matrix. We conclude with experiments in compu"},"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":"1403.1140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-03-05T14:14:12Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"fa083e3edebeab5c3462f5bb35cd523126cad4486528b2a78ddf151499d0126d","abstract_canon_sha256":"6de7288d58bc4e00d12069420d22d2aedd0c5696c40fdcabded37fc8bb0199d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:00.555229Z","signature_b64":"sfuzZHtwZHYW1qhQA1oYzCUhSiV47ZpHW7H/aUhcajNqtprtuX7NLoAPRQ2XBFsw058CefhMwcXrCqzY03FQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"183daa210e4e8c40e2bfa2a0389b3c86cafd82f33675663141767a80ae48013d","last_reissued_at":"2026-05-18T02:57:00.554828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:00.554828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Methods for Solving Algebraic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.MS","authors_text":"Ioannis Z. Emiris","submitted_at":"2014-03-05T14:14:12Z","abstract_excerpt":"We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining an overconstrained system and constructing a Sylvester-type matrix of its sparse resultant. Third, C code for a Sylvester-type matrix of the sparse resultant and a superset of all common roots of the initial well-constrained system by computing the eigen-decomposition of a square matrix obtained from the resultant matrix. We conclude with experiments in compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1140","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":"1403.1140","created_at":"2026-05-18T02:57:00.554888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1140v1","created_at":"2026-05-18T02:57:00.554888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1140","created_at":"2026-05-18T02:57:00.554888+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA62UIIOJ2GE","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA62UIIOJ2GEBYV7","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA62UIIO","created_at":"2026-05-18T12:28:25.294606+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/DA62UIIOJ2GEBYV7UKQDRGZ4Q3","json":"https://pith.science/pith/DA62UIIOJ2GEBYV7UKQDRGZ4Q3.json","graph_json":"https://pith.science/api/pith-number/DA62UIIOJ2GEBYV7UKQDRGZ4Q3/graph.json","events_json":"https://pith.science/api/pith-number/DA62UIIOJ2GEBYV7UKQDRGZ4Q3/events.json","paper":"https://pith.science/paper/DA62UIIO"},"agent_actions":{"view_html":"https://pith.science/pith/DA62UIIOJ2GEBYV7UKQDRGZ4Q3","download_json":"https://pith.science/pith/DA62UIIOJ2GEBYV7UKQDRGZ4Q3.json","view_paper":"https://pith.science/paper/DA62UIIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1140&json=true","fetch_graph":"https://pith.science/api/pith-number/DA62UIIOJ2GEBYV7UKQDRGZ4Q3/graph.json","fetch_events":"https://pith.science/api/pith-number/DA62UIIOJ2GEBYV7UKQDRGZ4Q3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA62UIIOJ2GEBYV7UKQDRGZ4Q3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA62UIIOJ2GEBYV7UKQDRGZ4Q3/action/storage_attestation","attest_author":"https://pith.science/pith/DA62UIIOJ2GEBYV7UKQDRGZ4Q3/action/author_attestation","sign_citation":"https://pith.science/pith/DA62UIIOJ2GEBYV7UKQDRGZ4Q3/action/citation_signature","submit_replication":"https://pith.science/pith/DA62UIIOJ2GEBYV7UKQDRGZ4Q3/action/replication_record"}},"created_at":"2026-05-18T02:57:00.554888+00:00","updated_at":"2026-05-18T02:57:00.554888+00:00"}