{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RXFAEL2WOJQLRG5G4QN7LNKA4Z","short_pith_number":"pith:RXFAEL2W","schema_version":"1.0","canonical_sha256":"8dca022f567260b89ba6e41bf5b540e675955fe6d405856ff0beff983af247cf","source":{"kind":"arxiv","id":"1906.12334","version":1},"attestation_state":"computed","paper":{"title":"K-Core Maximization through Edge Additions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Chen Chen, Fan Zhang, Wenjie Zhang, Xuemin Lin, Zhongxin Zhou","submitted_at":"2019-06-27T05:31:38Z","abstract_excerpt":"A popular model to measure the stability of a network is k-core - the maximal induced subgraph in which every vertex has at least k neighbors. Many studies maximize the number of vertices in k-core to improve the stability of a network. In this paper, we study the edge k-core problem: Given a graph G, an integer k and a budget b, add b edges to non-adjacent vertex pairs in G such that the k-core is maximized. We prove the problem is NP-hard and APX-hard. A heuristic algorithm is proposed on general graphs with effective optimization techniques. Comprehensive experiments on 9 real-life datasets"},"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":"1906.12334","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-06-27T05:31:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"853120e0979864e595d367e38704569b4bba88eae18f24b185c2cab0ed2f88cb","abstract_canon_sha256":"cf84d5f6d97c9e8ce5273fa7d607bc7efab06158859f098312fb2c1fd4e95f96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:58.563761Z","signature_b64":"p89lS+Xb8jA4Q9pA3NGZGpxOPNFaoaf7zeiCBq/9kwz5CZH6weWS+FN7BEoMJ8ncfKr11zzY7NavEpqfDTLKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dca022f567260b89ba6e41bf5b540e675955fe6d405856ff0beff983af247cf","last_reissued_at":"2026-05-17T23:41:58.563196Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:58.563196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K-Core Maximization through Edge Additions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Chen Chen, Fan Zhang, Wenjie Zhang, Xuemin Lin, Zhongxin Zhou","submitted_at":"2019-06-27T05:31:38Z","abstract_excerpt":"A popular model to measure the stability of a network is k-core - the maximal induced subgraph in which every vertex has at least k neighbors. Many studies maximize the number of vertices in k-core to improve the stability of a network. In this paper, we study the edge k-core problem: Given a graph G, an integer k and a budget b, add b edges to non-adjacent vertex pairs in G such that the k-core is maximized. We prove the problem is NP-hard and APX-hard. A heuristic algorithm is proposed on general graphs with effective optimization techniques. Comprehensive experiments on 9 real-life datasets"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.12334","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":"1906.12334","created_at":"2026-05-17T23:41:58.563275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.12334v1","created_at":"2026-05-17T23:41:58.563275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.12334","created_at":"2026-05-17T23:41:58.563275+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXFAEL2WOJQL","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXFAEL2WOJQLRG5G","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXFAEL2W","created_at":"2026-05-18T12:33:27.125529+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/RXFAEL2WOJQLRG5G4QN7LNKA4Z","json":"https://pith.science/pith/RXFAEL2WOJQLRG5G4QN7LNKA4Z.json","graph_json":"https://pith.science/api/pith-number/RXFAEL2WOJQLRG5G4QN7LNKA4Z/graph.json","events_json":"https://pith.science/api/pith-number/RXFAEL2WOJQLRG5G4QN7LNKA4Z/events.json","paper":"https://pith.science/paper/RXFAEL2W"},"agent_actions":{"view_html":"https://pith.science/pith/RXFAEL2WOJQLRG5G4QN7LNKA4Z","download_json":"https://pith.science/pith/RXFAEL2WOJQLRG5G4QN7LNKA4Z.json","view_paper":"https://pith.science/paper/RXFAEL2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.12334&json=true","fetch_graph":"https://pith.science/api/pith-number/RXFAEL2WOJQLRG5G4QN7LNKA4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/RXFAEL2WOJQLRG5G4QN7LNKA4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXFAEL2WOJQLRG5G4QN7LNKA4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXFAEL2WOJQLRG5G4QN7LNKA4Z/action/storage_attestation","attest_author":"https://pith.science/pith/RXFAEL2WOJQLRG5G4QN7LNKA4Z/action/author_attestation","sign_citation":"https://pith.science/pith/RXFAEL2WOJQLRG5G4QN7LNKA4Z/action/citation_signature","submit_replication":"https://pith.science/pith/RXFAEL2WOJQLRG5G4QN7LNKA4Z/action/replication_record"}},"created_at":"2026-05-17T23:41:58.563275+00:00","updated_at":"2026-05-17T23:41:58.563275+00:00"}