{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RZZLSCTIIO4OI3M5AXK52N4UYI","short_pith_number":"pith:RZZLSCTI","schema_version":"1.0","canonical_sha256":"8e72b90a6843b8e46d9d05d5dd3794c20c121f210c7157a38de6c2a29328c07f","source":{"kind":"arxiv","id":"1610.03972","version":3},"attestation_state":"computed","paper":{"title":"1-well-covered graphs revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2016-10-13T08:19:45Z","abstract_excerpt":"A graph is well-covered if all its maximal independent sets are of the same size (M. D. Plummer, 1970). A well-covered graph is 1-well-covered if the deletion of every vertex leaves a graph which is well-covered as well (J. W. Staples, 1975). A graph G belongs to class W_{n} if every n pairwise disjoint independent sets in G are included in $n$ pairwise disjoint maximum independent sets (J. W. Staples, 1975). Clearly, W_{1} is the family of all well-covered graphs. It turns out that G belongs to W_{2} if and only if it is a 1-well-covered graph without isolated vertices. We show that deleting "},"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":"1610.03972","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-13T08:19:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6e3a6cb81e85ab67ef9f1ef714bc64de3da0681c61e344571bbd57b2aca3598b","abstract_canon_sha256":"6539ecda5c0b680aef4fc0122e5781f2ce48e0f103653aede52127795498e27c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:20.486915Z","signature_b64":"4rAbJX5zFO9bI0aWBRRAHMe2PUnHDfGQURjJsWqk9wPptbrIYNK2tPve/TCe7bWLoaRT1c8qAvJMrhqpS2tZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e72b90a6843b8e46d9d05d5dd3794c20c121f210c7157a38de6c2a29328c07f","last_reissued_at":"2026-05-18T00:55:20.486328Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:20.486328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1-well-covered graphs revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2016-10-13T08:19:45Z","abstract_excerpt":"A graph is well-covered if all its maximal independent sets are of the same size (M. D. Plummer, 1970). A well-covered graph is 1-well-covered if the deletion of every vertex leaves a graph which is well-covered as well (J. W. Staples, 1975). A graph G belongs to class W_{n} if every n pairwise disjoint independent sets in G are included in $n$ pairwise disjoint maximum independent sets (J. W. Staples, 1975). Clearly, W_{1} is the family of all well-covered graphs. It turns out that G belongs to W_{2} if and only if it is a 1-well-covered graph without isolated vertices. We show that deleting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03972","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":"1610.03972","created_at":"2026-05-18T00:55:20.486438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03972v3","created_at":"2026-05-18T00:55:20.486438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03972","created_at":"2026-05-18T00:55:20.486438+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZZLSCTIIO4O","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZZLSCTIIO4OI3M5","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZZLSCTI","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14076","citing_title":"The 2-Quasi-Regularizability Conjecture and Independence Polynomials of Wp Graphs","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI","json":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI.json","graph_json":"https://pith.science/api/pith-number/RZZLSCTIIO4OI3M5AXK52N4UYI/graph.json","events_json":"https://pith.science/api/pith-number/RZZLSCTIIO4OI3M5AXK52N4UYI/events.json","paper":"https://pith.science/paper/RZZLSCTI"},"agent_actions":{"view_html":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI","download_json":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI.json","view_paper":"https://pith.science/paper/RZZLSCTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03972&json=true","fetch_graph":"https://pith.science/api/pith-number/RZZLSCTIIO4OI3M5AXK52N4UYI/graph.json","fetch_events":"https://pith.science/api/pith-number/RZZLSCTIIO4OI3M5AXK52N4UYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/action/storage_attestation","attest_author":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/action/author_attestation","sign_citation":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/action/citation_signature","submit_replication":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/action/replication_record"}},"created_at":"2026-05-18T00:55:20.486438+00:00","updated_at":"2026-05-18T00:55:20.486438+00:00"}