{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:D4R25KOMXV3DOALHZFFU3HZ76K","short_pith_number":"pith:D4R25KOM","canonical_record":{"source":{"id":"1209.2512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-09-12T07:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"ae5dcdc90d08c1ceb3a7d0cd1f18805c8a37253ab9fdf5a9f8899192a8855dc7","abstract_canon_sha256":"fe1ed72aacd8d814a339075e7a6cdbc167b89f92815f0aaac5c6dfd6b85cb476"},"schema_version":"1.0"},"canonical_sha256":"1f23aea9ccbd76370167c94b4d9f3ff2aba1f0df799771004341dd88acd94f5e","source":{"kind":"arxiv","id":"1209.2512","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2512","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2512v1","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2512","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"D4R25KOMXV3D","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"D4R25KOMXV3DOALH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"D4R25KOM","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:D4R25KOMXV3DOALHZFFU3HZ76K","target":"record","payload":{"canonical_record":{"source":{"id":"1209.2512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-09-12T07:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"ae5dcdc90d08c1ceb3a7d0cd1f18805c8a37253ab9fdf5a9f8899192a8855dc7","abstract_canon_sha256":"fe1ed72aacd8d814a339075e7a6cdbc167b89f92815f0aaac5c6dfd6b85cb476"},"schema_version":"1.0"},"canonical_sha256":"1f23aea9ccbd76370167c94b4d9f3ff2aba1f0df799771004341dd88acd94f5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:42.933559Z","signature_b64":"QsSn4PhWL/xDxqyAbym1jxTL6D+5hCX7DH+4ASZyDdJF11DoLoUcmTuigj8UukQrDTPqevwq17YHuAyz2N8+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f23aea9ccbd76370167c94b4d9f3ff2aba1f0df799771004341dd88acd94f5e","last_reissued_at":"2026-05-18T03:45:42.932776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:42.932776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.2512","source_version":1,"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-18T03:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pR4zBmt9juBcuS9ZW5jNJfxtl+A8LJmMTQoQyFEcqRuMDesLchSv0fNakhb2bLPrlMlv2N6MQ9NsHWjvuGWUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:14:02.274699Z"},"content_sha256":"3d65dc2ccae855994aa64bcbb1178846485cf982a439d1f0a0c72bc006a2ded0","schema_version":"1.0","event_id":"sha256:3d65dc2ccae855994aa64bcbb1178846485cf982a439d1f0a0c72bc006a2ded0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:D4R25KOMXV3DOALHZFFU3HZ76K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull","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":"2012-09-12T07:39:51Z","abstract_excerpt":"The Maximum Weight Independent Set (MWIS) Problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated and most important problems on graphs, it is well known to be NP-complete and hard to approximate. The complexity of MWIS is open for hole-free graphs (i.e., graphs without induced subgraphs isomorphic to a chordless cycle of length at least five). By applying clique separator decomposition as well as modular decomposition, we obtain polynomial time solutions of MWIS for odd-hole- and dart-free graphs as well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2512","kind":"arxiv","version":1},"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-18T03:45:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDwT6SBLhz6+XfYtBWiIyAaYWqPNl9VbSesBVU5Nys52IcHK6ICNET+Q40n1X9G0yWH+mItD2wETdn04j1ojAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:14:02.275251Z"},"content_sha256":"50884442644b3e612bd98c5853bfcd0c7dfe6244a9867ca3e714a52afebddbc3","schema_version":"1.0","event_id":"sha256:50884442644b3e612bd98c5853bfcd0c7dfe6244a9867ca3e714a52afebddbc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K/bundle.json","state_url":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4R25KOMXV3DOALHZFFU3HZ76K/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-04T17:14:02Z","links":{"resolver":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K","bundle":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K/bundle.json","state":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4R25KOMXV3DOALHZFFU3HZ76K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:D4R25KOMXV3DOALHZFFU3HZ76K","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":"fe1ed72aacd8d814a339075e7a6cdbc167b89f92815f0aaac5c6dfd6b85cb476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-09-12T07:39:51Z","title_canon_sha256":"ae5dcdc90d08c1ceb3a7d0cd1f18805c8a37253ab9fdf5a9f8899192a8855dc7"},"schema_version":"1.0","source":{"id":"1209.2512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2512","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2512v1","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2512","created_at":"2026-05-18T03:45:42Z"},{"alias_kind":"pith_short_12","alias_value":"D4R25KOMXV3D","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"D4R25KOMXV3DOALH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"D4R25KOM","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:50884442644b3e612bd98c5853bfcd0c7dfe6244a9867ca3e714a52afebddbc3","target":"graph","created_at":"2026-05-18T03:45:42Z","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 graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated and most important problems on graphs, it is well known to be NP-complete and hard to approximate. The complexity of MWIS is open for hole-free graphs (i.e., graphs without induced subgraphs isomorphic to a chordless cycle of length at least five). By applying clique separator decomposition as well as modular decomposition, we obtain polynomial time solutions of MWIS for odd-hole- and dart-free graphs as well","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":"2012-09-12T07:39:51Z","title":"Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2512","kind":"arxiv","version":1},"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:3d65dc2ccae855994aa64bcbb1178846485cf982a439d1f0a0c72bc006a2ded0","target":"record","created_at":"2026-05-18T03:45:42Z","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":"fe1ed72aacd8d814a339075e7a6cdbc167b89f92815f0aaac5c6dfd6b85cb476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-09-12T07:39:51Z","title_canon_sha256":"ae5dcdc90d08c1ceb3a7d0cd1f18805c8a37253ab9fdf5a9f8899192a8855dc7"},"schema_version":"1.0","source":{"id":"1209.2512","kind":"arxiv","version":1}},"canonical_sha256":"1f23aea9ccbd76370167c94b4d9f3ff2aba1f0df799771004341dd88acd94f5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f23aea9ccbd76370167c94b4d9f3ff2aba1f0df799771004341dd88acd94f5e","first_computed_at":"2026-05-18T03:45:42.932776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:42.932776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QsSn4PhWL/xDxqyAbym1jxTL6D+5hCX7DH+4ASZyDdJF11DoLoUcmTuigj8UukQrDTPqevwq17YHuAyz2N8+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:42.933559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.2512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d65dc2ccae855994aa64bcbb1178846485cf982a439d1f0a0c72bc006a2ded0","sha256:50884442644b3e612bd98c5853bfcd0c7dfe6244a9867ca3e714a52afebddbc3"],"state_sha256":"823e642dec60d6fcb4d0e02d8fcb9139fef2c2d37d43ca6c35df14dbc822a5ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9kReFD1xGr94NXpF63u1P8h/t2Q0FB3RaAgbqQ4lsMYpx3cKxWGCJg1zbkpGOnVDkFnC82n+Gfa/jTfxFulCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:14:02.278002Z","bundle_sha256":"c6e30a6d11d01cf1f16ac777449fc7f08e758cd65aef39f6bbb12e0c5c8fef14"}}