{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CQN56XXOSTU66MJZRO62C3GV3D","short_pith_number":"pith:CQN56XXO","canonical_record":{"source":{"id":"2307.15573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-28T14:12:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5fc57fd9b2e0470c53edd9cf65361edb3d936d58ef5db102309673967f52bd59","abstract_canon_sha256":"1091cfa9de218e3bb2383f8e00219a6a0e08306c8c0a257b7b54316103d1923a"},"schema_version":"1.0"},"canonical_sha256":"141bdf5eee94e9ef31398bbda16cd5d8d2d93e6b3a39356c8f06afdc5a56deed","source":{"kind":"arxiv","id":"2307.15573","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.15573","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"2307.15573v2","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15573","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"CQN56XXOSTU6","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"pith_short_16","alias_value":"CQN56XXOSTU66MJZ","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"pith_short_8","alias_value":"CQN56XXO","created_at":"2026-07-05T07:12:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CQN56XXOSTU66MJZRO62C3GV3D","target":"record","payload":{"canonical_record":{"source":{"id":"2307.15573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-28T14:12:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5fc57fd9b2e0470c53edd9cf65361edb3d936d58ef5db102309673967f52bd59","abstract_canon_sha256":"1091cfa9de218e3bb2383f8e00219a6a0e08306c8c0a257b7b54316103d1923a"},"schema_version":"1.0"},"canonical_sha256":"141bdf5eee94e9ef31398bbda16cd5d8d2d93e6b3a39356c8f06afdc5a56deed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:51.925240Z","signature_b64":"M9hd2lHvi9WrkIpxBIXbSsurbFIaXoEjdrCBX5Y4Y7KcGCmokZ5eqdFbZ2d+kdje0eeNVyyHzzm2SjoXxvNnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"141bdf5eee94e9ef31398bbda16cd5d8d2d93e6b3a39356c8f06afdc5a56deed","last_reissued_at":"2026-07-05T07:12:51.924759Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:51.924759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.15573","source_version":2,"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-05T07:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76YAkSBtrm6M8y/gHigeRoHPZebvjW+hai7gTZH0hlNkfKoUFwK8VUYbXTxexKGkK6NNeTtQDJgWHkB5VqETCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:38:57.040116Z"},"content_sha256":"0fadd6b59cef88de83773d794f833244ee235805acd71b8a4ab801e3cf3f1470","schema_version":"1.0","event_id":"sha256:0fadd6b59cef88de83773d794f833244ee235805acd71b8a4ab801e3cf3f1470"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CQN56XXOSTU66MJZRO62C3GV3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Three remarks on $\\mathbf{W_2}$ graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carl Feghali, Malory Marin","submitted_at":"2023-07-28T14:12:22Z","abstract_excerpt":"Let $k \\geq 1$. A graph $G$ is $\\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex subsets $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]$. Recognizing $\\mathbf{W_1}$ graphs is co-NP-hard, as shown by Chv\\'atal and Slater (1993) and, independently, by Sankaranarayana and Stewart (1992). Extending this result and answering a recent question of Levit and Tankus, we show that recognizing $\\mathbf{W_k}$ graphs is co-NP-hard for $k \\geq 2$. On the positive side, we show that re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15573","kind":"arxiv","version":2},"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/2307.15573/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-05T07:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTWXnwwJzQhAbsqOeMmB2UQM7WYRW1I+xkNe+S4ON+5Gt+XHCfBzFHx5RbzqxFeOc3eq4xt3rnRY72lqWMwwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T06:38:57.040620Z"},"content_sha256":"b0454701ee3b6ee3edd35cec9d95dfe804cce5b85d72e3da69690ca6ce326183","schema_version":"1.0","event_id":"sha256:b0454701ee3b6ee3edd35cec9d95dfe804cce5b85d72e3da69690ca6ce326183"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQN56XXOSTU66MJZRO62C3GV3D/bundle.json","state_url":"https://pith.science/pith/CQN56XXOSTU66MJZRO62C3GV3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQN56XXOSTU66MJZRO62C3GV3D/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-11T06:38:57Z","links":{"resolver":"https://pith.science/pith/CQN56XXOSTU66MJZRO62C3GV3D","bundle":"https://pith.science/pith/CQN56XXOSTU66MJZRO62C3GV3D/bundle.json","state":"https://pith.science/pith/CQN56XXOSTU66MJZRO62C3GV3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQN56XXOSTU66MJZRO62C3GV3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CQN56XXOSTU66MJZRO62C3GV3D","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":"1091cfa9de218e3bb2383f8e00219a6a0e08306c8c0a257b7b54316103d1923a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-28T14:12:22Z","title_canon_sha256":"5fc57fd9b2e0470c53edd9cf65361edb3d936d58ef5db102309673967f52bd59"},"schema_version":"1.0","source":{"id":"2307.15573","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.15573","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"2307.15573v2","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15573","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"CQN56XXOSTU6","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"pith_short_16","alias_value":"CQN56XXOSTU66MJZ","created_at":"2026-07-05T07:12:51Z"},{"alias_kind":"pith_short_8","alias_value":"CQN56XXO","created_at":"2026-07-05T07:12:51Z"}],"graph_snapshots":[{"event_id":"sha256:b0454701ee3b6ee3edd35cec9d95dfe804cce5b85d72e3da69690ca6ce326183","target":"graph","created_at":"2026-07-05T07:12:51Z","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/2307.15573/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $k \\geq 1$. A graph $G$ is $\\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex subsets $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]$. Recognizing $\\mathbf{W_1}$ graphs is co-NP-hard, as shown by Chv\\'atal and Slater (1993) and, independently, by Sankaranarayana and Stewart (1992). Extending this result and answering a recent question of Levit and Tankus, we show that recognizing $\\mathbf{W_k}$ graphs is co-NP-hard for $k \\geq 2$. On the positive side, we show that re","authors_text":"Carl Feghali, Malory Marin","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-28T14:12:22Z","title":"Three remarks on $\\mathbf{W_2}$ graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15573","kind":"arxiv","version":2},"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:0fadd6b59cef88de83773d794f833244ee235805acd71b8a4ab801e3cf3f1470","target":"record","created_at":"2026-07-05T07:12:51Z","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":"1091cfa9de218e3bb2383f8e00219a6a0e08306c8c0a257b7b54316103d1923a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-28T14:12:22Z","title_canon_sha256":"5fc57fd9b2e0470c53edd9cf65361edb3d936d58ef5db102309673967f52bd59"},"schema_version":"1.0","source":{"id":"2307.15573","kind":"arxiv","version":2}},"canonical_sha256":"141bdf5eee94e9ef31398bbda16cd5d8d2d93e6b3a39356c8f06afdc5a56deed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"141bdf5eee94e9ef31398bbda16cd5d8d2d93e6b3a39356c8f06afdc5a56deed","first_computed_at":"2026-07-05T07:12:51.924759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:51.924759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M9hd2lHvi9WrkIpxBIXbSsurbFIaXoEjdrCBX5Y4Y7KcGCmokZ5eqdFbZ2d+kdje0eeNVyyHzzm2SjoXxvNnBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:51.925240Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.15573","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fadd6b59cef88de83773d794f833244ee235805acd71b8a4ab801e3cf3f1470","sha256:b0454701ee3b6ee3edd35cec9d95dfe804cce5b85d72e3da69690ca6ce326183"],"state_sha256":"44083432ad6cdfbde457b9bce7933e3b91cc984dba5146b2ced8e67ffe676bbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+1UrSDX5LJEPaBLpG61dNHOJWf96U462dsUYB2vhhTwCEApI1x0STafHqTJoHjKAg3SbG4qFWZs3+94zOufAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T06:38:57.044993Z","bundle_sha256":"529cb593b97f580ef0a393d247887c5e914d1377ca66115bac2d242fa1aa97af"}}