{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YWDNCCKGCGA2X6ZTLZSDXD6LL5","short_pith_number":"pith:YWDNCCKG","schema_version":"1.0","canonical_sha256":"c586d109461181abfb335e643b8fcb5f7c1daeb7aee97b650a5750e4ea4fd12d","source":{"kind":"arxiv","id":"1210.1336","version":1},"attestation_state":"computed","paper":{"title":"Cohen-Macaulay $r$-partite graphs with minimal clique cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Asghar Madadi, Rashid Zaare-Nahandi","submitted_at":"2012-10-04T08:46:25Z","abstract_excerpt":"In this note, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if $G$ is an $r$-partite Cohen-Macaulay graph which is covered by some disjoint cliques of size $r$, then the clique cover is unique."},"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":"1210.1336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-10-04T08:46:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ef22ed4b558fc2afc12f466616129d3c460444840fa1f504c52c7447cf19c662","abstract_canon_sha256":"60dc5e81d83c366dac00527bb28b7c58d3f9ce5b8289488f401b911b464ea55a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:03.879378Z","signature_b64":"SWH6kFTIDPxdnfZrHmCP6qTR2cPFtlVAv+GrUdCTwrEQu/+j9hZYCGueEoCbkHjShL64eE2b66NN/0lJF7OuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c586d109461181abfb335e643b8fcb5f7c1daeb7aee97b650a5750e4ea4fd12d","last_reissued_at":"2026-05-18T03:44:03.878674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:03.878674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cohen-Macaulay $r$-partite graphs with minimal clique cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Asghar Madadi, Rashid Zaare-Nahandi","submitted_at":"2012-10-04T08:46:25Z","abstract_excerpt":"In this note, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if $G$ is an $r$-partite Cohen-Macaulay graph which is covered by some disjoint cliques of size $r$, then the clique cover is unique."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1336","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":"1210.1336","created_at":"2026-05-18T03:44:03.878774+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1336v1","created_at":"2026-05-18T03:44:03.878774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1336","created_at":"2026-05-18T03:44:03.878774+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWDNCCKGCGA2","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWDNCCKGCGA2X6ZT","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWDNCCKG","created_at":"2026-05-18T12:27:30.460161+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/YWDNCCKGCGA2X6ZTLZSDXD6LL5","json":"https://pith.science/pith/YWDNCCKGCGA2X6ZTLZSDXD6LL5.json","graph_json":"https://pith.science/api/pith-number/YWDNCCKGCGA2X6ZTLZSDXD6LL5/graph.json","events_json":"https://pith.science/api/pith-number/YWDNCCKGCGA2X6ZTLZSDXD6LL5/events.json","paper":"https://pith.science/paper/YWDNCCKG"},"agent_actions":{"view_html":"https://pith.science/pith/YWDNCCKGCGA2X6ZTLZSDXD6LL5","download_json":"https://pith.science/pith/YWDNCCKGCGA2X6ZTLZSDXD6LL5.json","view_paper":"https://pith.science/paper/YWDNCCKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1336&json=true","fetch_graph":"https://pith.science/api/pith-number/YWDNCCKGCGA2X6ZTLZSDXD6LL5/graph.json","fetch_events":"https://pith.science/api/pith-number/YWDNCCKGCGA2X6ZTLZSDXD6LL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWDNCCKGCGA2X6ZTLZSDXD6LL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWDNCCKGCGA2X6ZTLZSDXD6LL5/action/storage_attestation","attest_author":"https://pith.science/pith/YWDNCCKGCGA2X6ZTLZSDXD6LL5/action/author_attestation","sign_citation":"https://pith.science/pith/YWDNCCKGCGA2X6ZTLZSDXD6LL5/action/citation_signature","submit_replication":"https://pith.science/pith/YWDNCCKGCGA2X6ZTLZSDXD6LL5/action/replication_record"}},"created_at":"2026-05-18T03:44:03.878774+00:00","updated_at":"2026-05-18T03:44:03.878774+00:00"}