{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TAFYKGNPDUATFV5MCPB6GENNFV","short_pith_number":"pith:TAFYKGNP","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"},"canonical_sha256":"980b8519af1d0132d7ac13c3e311ad2d49d5feb5a3632b3f283760bf16f52420","source":{"kind":"arxiv","id":"1009.5242","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5242","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5242v3","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5242","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"TAFYKGNPDUAT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TAFYKGNPDUATFV5M","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TAFYKGNP","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TAFYKGNPDUATFV5MCPB6GENNFV","target":"record","payload":{"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"},"canonical_sha256":"980b8519af1d0132d7ac13c3e311ad2d49d5feb5a3632b3f283760bf16f52420","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"},"source_kind":"arxiv","source_id":"1009.5242","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHVdFCG5VEyrdsVu6S6R3pItEybLxmPTM1d5UadRy+cHYmIAvQOAOS726Zf1lQuS+lB8ph1OlGVruy94G6atCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:33:47.155750Z"},"content_sha256":"846f4eec3e0118f3d828033928c7f135cba17cc48af2311b9a814e67c15431bd","schema_version":"1.0","event_id":"sha256:846f4eec3e0118f3d828033928c7f135cba17cc48af2311b9a814e67c15431bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TAFYKGNPDUATFV5MCPB6GENNFV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWVkJPhpuHCtCOE//w+zlAwW7Ya75ctmnjPrLSzz+5deCZAjVD25wJJmMSEzZ1m1NONSTfggtLPJxuG2QNdaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:33:47.156326Z"},"content_sha256":"e7510a6df87687a0828d38a26d9b7790176dd8fa6a712a12e96322cda62e4eae","schema_version":"1.0","event_id":"sha256:e7510a6df87687a0828d38a26d9b7790176dd8fa6a712a12e96322cda62e4eae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV/bundle.json","state_url":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAFYKGNPDUATFV5MCPB6GENNFV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T08:33:47Z","links":{"resolver":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV","bundle":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV/bundle.json","state":"https://pith.science/pith/TAFYKGNPDUATFV5MCPB6GENNFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAFYKGNPDUATFV5MCPB6GENNFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TAFYKGNPDUATFV5MCPB6GENNFV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4ff4a997c55a87ac088be8a6bf0509db9ad1ad862061d43a8ec767d7b431dfbd","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-27T12:47:02Z","title_canon_sha256":"1a0b95410ff523749006dc90fe0f7c0c48ef72c48551f2e9bdc86835049d3bf1"},"schema_version":"1.0","source":{"id":"1009.5242","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5242","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5242v3","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5242","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"TAFYKGNPDUAT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TAFYKGNPDUATFV5M","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TAFYKGNP","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:e7510a6df87687a0828d38a26d9b7790176dd8fa6a712a12e96322cda62e4eae","target":"graph","created_at":"2026-05-18T03:28:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Rashid Zaare-Nahandi","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-27T12:47:02Z","title":"Well-covered and uniformly well-covered graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5242","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:846f4eec3e0118f3d828033928c7f135cba17cc48af2311b9a814e67c15431bd","target":"record","created_at":"2026-05-18T03:28:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4ff4a997c55a87ac088be8a6bf0509db9ad1ad862061d43a8ec767d7b431dfbd","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-27T12:47:02Z","title_canon_sha256":"1a0b95410ff523749006dc90fe0f7c0c48ef72c48551f2e9bdc86835049d3bf1"},"schema_version":"1.0","source":{"id":"1009.5242","kind":"arxiv","version":3}},"canonical_sha256":"980b8519af1d0132d7ac13c3e311ad2d49d5feb5a3632b3f283760bf16f52420","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"980b8519af1d0132d7ac13c3e311ad2d49d5feb5a3632b3f283760bf16f52420","first_computed_at":"2026-05-18T03:28:19.878333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:19.878333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+881Z2wXS5VY6T7ux+utfFm50jQ5WdJWm3ff98UKL+3oIEtGdrVxsYYN4Frf1thBa2pCYIq5cAWJo03x78PBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:19.879054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5242","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:846f4eec3e0118f3d828033928c7f135cba17cc48af2311b9a814e67c15431bd","sha256:e7510a6df87687a0828d38a26d9b7790176dd8fa6a712a12e96322cda62e4eae"],"state_sha256":"ae84e21da5c32db904d5e397b4737dc87462258c3850bc9b59ed2d4fb4a47d4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AgKDUY9xqgK2pbp5SPeeWDnCSb5ZfyY6UoH1M1rLFirsWhRyMaOmMUHEuSfOjAJYwqS/95gyynFI4Gi3XLUaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:33:47.159436Z","bundle_sha256":"99574f2eba2ca5e9f3264c7ced7e905bd5e2a2392dd0b8617d4dd89d7788c673"}}