{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YZEWMHW5Y3SOPV4NY3OG2ZH62G","short_pith_number":"pith:YZEWMHW5","schema_version":"1.0","canonical_sha256":"c649661eddc6e4e7d78dc6dc6d64fed1ac3f48cd908c70dca38100d18f3769e9","source":{"kind":"arxiv","id":"1509.00764","version":1},"attestation_state":"computed","paper":{"title":"Finding Near-Optimal Independent Sets at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","cs.SI"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Darren Strash, Peter Sanders, Renato F. Werneck, Sebastian Lamm","submitted_at":"2015-09-02T16:04:59Z","abstract_excerpt":"The independent set problem is NP-hard and particularly difficult to solve in large sparse graphs. In this work, we develop an advanced evolutionary algorithm, which incorporates kernelization techniques to compute large independent sets in huge sparse networks. A recent exact algorithm has shown that large networks can be solved exactly by employing a branch-and-reduce technique that recursively kernelizes the graph and performs branching. However, one major drawback of their algorithm is that, for huge graphs, branching still can take exponential time. To avoid this problem, we recursively c"},"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":"1509.00764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-02T16:04:59Z","cross_cats_sorted":["cs.NE","cs.SI"],"title_canon_sha256":"6535de453ef91ea6da43edf73d36d02e4ce9b014f8a3d3a66948261fded82602","abstract_canon_sha256":"28307f590cf224864ab5ae9d4ef8a0c452d8fecea8f65717cac9353f5dce8de9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:06.096884Z","signature_b64":"43UUPGOlJMAykFjqBtRxcWD6TSOqlMJ42vKYVm1R+8c/5BZd0Ip6DEmAvo3jv5Tjj/mhhhlCPV+eAWeDC12KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c649661eddc6e4e7d78dc6dc6d64fed1ac3f48cd908c70dca38100d18f3769e9","last_reissued_at":"2026-05-18T01:34:06.096389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:06.096389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Near-Optimal Independent Sets at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","cs.SI"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Darren Strash, Peter Sanders, Renato F. Werneck, Sebastian Lamm","submitted_at":"2015-09-02T16:04:59Z","abstract_excerpt":"The independent set problem is NP-hard and particularly difficult to solve in large sparse graphs. In this work, we develop an advanced evolutionary algorithm, which incorporates kernelization techniques to compute large independent sets in huge sparse networks. A recent exact algorithm has shown that large networks can be solved exactly by employing a branch-and-reduce technique that recursively kernelizes the graph and performs branching. However, one major drawback of their algorithm is that, for huge graphs, branching still can take exponential time. To avoid this problem, we recursively c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00764","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.00764","created_at":"2026-05-18T01:34:06.096461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00764v1","created_at":"2026-05-18T01:34:06.096461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00764","created_at":"2026-05-18T01:34:06.096461+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZEWMHW5Y3SO","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZEWMHW5Y3SOPV4N","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZEWMHW5","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YZEWMHW5Y3SOPV4NY3OG2ZH62G","json":"https://pith.science/pith/YZEWMHW5Y3SOPV4NY3OG2ZH62G.json","graph_json":"https://pith.science/api/pith-number/YZEWMHW5Y3SOPV4NY3OG2ZH62G/graph.json","events_json":"https://pith.science/api/pith-number/YZEWMHW5Y3SOPV4NY3OG2ZH62G/events.json","paper":"https://pith.science/paper/YZEWMHW5"},"agent_actions":{"view_html":"https://pith.science/pith/YZEWMHW5Y3SOPV4NY3OG2ZH62G","download_json":"https://pith.science/pith/YZEWMHW5Y3SOPV4NY3OG2ZH62G.json","view_paper":"https://pith.science/paper/YZEWMHW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00764&json=true","fetch_graph":"https://pith.science/api/pith-number/YZEWMHW5Y3SOPV4NY3OG2ZH62G/graph.json","fetch_events":"https://pith.science/api/pith-number/YZEWMHW5Y3SOPV4NY3OG2ZH62G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZEWMHW5Y3SOPV4NY3OG2ZH62G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZEWMHW5Y3SOPV4NY3OG2ZH62G/action/storage_attestation","attest_author":"https://pith.science/pith/YZEWMHW5Y3SOPV4NY3OG2ZH62G/action/author_attestation","sign_citation":"https://pith.science/pith/YZEWMHW5Y3SOPV4NY3OG2ZH62G/action/citation_signature","submit_replication":"https://pith.science/pith/YZEWMHW5Y3SOPV4NY3OG2ZH62G/action/replication_record"}},"created_at":"2026-05-18T01:34:06.096461+00:00","updated_at":"2026-05-18T01:34:06.096461+00:00"}