{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TI7YMZ2ATIVXDN6X5K56UNHZRL","short_pith_number":"pith:TI7YMZ2A","schema_version":"1.0","canonical_sha256":"9a3f8667409a2b71b7d7eabbea34f98ad2fc71e2ec3826e08f54026d12459a0d","source":{"kind":"arxiv","id":"1901.02166","version":2},"attestation_state":"computed","paper":{"title":"K-Core Minimization: A Game Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Ambuj Singh, Arlei Silva, Sourav Medya, Tiyani Ma","submitted_at":"2019-01-08T05:33:56Z","abstract_excerpt":"K-cores are maximal induced subgraphs where all vertices have degree at least k. These dense patterns have applications in community detection, network visualization and protein function prediction. However, k-cores can be quite unstable to network modifications, which motivates the question: How resilient is the k-core structure of a network, such as the Web or Facebook, to edge deletions? We investigate this question from an algorithmic perspective. More specifically, we study the problem of computing a small set of edges for which the removal minimizes the $k$-core structure of a network. T"},"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":"1901.02166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-01-08T05:33:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"144059752b6271bf7b1eb8dcb9fcc127a078f5a99bc0074fcbdf31d281b28ce4","abstract_canon_sha256":"08e8ff0f60b4f283e6878a29496eda6a14c13da846dbd3f81e0a78469bd3deab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:23.128775Z","signature_b64":"H6cFoTukMc4aUXgBQpy3kAyjOe+iqcS9QmTaGQU7gOJYdPJqgYAueakLcEBFcec4e0qrIyPOhcWP19cmK+DJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a3f8667409a2b71b7d7eabbea34f98ad2fc71e2ec3826e08f54026d12459a0d","last_reissued_at":"2026-07-05T00:56:23.128358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:23.128358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K-Core Minimization: A Game Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Ambuj Singh, Arlei Silva, Sourav Medya, Tiyani Ma","submitted_at":"2019-01-08T05:33:56Z","abstract_excerpt":"K-cores are maximal induced subgraphs where all vertices have degree at least k. These dense patterns have applications in community detection, network visualization and protein function prediction. However, k-cores can be quite unstable to network modifications, which motivates the question: How resilient is the k-core structure of a network, such as the Web or Facebook, to edge deletions? We investigate this question from an algorithmic perspective. More specifically, we study the problem of computing a small set of edges for which the removal minimizes the $k$-core structure of a network. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02166","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/1901.02166/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":"1901.02166","created_at":"2026-07-05T00:56:23.128417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02166v2","created_at":"2026-07-05T00:56:23.128417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02166","created_at":"2026-07-05T00:56:23.128417+00:00"},{"alias_kind":"pith_short_12","alias_value":"TI7YMZ2ATIVX","created_at":"2026-07-05T00:56:23.128417+00:00"},{"alias_kind":"pith_short_16","alias_value":"TI7YMZ2ATIVXDN6X","created_at":"2026-07-05T00:56:23.128417+00:00"},{"alias_kind":"pith_short_8","alias_value":"TI7YMZ2A","created_at":"2026-07-05T00:56:23.128417+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1906.12334","citing_title":"K-Core Maximization through Edge Additions","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TI7YMZ2ATIVXDN6X5K56UNHZRL","json":"https://pith.science/pith/TI7YMZ2ATIVXDN6X5K56UNHZRL.json","graph_json":"https://pith.science/api/pith-number/TI7YMZ2ATIVXDN6X5K56UNHZRL/graph.json","events_json":"https://pith.science/api/pith-number/TI7YMZ2ATIVXDN6X5K56UNHZRL/events.json","paper":"https://pith.science/paper/TI7YMZ2A"},"agent_actions":{"view_html":"https://pith.science/pith/TI7YMZ2ATIVXDN6X5K56UNHZRL","download_json":"https://pith.science/pith/TI7YMZ2ATIVXDN6X5K56UNHZRL.json","view_paper":"https://pith.science/paper/TI7YMZ2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02166&json=true","fetch_graph":"https://pith.science/api/pith-number/TI7YMZ2ATIVXDN6X5K56UNHZRL/graph.json","fetch_events":"https://pith.science/api/pith-number/TI7YMZ2ATIVXDN6X5K56UNHZRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TI7YMZ2ATIVXDN6X5K56UNHZRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TI7YMZ2ATIVXDN6X5K56UNHZRL/action/storage_attestation","attest_author":"https://pith.science/pith/TI7YMZ2ATIVXDN6X5K56UNHZRL/action/author_attestation","sign_citation":"https://pith.science/pith/TI7YMZ2ATIVXDN6X5K56UNHZRL/action/citation_signature","submit_replication":"https://pith.science/pith/TI7YMZ2ATIVXDN6X5K56UNHZRL/action/replication_record"}},"created_at":"2026-07-05T00:56:23.128417+00:00","updated_at":"2026-07-05T00:56:23.128417+00:00"}