{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RZBVT5IXFI6ANM2CE675HBHAFL","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":"5c837690880b310c4409cd1508dfb1ea3937c50db509df5e44ca7102709d86de","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-09-26T12:14:35Z","title_canon_sha256":"4d2c581ab8e5fcbcb26ab94838940d95e1f068b79b9c7124f7074d2715d473f4"},"schema_version":"1.0","source":{"id":"1809.09932","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09932","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09932v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09932","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"RZBVT5IXFI6A","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RZBVT5IXFI6ANM2C","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RZBVT5IX","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:62a6d126104c21e798a866287242e6721bbaa2a9b9edd15026a6ee4e59f400fd","target":"graph","created_at":"2026-05-18T00:04:43Z","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":"Computing the complexity of Markov bases is an extremely challenging problem; no formula is known in general and there are very few classes of toric ideals for which the Markov complexity has been computed. A monomial curve $C$ in $\\mathbb{A}^3$ has Markov complexity $m(C)$ two or three. Two if the monomial curve is complete intersection and three otherwise. Our main result shows that there is no $d\\in \\mathbb{N}$ such that $m(C)\\leq d$ for all monomial curves $C$ in $\\mathbb{A}^4$. The same result is true even if we restrict to complete intersections. We extend this result to all monomial cur","authors_text":"Apostolos Thoma, Dimitra Kosta","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-09-26T12:14:35Z","title":"Unboundedness of Markov complexity of monomial curves in ${\\mathbb A}^n$ for $n\\geq 4$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09932","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:72d2ef93276e6519828eef281f5f0af87899b15a282102bdbc178386c1bc7b30","target":"record","created_at":"2026-05-18T00:04:43Z","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":"5c837690880b310c4409cd1508dfb1ea3937c50db509df5e44ca7102709d86de","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-09-26T12:14:35Z","title_canon_sha256":"4d2c581ab8e5fcbcb26ab94838940d95e1f068b79b9c7124f7074d2715d473f4"},"schema_version":"1.0","source":{"id":"1809.09932","kind":"arxiv","version":1}},"canonical_sha256":"8e4359f5172a3c06b34227bfd384e02ad21c11fcbbb5d9e2fdb737c031abf160","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e4359f5172a3c06b34227bfd384e02ad21c11fcbbb5d9e2fdb737c031abf160","first_computed_at":"2026-05-18T00:04:43.233267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:43.233267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NYqOAJ7IoFmYHZZQsEhYpfsIy8gzKbGKSxZ3XYVNSLCuNy0UUJA9WtzILebqM+66aGZWNM5xHst3FkDIBrnSAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:43.234013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09932","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72d2ef93276e6519828eef281f5f0af87899b15a282102bdbc178386c1bc7b30","sha256:62a6d126104c21e798a866287242e6721bbaa2a9b9edd15026a6ee4e59f400fd"],"state_sha256":"424a5b9ceed6c1812fd8a510351989776469add71eceeae03c31a312b93a3a91"}