{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:I5YDPTRBV5NGZFYB2LUHSLU6BP","short_pith_number":"pith:I5YDPTRB","schema_version":"1.0","canonical_sha256":"477037ce21af5a6c9701d2e8792e9e0bd9f6189d5977496db4015ee81fde7354","source":{"kind":"arxiv","id":"1511.08066","version":3},"attestation_state":"computed","paper":{"title":"Maximum Weight Independent Sets for ($P_7$,Triangle)-Free Graphs in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Raffaele Mosca","submitted_at":"2015-11-25T14:08:30Z","abstract_excerpt":"The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum. MWIS is one of the most investigated and most important algorithmic graph problems; it is well known to be NP-complete, and it remains NP-complete even under various strong restrictions such as for triangle-free graphs. Its complexity was an open problem for $P_k$-free graphs, $k \\ge 5$. Recently, Lokshtanov, Vatshelle, and Villanger proved that MWIS can be solved in polynomial time for $P_5$-free graphs, and Lokshtanov, Pilipc"},"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":"1511.08066","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-25T14:08:30Z","cross_cats_sorted":[],"title_canon_sha256":"6342ec2d553ea670da63c508fb3e51d4e97b200008a5e47b8a855735ddb2572b","abstract_canon_sha256":"0e6f2160ab1929329fd99c2a9b1b5a47ace9f2f7f1244c753599ce5d1b128d94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:41.239521Z","signature_b64":"+TodoccangZxCC+v0HGpnyQ2oHuoe+1mvlxx3Hyd+9jGeWrU5lQ4ERaVC/1lXjXkrzD+IK3J+NkTFMOqJF3PCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"477037ce21af5a6c9701d2e8792e9e0bd9f6189d5977496db4015ee81fde7354","last_reissued_at":"2026-05-18T01:11:41.239185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:41.239185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Weight Independent Sets for ($P_7$,Triangle)-Free Graphs in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Raffaele Mosca","submitted_at":"2015-11-25T14:08:30Z","abstract_excerpt":"The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum. MWIS is one of the most investigated and most important algorithmic graph problems; it is well known to be NP-complete, and it remains NP-complete even under various strong restrictions such as for triangle-free graphs. Its complexity was an open problem for $P_k$-free graphs, $k \\ge 5$. Recently, Lokshtanov, Vatshelle, and Villanger proved that MWIS can be solved in polynomial time for $P_5$-free graphs, and Lokshtanov, Pilipc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08066","kind":"arxiv","version":3},"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":"1511.08066","created_at":"2026-05-18T01:11:41.239243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08066v3","created_at":"2026-05-18T01:11:41.239243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08066","created_at":"2026-05-18T01:11:41.239243+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5YDPTRBV5NG","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5YDPTRBV5NGZFYB","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5YDPTRB","created_at":"2026-05-18T12:29:25.134429+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/I5YDPTRBV5NGZFYB2LUHSLU6BP","json":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP.json","graph_json":"https://pith.science/api/pith-number/I5YDPTRBV5NGZFYB2LUHSLU6BP/graph.json","events_json":"https://pith.science/api/pith-number/I5YDPTRBV5NGZFYB2LUHSLU6BP/events.json","paper":"https://pith.science/paper/I5YDPTRB"},"agent_actions":{"view_html":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP","download_json":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP.json","view_paper":"https://pith.science/paper/I5YDPTRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08066&json=true","fetch_graph":"https://pith.science/api/pith-number/I5YDPTRBV5NGZFYB2LUHSLU6BP/graph.json","fetch_events":"https://pith.science/api/pith-number/I5YDPTRBV5NGZFYB2LUHSLU6BP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/action/storage_attestation","attest_author":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/action/author_attestation","sign_citation":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/action/citation_signature","submit_replication":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/action/replication_record"}},"created_at":"2026-05-18T01:11:41.239243+00:00","updated_at":"2026-05-18T01:11:41.239243+00:00"}