{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G2VWHTBJWVIY2LPIQ4EMIU2KBN","short_pith_number":"pith:G2VWHTBJ","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"},"canonical_sha256":"36ab63cc29b5518d2de88708c4534a0b7f4ab432348af405e5192be900ccf3e2","source":{"kind":"arxiv","id":"1811.04433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04433","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04433v1","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04433","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"G2VWHTBJWVIY","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G2VWHTBJWVIY2LPI","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G2VWHTBJ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G2VWHTBJWVIY2LPIQ4EMIU2KBN","target":"record","payload":{"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"},"canonical_sha256":"36ab63cc29b5518d2de88708c4534a0b7f4ab432348af405e5192be900ccf3e2","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"},"source_kind":"arxiv","source_id":"1811.04433","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-05-18T00:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKKZJMEQlO54dTj/RpW0S9I04dc6KuJq0X6bN3y7d7V99xfUWGyLS0wLzSlFyM0bm0dFuuUvENmVDF5EFzWoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:37.881193Z"},"content_sha256":"71e69881b44cd64f122ed6825e9d8b59b88c3f38a183d3ef93e5b91466a252a3","schema_version":"1.0","event_id":"sha256:71e69881b44cd64f122ed6825e9d8b59b88c3f38a183d3ef93e5b91466a252a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G2VWHTBJWVIY2LPIQ4EMIU2KBN","target":"graph","payload":{"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"},"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:01:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sEaj5+mgtShBjOvmz1Q1GxRakIrThYXLl3oTu42hznbryalwxtJa1/r0RRZeVpAN1TP7RRlvz5DygRNVWtpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:37.881701Z"},"content_sha256":"813f156cfa5dcb16fc61de438fdbf7c571c4d5bd05018016be6d451039772dcb","schema_version":"1.0","event_id":"sha256:813f156cfa5dcb16fc61de438fdbf7c571c4d5bd05018016be6d451039772dcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/bundle.json","state_url":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/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-05-31T21:54:37Z","links":{"resolver":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN","bundle":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/bundle.json","state":"https://pith.science/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G2VWHTBJWVIY2LPIQ4EMIU2KBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G2VWHTBJWVIY2LPIQ4EMIU2KBN","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":"d0929a7c8d549265ae322c6ed1a89eac7c9934cd9903b5acf806125b3eac49dd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-11T16:07:22Z","title_canon_sha256":"a5131dec167a14d50c6e233f466ad72900cf968c2529e6ab57d8b1d9d90169f9"},"schema_version":"1.0","source":{"id":"1811.04433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04433","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04433v1","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04433","created_at":"2026-05-18T00:01:05Z"},{"alias_kind":"pith_short_12","alias_value":"G2VWHTBJWVIY","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G2VWHTBJWVIY2LPI","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G2VWHTBJ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:813f156cfa5dcb16fc61de438fdbf7c571c4d5bd05018016be6d451039772dcb","target":"graph","created_at":"2026-05-18T00:01:05Z","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 $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","authors_text":"David Tankus, Vadim E. Levit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-11T16:07:22Z","title":"Recognizing generating subgraphs revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04433","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:71e69881b44cd64f122ed6825e9d8b59b88c3f38a183d3ef93e5b91466a252a3","target":"record","created_at":"2026-05-18T00:01:05Z","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":"d0929a7c8d549265ae322c6ed1a89eac7c9934cd9903b5acf806125b3eac49dd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-11T16:07:22Z","title_canon_sha256":"a5131dec167a14d50c6e233f466ad72900cf968c2529e6ab57d8b1d9d90169f9"},"schema_version":"1.0","source":{"id":"1811.04433","kind":"arxiv","version":1}},"canonical_sha256":"36ab63cc29b5518d2de88708c4534a0b7f4ab432348af405e5192be900ccf3e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36ab63cc29b5518d2de88708c4534a0b7f4ab432348af405e5192be900ccf3e2","first_computed_at":"2026-05-18T00:01:05.188510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:05.188510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1l2uA7JYHQ0Ekq9PyrjhZfAHmsus1gUJWz8A51w59uz5BKPyTfmhObJMK+GxzTRHgoXyrXTAbDH6DWwPb1tOBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:05.189106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71e69881b44cd64f122ed6825e9d8b59b88c3f38a183d3ef93e5b91466a252a3","sha256:813f156cfa5dcb16fc61de438fdbf7c571c4d5bd05018016be6d451039772dcb"],"state_sha256":"dd08bd34c7b3d8f97842fe925270bb43ad0c8563f74cd1cf7dd65dcc532409d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLZxZy6SLSBI2WomTv3AZ1mNG/+bMQCXh6h9yu0mkBT8OWNr65s2ylU86xBYGbVx9XFBWRt8/Wan1RB7Up3HCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:54:37.885486Z","bundle_sha256":"1628112280e2ab3dab0d7310693bfc29c2a7878001c67da49a086912647d9926"}}