{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:I5YDPTRBV5NGZFYB2LUHSLU6BP","short_pith_number":"pith:I5YDPTRB","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"},"canonical_sha256":"477037ce21af5a6c9701d2e8792e9e0bd9f6189d5977496db4015ee81fde7354","source":{"kind":"arxiv","id":"1511.08066","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08066","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08066v3","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08066","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"I5YDPTRBV5NG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I5YDPTRBV5NGZFYB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I5YDPTRB","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:I5YDPTRBV5NGZFYB2LUHSLU6BP","target":"record","payload":{"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"},"canonical_sha256":"477037ce21af5a6c9701d2e8792e9e0bd9f6189d5977496db4015ee81fde7354","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"},"source_kind":"arxiv","source_id":"1511.08066","source_version":3,"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-18T01:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6F7jikHVx6H5HGqJDbSupxQZwrIfbTtMWsK+3Yskc7o6+5CDSa1JHhFfzPmbLSvuu0Mpv29yiHjTE3e93sqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:50:38.476927Z"},"content_sha256":"f0812e849b6d6dd9af374d816bf6ef372440c916db81c5d367939a2e2b3b113e","schema_version":"1.0","event_id":"sha256:f0812e849b6d6dd9af374d816bf6ef372440c916db81c5d367939a2e2b3b113e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:I5YDPTRBV5NGZFYB2LUHSLU6BP","target":"graph","payload":{"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"},"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-18T01:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4iz7YCASqqG9WtDl/99yodRNdhByCFctQGdOfxwAMbar3X54mZjDJ9bGwyoO6gHg6azQe3cNc1G/LJWMzttCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:50:38.477614Z"},"content_sha256":"830c0ffee7877cda180fdc412a45ae6e24c8cb0c77871be2019d10f16ce1c158","schema_version":"1.0","event_id":"sha256:830c0ffee7877cda180fdc412a45ae6e24c8cb0c77871be2019d10f16ce1c158"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/bundle.json","state_url":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/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-31T18:50:38Z","links":{"resolver":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP","bundle":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/bundle.json","state":"https://pith.science/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5YDPTRBV5NGZFYB2LUHSLU6BP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:I5YDPTRBV5NGZFYB2LUHSLU6BP","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":"0e6f2160ab1929329fd99c2a9b1b5a47ace9f2f7f1244c753599ce5d1b128d94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-25T14:08:30Z","title_canon_sha256":"6342ec2d553ea670da63c508fb3e51d4e97b200008a5e47b8a855735ddb2572b"},"schema_version":"1.0","source":{"id":"1511.08066","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08066","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08066v3","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08066","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"I5YDPTRBV5NG","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"I5YDPTRBV5NGZFYB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"I5YDPTRB","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:830c0ffee7877cda180fdc412a45ae6e24c8cb0c77871be2019d10f16ce1c158","target":"graph","created_at":"2026-05-18T01:11:41Z","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":"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","authors_text":"Andreas Brandstadt, Raffaele Mosca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-25T14:08:30Z","title":"Maximum Weight Independent Sets for ($P_7$,Triangle)-Free Graphs in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08066","kind":"arxiv","version":3},"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:f0812e849b6d6dd9af374d816bf6ef372440c916db81c5d367939a2e2b3b113e","target":"record","created_at":"2026-05-18T01:11:41Z","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":"0e6f2160ab1929329fd99c2a9b1b5a47ace9f2f7f1244c753599ce5d1b128d94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-25T14:08:30Z","title_canon_sha256":"6342ec2d553ea670da63c508fb3e51d4e97b200008a5e47b8a855735ddb2572b"},"schema_version":"1.0","source":{"id":"1511.08066","kind":"arxiv","version":3}},"canonical_sha256":"477037ce21af5a6c9701d2e8792e9e0bd9f6189d5977496db4015ee81fde7354","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"477037ce21af5a6c9701d2e8792e9e0bd9f6189d5977496db4015ee81fde7354","first_computed_at":"2026-05-18T01:11:41.239185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:41.239185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+TodoccangZxCC+v0HGpnyQ2oHuoe+1mvlxx3Hyd+9jGeWrU5lQ4ERaVC/1lXjXkrzD+IK3J+NkTFMOqJF3PCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:41.239521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08066","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0812e849b6d6dd9af374d816bf6ef372440c916db81c5d367939a2e2b3b113e","sha256:830c0ffee7877cda180fdc412a45ae6e24c8cb0c77871be2019d10f16ce1c158"],"state_sha256":"7dd2152100c2c150ff1daaf5f07ca59ad1d97a5d9006fcd5eda6597c49f9b14e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2b+gNwQ77ITYYlqNoI+MLsVM7gIWyzvuRQEqKKuCkGe6EJNHgDYh/xgroykHXtzBhkTLvfEhLG5eyNwL+rcVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:50:38.481294Z","bundle_sha256":"ea2572285ef5bfcc7dbd868e9caaacf33a1b956fa37460434d7e69a5d6d92e3d"}}