{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2REL74CV57F2ATDOCT5KTTRYP5","short_pith_number":"pith:2REL74CV","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"},"canonical_sha256":"d448bff055efcba04c6e14faa9ce387f7e525919874b72f0857340fd36bbe155","source":{"kind":"arxiv","id":"2211.14833","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.14833","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"2211.14833v2","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14833","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"2REL74CV57F2","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"2REL74CV57F2ATDO","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"2REL74CV","created_at":"2026-07-05T06:06:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2REL74CV57F2ATDOCT5KTTRYP5","target":"record","payload":{"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"},"canonical_sha256":"d448bff055efcba04c6e14faa9ce387f7e525919874b72f0857340fd36bbe155","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"},"source_kind":"arxiv","source_id":"2211.14833","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsxdAR3Wp34bz5gz9iO+KU6wn9lVbEj9YZSAsB2/h1IUMYCKwsOEtclOIE+0UMEFWU4pDC96lLAe6pP0KytcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T00:28:26.659017Z"},"content_sha256":"45966ce4cf61510cfc6bae6bba7e246c571ec56f51682c42ee31ae6b4ae15414","schema_version":"1.0","event_id":"sha256:45966ce4cf61510cfc6bae6bba7e246c571ec56f51682c42ee31ae6b4ae15414"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2REL74CV57F2ATDOCT5KTTRYP5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:06:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BT5uPYKI/xvwtHJ+MpOYSu03eyEfdXqDPy53SrdGj3FGAUZQYEiLN43NOVLQeTzJGCqA6/paHSODFOU6qE7kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T00:28:26.659568Z"},"content_sha256":"77ea2c5411bfbbdff13264b5955150e7daae9bc84ae63647405ac57a0138ee2c","schema_version":"1.0","event_id":"sha256:77ea2c5411bfbbdff13264b5955150e7daae9bc84ae63647405ac57a0138ee2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5/bundle.json","state_url":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2REL74CV57F2ATDOCT5KTTRYP5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T00:28:26Z","links":{"resolver":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5","bundle":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5/bundle.json","state":"https://pith.science/pith/2REL74CV57F2ATDOCT5KTTRYP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2REL74CV57F2ATDOCT5KTTRYP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2REL74CV57F2ATDOCT5KTTRYP5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aa3ccd9f3517f374a58a31c042b8a4e8cf8ff5c9052ef7f06029827c04748b28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-27T14:00:45Z","title_canon_sha256":"629d24518908e06e2faa2fb7bcf54f5e20deab18f326c402b3990af48f52a67b"},"schema_version":"1.0","source":{"id":"2211.14833","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.14833","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"arxiv_version","alias_value":"2211.14833v2","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14833","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"pith_short_12","alias_value":"2REL74CV57F2","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"pith_short_16","alias_value":"2REL74CV57F2ATDO","created_at":"2026-07-05T06:06:06Z"},{"alias_kind":"pith_short_8","alias_value":"2REL74CV","created_at":"2026-07-05T06:06:06Z"}],"graph_snapshots":[{"event_id":"sha256:77ea2c5411bfbbdff13264b5955150e7daae9bc84ae63647405ac57a0138ee2c","target":"graph","created_at":"2026-07-05T06:06:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.14833/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Carmine Sorgente, Claudia Archetti, Domenico Serra, Ivana Ljubic, Martina Cerulli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-27T14:00:45Z","title":"Mathematical Programming Formulations for the Collapsed k-Core Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14833","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:45966ce4cf61510cfc6bae6bba7e246c571ec56f51682c42ee31ae6b4ae15414","target":"record","created_at":"2026-07-05T06:06:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aa3ccd9f3517f374a58a31c042b8a4e8cf8ff5c9052ef7f06029827c04748b28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-27T14:00:45Z","title_canon_sha256":"629d24518908e06e2faa2fb7bcf54f5e20deab18f326c402b3990af48f52a67b"},"schema_version":"1.0","source":{"id":"2211.14833","kind":"arxiv","version":2}},"canonical_sha256":"d448bff055efcba04c6e14faa9ce387f7e525919874b72f0857340fd36bbe155","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d448bff055efcba04c6e14faa9ce387f7e525919874b72f0857340fd36bbe155","first_computed_at":"2026-07-05T06:06:06.899481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:06:06.899481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9+U9toO95poJhsROzXSfHBZmuUJk0Dx4iTa+U5igMxm/i6hUlZRRo6bykeQ+5ou/4j+2c2SQmo+POAmtkETlAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:06:06.899882Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.14833","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45966ce4cf61510cfc6bae6bba7e246c571ec56f51682c42ee31ae6b4ae15414","sha256:77ea2c5411bfbbdff13264b5955150e7daae9bc84ae63647405ac57a0138ee2c"],"state_sha256":"963b99cbca3a4ddd8cbd02a6c87699f05dd0b9586443d9083b3d13e14b6d07f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtjl/4PXCsSXzyCX4gZnjo8li9gU7t9aKGZQ/glu8tp9BJMM8Fb/mBRhTM9eaISyuOaouM0RC71103snu2XfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T00:28:26.663582Z","bundle_sha256":"241ead697e45ee7f671dd5e82dd10d45cfde85a899b6ff6e7b864cc9288a0407"}}