{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5C57KSUJCB2OOJH4WDZXN6K26N","short_pith_number":"pith:5C57KSUJ","schema_version":"1.0","canonical_sha256":"e8bbf54a891074e724fcb0f376f95af37c113f6a3706474955b3fbfe25ddb4a3","source":{"kind":"arxiv","id":"1902.01484","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Toric Ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.AG"],"primary_cat":"cs.SC","authors_text":"Diego Cifuentes, Shmuel Onn","submitted_at":"2019-02-04T22:31:16Z","abstract_excerpt":"We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\\\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient algorithms by taking advantage of the sparsity pattern of the matrix. We describe this sparsity pattern with a graph, and study the parameterized complexity of toric ideals in terms of graph parameters such as treewidth and treedepth. In particular, we show that the normal form problem can be solved in parameter-tractable time in terms of the treedepth. An i"},"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":"1902.01484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-04T22:31:16Z","cross_cats_sorted":["math.AC","math.AG"],"title_canon_sha256":"81e2b1e6ce1991b5811093f8073fc7fc47983e7d2fe189c56f7709b687e8c5a9","abstract_canon_sha256":"035f0e24c8545057ec167c45ec19d08daf90b7371360cc9ccb5aff1a2cdc90ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:47.568796Z","signature_b64":"yWQj7Wgygp1dPjhl+qtLcMIk3deXJdYdIVJ+FYWxeEZ89txt3h3A0EoezQjOC+J6TJ94anE2N2ZVny4ix5YZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8bbf54a891074e724fcb0f376f95af37c113f6a3706474955b3fbfe25ddb4a3","last_reissued_at":"2026-05-17T23:54:47.568202Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:47.568202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Toric Ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.AG"],"primary_cat":"cs.SC","authors_text":"Diego Cifuentes, Shmuel Onn","submitted_at":"2019-02-04T22:31:16Z","abstract_excerpt":"We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\\\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient algorithms by taking advantage of the sparsity pattern of the matrix. We describe this sparsity pattern with a graph, and study the parameterized complexity of toric ideals in terms of graph parameters such as treewidth and treedepth. In particular, we show that the normal form problem can be solved in parameter-tractable time in terms of the treedepth. An i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01484","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":"1902.01484","created_at":"2026-05-17T23:54:47.568289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01484v1","created_at":"2026-05-17T23:54:47.568289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01484","created_at":"2026-05-17T23:54:47.568289+00:00"},{"alias_kind":"pith_short_12","alias_value":"5C57KSUJCB2O","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5C57KSUJCB2OOJH4","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5C57KSUJ","created_at":"2026-05-18T12:33:10.108867+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/5C57KSUJCB2OOJH4WDZXN6K26N","json":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N.json","graph_json":"https://pith.science/api/pith-number/5C57KSUJCB2OOJH4WDZXN6K26N/graph.json","events_json":"https://pith.science/api/pith-number/5C57KSUJCB2OOJH4WDZXN6K26N/events.json","paper":"https://pith.science/paper/5C57KSUJ"},"agent_actions":{"view_html":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N","download_json":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N.json","view_paper":"https://pith.science/paper/5C57KSUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01484&json=true","fetch_graph":"https://pith.science/api/pith-number/5C57KSUJCB2OOJH4WDZXN6K26N/graph.json","fetch_events":"https://pith.science/api/pith-number/5C57KSUJCB2OOJH4WDZXN6K26N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N/action/storage_attestation","attest_author":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N/action/author_attestation","sign_citation":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N/action/citation_signature","submit_replication":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N/action/replication_record"}},"created_at":"2026-05-17T23:54:47.568289+00:00","updated_at":"2026-05-17T23:54:47.568289+00:00"}