{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YB535IKKXGY7JCZJ2Q66FCKFWD","short_pith_number":"pith:YB535IKK","schema_version":"1.0","canonical_sha256":"c07bbea14ab9b1f48b29d43de28945b0d9c311f2f4655c5b7e052d8afaf3f22e","source":{"kind":"arxiv","id":"1105.3564","version":1},"attestation_state":"computed","paper":{"title":"Monomial cut ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Anda Olteanu","submitted_at":"2011-05-18T09:04:58Z","abstract_excerpt":"B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a linear resolution or being Cohen--Macaulay may be derived from the combinatorial structure of the graph."},"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":"1105.3564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-05-18T09:04:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cfe926bb48fc7d9007e3a5b91b5de5e8d3e552044f2a897e3f9244822a83d56f","abstract_canon_sha256":"a621d1aedc417625540e164596d376578a7b0f9818511d63a3b04149ebfa59de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:52.353183Z","signature_b64":"8lLZ3fBzN6/dTKm8Z1xZgSkJetnzKQfe38acj6MD0r8DPa7eA6oHorkqloOY9wxM1rBTdlbBYxXc+n7W1mCuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c07bbea14ab9b1f48b29d43de28945b0d9c311f2f4655c5b7e052d8afaf3f22e","last_reissued_at":"2026-05-18T04:21:52.352570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:52.352570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monomial cut ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Anda Olteanu","submitted_at":"2011-05-18T09:04:58Z","abstract_excerpt":"B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a linear resolution or being Cohen--Macaulay may be derived from the combinatorial structure of the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3564","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":"1105.3564","created_at":"2026-05-18T04:21:52.352644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3564v1","created_at":"2026-05-18T04:21:52.352644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3564","created_at":"2026-05-18T04:21:52.352644+00:00"},{"alias_kind":"pith_short_12","alias_value":"YB535IKKXGY7","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YB535IKKXGY7JCZJ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YB535IKK","created_at":"2026-05-18T12:26:47.523578+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/YB535IKKXGY7JCZJ2Q66FCKFWD","json":"https://pith.science/pith/YB535IKKXGY7JCZJ2Q66FCKFWD.json","graph_json":"https://pith.science/api/pith-number/YB535IKKXGY7JCZJ2Q66FCKFWD/graph.json","events_json":"https://pith.science/api/pith-number/YB535IKKXGY7JCZJ2Q66FCKFWD/events.json","paper":"https://pith.science/paper/YB535IKK"},"agent_actions":{"view_html":"https://pith.science/pith/YB535IKKXGY7JCZJ2Q66FCKFWD","download_json":"https://pith.science/pith/YB535IKKXGY7JCZJ2Q66FCKFWD.json","view_paper":"https://pith.science/paper/YB535IKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3564&json=true","fetch_graph":"https://pith.science/api/pith-number/YB535IKKXGY7JCZJ2Q66FCKFWD/graph.json","fetch_events":"https://pith.science/api/pith-number/YB535IKKXGY7JCZJ2Q66FCKFWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YB535IKKXGY7JCZJ2Q66FCKFWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YB535IKKXGY7JCZJ2Q66FCKFWD/action/storage_attestation","attest_author":"https://pith.science/pith/YB535IKKXGY7JCZJ2Q66FCKFWD/action/author_attestation","sign_citation":"https://pith.science/pith/YB535IKKXGY7JCZJ2Q66FCKFWD/action/citation_signature","submit_replication":"https://pith.science/pith/YB535IKKXGY7JCZJ2Q66FCKFWD/action/replication_record"}},"created_at":"2026-05-18T04:21:52.352644+00:00","updated_at":"2026-05-18T04:21:52.352644+00:00"}