{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Y5ULAMRGBAASLOF25ORFDBP6S3","short_pith_number":"pith:Y5ULAMRG","canonical_record":{"source":{"id":"2404.07853","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-11T15:49:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"180b481518d61a385ea114565b72f16e35ba2b654cc3312f982357a2fcb2b7f8","abstract_canon_sha256":"440d1ba1fa17f549d7f79538a0387f71d419a8f1664d4f5cdd33dfe8b0a02b17"},"schema_version":"1.0"},"canonical_sha256":"c768b03226080125b8baeba25185fe96faa16c754af97b1086adadfdccfa0f65","source":{"kind":"arxiv","id":"2404.07853","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.07853","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"arxiv_version","alias_value":"2404.07853v1","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07853","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"pith_short_12","alias_value":"Y5ULAMRGBAAS","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"pith_short_16","alias_value":"Y5ULAMRGBAASLOF2","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"pith_short_8","alias_value":"Y5ULAMRG","created_at":"2026-07-05T08:06:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Y5ULAMRGBAASLOF25ORFDBP6S3","target":"record","payload":{"canonical_record":{"source":{"id":"2404.07853","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-11T15:49:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"180b481518d61a385ea114565b72f16e35ba2b654cc3312f982357a2fcb2b7f8","abstract_canon_sha256":"440d1ba1fa17f549d7f79538a0387f71d419a8f1664d4f5cdd33dfe8b0a02b17"},"schema_version":"1.0"},"canonical_sha256":"c768b03226080125b8baeba25185fe96faa16c754af97b1086adadfdccfa0f65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:58.577877Z","signature_b64":"4BT5mESqj1ZoPwejCqiKjama7W4PZKvLI/v1J2wwbSqstJ3M0gxXBaNhwruGc7ag7K96D0aDJSwIi91SLKO8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c768b03226080125b8baeba25185fe96faa16c754af97b1086adadfdccfa0f65","last_reissued_at":"2026-07-05T08:06:58.577484Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:58.577484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.07853","source_version":1,"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-07-05T08:06:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Jfb2N3smq5dLN6g3g1AEVikrwO9SQi8j42dJ69WcDRWjcxJda0rc/ZbYxjxJkLQJq780+Hjemq3/PeqxF5vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:33:16.545124Z"},"content_sha256":"8725660e4ba874af3f6151999735733aee9ec0cbad98124a5b25e3d4e5b7af13","schema_version":"1.0","event_id":"sha256:8725660e4ba874af3f6151999735733aee9ec0cbad98124a5b25e3d4e5b7af13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Y5ULAMRGBAASLOF25ORFDBP6S3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beyond recognizing well-covered graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carl Feghali, Malory Marin, R\\'emi Watrigant","submitted_at":"2024-04-11T15:49:12Z","abstract_excerpt":"We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is said\n  - $\\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex sets $A_1, \\dots, A_k$ in $G$, there exist $k$ pairwise disjoint maximum independent sets $S_1, \\dots,S_k$ in $G$ such that $A_i \\subseteq S_i$ for $i \\in [k]$.\n  - $\\mathbf{E_s}$ if every independent set in $G$ of size at most $s$ is contained in a maximum independent set in $G$.\n  Chv\\'atal and Slater (1993) and Sankaranarayana and Stewart (1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07853","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.07853/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:06:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBvu5e/gevDYYl7R1RnLQ5a6BMhUpeQDOUDcsvGLZeh0uLQpObkNGIsLsp2PHUdfOUiZYtMo/e5Wg6FnIInqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T22:33:16.546046Z"},"content_sha256":"1dc7765accf640df6dabd638269eea0b0a21dd4ff74342040c9c2784dd7ea7fd","schema_version":"1.0","event_id":"sha256:1dc7765accf640df6dabd638269eea0b0a21dd4ff74342040c9c2784dd7ea7fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y5ULAMRGBAASLOF25ORFDBP6S3/bundle.json","state_url":"https://pith.science/pith/Y5ULAMRGBAASLOF25ORFDBP6S3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y5ULAMRGBAASLOF25ORFDBP6S3/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-08-10T22:33:16Z","links":{"resolver":"https://pith.science/pith/Y5ULAMRGBAASLOF25ORFDBP6S3","bundle":"https://pith.science/pith/Y5ULAMRGBAASLOF25ORFDBP6S3/bundle.json","state":"https://pith.science/pith/Y5ULAMRGBAASLOF25ORFDBP6S3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y5ULAMRGBAASLOF25ORFDBP6S3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Y5ULAMRGBAASLOF25ORFDBP6S3","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":"440d1ba1fa17f549d7f79538a0387f71d419a8f1664d4f5cdd33dfe8b0a02b17","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-11T15:49:12Z","title_canon_sha256":"180b481518d61a385ea114565b72f16e35ba2b654cc3312f982357a2fcb2b7f8"},"schema_version":"1.0","source":{"id":"2404.07853","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.07853","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"arxiv_version","alias_value":"2404.07853v1","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07853","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"pith_short_12","alias_value":"Y5ULAMRGBAAS","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"pith_short_16","alias_value":"Y5ULAMRGBAASLOF2","created_at":"2026-07-05T08:06:58Z"},{"alias_kind":"pith_short_8","alias_value":"Y5ULAMRG","created_at":"2026-07-05T08:06:58Z"}],"graph_snapshots":[{"event_id":"sha256:1dc7765accf640df6dabd638269eea0b0a21dd4ff74342040c9c2784dd7ea7fd","target":"graph","created_at":"2026-07-05T08:06:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.07853/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is said\n  - $\\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex sets $A_1, \\dots, A_k$ in $G$, there exist $k$ pairwise disjoint maximum independent sets $S_1, \\dots,S_k$ in $G$ such that $A_i \\subseteq S_i$ for $i \\in [k]$.\n  - $\\mathbf{E_s}$ if every independent set in $G$ of size at most $s$ is contained in a maximum independent set in $G$.\n  Chv\\'atal and Slater (1993) and Sankaranarayana and Stewart (1","authors_text":"Carl Feghali, Malory Marin, R\\'emi Watrigant","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-11T15:49:12Z","title":"Beyond recognizing well-covered graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07853","kind":"arxiv","version":1},"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:8725660e4ba874af3f6151999735733aee9ec0cbad98124a5b25e3d4e5b7af13","target":"record","created_at":"2026-07-05T08:06:58Z","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":"440d1ba1fa17f549d7f79538a0387f71d419a8f1664d4f5cdd33dfe8b0a02b17","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-11T15:49:12Z","title_canon_sha256":"180b481518d61a385ea114565b72f16e35ba2b654cc3312f982357a2fcb2b7f8"},"schema_version":"1.0","source":{"id":"2404.07853","kind":"arxiv","version":1}},"canonical_sha256":"c768b03226080125b8baeba25185fe96faa16c754af97b1086adadfdccfa0f65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c768b03226080125b8baeba25185fe96faa16c754af97b1086adadfdccfa0f65","first_computed_at":"2026-07-05T08:06:58.577484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:06:58.577484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4BT5mESqj1ZoPwejCqiKjama7W4PZKvLI/v1J2wwbSqstJ3M0gxXBaNhwruGc7ag7K96D0aDJSwIi91SLKO8AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:06:58.577877Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.07853","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8725660e4ba874af3f6151999735733aee9ec0cbad98124a5b25e3d4e5b7af13","sha256:1dc7765accf640df6dabd638269eea0b0a21dd4ff74342040c9c2784dd7ea7fd"],"state_sha256":"650edbfcc577ef9490b7b1b19b620c1bdac063f0d6ebaa6ae244a169c0b97373"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKut/pdmulOwSdioRxGVte/udIg0ECSB/4rRoxzDru8pM+O1Tj1YwVjHRqGwUVcQx1DQuRlH5Mm4RI0KVs3vDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T22:33:16.551428Z","bundle_sha256":"538cd1a1fa2d824b96ec03e9407c2a2d61069ecae5cc8cef13da715bb8988a90"}}