{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WDFALYDM72T6ZESU5QGXZ6BDXU","short_pith_number":"pith:WDFALYDM","canonical_record":{"source":{"id":"1210.6918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-25T17:26:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"41fe23bb9bcf966e51f548e4271d0f7ec8183ae6fddabef0ba9915fcb1c4036f","abstract_canon_sha256":"58d6cb705c2f530660be9f7dc5fe0598e904f03b49ce814dbc1472656369e1a1"},"schema_version":"1.0"},"canonical_sha256":"b0ca05e06cfea7ec9254ec0d7cf823bd0446256efd683403526ea994e5b9ce65","source":{"kind":"arxiv","id":"1210.6918","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6918","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6918v1","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6918","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"WDFALYDM72T6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WDFALYDM72T6ZESU","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WDFALYDM","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WDFALYDM72T6ZESU5QGXZ6BDXU","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-25T17:26:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"41fe23bb9bcf966e51f548e4271d0f7ec8183ae6fddabef0ba9915fcb1c4036f","abstract_canon_sha256":"58d6cb705c2f530660be9f7dc5fe0598e904f03b49ce814dbc1472656369e1a1"},"schema_version":"1.0"},"canonical_sha256":"b0ca05e06cfea7ec9254ec0d7cf823bd0446256efd683403526ea994e5b9ce65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:22.843642Z","signature_b64":"+T8sMp5br2fHkBkbbrPSfaYHRlRxO0zAGwfA42Y4RjZjBF0HHQgjMWHwM1nSJTKVhUWc7xgcI9njQh48Kx+ZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0ca05e06cfea7ec9254ec0d7cf823bd0446256efd683403526ea994e5b9ce65","last_reissued_at":"2026-05-18T03:42:22.842971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:22.842971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6918","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-18T03:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCDVl+J84USsesrh/V9mh/CP+jMnjF0FkyZeNtVJpSLqFGz8IVVwr/mYBfdtr7Te4XgTKSiAkn5lKUPg8dkkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:13:24.120378Z"},"content_sha256":"62a0c03e59803d6b08c3b24539f1893495e85b46dd722d768ec4752a40927fb2","schema_version":"1.0","event_id":"sha256:62a0c03e59803d6b08c3b24539f1893495e85b46dd722d768ec4752a40927fb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WDFALYDM72T6ZESU5QGXZ6BDXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"David Tankus, Vadim Levit","submitted_at":"2012-10-25T17:26:13Z","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. Given an input graph G without cycles of length 4, 5, and 6, we characterize polynomially the vector space of weight functions w for which G is w-well-covered. Let B be an induced complete bipartite subgraph of G on vertex sets of bipartition B_{X} and B_{Y}. Assume tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6918","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-18T03:42:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsh2QbjcbrE2P7f7nrAurj5QNnJ216/7LPPyE6iSuf823jst+3MoxVBuNX/Br9v9hs8/KNMYS0sQlPCc02BPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:13:24.120972Z"},"content_sha256":"6dbbf1512bd941a15573dd31bbf18e853e61c461db90a04aa51243eecff1d3dc","schema_version":"1.0","event_id":"sha256:6dbbf1512bd941a15573dd31bbf18e853e61c461db90a04aa51243eecff1d3dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDFALYDM72T6ZESU5QGXZ6BDXU/bundle.json","state_url":"https://pith.science/pith/WDFALYDM72T6ZESU5QGXZ6BDXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDFALYDM72T6ZESU5QGXZ6BDXU/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-08T12:13:24Z","links":{"resolver":"https://pith.science/pith/WDFALYDM72T6ZESU5QGXZ6BDXU","bundle":"https://pith.science/pith/WDFALYDM72T6ZESU5QGXZ6BDXU/bundle.json","state":"https://pith.science/pith/WDFALYDM72T6ZESU5QGXZ6BDXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDFALYDM72T6ZESU5QGXZ6BDXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WDFALYDM72T6ZESU5QGXZ6BDXU","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":"58d6cb705c2f530660be9f7dc5fe0598e904f03b49ce814dbc1472656369e1a1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-25T17:26:13Z","title_canon_sha256":"41fe23bb9bcf966e51f548e4271d0f7ec8183ae6fddabef0ba9915fcb1c4036f"},"schema_version":"1.0","source":{"id":"1210.6918","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6918","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6918v1","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6918","created_at":"2026-05-18T03:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"WDFALYDM72T6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WDFALYDM72T6ZESU","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WDFALYDM","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:6dbbf1512bd941a15573dd31bbf18e853e61c461db90a04aa51243eecff1d3dc","target":"graph","created_at":"2026-05-18T03:42:22Z","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. Given an input graph G without cycles of length 4, 5, and 6, we characterize polynomially the vector space of weight functions w for which G is w-well-covered. Let B be an induced complete bipartite subgraph of G on vertex sets of bipartition B_{X} and B_{Y}. Assume tha","authors_text":"David Tankus, Vadim Levit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-25T17:26:13Z","title":"Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6918","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:62a0c03e59803d6b08c3b24539f1893495e85b46dd722d768ec4752a40927fb2","target":"record","created_at":"2026-05-18T03:42:22Z","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":"58d6cb705c2f530660be9f7dc5fe0598e904f03b49ce814dbc1472656369e1a1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-25T17:26:13Z","title_canon_sha256":"41fe23bb9bcf966e51f548e4271d0f7ec8183ae6fddabef0ba9915fcb1c4036f"},"schema_version":"1.0","source":{"id":"1210.6918","kind":"arxiv","version":1}},"canonical_sha256":"b0ca05e06cfea7ec9254ec0d7cf823bd0446256efd683403526ea994e5b9ce65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0ca05e06cfea7ec9254ec0d7cf823bd0446256efd683403526ea994e5b9ce65","first_computed_at":"2026-05-18T03:42:22.842971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:22.842971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+T8sMp5br2fHkBkbbrPSfaYHRlRxO0zAGwfA42Y4RjZjBF0HHQgjMWHwM1nSJTKVhUWc7xgcI9njQh48Kx+ZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:22.843642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6918","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62a0c03e59803d6b08c3b24539f1893495e85b46dd722d768ec4752a40927fb2","sha256:6dbbf1512bd941a15573dd31bbf18e853e61c461db90a04aa51243eecff1d3dc"],"state_sha256":"6c9b999b5f8d3bb1c715f9c0661136b9fde4ada34e3dc798363850d32a41e62b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t46js6kpOjDpR+7iY+THk7o9Xhxha1Wl77duHMAoRoW9Hjfx9HUcFpMGBtr6AZ5FLchWhzexMZtw174Bbi4tDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:13:24.123522Z","bundle_sha256":"4fd1852d9e9d7a260f21282fc8c40ed5e9a93516e5f0e7ea0cf4ee4b12cb9eb0"}}