{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:F6PC75TMN4CRMP3BP7NCKWPOMZ","short_pith_number":"pith:F6PC75TM","schema_version":"1.0","canonical_sha256":"2f9e2ff66c6f05163f617fda2559ee665644c24633322b87bf362f495dad8019","source":{"kind":"arxiv","id":"1212.6429","version":1},"attestation_state":"computed","paper":{"title":"Complete Intersection Toric Ideals of Oriented Graphs and Chorded-Theta Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"E. Reyes, I. Gitler, J. A. Vega","submitted_at":"2012-12-27T20:59:50Z","abstract_excerpt":"Let $G=(V,E)$ be a finite, simple graph. We consider for each oriented graph $G_{\\cal O}$ associated to an orientation ${\\cal O}$ of the edges of $G$, the toric ideal $P_{G_{\\cal O}}$. In this paper we study those graphs with the property that $P_{G_{\\cal O}}$ is a binomial complete intersection, for all ${\\cal O}$. These graphs are called $\\text{CI}{\\cal O}$ graphs. We prove that these graphs can be constructed recursively as clique-sums of cycles and/or complete graphs. We introduce the chorded-theta subgraphs and their transversal triangles. Also we establish that the $\\text{CI}{\\cal O}$ gr"},"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":"1212.6429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-12-27T20:59:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"57c7084062de5df22fc6176c87ff55cd422e4eac56590f5c62289d412ed700e8","abstract_canon_sha256":"1e2b54027eb5cc7b75ed84c5c07a52c0715139eb99b654c933eefdb3bc1fca5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:39.758212Z","signature_b64":"23nZjh6/YqoMNgclcKsWlRAzYVtOScFNFvxFj3N/fuyZCRb8L/Xf4xKG47zNlYZaqmUxfJcBulLL2pS3aiOjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f9e2ff66c6f05163f617fda2559ee665644c24633322b87bf362f495dad8019","last_reissued_at":"2026-05-18T03:37:39.757693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:39.757693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete Intersection Toric Ideals of Oriented Graphs and Chorded-Theta Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"E. Reyes, I. Gitler, J. A. Vega","submitted_at":"2012-12-27T20:59:50Z","abstract_excerpt":"Let $G=(V,E)$ be a finite, simple graph. We consider for each oriented graph $G_{\\cal O}$ associated to an orientation ${\\cal O}$ of the edges of $G$, the toric ideal $P_{G_{\\cal O}}$. In this paper we study those graphs with the property that $P_{G_{\\cal O}}$ is a binomial complete intersection, for all ${\\cal O}$. These graphs are called $\\text{CI}{\\cal O}$ graphs. We prove that these graphs can be constructed recursively as clique-sums of cycles and/or complete graphs. We introduce the chorded-theta subgraphs and their transversal triangles. Also we establish that the $\\text{CI}{\\cal O}$ gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6429","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":"1212.6429","created_at":"2026-05-18T03:37:39.757756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6429v1","created_at":"2026-05-18T03:37:39.757756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6429","created_at":"2026-05-18T03:37:39.757756+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6PC75TMN4CR","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6PC75TMN4CRMP3B","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6PC75TM","created_at":"2026-05-18T12:27:04.183437+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/F6PC75TMN4CRMP3BP7NCKWPOMZ","json":"https://pith.science/pith/F6PC75TMN4CRMP3BP7NCKWPOMZ.json","graph_json":"https://pith.science/api/pith-number/F6PC75TMN4CRMP3BP7NCKWPOMZ/graph.json","events_json":"https://pith.science/api/pith-number/F6PC75TMN4CRMP3BP7NCKWPOMZ/events.json","paper":"https://pith.science/paper/F6PC75TM"},"agent_actions":{"view_html":"https://pith.science/pith/F6PC75TMN4CRMP3BP7NCKWPOMZ","download_json":"https://pith.science/pith/F6PC75TMN4CRMP3BP7NCKWPOMZ.json","view_paper":"https://pith.science/paper/F6PC75TM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6429&json=true","fetch_graph":"https://pith.science/api/pith-number/F6PC75TMN4CRMP3BP7NCKWPOMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/F6PC75TMN4CRMP3BP7NCKWPOMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6PC75TMN4CRMP3BP7NCKWPOMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6PC75TMN4CRMP3BP7NCKWPOMZ/action/storage_attestation","attest_author":"https://pith.science/pith/F6PC75TMN4CRMP3BP7NCKWPOMZ/action/author_attestation","sign_citation":"https://pith.science/pith/F6PC75TMN4CRMP3BP7NCKWPOMZ/action/citation_signature","submit_replication":"https://pith.science/pith/F6PC75TMN4CRMP3BP7NCKWPOMZ/action/replication_record"}},"created_at":"2026-05-18T03:37:39.757756+00:00","updated_at":"2026-05-18T03:37:39.757756+00:00"}