{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MDNVWEBI6ML6Q7QSI5RBY4I6N4","short_pith_number":"pith:MDNVWEBI","canonical_record":{"source":{"id":"1810.10834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T11:22:37Z","cross_cats_sorted":[],"title_canon_sha256":"b3eb296b81ecdd95ccef0fd57fedab608bbce957bd2f59937e14491c25a1b421","abstract_canon_sha256":"979a908de81f8d10fb151eb5fc0552dbc8723f19dc99b81175e99d874f154f40"},"schema_version":"1.0"},"canonical_sha256":"60db5b1028f317e87e1247621c711e6f0ab0c13e60960812d709d201ddc79212","source":{"kind":"arxiv","id":"1810.10834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10834","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10834v1","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10834","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"MDNVWEBI6ML6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MDNVWEBI6ML6Q7QS","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MDNVWEBI","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MDNVWEBI6ML6Q7QSI5RBY4I6N4","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T11:22:37Z","cross_cats_sorted":[],"title_canon_sha256":"b3eb296b81ecdd95ccef0fd57fedab608bbce957bd2f59937e14491c25a1b421","abstract_canon_sha256":"979a908de81f8d10fb151eb5fc0552dbc8723f19dc99b81175e99d874f154f40"},"schema_version":"1.0"},"canonical_sha256":"60db5b1028f317e87e1247621c711e6f0ab0c13e60960812d709d201ddc79212","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:19.050590Z","signature_b64":"/dnFleEOhlC2DdS/Cdm/n58ZHkwJD+UJZC9cZGLb0W4n2NzS3fMsvhsIyG+l/rL2JFn3nW/9+v08vqftcZ4XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60db5b1028f317e87e1247621c711e6f0ab0c13e60960812d709d201ddc79212","last_reissued_at":"2026-05-18T00:02:19.050169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:19.050169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10834","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-18T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2NpFijalppGUlvb/V4FVv9dIcwMHqML4YsV28DzHUfOW++SA0SM+pRpIqXXN+r2dKfFIBJ3fh+BMlJuCULJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:56:57.450724Z"},"content_sha256":"d7a9a16215172209e2eccea312e5259570f5a6eea3663343cee34ac09c4ebd58","schema_version":"1.0","event_id":"sha256:d7a9a16215172209e2eccea312e5259570f5a6eea3663343cee34ac09c4ebd58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MDNVWEBI6ML6Q7QSI5RBY4I6N4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Darren Strash, Huashuo Zhang, Robert Williger, Sebastian Lamm","submitted_at":"2018-10-25T11:22:37Z","abstract_excerpt":"One powerful technique to solve NP-hard optimization problems in practice is branch-and-reduce search---which is branch-and-bound that intermixes branching with reductions to decrease the input size. While this technique is known to be very effective in practice for unweighted problems, very little is known for weighted problems, in part due to a lack of known effective reductions. In this work, we develop a full suite of new reductions for the maximum weight independent set problem and provide extensive experiments to show their effectiveness in practice on real-world graphs of up to millions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10834","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-18T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iLcmDN3wkh0Yv3HdpFiLtQELsUVsrRQDWjGswQAn5eWo1UqcG1r3rxK/QG/g3lJEnWebz/P3YSaVPJ65sLLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:56:57.451072Z"},"content_sha256":"3f3bac9176eea189fdfbbd9a21ad07721edc4dd223d2b4ed66d1798c80f74d37","schema_version":"1.0","event_id":"sha256:3f3bac9176eea189fdfbbd9a21ad07721edc4dd223d2b4ed66d1798c80f74d37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDNVWEBI6ML6Q7QSI5RBY4I6N4/bundle.json","state_url":"https://pith.science/pith/MDNVWEBI6ML6Q7QSI5RBY4I6N4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDNVWEBI6ML6Q7QSI5RBY4I6N4/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-30T20:56:57Z","links":{"resolver":"https://pith.science/pith/MDNVWEBI6ML6Q7QSI5RBY4I6N4","bundle":"https://pith.science/pith/MDNVWEBI6ML6Q7QSI5RBY4I6N4/bundle.json","state":"https://pith.science/pith/MDNVWEBI6ML6Q7QSI5RBY4I6N4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDNVWEBI6ML6Q7QSI5RBY4I6N4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MDNVWEBI6ML6Q7QSI5RBY4I6N4","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":"979a908de81f8d10fb151eb5fc0552dbc8723f19dc99b81175e99d874f154f40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T11:22:37Z","title_canon_sha256":"b3eb296b81ecdd95ccef0fd57fedab608bbce957bd2f59937e14491c25a1b421"},"schema_version":"1.0","source":{"id":"1810.10834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10834","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10834v1","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10834","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"MDNVWEBI6ML6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MDNVWEBI6ML6Q7QS","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MDNVWEBI","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:3f3bac9176eea189fdfbbd9a21ad07721edc4dd223d2b4ed66d1798c80f74d37","target":"graph","created_at":"2026-05-18T00:02:19Z","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":"One powerful technique to solve NP-hard optimization problems in practice is branch-and-reduce search---which is branch-and-bound that intermixes branching with reductions to decrease the input size. While this technique is known to be very effective in practice for unweighted problems, very little is known for weighted problems, in part due to a lack of known effective reductions. In this work, we develop a full suite of new reductions for the maximum weight independent set problem and provide extensive experiments to show their effectiveness in practice on real-world graphs of up to millions","authors_text":"Christian Schulz, Darren Strash, Huashuo Zhang, Robert Williger, Sebastian Lamm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T11:22:37Z","title":"Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10834","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:d7a9a16215172209e2eccea312e5259570f5a6eea3663343cee34ac09c4ebd58","target":"record","created_at":"2026-05-18T00:02:19Z","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":"979a908de81f8d10fb151eb5fc0552dbc8723f19dc99b81175e99d874f154f40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-25T11:22:37Z","title_canon_sha256":"b3eb296b81ecdd95ccef0fd57fedab608bbce957bd2f59937e14491c25a1b421"},"schema_version":"1.0","source":{"id":"1810.10834","kind":"arxiv","version":1}},"canonical_sha256":"60db5b1028f317e87e1247621c711e6f0ab0c13e60960812d709d201ddc79212","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60db5b1028f317e87e1247621c711e6f0ab0c13e60960812d709d201ddc79212","first_computed_at":"2026-05-18T00:02:19.050169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:19.050169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/dnFleEOhlC2DdS/Cdm/n58ZHkwJD+UJZC9cZGLb0W4n2NzS3fMsvhsIyG+l/rL2JFn3nW/9+v08vqftcZ4XBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:19.050590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7a9a16215172209e2eccea312e5259570f5a6eea3663343cee34ac09c4ebd58","sha256:3f3bac9176eea189fdfbbd9a21ad07721edc4dd223d2b4ed66d1798c80f74d37"],"state_sha256":"2fcdad4e48cc749ccd46e64a379b0c2d3c61505ec26d5b69205de30e58309d44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3umXQrZn8dTIuQVbu8klR9meZXLJUuFy7jsHaifHWw/B2wp5VTaBQlnsi7amMFm0U/0eaxWXSQQ1su3bCjsIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:56:57.453067Z","bundle_sha256":"bd605fd69950b46b6d44edd0e53597f476ba7f239165858ee44fd4c87d34d013"}}