{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NOU6KFX2O4W7HR7SJAWP6YQEQT","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":"21f764fc35c1715a2bd37669b7b6ecb82891039f183c713664723e12f1f6c5f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-02-02T15:09:18Z","title_canon_sha256":"b963e08eb8a4db84101f1ca1e43af6e99dc88f998f48a7a8530654a001ab8590"},"schema_version":"1.0","source":{"id":"2102.01540","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01540","created_at":"2026-07-05T02:26:55Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01540v2","created_at":"2026-07-05T02:26:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01540","created_at":"2026-07-05T02:26:55Z"},{"alias_kind":"pith_short_12","alias_value":"NOU6KFX2O4W7","created_at":"2026-07-05T02:26:55Z"},{"alias_kind":"pith_short_16","alias_value":"NOU6KFX2O4W7HR7S","created_at":"2026-07-05T02:26:55Z"},{"alias_kind":"pith_short_8","alias_value":"NOU6KFX2","created_at":"2026-07-05T02:26:55Z"}],"graph_snapshots":[{"event_id":"sha256:d54be9865f71c858f625ae79a073fc6f66b9f3efa4a360250ad52db8a02dc823","target":"graph","created_at":"2026-07-05T02:26:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.01540/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding a maximum independent set is a fundamental NP-hard problem that is used in many real-world applications. Given an unweighted graph, this problem asks for a maximum cardinality set of pairwise non-adjacent vertices. Some of the most successful algorithms for this problem are based on the branch-and-bound or branch-and-reduce paradigms. In particular, branch-and-reduce algorithms, which combine branch-and-bound with reduction rules, achieved substantial results, solving many previously infeasible instances. These results were to a large part achieved by developing new, more practical red","authors_text":"Christian Schorr, Demian Hespe, Sebastian Lamm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-02-02T15:09:18Z","title":"Targeted Branching for the Maximum Independent Set Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01540","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:c91f6faa514f2d90cc93f4f749765254830d47da5edfea38a7603534a737790d","target":"record","created_at":"2026-07-05T02:26:55Z","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":"21f764fc35c1715a2bd37669b7b6ecb82891039f183c713664723e12f1f6c5f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-02-02T15:09:18Z","title_canon_sha256":"b963e08eb8a4db84101f1ca1e43af6e99dc88f998f48a7a8530654a001ab8590"},"schema_version":"1.0","source":{"id":"2102.01540","kind":"arxiv","version":2}},"canonical_sha256":"6ba9e516fa772df3c7f2482cff620484e30cacc95ce5d9456e060641f0dc0603","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ba9e516fa772df3c7f2482cff620484e30cacc95ce5d9456e060641f0dc0603","first_computed_at":"2026-07-05T02:26:55.318052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:26:55.318052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wK18tcxHQ5jhO6LcoCjGxfaatAaUDV8Oi2H01clK4TLviJ6v5pkGmQi9FMbQZuX+qXVelPdO2ktXWkFRxZaxCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:26:55.318506Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.01540","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c91f6faa514f2d90cc93f4f749765254830d47da5edfea38a7603534a737790d","sha256:d54be9865f71c858f625ae79a073fc6f66b9f3efa4a360250ad52db8a02dc823"],"state_sha256":"85864e002c0cc29af718fc9c4c63bc81069db772b7be32ab70bab1afc6419d70"}