{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:56VNIR2ZLKPB45HD5K4OD5LHYE","short_pith_number":"pith:56VNIR2Z","schema_version":"1.0","canonical_sha256":"efaad447595a9e1e74e3eab8e1f567c10c4896ec87fd36b5c8a78b56d08d9d38","source":{"kind":"arxiv","id":"0901.0858","version":4},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0901.0858","created_at":"2026-05-18T04:40:54.739587+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.0858v4","created_at":"2026-05-18T04:40:54.739587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.0858","created_at":"2026-05-18T04:40:54.739587+00:00"},{"alias_kind":"pith_short_12","alias_value":"56VNIR2ZLKPB","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"56VNIR2ZLKPB45HD","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"56VNIR2Z","created_at":"2026-05-18T12:25:58.837520+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/56VNIR2ZLKPB45HD5K4OD5LHYE","json":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE.json","graph_json":"https://pith.science/api/pith-number/56VNIR2ZLKPB45HD5K4OD5LHYE/graph.json","events_json":"https://pith.science/api/pith-number/56VNIR2ZLKPB45HD5K4OD5LHYE/events.json","paper":"https://pith.science/paper/56VNIR2Z"},"agent_actions":{"view_html":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE","download_json":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE.json","view_paper":"https://pith.science/paper/56VNIR2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.0858&json=true","fetch_graph":"https://pith.science/api/pith-number/56VNIR2ZLKPB45HD5K4OD5LHYE/graph.json","fetch_events":"https://pith.science/api/pith-number/56VNIR2ZLKPB45HD5K4OD5LHYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/action/storage_attestation","attest_author":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/action/author_attestation","sign_citation":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/action/citation_signature","submit_replication":"https://pith.science/pith/56VNIR2ZLKPB45HD5K4OD5LHYE/action/replication_record"}},"created_at":"2026-05-18T04:40:54.739587+00:00","updated_at":"2026-05-18T04:40:54.739587+00:00"}