{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AJC7M7HSWDNG3JA5ZGX4KKPW7V","short_pith_number":"pith:AJC7M7HS","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"},"canonical_sha256":"0245f67cf2b0da6da41dc9afc529f6fd49fb7dea12a87ebc9f0d8d64d6d8e561","source":{"kind":"arxiv","id":"1806.09472","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09472","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09472v2","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09472","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"AJC7M7HSWDNG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AJC7M7HSWDNG3JA5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AJC7M7HS","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AJC7M7HSWDNG3JA5ZGX4KKPW7V","target":"record","payload":{"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"},"canonical_sha256":"0245f67cf2b0da6da41dc9afc529f6fd49fb7dea12a87ebc9f0d8d64d6d8e561","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"},"source_kind":"arxiv","source_id":"1806.09472","source_version":2,"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-17T23:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TkcESssU6HpQTSDKbC6320UkD0d5lFr3IKhVDmjanSiynm4mV3rqEafJibCALIrgd0GpjLDRGhp/c+NEyixBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:34:15.958100Z"},"content_sha256":"c7ceb4b4cab201766ee12611e254056d3eb4c190fa1b263634c35ccdb850d0f0","schema_version":"1.0","event_id":"sha256:c7ceb4b4cab201766ee12611e254056d3eb4c190fa1b263634c35ccdb850d0f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AJC7M7HSWDNG3JA5ZGX4KKPW7V","target":"graph","payload":{"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"},"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-17T23:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yuhaRE44XRi7eTHDuCOYtH9jp+qzfOXCh6x3V5m6cdcDH0PA6PC3zhPKPz9CbelOU/pLXWsnfYookb0f5ZYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:34:15.958461Z"},"content_sha256":"9a650cc4d932ee8906a1f5383efd6acb1a3dbb5f3818474585e4f5cb373be7c1","schema_version":"1.0","event_id":"sha256:9a650cc4d932ee8906a1f5383efd6acb1a3dbb5f3818474585e4f5cb373be7c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/bundle.json","state_url":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/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-06-04T23:34:15Z","links":{"resolver":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V","bundle":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/bundle.json","state":"https://pith.science/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJC7M7HSWDNG3JA5ZGX4KKPW7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AJC7M7HSWDNG3JA5ZGX4KKPW7V","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":"b57e045ad2b3fd438e30ee1dd98f1d14270a88df79358c61edeb9f7a8c8e83a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-22T13:57:55Z","title_canon_sha256":"234c8701a8de805ae6b16397f1c5b796bafdc2a3ff6a50d9eb4c5cf8af5a45b1"},"schema_version":"1.0","source":{"id":"1806.09472","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09472","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09472v2","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09472","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"AJC7M7HSWDNG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AJC7M7HSWDNG3JA5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AJC7M7HS","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:9a650cc4d932ee8906a1f5383efd6acb1a3dbb5f3818474585e4f5cb373be7c1","target":"graph","created_at":"2026-05-17T23:56:33Z","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 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","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-22T13:57:55Z","title":"Maximum Weight Independent Sets for ($S_{1,2,4}$,Triangle)-Free Graphs in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09472","kind":"arxiv","version":2},"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:c7ceb4b4cab201766ee12611e254056d3eb4c190fa1b263634c35ccdb850d0f0","target":"record","created_at":"2026-05-17T23:56:33Z","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":"b57e045ad2b3fd438e30ee1dd98f1d14270a88df79358c61edeb9f7a8c8e83a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-06-22T13:57:55Z","title_canon_sha256":"234c8701a8de805ae6b16397f1c5b796bafdc2a3ff6a50d9eb4c5cf8af5a45b1"},"schema_version":"1.0","source":{"id":"1806.09472","kind":"arxiv","version":2}},"canonical_sha256":"0245f67cf2b0da6da41dc9afc529f6fd49fb7dea12a87ebc9f0d8d64d6d8e561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0245f67cf2b0da6da41dc9afc529f6fd49fb7dea12a87ebc9f0d8d64d6d8e561","first_computed_at":"2026-05-17T23:56:33.782700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:33.782700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mQpKgZOKFGVZ+eYxkqVTDYpLdul44HWzasQ74s3+jFxRowR+EQ1LtEjSkdEghMKbHd4CR4MDwDA4kJ1NGZPMDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:33.783230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09472","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7ceb4b4cab201766ee12611e254056d3eb4c190fa1b263634c35ccdb850d0f0","sha256:9a650cc4d932ee8906a1f5383efd6acb1a3dbb5f3818474585e4f5cb373be7c1"],"state_sha256":"4c97ac547cf27478c62d382e0561ae5aff15e6a60e4b3a5250eb409b27ed319c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"myJEyc2TakiLESwR0x2h9AvzuPFEGI+SAK8wefuPyCxn3uwXyOZreBaHNuKJJ/K0Q+nRw6/xJ71U5kJjiQDIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:34:15.960401Z","bundle_sha256":"ab4ec72d959242931a74435325e3fe4d68a6ca6fec227043fb41d4a0f2aab5f0"}}