{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2REL74CV57F2ATDOCT5KTTRYP5","short_pith_number":"pith:2REL74CV","schema_version":"1.0","canonical_sha256":"d448bff055efcba04c6e14faa9ce387f7e525919874b72f0857340fd36bbe155","source":{"kind":"arxiv","id":"2211.14833","version":2},"attestation_state":"computed","paper":{"title":"Mathematical Programming Formulations for the Collapsed k-Core Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carmine Sorgente, Claudia Archetti, Domenico Serra, Ivana Ljubic, Martina Cerulli","submitted_at":"2022-11-27T14:00:45Z","abstract_excerpt":"In social network analysis, the size of the k-core, i.e., the maximal induced subgraph of the network with minimum degree at least k, is frequently adopted as a typical metric to evaluate the cohesiveness of a community. We address the Collapsed k-Core Problem, which seeks to find a subset of $b$ users, namely the most critical users of the network, the removal of which results in the smallest possible k-core. For the first time, both the problem of finding the k-core of a network and the Collapsed k-Core Problem are formulated using mathematical programming. On the one hand, we model the Coll"},"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":"2211.14833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-27T14:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"629d24518908e06e2faa2fb7bcf54f5e20deab18f326c402b3990af48f52a67b","abstract_canon_sha256":"aa3ccd9f3517f374a58a31c042b8a4e8cf8ff5c9052ef7f06029827c04748b28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:06.899882Z","signature_b64":"9+U9toO95poJhsROzXSfHBZmuUJk0Dx4iTa+U5igMxm/i6hUlZRRo6bykeQ+5ou/4j+2c2SQmo+POAmtkETlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d448bff055efcba04c6e14faa9ce387f7e525919874b72f0857340fd36bbe155","last_reissued_at":"2026-07-05T06:06:06.899481Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:06.899481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mathematical Programming Formulations for the Collapsed k-Core Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carmine Sorgente, Claudia Archetti, Domenico Serra, Ivana Ljubic, Martina Cerulli","submitted_at":"2022-11-27T14:00:45Z","abstract_excerpt":"In social network analysis, the size of the k-core, i.e., the maximal induced subgraph of the network with minimum degree at least k, is frequently adopted as a typical metric to evaluate the cohesiveness of a community. We address the Collapsed k-Core Problem, which seeks to find a subset of $b$ users, namely the most critical users of the network, the removal of which results in the smallest possible k-core. For the first time, both the problem of finding the k-core of a network and the Collapsed k-Core Problem are formulated using mathematical programming. On the one hand, we model the Coll"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14833","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/2211.14833/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":"2211.14833","created_at":"2026-07-05T06:06:06.899538+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.14833v2","created_at":"2026-07-05T06:06:06.899538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14833","created_at":"2026-07-05T06:06:06.899538+00:00"},{"alias_kind":"pith_short_12","alias_value":"2REL74CV57F2","created_at":"2026-07-05T06:06:06.899538+00:00"},{"alias_kind":"pith_short_16","alias_value":"2REL74CV57F2ATDO","created_at":"2026-07-05T06:06:06.899538+00:00"},{"alias_kind":"pith_short_8","alias_value":"2REL74CV","created_at":"2026-07-05T06:06:06.899538+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/2REL74CV57F2ATDOCT5KTTRYP5","json":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5.json","graph_json":"https://pith.science/api/pith-number/2REL74CV57F2ATDOCT5KTTRYP5/graph.json","events_json":"https://pith.science/api/pith-number/2REL74CV57F2ATDOCT5KTTRYP5/events.json","paper":"https://pith.science/paper/2REL74CV"},"agent_actions":{"view_html":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5","download_json":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5.json","view_paper":"https://pith.science/paper/2REL74CV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.14833&json=true","fetch_graph":"https://pith.science/api/pith-number/2REL74CV57F2ATDOCT5KTTRYP5/graph.json","fetch_events":"https://pith.science/api/pith-number/2REL74CV57F2ATDOCT5KTTRYP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5/action/storage_attestation","attest_author":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5/action/author_attestation","sign_citation":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5/action/citation_signature","submit_replication":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5/action/replication_record"}},"created_at":"2026-07-05T06:06:06.899538+00:00","updated_at":"2026-07-05T06:06:06.899538+00:00"}