{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AJC7M7HSWDNG3JA5ZGX4KKPW7V","short_pith_number":"pith:AJC7M7HS","schema_version":"1.0","canonical_sha256":"0245f67cf2b0da6da41dc9afc529f6fd49fb7dea12a87ebc9f0d8d64d6d8e561","source":{"kind":"arxiv","id":"1806.09472","version":2},"attestation_state":"computed","paper":{"title":"Maximum Weight Independent Sets for ($S_{1,2,4}$,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 Brandst\\\"adt, Raffaele Mosca","submitted_at":"2018-06-22T13:57:55Z","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 for $P_k$-free graphs, $k \\ge 7$, is an open problem. In \\cite{BraMos2018}, it is shown that MWIS can be solved in polynomial time for ($P_7$,triangle)-free graphs. This result is extended by Maff"},"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":"1806.09472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-22T13:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"234c8701a8de805ae6b16397f1c5b796bafdc2a3ff6a50d9eb4c5cf8af5a45b1","abstract_canon_sha256":"b57e045ad2b3fd438e30ee1dd98f1d14270a88df79358c61edeb9f7a8c8e83a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:33.783230Z","signature_b64":"mQpKgZOKFGVZ+eYxkqVTDYpLdul44HWzasQ74s3+jFxRowR+EQ1LtEjSkdEghMKbHd4CR4MDwDA4kJ1NGZPMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0245f67cf2b0da6da41dc9afc529f6fd49fb7dea12a87ebc9f0d8d64d6d8e561","last_reissued_at":"2026-05-17T23:56:33.782700Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:33.782700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Weight Independent Sets for ($S_{1,2,4}$,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 Brandst\\\"adt, Raffaele Mosca","submitted_at":"2018-06-22T13:57:55Z","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 for $P_k$-free graphs, $k \\ge 7$, is an open problem. In \\cite{BraMos2018}, it is shown that MWIS can be solved in polynomial time for ($P_7$,triangle)-free graphs. This result is extended by Maff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09472","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.09472","created_at":"2026-05-17T23:56:33.782792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09472v2","created_at":"2026-05-17T23:56:33.782792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09472","created_at":"2026-05-17T23:56:33.782792+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJC7M7HSWDNG","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJC7M7HSWDNG3JA5","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJC7M7HS","created_at":"2026-05-18T12:32:13.499390+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/AJC7M7HSWDNG3JA5ZGX4KKPW7V","json":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V.json","graph_json":"https://pith.science/api/pith-number/AJC7M7HSWDNG3JA5ZGX4KKPW7V/graph.json","events_json":"https://pith.science/api/pith-number/AJC7M7HSWDNG3JA5ZGX4KKPW7V/events.json","paper":"https://pith.science/paper/AJC7M7HS"},"agent_actions":{"view_html":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V","download_json":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V.json","view_paper":"https://pith.science/paper/AJC7M7HS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09472&json=true","fetch_graph":"https://pith.science/api/pith-number/AJC7M7HSWDNG3JA5ZGX4KKPW7V/graph.json","fetch_events":"https://pith.science/api/pith-number/AJC7M7HSWDNG3JA5ZGX4KKPW7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/action/storage_attestation","attest_author":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/action/author_attestation","sign_citation":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/action/citation_signature","submit_replication":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/action/replication_record"}},"created_at":"2026-05-17T23:56:33.782792+00:00","updated_at":"2026-05-17T23:56:33.782792+00:00"}