{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:56VNIR2ZLKPB45HD5K4OD5LHYE","short_pith_number":"pith:56VNIR2Z","canonical_record":{"source":{"id":"0901.0858","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-01-07T16:09:49Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"804160f33d422454688f57d3bf29b6cf9e430f92e1aacb7f6f20cf37d8505058","abstract_canon_sha256":"439ad4cd5d8b382c768a3af81d0c26937e393ee4f152450d864607990750f418"},"schema_version":"1.0"},"canonical_sha256":"efaad447595a9e1e74e3eab8e1f567c10c4896ec87fd36b5c8a78b56d08d9d38","source":{"kind":"arxiv","id":"0901.0858","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0858","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0858v4","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0858","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"56VNIR2ZLKPB","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"56VNIR2ZLKPB45HD","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"56VNIR2Z","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:56VNIR2ZLKPB45HD5K4OD5LHYE","target":"record","payload":{"canonical_record":{"source":{"id":"0901.0858","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-01-07T16:09:49Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"804160f33d422454688f57d3bf29b6cf9e430f92e1aacb7f6f20cf37d8505058","abstract_canon_sha256":"439ad4cd5d8b382c768a3af81d0c26937e393ee4f152450d864607990750f418"},"schema_version":"1.0"},"canonical_sha256":"efaad447595a9e1e74e3eab8e1f567c10c4896ec87fd36b5c8a78b56d08d9d38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:54.740207Z","signature_b64":"k/fp3a35UNGNeKwJnkdSIa+LWVlypDiQiBrfcrNUQOjWnL76DY+kYmFOTNQfaFWgTYfl1PtbsBH6J4rs2LgCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efaad447595a9e1e74e3eab8e1f567c10c4896ec87fd36b5c8a78b56d08d9d38","last_reissued_at":"2026-05-18T04:40:54.739485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:54.739485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.0858","source_version":4,"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-18T04:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"II8cGopPoNocSCb8JBrJ+/WiG92Q5NiAZgXjPQ0iyhlpPwiw0+Qs9gG4FoR87ra551FJu9oOnk4HNsC5cZBVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:36:20.324559Z"},"content_sha256":"d376be465c817ca0508f67b63866f47482febeece1369e7dc2ca0285bc2caa3f","schema_version":"1.0","event_id":"sha256:d376be465c817ca0508f67b63866f47482febeece1369e7dc2ca0285bc2caa3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:56VNIR2ZLKPB45HD5K4OD5LHYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"David Tankus, Vadim E. Levit","submitted_at":"2009-01-07T16:09:49Z","abstract_excerpt":"A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NP-complete. Let w be a weight function defined on the vertices of G. Then G is w-well-covered if all maximal independent sets of G are of the same weight. The set of weight functions w for which a graph is w-well-covered is a vector space. We prove that finding the vector space of weight functions under which an input graph is w-well-covered can be done in polynomial time, if the input graph does not contain cycles of length 4, 5, 6 and 7."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0858","kind":"arxiv","version":4},"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-18T04:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEVM7mHfiyhUIz+5J0E3i6w0lp9GnBK/58UPjp2gsz7Xffx9XZUx6tIUn3jnh2emIjcLBTmWsql0MufxGDJQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:36:20.324931Z"},"content_sha256":"1e554b260ed91ecd2b1de2d98baf8d7de89b5eb5f76142b0b94d82f073335c1e","schema_version":"1.0","event_id":"sha256:1e554b260ed91ecd2b1de2d98baf8d7de89b5eb5f76142b0b94d82f073335c1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/bundle.json","state_url":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/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-31T23:36:20Z","links":{"resolver":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE","bundle":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/bundle.json","state":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:56VNIR2ZLKPB45HD5K4OD5LHYE","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":"439ad4cd5d8b382c768a3af81d0c26937e393ee4f152450d864607990750f418","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-01-07T16:09:49Z","title_canon_sha256":"804160f33d422454688f57d3bf29b6cf9e430f92e1aacb7f6f20cf37d8505058"},"schema_version":"1.0","source":{"id":"0901.0858","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.0858","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"0901.0858v4","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0858","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"56VNIR2ZLKPB","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"56VNIR2ZLKPB45HD","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"56VNIR2Z","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:1e554b260ed91ecd2b1de2d98baf8d7de89b5eb5f76142b0b94d82f073335c1e","target":"graph","created_at":"2026-05-18T04:40:54Z","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 is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NP-complete. Let w be a weight function defined on the vertices of G. Then G is w-well-covered if all maximal independent sets of G are of the same weight. The set of weight functions w for which a graph is w-well-covered is a vector space. We prove that finding the vector space of weight functions under which an input graph is w-well-covered can be done in polynomial time, if the input graph does not contain cycles of length 4, 5, 6 and 7.","authors_text":"David Tankus, Vadim E. Levit","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-01-07T16:09:49Z","title":"Weighted Well-Covered Graphs without Cycles of Length 4, 5, 6 and 7"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.0858","kind":"arxiv","version":4},"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:d376be465c817ca0508f67b63866f47482febeece1369e7dc2ca0285bc2caa3f","target":"record","created_at":"2026-05-18T04:40:54Z","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":"439ad4cd5d8b382c768a3af81d0c26937e393ee4f152450d864607990750f418","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-01-07T16:09:49Z","title_canon_sha256":"804160f33d422454688f57d3bf29b6cf9e430f92e1aacb7f6f20cf37d8505058"},"schema_version":"1.0","source":{"id":"0901.0858","kind":"arxiv","version":4}},"canonical_sha256":"efaad447595a9e1e74e3eab8e1f567c10c4896ec87fd36b5c8a78b56d08d9d38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efaad447595a9e1e74e3eab8e1f567c10c4896ec87fd36b5c8a78b56d08d9d38","first_computed_at":"2026-05-18T04:40:54.739485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:54.739485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k/fp3a35UNGNeKwJnkdSIa+LWVlypDiQiBrfcrNUQOjWnL76DY+kYmFOTNQfaFWgTYfl1PtbsBH6J4rs2LgCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:54.740207Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.0858","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d376be465c817ca0508f67b63866f47482febeece1369e7dc2ca0285bc2caa3f","sha256:1e554b260ed91ecd2b1de2d98baf8d7de89b5eb5f76142b0b94d82f073335c1e"],"state_sha256":"8d77dd736e5e5bbba23d1b6092d2c9a5dbd3e12aa1e9ff1a3576c4c4e1e8d923"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+LqhylDXx3TnqPt4ryC2k/TK4XYT/VqsTmsXmhvTUJrhvJVurPE0pi0XO3JTf/3AdloiCB056WVf0MhVYozCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:36:20.327333Z","bundle_sha256":"175586bb40b7bef1bf645759108b2a2abc0f5b39559755604a9dcc9b6a1775a6"}}