{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NOU6KFX2O4W7HR7SJAWP6YQEQT","short_pith_number":"pith:NOU6KFX2","schema_version":"1.0","canonical_sha256":"6ba9e516fa772df3c7f2482cff620484e30cacc95ce5d9456e060641f0dc0603","source":{"kind":"arxiv","id":"2102.01540","version":2},"attestation_state":"computed","paper":{"title":"Targeted Branching 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 Schorr, Demian Hespe, Sebastian Lamm","submitted_at":"2021-02-02T15:09:18Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2102.01540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-02-02T15:09:18Z","cross_cats_sorted":[],"title_canon_sha256":"b963e08eb8a4db84101f1ca1e43af6e99dc88f998f48a7a8530654a001ab8590","abstract_canon_sha256":"21f764fc35c1715a2bd37669b7b6ecb82891039f183c713664723e12f1f6c5f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:55.318506Z","signature_b64":"wK18tcxHQ5jhO6LcoCjGxfaatAaUDV8Oi2H01clK4TLviJ6v5pkGmQi9FMbQZuX+qXVelPdO2ktXWkFRxZaxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ba9e516fa772df3c7f2482cff620484e30cacc95ce5d9456e060641f0dc0603","last_reissued_at":"2026-07-05T02:26:55.318052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:55.318052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Targeted Branching 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 Schorr, Demian Hespe, Sebastian Lamm","submitted_at":"2021-02-02T15:09:18Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01540","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.01540/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2102.01540","created_at":"2026-07-05T02:26:55.318110+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.01540v2","created_at":"2026-07-05T02:26:55.318110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01540","created_at":"2026-07-05T02:26:55.318110+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOU6KFX2O4W7","created_at":"2026-07-05T02:26:55.318110+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOU6KFX2O4W7HR7S","created_at":"2026-07-05T02:26:55.318110+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOU6KFX2","created_at":"2026-07-05T02:26:55.318110+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07952","citing_title":"Reducibility of native weighted graphs on Rydberg Arrays","ref_index":87,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NOU6KFX2O4W7HR7SJAWP6YQEQT","json":"https://pith.science/pith/NOU6KFX2O4W7HR7SJAWP6YQEQT.json","graph_json":"https://pith.science/api/pith-number/NOU6KFX2O4W7HR7SJAWP6YQEQT/graph.json","events_json":"https://pith.science/api/pith-number/NOU6KFX2O4W7HR7SJAWP6YQEQT/events.json","paper":"https://pith.science/paper/NOU6KFX2"},"agent_actions":{"view_html":"https://pith.science/pith/NOU6KFX2O4W7HR7SJAWP6YQEQT","download_json":"https://pith.science/pith/NOU6KFX2O4W7HR7SJAWP6YQEQT.json","view_paper":"https://pith.science/paper/NOU6KFX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.01540&json=true","fetch_graph":"https://pith.science/api/pith-number/NOU6KFX2O4W7HR7SJAWP6YQEQT/graph.json","fetch_events":"https://pith.science/api/pith-number/NOU6KFX2O4W7HR7SJAWP6YQEQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOU6KFX2O4W7HR7SJAWP6YQEQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOU6KFX2O4W7HR7SJAWP6YQEQT/action/storage_attestation","attest_author":"https://pith.science/pith/NOU6KFX2O4W7HR7SJAWP6YQEQT/action/author_attestation","sign_citation":"https://pith.science/pith/NOU6KFX2O4W7HR7SJAWP6YQEQT/action/citation_signature","submit_replication":"https://pith.science/pith/NOU6KFX2O4W7HR7SJAWP6YQEQT/action/replication_record"}},"created_at":"2026-07-05T02:26:55.318110+00:00","updated_at":"2026-07-05T02:26:55.318110+00:00"}