{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5C57KSUJCB2OOJH4WDZXN6K26N","short_pith_number":"pith:5C57KSUJ","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"},"canonical_sha256":"e8bbf54a891074e724fcb0f376f95af37c113f6a3706474955b3fbfe25ddb4a3","source":{"kind":"arxiv","id":"1902.01484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01484","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01484v1","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01484","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"5C57KSUJCB2O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5C57KSUJCB2OOJH4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5C57KSUJ","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5C57KSUJCB2OOJH4WDZXN6K26N","target":"record","payload":{"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"},"canonical_sha256":"e8bbf54a891074e724fcb0f376f95af37c113f6a3706474955b3fbfe25ddb4a3","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"},"source_kind":"arxiv","source_id":"1902.01484","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DzVtdE1ouePeBJTpOcJLnrLO5I9FsUEhqlvoAjAqaurVcHn1qkdi/AYglzFy34tE4ftRTxwi0xUi42BG0LpCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:20:51.775291Z"},"content_sha256":"b84bd0a1c6e6292aee5f95031f9abf8ae1980361a92747c80bd6973b1437deb6","schema_version":"1.0","event_id":"sha256:b84bd0a1c6e6292aee5f95031f9abf8ae1980361a92747c80bd6973b1437deb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5C57KSUJCB2OOJH4WDZXN6K26N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eZ3lUcpyp8QN8oFZiKDoRlO99PhsHJcab4J9cxiMg6MHee4ypXuQ+BQngIy4BrQEVvLUAhqthAfbZCqlaihBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:20:51.776035Z"},"content_sha256":"d6be66b6cab606de56c05127ea50e017723bd88a68816645eea6f3d3ff2bf58c","schema_version":"1.0","event_id":"sha256:d6be66b6cab606de56c05127ea50e017723bd88a68816645eea6f3d3ff2bf58c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N/bundle.json","state_url":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5C57KSUJCB2OOJH4WDZXN6K26N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T16:20:51Z","links":{"resolver":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N","bundle":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N/bundle.json","state":"https://pith.science/pith/5C57KSUJCB2OOJH4WDZXN6K26N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5C57KSUJCB2OOJH4WDZXN6K26N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5C57KSUJCB2OOJH4WDZXN6K26N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"035f0e24c8545057ec167c45ec19d08daf90b7371360cc9ccb5aff1a2cdc90ed","cross_cats_sorted":["math.AC","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-04T22:31:16Z","title_canon_sha256":"81e2b1e6ce1991b5811093f8073fc7fc47983e7d2fe189c56f7709b687e8c5a9"},"schema_version":"1.0","source":{"id":"1902.01484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01484","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01484v1","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01484","created_at":"2026-05-17T23:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"5C57KSUJCB2O","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5C57KSUJCB2OOJH4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5C57KSUJ","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:d6be66b6cab606de56c05127ea50e017723bd88a68816645eea6f3d3ff2bf58c","target":"graph","created_at":"2026-05-17T23:54:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Diego Cifuentes, Shmuel Onn","cross_cats":["math.AC","math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-04T22:31:16Z","title":"On the Complexity of Toric Ideals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01484","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b84bd0a1c6e6292aee5f95031f9abf8ae1980361a92747c80bd6973b1437deb6","target":"record","created_at":"2026-05-17T23:54:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"035f0e24c8545057ec167c45ec19d08daf90b7371360cc9ccb5aff1a2cdc90ed","cross_cats_sorted":["math.AC","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-02-04T22:31:16Z","title_canon_sha256":"81e2b1e6ce1991b5811093f8073fc7fc47983e7d2fe189c56f7709b687e8c5a9"},"schema_version":"1.0","source":{"id":"1902.01484","kind":"arxiv","version":1}},"canonical_sha256":"e8bbf54a891074e724fcb0f376f95af37c113f6a3706474955b3fbfe25ddb4a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8bbf54a891074e724fcb0f376f95af37c113f6a3706474955b3fbfe25ddb4a3","first_computed_at":"2026-05-17T23:54:47.568202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:47.568202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yWQj7Wgygp1dPjhl+qtLcMIk3deXJdYdIVJ+FYWxeEZ89txt3h3A0EoezQjOC+J6TJ94anE2N2ZVny4ix5YZAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:47.568796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b84bd0a1c6e6292aee5f95031f9abf8ae1980361a92747c80bd6973b1437deb6","sha256:d6be66b6cab606de56c05127ea50e017723bd88a68816645eea6f3d3ff2bf58c"],"state_sha256":"f22aaac9e8679e7c9d9765ffe0fdf492094e50945480af88cc57f116a4b98047"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tna7TodptOBomsn4Sb6W+IAAeFxwUqpqRFqI/jEO+BIWW0ue9tQynGIRu7CIZXoyif9R6OKvQOe16nREb7JpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:20:51.780787Z","bundle_sha256":"3d72ddc34b4706eac86116c619f6b9c785a0ba8e0380ef3cc849fc9500efe3e6"}}