{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RZZLSCTIIO4OI3M5AXK52N4UYI","short_pith_number":"pith:RZZLSCTI","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"},"canonical_sha256":"8e72b90a6843b8e46d9d05d5dd3794c20c121f210c7157a38de6c2a29328c07f","source":{"kind":"arxiv","id":"1610.03972","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03972","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03972v3","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03972","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"RZZLSCTIIO4O","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RZZLSCTIIO4OI3M5","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RZZLSCTI","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RZZLSCTIIO4OI3M5AXK52N4UYI","target":"record","payload":{"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"},"canonical_sha256":"8e72b90a6843b8e46d9d05d5dd3794c20c121f210c7157a38de6c2a29328c07f","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"},"source_kind":"arxiv","source_id":"1610.03972","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-18T00:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YjM99X9uPFQI1XcHrwwVQPAwD9TUcdQtXDgILhACNyMz0zJusoQjuEFn36WRp4G8jHLRXPF41SaRBJvtwLTdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:55:31.439397Z"},"content_sha256":"8c5ec531aeae4550714a0412887efee7dd54a4afd1434a46fea4792a2c246641","schema_version":"1.0","event_id":"sha256:8c5ec531aeae4550714a0412887efee7dd54a4afd1434a46fea4792a2c246641"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RZZLSCTIIO4OI3M5AXK52N4UYI","target":"graph","payload":{"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"},"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-18T00:55:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMPIxXh9r6QV+9Xj9Dv391JCmC7VvosbG/xYpBPHvOSxam3xiI+27tuz5hnZTeFAVnQf54xb9pg03t/JeWa8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:55:31.439745Z"},"content_sha256":"181de42d85002909ce528a660504dfe51775962fc0072fb443810b32837d0dda","schema_version":"1.0","event_id":"sha256:181de42d85002909ce528a660504dfe51775962fc0072fb443810b32837d0dda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/bundle.json","state_url":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/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-20T09:55:31Z","links":{"resolver":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI","bundle":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/bundle.json","state":"https://pith.science/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZZLSCTIIO4OI3M5AXK52N4UYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RZZLSCTIIO4OI3M5AXK52N4UYI","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":"6539ecda5c0b680aef4fc0122e5781f2ce48e0f103653aede52127795498e27c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-13T08:19:45Z","title_canon_sha256":"6e3a6cb81e85ab67ef9f1ef714bc64de3da0681c61e344571bbd57b2aca3598b"},"schema_version":"1.0","source":{"id":"1610.03972","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03972","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03972v3","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03972","created_at":"2026-05-18T00:55:20Z"},{"alias_kind":"pith_short_12","alias_value":"RZZLSCTIIO4O","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RZZLSCTIIO4OI3M5","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RZZLSCTI","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:181de42d85002909ce528a660504dfe51775962fc0072fb443810b32837d0dda","target":"graph","created_at":"2026-05-18T00:55:20Z","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 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 ","authors_text":"Eugen Mandrescu, Vadim E. Levit","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-13T08:19:45Z","title":"1-well-covered graphs revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03972","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:8c5ec531aeae4550714a0412887efee7dd54a4afd1434a46fea4792a2c246641","target":"record","created_at":"2026-05-18T00:55:20Z","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":"6539ecda5c0b680aef4fc0122e5781f2ce48e0f103653aede52127795498e27c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-13T08:19:45Z","title_canon_sha256":"6e3a6cb81e85ab67ef9f1ef714bc64de3da0681c61e344571bbd57b2aca3598b"},"schema_version":"1.0","source":{"id":"1610.03972","kind":"arxiv","version":3}},"canonical_sha256":"8e72b90a6843b8e46d9d05d5dd3794c20c121f210c7157a38de6c2a29328c07f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e72b90a6843b8e46d9d05d5dd3794c20c121f210c7157a38de6c2a29328c07f","first_computed_at":"2026-05-18T00:55:20.486328Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:20.486328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4rAbJX5zFO9bI0aWBRRAHMe2PUnHDfGQURjJsWqk9wPptbrIYNK2tPve/TCe7bWLoaRT1c8qAvJMrhqpS2tZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:20.486915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03972","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c5ec531aeae4550714a0412887efee7dd54a4afd1434a46fea4792a2c246641","sha256:181de42d85002909ce528a660504dfe51775962fc0072fb443810b32837d0dda"],"state_sha256":"675ceb26937bd08f4f6b2c879e4d1935516549155921850e07579aed531426bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vpUrfPmRlZIndtAbx0dDZ7kYBiOB1FBQyG6/V7zt1kG1IWQHxzSb4Q0u9VZYNqgOhoybepmWdTS4Jqn0BKN4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:55:31.441713Z","bundle_sha256":"e3ea7374fd7e759409a0b4d53807bb11156ee7cc7ebbab0e3454878c3904790a"}}