{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QHNZ7BJUP3FOBAYUPJNHOD44CX","short_pith_number":"pith:QHNZ7BJU","canonical_record":{"source":{"id":"1304.5870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T08:43:19Z","cross_cats_sorted":[],"title_canon_sha256":"e1a167e89c074653f45422b3269e109c83a4038ea69fbb0df9eebbe7d1c85bf8","abstract_canon_sha256":"cb350dd2e1637cc7b54097991967cc88fdf8c75797edbb0a173621922919ad52"},"schema_version":"1.0"},"canonical_sha256":"81db9f85347ecae083147a5a770f9c15d50bfd25bcee9289cdec0139fcc88bcc","source":{"kind":"arxiv","id":"1304.5870","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5870","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5870v2","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5870","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"QHNZ7BJUP3FO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QHNZ7BJUP3FOBAYU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QHNZ7BJU","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QHNZ7BJUP3FOBAYUPJNHOD44CX","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T08:43:19Z","cross_cats_sorted":[],"title_canon_sha256":"e1a167e89c074653f45422b3269e109c83a4038ea69fbb0df9eebbe7d1c85bf8","abstract_canon_sha256":"cb350dd2e1637cc7b54097991967cc88fdf8c75797edbb0a173621922919ad52"},"schema_version":"1.0"},"canonical_sha256":"81db9f85347ecae083147a5a770f9c15d50bfd25bcee9289cdec0139fcc88bcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:10.337792Z","signature_b64":"q8qcIjAOrcNAUrig4/+YT67w5w9zdNL9m4Txie2Y/LNc9IKv+hNQViMsDvQjwgHrhB2jlyRQJClHBs2JfExDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81db9f85347ecae083147a5a770f9c15d50bfd25bcee9289cdec0139fcc88bcc","last_reissued_at":"2026-05-18T03:13:10.336979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:10.336979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5870","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-05-18T03:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qt4EEVlmxWAbfPWYLcScTq8b4NMYmOoQBY5/rP9NaFSOcqiu7ZPw8mrRmu7DZP46RCzOQs3nDv8H32CoeyWsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:11:28.943476Z"},"content_sha256":"2e9b8fcebb5dca85129401c0a0413b0231281e1f5aaa0accad12f2b7ac1743b5","schema_version":"1.0","event_id":"sha256:2e9b8fcebb5dca85129401c0a0413b0231281e1f5aaa0accad12f2b7ac1743b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QHNZ7BJUP3FOBAYUPJNHOD44CX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Petr A. Golovach, Rajesh Chitnis","submitted_at":"2013-04-22T08:43:19Z","abstract_excerpt":"Bhawalkar, Kleinberg, Lewi, Roughgarden, and Sharma [ICALP 2012] introduced the Anchored k-Core problem, where the task is for a given graph G and integers b, k, and p to find an induced subgraph H with at least p vertices (the core) such that all but at most b vertices (called anchors) of H are of degree at least k. In this paper, we extend the notion of k-core to directed graphs and provide a number of new algorithmic and complexity results for the directed version of the problem. We show that\n  - The decision version of the problem is NP-complete for every k>=1 even if the input graph is re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5870","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":""},"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-05-18T03:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6F/wE0AQUc7xj6skkMQhL+qWyj4D36S3CLWiD3Rso8xVJRE1SDVvLOs8iL7qO2ZrET33XE9yhLCXWPEq0/YfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:11:28.944109Z"},"content_sha256":"0e6c84ab9e61b185d676434546f63c039dde4b80d5669a4eb017b04211265081","schema_version":"1.0","event_id":"sha256:0e6c84ab9e61b185d676434546f63c039dde4b80d5669a4eb017b04211265081"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHNZ7BJUP3FOBAYUPJNHOD44CX/bundle.json","state_url":"https://pith.science/pith/QHNZ7BJUP3FOBAYUPJNHOD44CX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHNZ7BJUP3FOBAYUPJNHOD44CX/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-05-25T16:11:28Z","links":{"resolver":"https://pith.science/pith/QHNZ7BJUP3FOBAYUPJNHOD44CX","bundle":"https://pith.science/pith/QHNZ7BJUP3FOBAYUPJNHOD44CX/bundle.json","state":"https://pith.science/pith/QHNZ7BJUP3FOBAYUPJNHOD44CX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHNZ7BJUP3FOBAYUPJNHOD44CX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QHNZ7BJUP3FOBAYUPJNHOD44CX","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":"cb350dd2e1637cc7b54097991967cc88fdf8c75797edbb0a173621922919ad52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T08:43:19Z","title_canon_sha256":"e1a167e89c074653f45422b3269e109c83a4038ea69fbb0df9eebbe7d1c85bf8"},"schema_version":"1.0","source":{"id":"1304.5870","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5870","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5870v2","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5870","created_at":"2026-05-18T03:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"QHNZ7BJUP3FO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QHNZ7BJUP3FOBAYU","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QHNZ7BJU","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:0e6c84ab9e61b185d676434546f63c039dde4b80d5669a4eb017b04211265081","target":"graph","created_at":"2026-05-18T03:13:10Z","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"},"paper":{"abstract_excerpt":"Bhawalkar, Kleinberg, Lewi, Roughgarden, and Sharma [ICALP 2012] introduced the Anchored k-Core problem, where the task is for a given graph G and integers b, k, and p to find an induced subgraph H with at least p vertices (the core) such that all but at most b vertices (called anchors) of H are of degree at least k. In this paper, we extend the notion of k-core to directed graphs and provide a number of new algorithmic and complexity results for the directed version of the problem. We show that\n  - The decision version of the problem is NP-complete for every k>=1 even if the input graph is re","authors_text":"Fedor V. Fomin, Petr A. Golovach, Rajesh Chitnis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T08:43:19Z","title":"Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5870","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:2e9b8fcebb5dca85129401c0a0413b0231281e1f5aaa0accad12f2b7ac1743b5","target":"record","created_at":"2026-05-18T03:13:10Z","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":"cb350dd2e1637cc7b54097991967cc88fdf8c75797edbb0a173621922919ad52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-22T08:43:19Z","title_canon_sha256":"e1a167e89c074653f45422b3269e109c83a4038ea69fbb0df9eebbe7d1c85bf8"},"schema_version":"1.0","source":{"id":"1304.5870","kind":"arxiv","version":2}},"canonical_sha256":"81db9f85347ecae083147a5a770f9c15d50bfd25bcee9289cdec0139fcc88bcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81db9f85347ecae083147a5a770f9c15d50bfd25bcee9289cdec0139fcc88bcc","first_computed_at":"2026-05-18T03:13:10.336979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:10.336979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q8qcIjAOrcNAUrig4/+YT67w5w9zdNL9m4Txie2Y/LNc9IKv+hNQViMsDvQjwgHrhB2jlyRQJClHBs2JfExDCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:10.337792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5870","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e9b8fcebb5dca85129401c0a0413b0231281e1f5aaa0accad12f2b7ac1743b5","sha256:0e6c84ab9e61b185d676434546f63c039dde4b80d5669a4eb017b04211265081"],"state_sha256":"500cd4c7da2e25356e131375f6250f8276ac5f8c3d1b0858e5faf5d3d571963e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xkFYeTFyyn8aFqsaJWDdymU1whFkGbsnE43Qpvjpukn+zyx6SkwoAI0TP6nmGafdqDZhBfJu5MKI7flphZVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:11:28.947777Z","bundle_sha256":"4fd6b1815f33180489f9b592d7c3b16cac5dc75f303f7a30f5f06fc585ab8423"}}