{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TAFYKGNPDUATFV5MCPB6GENNFV","short_pith_number":"pith:TAFYKGNP","schema_version":"1.0","canonical_sha256":"980b8519af1d0132d7ac13c3e311ad2d49d5feb5a3632b3f283760bf16f52420","source":{"kind":"arxiv","id":"1009.5242","version":3},"attestation_state":"computed","paper":{"title":"Well-covered and uniformly well-covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Rashid Zaare-Nahandi","submitted_at":"2010-09-27T12:47:02Z","abstract_excerpt":"A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A well-covered graph $G$ is called uniformly well-covered if there is a partition of the set of vertices of $G$ such that each maximal independent set of vertices has exactly one vertex in common with each part in the partition. The problem of determining which graphs is well-covered, was proposed in 1970 by M.D. Plummer. Let $\\cal G$ be the class of graphs with some disjoint maximal cliques covering all vertices. In this paper, some necessary and sufficient conditions are presented to rec"},"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":"1009.5242","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-27T12:47:02Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"1a0b95410ff523749006dc90fe0f7c0c48ef72c48551f2e9bdc86835049d3bf1","abstract_canon_sha256":"4ff4a997c55a87ac088be8a6bf0509db9ad1ad862061d43a8ec767d7b431dfbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:19.879054Z","signature_b64":"+881Z2wXS5VY6T7ux+utfFm50jQ5WdJWm3ff98UKL+3oIEtGdrVxsYYN4Frf1thBa2pCYIq5cAWJo03x78PBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"980b8519af1d0132d7ac13c3e311ad2d49d5feb5a3632b3f283760bf16f52420","last_reissued_at":"2026-05-18T03:28:19.878333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:19.878333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Well-covered and uniformly well-covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Rashid Zaare-Nahandi","submitted_at":"2010-09-27T12:47:02Z","abstract_excerpt":"A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A well-covered graph $G$ is called uniformly well-covered if there is a partition of the set of vertices of $G$ such that each maximal independent set of vertices has exactly one vertex in common with each part in the partition. The problem of determining which graphs is well-covered, was proposed in 1970 by M.D. Plummer. Let $\\cal G$ be the class of graphs with some disjoint maximal cliques covering all vertices. In this paper, some necessary and sufficient conditions are presented to rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5242","kind":"arxiv","version":3},"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":"1009.5242","created_at":"2026-05-18T03:28:19.878454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5242v3","created_at":"2026-05-18T03:28:19.878454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5242","created_at":"2026-05-18T03:28:19.878454+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAFYKGNPDUAT","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAFYKGNPDUATFV5M","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAFYKGNP","created_at":"2026-05-18T12:26:13.927090+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/TAFYKGNPDUATFV5MCPB6GENNFV","json":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV.json","graph_json":"https://pith.science/api/pith-number/TAFYKGNPDUATFV5MCPB6GENNFV/graph.json","events_json":"https://pith.science/api/pith-number/TAFYKGNPDUATFV5MCPB6GENNFV/events.json","paper":"https://pith.science/paper/TAFYKGNP"},"agent_actions":{"view_html":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV","download_json":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV.json","view_paper":"https://pith.science/paper/TAFYKGNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5242&json=true","fetch_graph":"https://pith.science/api/pith-number/TAFYKGNPDUATFV5MCPB6GENNFV/graph.json","fetch_events":"https://pith.science/api/pith-number/TAFYKGNPDUATFV5MCPB6GENNFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV/action/storage_attestation","attest_author":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV/action/author_attestation","sign_citation":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV/action/citation_signature","submit_replication":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV/action/replication_record"}},"created_at":"2026-05-18T03:28:19.878454+00:00","updated_at":"2026-05-18T03:28:19.878454+00:00"}