{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IH227UNFTVLHLHFFOIVJWOCHAO","short_pith_number":"pith:IH227UNF","canonical_record":{"source":{"id":"1401.0294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-01T15:20:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"616e179895eb9179ebdb496c3a2d18703164b11980f76690ebadcf1b1b561726","abstract_canon_sha256":"8160df6593ca78dd9988b00a8edc96ae380557f07376cba575417df5bc054bf5"},"schema_version":"1.0"},"canonical_sha256":"41f5afd1a59d56759ca5722a9b38470386d0665206cd62e18048e2cb52fbb5c9","source":{"kind":"arxiv","id":"1401.0294","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0294","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0294v2","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0294","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"IH227UNFTVLH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IH227UNFTVLHLHFF","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IH227UNF","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IH227UNFTVLHLHFFOIVJWOCHAO","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-01T15:20:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"616e179895eb9179ebdb496c3a2d18703164b11980f76690ebadcf1b1b561726","abstract_canon_sha256":"8160df6593ca78dd9988b00a8edc96ae380557f07376cba575417df5bc054bf5"},"schema_version":"1.0"},"canonical_sha256":"41f5afd1a59d56759ca5722a9b38470386d0665206cd62e18048e2cb52fbb5c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:38.594460Z","signature_b64":"AgO8XgcTvHKnhgL5Zf57uol6MlGi43dv3iqSlBz/AieTzFDaJimtfmzR5txlYa7dfsnbcQLDVIL9uCEWTetzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f5afd1a59d56759ca5722a9b38470386d0665206cd62e18048e2cb52fbb5c9","last_reissued_at":"2026-05-18T00:57:38.593865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:38.593865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0294","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-05-18T00:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imGp4IV13HoQFb8aiKXcFoYWrNPrhkgYgdUBwSwktCF0pqJKK9zRHxLUMM1cWN1OmsB4pV1YHJUtsmltt8qqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:16:14.871158Z"},"content_sha256":"547a139dc6e362368d129c1b57a4d3d33d1055cbd5d283cff65b77880291db0f","schema_version":"1.0","event_id":"sha256:547a139dc6e362368d129c1b57a4d3d33d1055cbd5d283cff65b77880291db0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IH227UNFTVLHLHFFOIVJWOCHAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity results for generating subgraphs","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":"2014-01-01T15:20:17Z","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.\n  For every graph G, the set of weight functions w such that G is w-well-covered is a vector space, denoted WCW(G). Let B be a complete bipartite induced subgraph of G on vertex sets of bipartition B_X and B_Y. Then B is generating if there exists an independent set S such that S \\cup B_X and S \\cup B_Y are both maximal independent sets of G. A relating edge is a ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0294","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":""},"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:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LcEJ2NiUqoaEJgaU8qUVL8JxbT0f56cXrD7bM9sYKSVEvJlQRXIwikGsR3EnaiSF4qHw3OS2HOhXSJGiOGFmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:16:14.871516Z"},"content_sha256":"6de0ef85b391c9745974b0d645e6157dcfa1a7b121feb1d13fd05081cc4ad140","schema_version":"1.0","event_id":"sha256:6de0ef85b391c9745974b0d645e6157dcfa1a7b121feb1d13fd05081cc4ad140"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH227UNFTVLHLHFFOIVJWOCHAO/bundle.json","state_url":"https://pith.science/pith/IH227UNFTVLHLHFFOIVJWOCHAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH227UNFTVLHLHFFOIVJWOCHAO/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-02T06:16:14Z","links":{"resolver":"https://pith.science/pith/IH227UNFTVLHLHFFOIVJWOCHAO","bundle":"https://pith.science/pith/IH227UNFTVLHLHFFOIVJWOCHAO/bundle.json","state":"https://pith.science/pith/IH227UNFTVLHLHFFOIVJWOCHAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH227UNFTVLHLHFFOIVJWOCHAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IH227UNFTVLHLHFFOIVJWOCHAO","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":"8160df6593ca78dd9988b00a8edc96ae380557f07376cba575417df5bc054bf5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-01T15:20:17Z","title_canon_sha256":"616e179895eb9179ebdb496c3a2d18703164b11980f76690ebadcf1b1b561726"},"schema_version":"1.0","source":{"id":"1401.0294","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0294","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0294v2","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0294","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"IH227UNFTVLH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IH227UNFTVLHLHFF","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IH227UNF","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:6de0ef85b391c9745974b0d645e6157dcfa1a7b121feb1d13fd05081cc4ad140","target":"graph","created_at":"2026-05-18T00:57:38Z","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.\n  For every graph G, the set of weight functions w such that G is w-well-covered is a vector space, denoted WCW(G). Let B be a complete bipartite induced subgraph of G on vertex sets of bipartition B_X and B_Y. Then B is generating if there exists an independent set S such that S \\cup B_X and S \\cup B_Y are both maximal independent sets of G. A relating edge is a ge","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":"2014-01-01T15:20:17Z","title":"Complexity results for generating subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0294","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:547a139dc6e362368d129c1b57a4d3d33d1055cbd5d283cff65b77880291db0f","target":"record","created_at":"2026-05-18T00:57:38Z","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":"8160df6593ca78dd9988b00a8edc96ae380557f07376cba575417df5bc054bf5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-01T15:20:17Z","title_canon_sha256":"616e179895eb9179ebdb496c3a2d18703164b11980f76690ebadcf1b1b561726"},"schema_version":"1.0","source":{"id":"1401.0294","kind":"arxiv","version":2}},"canonical_sha256":"41f5afd1a59d56759ca5722a9b38470386d0665206cd62e18048e2cb52fbb5c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41f5afd1a59d56759ca5722a9b38470386d0665206cd62e18048e2cb52fbb5c9","first_computed_at":"2026-05-18T00:57:38.593865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:38.593865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AgO8XgcTvHKnhgL5Zf57uol6MlGi43dv3iqSlBz/AieTzFDaJimtfmzR5txlYa7dfsnbcQLDVIL9uCEWTetzCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:38.594460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0294","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:547a139dc6e362368d129c1b57a4d3d33d1055cbd5d283cff65b77880291db0f","sha256:6de0ef85b391c9745974b0d645e6157dcfa1a7b121feb1d13fd05081cc4ad140"],"state_sha256":"3653c51de9d958c52316a6592454e9279527ae25553632905d7ad353d2d1b761"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RvXrpYd8Md1Vb9o6s2IKFHLkAJQwONhTe7FiQo5l7ftJ4C5yU97bB1tiM9qWsrU9WGtafqJQPCjvY1RlE1NLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:16:14.873487Z","bundle_sha256":"acdd5674ff007924e04a4a120f538d1e2fe6e04d0e0b94eb6f9f4e2ee24279c0"}}