{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SUXV3JFZWUAEDPG7UMHPSSMHV2","short_pith_number":"pith:SUXV3JFZ","schema_version":"1.0","canonical_sha256":"952f5da4b9b50041bcdfa30ef94987aea1c28023a59e9d553b2f25c2ece1aa2c","source":{"kind":"arxiv","id":"1312.3779","version":3},"attestation_state":"computed","paper":{"title":"On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Ashwin Pananjady, N Safina Devi, Sounaka Mishra","submitted_at":"2013-12-13T11:42:19Z","abstract_excerpt":"In this paper, we investigate the approximability of two node deletion problems. Given a vertex weighted graph $G=(V,E)$ and a specified, or \"distinguished\" vertex $p \\in V$, MDD(min) is the problem of finding a minimum weight vertex set $S \\subseteq V\\setminus \\{p\\}$ such that $p$ becomes the minimum degree vertex in $G[V \\setminus S]$; and MDD(max) is the problem of finding a minimum weight vertex set $S \\subseteq V\\setminus \\{p\\}$ such that $p$ becomes the maximum degree vertex in $G[V \\setminus S]$. These are known $NP$-complete problems and have been studied from the parameterized complex"},"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":"1312.3779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-13T11:42:19Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"035e0fd8f87d81be028f88f6d6e48b7487067b0ac572b798e06cf1c81cbb5869","abstract_canon_sha256":"f147e5e95fbbc851eb5414b966e49ff1be30a68eabae28475db5c33b767fe138"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:20.115799Z","signature_b64":"4rkAS/npIZp/32WFoqHOKfhIbpKBdddryf9Fz8ICUBocERkmP2OxVMG7R+Bnz27b4wD3ztlNuDQWt+MWgbOlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"952f5da4b9b50041bcdfa30ef94987aea1c28023a59e9d553b2f25c2ece1aa2c","last_reissued_at":"2026-05-18T03:02:20.115028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:20.115028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Ashwin Pananjady, N Safina Devi, Sounaka Mishra","submitted_at":"2013-12-13T11:42:19Z","abstract_excerpt":"In this paper, we investigate the approximability of two node deletion problems. Given a vertex weighted graph $G=(V,E)$ and a specified, or \"distinguished\" vertex $p \\in V$, MDD(min) is the problem of finding a minimum weight vertex set $S \\subseteq V\\setminus \\{p\\}$ such that $p$ becomes the minimum degree vertex in $G[V \\setminus S]$; and MDD(max) is the problem of finding a minimum weight vertex set $S \\subseteq V\\setminus \\{p\\}$ such that $p$ becomes the maximum degree vertex in $G[V \\setminus S]$. These are known $NP$-complete problems and have been studied from the parameterized complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3779","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.3779","created_at":"2026-05-18T03:02:20.115158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3779v3","created_at":"2026-05-18T03:02:20.115158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3779","created_at":"2026-05-18T03:02:20.115158+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUXV3JFZWUAE","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUXV3JFZWUAEDPG7","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUXV3JFZ","created_at":"2026-05-18T12:27:59.945178+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/SUXV3JFZWUAEDPG7UMHPSSMHV2","json":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2.json","graph_json":"https://pith.science/api/pith-number/SUXV3JFZWUAEDPG7UMHPSSMHV2/graph.json","events_json":"https://pith.science/api/pith-number/SUXV3JFZWUAEDPG7UMHPSSMHV2/events.json","paper":"https://pith.science/paper/SUXV3JFZ"},"agent_actions":{"view_html":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2","download_json":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2.json","view_paper":"https://pith.science/paper/SUXV3JFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3779&json=true","fetch_graph":"https://pith.science/api/pith-number/SUXV3JFZWUAEDPG7UMHPSSMHV2/graph.json","fetch_events":"https://pith.science/api/pith-number/SUXV3JFZWUAEDPG7UMHPSSMHV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/action/storage_attestation","attest_author":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/action/author_attestation","sign_citation":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/action/citation_signature","submit_replication":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/action/replication_record"}},"created_at":"2026-05-18T03:02:20.115158+00:00","updated_at":"2026-05-18T03:02:20.115158+00:00"}