{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BCR3N2EE6ICSDDH6ZJZFMJ7JTV","short_pith_number":"pith:BCR3N2EE","canonical_record":{"source":{"id":"1602.01659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T12:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"0ed4080bfc1621e2db7e6fc03ab7171a9f0b018de5142310fad6fde5363f476d","abstract_canon_sha256":"e292a00a8c7689ab491836fed7c6aad38598b19c0c44f3ba04e27983bf9e7a4e"},"schema_version":"1.0"},"canonical_sha256":"08a3b6e884f205218cfeca725627e99d5504d37c9040579d12018a4d8a55408b","source":{"kind":"arxiv","id":"1602.01659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01659","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01659v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01659","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"BCR3N2EE6ICS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BCR3N2EE6ICSDDH6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BCR3N2EE","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BCR3N2EE6ICSDDH6ZJZFMJ7JTV","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T12:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"0ed4080bfc1621e2db7e6fc03ab7171a9f0b018de5142310fad6fde5363f476d","abstract_canon_sha256":"e292a00a8c7689ab491836fed7c6aad38598b19c0c44f3ba04e27983bf9e7a4e"},"schema_version":"1.0"},"canonical_sha256":"08a3b6e884f205218cfeca725627e99d5504d37c9040579d12018a4d8a55408b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.436104Z","signature_b64":"Facpl4RtgrA2Mkv+CWVmbvU3LvToi3O86PMKu9xarLfVkqDZjUbwGHAD6q0FXFNvRFrQlyFdQ3ghPX+yXPcTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08a3b6e884f205218cfeca725627e99d5504d37c9040579d12018a4d8a55408b","last_reissued_at":"2026-05-18T01:21:18.435471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.435471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01659","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYclho/sEaxwdTvbQ9cEAUBZ4pbhqwB13mB9qtaViUeq2lOyXRPTiYO7rkNfDoCpej2j1O7+wZrfftzJyXA7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:23:33.826703Z"},"content_sha256":"a2eb52e3dbc05112c7a9a7f9de973387e8397b38ed34786f9a68a503096a731a","schema_version":"1.0","event_id":"sha256:a2eb52e3dbc05112c7a9a7f9de973387e8397b38ed34786f9a68a503096a731a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BCR3N2EE6ICSDDH6ZJZFMJ7JTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Local Search for the Maximum Independent Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Darren Strash, Jakob Dahlum, Peter Sanders, Renato F. Werneck, Sebastian Lamm","submitted_at":"2016-02-04T12:42:59Z","abstract_excerpt":"Computing high-quality independent sets quickly is an important problem in combinatorial optimization. Several recent algorithms have shown that kernelization techniques can be used to find exact maximum independent sets in medium-sized sparse graphs, as well as high-quality independent sets in huge sparse graphs that are intractable for exact (exponential-time) algorithms. However, a major drawback of these algorithms is that they require significant preprocessing overhead, and therefore cannot be used to find a high-quality independent set quickly.\n  In this paper, we show that performing si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01659","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tsYsw0JMKPeSha7x5B758nDmAvTIPqZZMz9l7rfkQFP1lZeYp1CGK25YrraOP+FBv/6mMbYODOnrE+Txg8ODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:23:33.827355Z"},"content_sha256":"e38e08f0d6363707b2d189936620549ceecd5512df194337f7c346565d17e040","schema_version":"1.0","event_id":"sha256:e38e08f0d6363707b2d189936620549ceecd5512df194337f7c346565d17e040"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCR3N2EE6ICSDDH6ZJZFMJ7JTV/bundle.json","state_url":"https://pith.science/pith/BCR3N2EE6ICSDDH6ZJZFMJ7JTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCR3N2EE6ICSDDH6ZJZFMJ7JTV/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-31T04:23:33Z","links":{"resolver":"https://pith.science/pith/BCR3N2EE6ICSDDH6ZJZFMJ7JTV","bundle":"https://pith.science/pith/BCR3N2EE6ICSDDH6ZJZFMJ7JTV/bundle.json","state":"https://pith.science/pith/BCR3N2EE6ICSDDH6ZJZFMJ7JTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCR3N2EE6ICSDDH6ZJZFMJ7JTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BCR3N2EE6ICSDDH6ZJZFMJ7JTV","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":"e292a00a8c7689ab491836fed7c6aad38598b19c0c44f3ba04e27983bf9e7a4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T12:42:59Z","title_canon_sha256":"0ed4080bfc1621e2db7e6fc03ab7171a9f0b018de5142310fad6fde5363f476d"},"schema_version":"1.0","source":{"id":"1602.01659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01659","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01659v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01659","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"BCR3N2EE6ICS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BCR3N2EE6ICSDDH6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BCR3N2EE","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:e38e08f0d6363707b2d189936620549ceecd5512df194337f7c346565d17e040","target":"graph","created_at":"2026-05-18T01:21:18Z","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":"Computing high-quality independent sets quickly is an important problem in combinatorial optimization. Several recent algorithms have shown that kernelization techniques can be used to find exact maximum independent sets in medium-sized sparse graphs, as well as high-quality independent sets in huge sparse graphs that are intractable for exact (exponential-time) algorithms. However, a major drawback of these algorithms is that they require significant preprocessing overhead, and therefore cannot be used to find a high-quality independent set quickly.\n  In this paper, we show that performing si","authors_text":"Christian Schulz, Darren Strash, Jakob Dahlum, Peter Sanders, Renato F. Werneck, Sebastian Lamm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T12:42:59Z","title":"Accelerating Local Search for the Maximum Independent Set Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01659","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:a2eb52e3dbc05112c7a9a7f9de973387e8397b38ed34786f9a68a503096a731a","target":"record","created_at":"2026-05-18T01:21:18Z","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":"e292a00a8c7689ab491836fed7c6aad38598b19c0c44f3ba04e27983bf9e7a4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-04T12:42:59Z","title_canon_sha256":"0ed4080bfc1621e2db7e6fc03ab7171a9f0b018de5142310fad6fde5363f476d"},"schema_version":"1.0","source":{"id":"1602.01659","kind":"arxiv","version":1}},"canonical_sha256":"08a3b6e884f205218cfeca725627e99d5504d37c9040579d12018a4d8a55408b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08a3b6e884f205218cfeca725627e99d5504d37c9040579d12018a4d8a55408b","first_computed_at":"2026-05-18T01:21:18.435471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.435471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Facpl4RtgrA2Mkv+CWVmbvU3LvToi3O86PMKu9xarLfVkqDZjUbwGHAD6q0FXFNvRFrQlyFdQ3ghPX+yXPcTDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.436104Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2eb52e3dbc05112c7a9a7f9de973387e8397b38ed34786f9a68a503096a731a","sha256:e38e08f0d6363707b2d189936620549ceecd5512df194337f7c346565d17e040"],"state_sha256":"306f33548d2eb873cb3e449a14832482fd1822d4b5bc46d2c55334c9b3bb80b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyGyr+MzTswoRSdLwYBYffJW5e9z7CClWw8gEvSpWmzbaT3nOA+5J7IkCWPnvGbDR9EQACmXlc32dgctIK/cAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:23:33.830535Z","bundle_sha256":"9ca56c0a11cafe2e8966e644f4793662f2815bf8e0fd48f5e713fb3ecb46ef7f"}}