{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RCYGYN6C7TQDBUUFDCOC44RZXQ","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":"d2e3989e373f2fc304fc71f0b9262c90f5d48843b93a7cc866091d12a206a21e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-25T06:05:06Z","title_canon_sha256":"b4886604c55939dd3a90aa22e7eeccc850256846c0a8d7efc5675b04c560c945"},"schema_version":"1.0","source":{"id":"2606.26639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.26639","created_at":"2026-06-26T01:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"2606.26639v1","created_at":"2026-06-26T01:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26639","created_at":"2026-06-26T01:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"RCYGYN6C7TQD","created_at":"2026-06-26T01:15:36Z"},{"alias_kind":"pith_short_16","alias_value":"RCYGYN6C7TQDBUUF","created_at":"2026-06-26T01:15:36Z"},{"alias_kind":"pith_short_8","alias_value":"RCYGYN6C","created_at":"2026-06-26T01:15:36Z"}],"graph_snapshots":[{"event_id":"sha256:dcbc5282bfa1e1f23b89becc8e8e195391e5e57ea0d3f8d9fe712374b40a45eb","target":"graph","created_at":"2026-06-26T01:15:36Z","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/2606.26639/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In network vulnerability analysis, it is crucial to evaluate the robustness of $k$-cores against vertex removals. A $k$-core is often fragile since removing a few vertices can trigger a large reduction in the core size, a phenomenon known as core collapse. In this paper, we study the problem of enumerating all minimal removable sets (MinRSs) of a given $k$-core, where a MinRS is a minimal nonempty set of vertices whose removal results in a smaller $k$-core graph. We consider this problem within a general mathematical framework based on monotone systems. We show that, for a monotone system that","authors_text":"Kan Shota, Kazuya Haraguchi","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-25T06:05:06Z","title":"Fast Enumeration of Minimal Removable Sets in Monotone Systems with Application to Core Collapse Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26639","kind":"arxiv","version":1},"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:07ccc8919fb342b2e1bfe3831c50f4693d706a18fb2c5fdfce0c2adc0ec90177","target":"record","created_at":"2026-06-26T01:15:36Z","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":"d2e3989e373f2fc304fc71f0b9262c90f5d48843b93a7cc866091d12a206a21e","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-25T06:05:06Z","title_canon_sha256":"b4886604c55939dd3a90aa22e7eeccc850256846c0a8d7efc5675b04c560c945"},"schema_version":"1.0","source":{"id":"2606.26639","kind":"arxiv","version":1}},"canonical_sha256":"88b06c37c2fce030d285189c2e7239bc2a24aa261cd52a074cfa4a0a9559f2d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88b06c37c2fce030d285189c2e7239bc2a24aa261cd52a074cfa4a0a9559f2d6","first_computed_at":"2026-06-26T01:15:36.855895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:15:36.855895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1n8yHq/YWizbN2+4ofZQOE1NXYeBzAPfvV8SMBqmeGKI045m1ABoXGUfsidpqC8lUKpjzwlYI4oRAUs3xnv5AQ==","signature_status":"signed_v1","signed_at":"2026-06-26T01:15:36.856305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.26639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07ccc8919fb342b2e1bfe3831c50f4693d706a18fb2c5fdfce0c2adc0ec90177","sha256:dcbc5282bfa1e1f23b89becc8e8e195391e5e57ea0d3f8d9fe712374b40a45eb"],"state_sha256":"55e7929b24f0a193ef8e92075416ae02fb32593618207db19c1c665ae45a2c10"}