{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VZJPO66WLGIK36STMQYIGIPN7O","short_pith_number":"pith:VZJPO66W","schema_version":"1.0","canonical_sha256":"ae52f77bd65990adfa5364308321edfba8f2c55254616251459a4798618aafeb","source":{"kind":"arxiv","id":"1604.08944","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.SC","authors_text":"Cornelius Brand, Michael Sagraloff","submitted_at":"2016-04-29T19:42:38Z","abstract_excerpt":"Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l with coefficients of small bit size. For computing l, we need to project the solutions into one dimension along O(n) distinct directions but no further algebraic manipulations. The solutions are then directly reconstructed from the considered projections. The first step is deterministic, whereas the second step uses randomization, thus being Las-Vegas.\n  The th"},"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":"1604.08944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-04-29T19:42:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d052e68182c95aa994620e9ea185d6c5ba1efcd1a7552685dada0c49264c3d62","abstract_canon_sha256":"48e065ba781dc328508e599edb63edbccb3b61891493aaaaa9d1aba6a9981064"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:01.359662Z","signature_b64":"QnBPJwjqgtbow+bwVDqiS3IF7kGC/YZiCRD0nWJfofJ+Useeqf9rpOehdyWYmMMVtpUfFrDRhsuQzG/OteBnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae52f77bd65990adfa5364308321edfba8f2c55254616251459a4798618aafeb","last_reissued_at":"2026-05-18T01:16:01.359022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:01.359022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.SC","authors_text":"Cornelius Brand, Michael Sagraloff","submitted_at":"2016-04-29T19:42:38Z","abstract_excerpt":"Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l with coefficients of small bit size. For computing l, we need to project the solutions into one dimension along O(n) distinct directions but no further algebraic manipulations. The solutions are then directly reconstructed from the considered projections. The first step is deterministic, whereas the second step uses randomization, thus being Las-Vegas.\n  The th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08944","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":"1604.08944","created_at":"2026-05-18T01:16:01.359114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08944v1","created_at":"2026-05-18T01:16:01.359114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08944","created_at":"2026-05-18T01:16:01.359114+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZJPO66WLGIK","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZJPO66WLGIK36ST","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZJPO66W","created_at":"2026-05-18T12:30:48.956258+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/VZJPO66WLGIK36STMQYIGIPN7O","json":"https://pith.science/pith/VZJPO66WLGIK36STMQYIGIPN7O.json","graph_json":"https://pith.science/api/pith-number/VZJPO66WLGIK36STMQYIGIPN7O/graph.json","events_json":"https://pith.science/api/pith-number/VZJPO66WLGIK36STMQYIGIPN7O/events.json","paper":"https://pith.science/paper/VZJPO66W"},"agent_actions":{"view_html":"https://pith.science/pith/VZJPO66WLGIK36STMQYIGIPN7O","download_json":"https://pith.science/pith/VZJPO66WLGIK36STMQYIGIPN7O.json","view_paper":"https://pith.science/paper/VZJPO66W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08944&json=true","fetch_graph":"https://pith.science/api/pith-number/VZJPO66WLGIK36STMQYIGIPN7O/graph.json","fetch_events":"https://pith.science/api/pith-number/VZJPO66WLGIK36STMQYIGIPN7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZJPO66WLGIK36STMQYIGIPN7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZJPO66WLGIK36STMQYIGIPN7O/action/storage_attestation","attest_author":"https://pith.science/pith/VZJPO66WLGIK36STMQYIGIPN7O/action/author_attestation","sign_citation":"https://pith.science/pith/VZJPO66WLGIK36STMQYIGIPN7O/action/citation_signature","submit_replication":"https://pith.science/pith/VZJPO66WLGIK36STMQYIGIPN7O/action/replication_record"}},"created_at":"2026-05-18T01:16:01.359114+00:00","updated_at":"2026-05-18T01:16:01.359114+00:00"}