{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G2VWHTBJWVIY2LPIQ4EMIU2KBN","short_pith_number":"pith:G2VWHTBJ","schema_version":"1.0","canonical_sha256":"36ab63cc29b5518d2de88708c4534a0b7f4ab432348af405e5192be900ccf3e2","source":{"kind":"arxiv","id":"1811.04433","version":1},"attestation_state":"computed","paper":{"title":"Recognizing generating subgraphs revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"David Tankus, Vadim E. Levit","submitted_at":"2018-11-11T16:07:22Z","abstract_excerpt":"A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. For every graph $G$, the set of weight functions $w$ such that $G$ is $w$-well-covered is a vector space, denoted as $WCW(G).$ Deciding whether an input graph $G$ is well-covered is co-NP-complete. Therefore, finding $WCW(G)$ is co-NP-hard. A generating subgraph of a graph $G$ is an induced complete bipartite subgraph $B$ of $G$ on vertex sets of bipartition"},"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":"1811.04433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-11T16:07:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a5131dec167a14d50c6e233f466ad72900cf968c2529e6ab57d8b1d9d90169f9","abstract_canon_sha256":"d0929a7c8d549265ae322c6ed1a89eac7c9934cd9903b5acf806125b3eac49dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:05.189106Z","signature_b64":"1l2uA7JYHQ0Ekq9PyrjhZfAHmsus1gUJWz8A51w59uz5BKPyTfmhObJMK+GxzTRHgoXyrXTAbDH6DWwPb1tOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ab63cc29b5518d2de88708c4534a0b7f4ab432348af405e5192be900ccf3e2","last_reissued_at":"2026-05-18T00:01:05.188510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:05.188510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognizing generating subgraphs revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"David Tankus, Vadim E. Levit","submitted_at":"2018-11-11T16:07:22Z","abstract_excerpt":"A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. For every graph $G$, the set of weight functions $w$ such that $G$ is $w$-well-covered is a vector space, denoted as $WCW(G).$ Deciding whether an input graph $G$ is well-covered is co-NP-complete. Therefore, finding $WCW(G)$ is co-NP-hard. A generating subgraph of a graph $G$ is an induced complete bipartite subgraph $B$ of $G$ on vertex sets of bipartition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04433","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":""},"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":"1811.04433","created_at":"2026-05-18T00:01:05.188588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.04433v1","created_at":"2026-05-18T00:01:05.188588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04433","created_at":"2026-05-18T00:01:05.188588+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2VWHTBJWVIY","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2VWHTBJWVIY2LPI","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2VWHTBJ","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN","json":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN.json","graph_json":"https://pith.science/api/pith-number/G2VWHTBJWVIY2LPIQ4EMIU2KBN/graph.json","events_json":"https://pith.science/api/pith-number/G2VWHTBJWVIY2LPIQ4EMIU2KBN/events.json","paper":"https://pith.science/paper/G2VWHTBJ"},"agent_actions":{"view_html":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN","download_json":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN.json","view_paper":"https://pith.science/paper/G2VWHTBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.04433&json=true","fetch_graph":"https://pith.science/api/pith-number/G2VWHTBJWVIY2LPIQ4EMIU2KBN/graph.json","fetch_events":"https://pith.science/api/pith-number/G2VWHTBJWVIY2LPIQ4EMIU2KBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/action/storage_attestation","attest_author":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/action/author_attestation","sign_citation":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/action/citation_signature","submit_replication":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/action/replication_record"}},"created_at":"2026-05-18T00:01:05.188588+00:00","updated_at":"2026-05-18T00:01:05.188588+00:00"}