{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3QHYJ3JW2VG5YOVLXY63XYNHEX","short_pith_number":"pith:3QHYJ3JW","schema_version":"1.0","canonical_sha256":"dc0f84ed36d54ddc3aabbe3dbbe1a725e78250a7dc5f604876f07d79765a4356","source":{"kind":"arxiv","id":"1310.2872","version":1},"attestation_state":"computed","paper":{"title":"A new construction for Cohen-Macaulay graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Amir Mousivand, Seyed Amin Seyed Fakhari, Siamak Yassemi","submitted_at":"2013-10-10T16:20:47Z","abstract_excerpt":"Let $G$ be a finite simple graph on a vertex set $V(G)=\\{x_{11}, \\ldots, x_{n1}\\}$. Also let $m_1, \\ldots,m_n \\geq 2$ be integers and $G_1, \\ldots, G_n$ be connected simple graphs on the vertex sets $V(G_i)=\\{x_{i1}, \\ldots, x_{im_i}\\}$. In this paper, we provide necessary and sufficient conditions on $G_1, \\ldots, G_n$ for which the graph obtained by attaching $G_i$ to $G$ is unmixed or vertex decomposable. Then we characterize Cohen--Macaulay and sequentially Cohen--Macaulay graphs obtained by attaching the cycle graphs or connected chordal graphs to an arbitrary graphs."},"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":"1310.2872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-10-10T16:20:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a9fd8c97e0fa8a612693697d7ed75fb1cbfb6abfb94c3d70f64f362e2ff3048a","abstract_canon_sha256":"90b4a8731a4b0e8fb5d1e73d3449da96d6ef87e4bf57d529057b0b80d0981316"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:45.455326Z","signature_b64":"7IKE0lDyFWt3BPIxciyiYigNO4S22KHqGAgzqrKIf2PAZwRp6eBEqof+6irpC8dFvH5EpJLIrHjRFqNjqY6FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc0f84ed36d54ddc3aabbe3dbbe1a725e78250a7dc5f604876f07d79765a4356","last_reissued_at":"2026-05-18T03:10:45.454803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:45.454803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new construction for Cohen-Macaulay graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Amir Mousivand, Seyed Amin Seyed Fakhari, Siamak Yassemi","submitted_at":"2013-10-10T16:20:47Z","abstract_excerpt":"Let $G$ be a finite simple graph on a vertex set $V(G)=\\{x_{11}, \\ldots, x_{n1}\\}$. Also let $m_1, \\ldots,m_n \\geq 2$ be integers and $G_1, \\ldots, G_n$ be connected simple graphs on the vertex sets $V(G_i)=\\{x_{i1}, \\ldots, x_{im_i}\\}$. In this paper, we provide necessary and sufficient conditions on $G_1, \\ldots, G_n$ for which the graph obtained by attaching $G_i$ to $G$ is unmixed or vertex decomposable. Then we characterize Cohen--Macaulay and sequentially Cohen--Macaulay graphs obtained by attaching the cycle graphs or connected chordal graphs to an arbitrary graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2872","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":"1310.2872","created_at":"2026-05-18T03:10:45.454885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2872v1","created_at":"2026-05-18T03:10:45.454885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2872","created_at":"2026-05-18T03:10:45.454885+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QHYJ3JW2VG5","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QHYJ3JW2VG5YOVL","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QHYJ3JW","created_at":"2026-05-18T12:27:32.513160+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/3QHYJ3JW2VG5YOVLXY63XYNHEX","json":"https://pith.science/pith/3QHYJ3JW2VG5YOVLXY63XYNHEX.json","graph_json":"https://pith.science/api/pith-number/3QHYJ3JW2VG5YOVLXY63XYNHEX/graph.json","events_json":"https://pith.science/api/pith-number/3QHYJ3JW2VG5YOVLXY63XYNHEX/events.json","paper":"https://pith.science/paper/3QHYJ3JW"},"agent_actions":{"view_html":"https://pith.science/pith/3QHYJ3JW2VG5YOVLXY63XYNHEX","download_json":"https://pith.science/pith/3QHYJ3JW2VG5YOVLXY63XYNHEX.json","view_paper":"https://pith.science/paper/3QHYJ3JW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2872&json=true","fetch_graph":"https://pith.science/api/pith-number/3QHYJ3JW2VG5YOVLXY63XYNHEX/graph.json","fetch_events":"https://pith.science/api/pith-number/3QHYJ3JW2VG5YOVLXY63XYNHEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QHYJ3JW2VG5YOVLXY63XYNHEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QHYJ3JW2VG5YOVLXY63XYNHEX/action/storage_attestation","attest_author":"https://pith.science/pith/3QHYJ3JW2VG5YOVLXY63XYNHEX/action/author_attestation","sign_citation":"https://pith.science/pith/3QHYJ3JW2VG5YOVLXY63XYNHEX/action/citation_signature","submit_replication":"https://pith.science/pith/3QHYJ3JW2VG5YOVLXY63XYNHEX/action/replication_record"}},"created_at":"2026-05-18T03:10:45.454885+00:00","updated_at":"2026-05-18T03:10:45.454885+00:00"}