{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SUXV3JFZWUAEDPG7UMHPSSMHV2","short_pith_number":"pith:SUXV3JFZ","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"},"canonical_sha256":"952f5da4b9b50041bcdfa30ef94987aea1c28023a59e9d553b2f25c2ece1aa2c","source":{"kind":"arxiv","id":"1312.3779","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3779","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3779v3","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3779","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"SUXV3JFZWUAE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SUXV3JFZWUAEDPG7","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SUXV3JFZ","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SUXV3JFZWUAEDPG7UMHPSSMHV2","target":"record","payload":{"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"},"canonical_sha256":"952f5da4b9b50041bcdfa30ef94987aea1c28023a59e9d553b2f25c2ece1aa2c","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"},"source_kind":"arxiv","source_id":"1312.3779","source_version":3,"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:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zOvk5isTM74AyU+R2DXM13VOuPsuIL+SEpvC0A3n0JeVeATOP9QiZ7dLOSH4sGQspXBm6DKssiKW8bkVgVfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:48:36.161626Z"},"content_sha256":"b8ce3c059cbb06fd727af55e15869be6391cdb0f836f5d155094b0a3fea254a8","schema_version":"1.0","event_id":"sha256:b8ce3c059cbb06fd727af55e15869be6391cdb0f836f5d155094b0a3fea254a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SUXV3JFZWUAEDPG7UMHPSSMHV2","target":"graph","payload":{"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"},"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:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dj0Tk3umouNgAl+3xRD3JuDg/8MPIWoTxD/gTd5p6xk4PxMdPEF7rDci6IHTp/fXvl1dO1m1XZybnLNxuLVsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:48:36.161976Z"},"content_sha256":"61b3f77b1c41d783d86d43c455016ed26ae77bd1cb2cce33866deabd0f84e34a","schema_version":"1.0","event_id":"sha256:61b3f77b1c41d783d86d43c455016ed26ae77bd1cb2cce33866deabd0f84e34a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/bundle.json","state_url":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/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-06-24T22:48:36Z","links":{"resolver":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2","bundle":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/bundle.json","state":"https://pith.science/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUXV3JFZWUAEDPG7UMHPSSMHV2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SUXV3JFZWUAEDPG7UMHPSSMHV2","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":"f147e5e95fbbc851eb5414b966e49ff1be30a68eabae28475db5c33b767fe138","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-13T11:42:19Z","title_canon_sha256":"035e0fd8f87d81be028f88f6d6e48b7487067b0ac572b798e06cf1c81cbb5869"},"schema_version":"1.0","source":{"id":"1312.3779","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3779","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3779v3","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3779","created_at":"2026-05-18T03:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"SUXV3JFZWUAE","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SUXV3JFZWUAEDPG7","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SUXV3JFZ","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:61b3f77b1c41d783d86d43c455016ed26ae77bd1cb2cce33866deabd0f84e34a","target":"graph","created_at":"2026-05-18T03:02:20Z","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":"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","authors_text":"Ashwin Pananjady, N Safina Devi, Sounaka Mishra","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-13T11:42:19Z","title":"On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3779","kind":"arxiv","version":3},"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:b8ce3c059cbb06fd727af55e15869be6391cdb0f836f5d155094b0a3fea254a8","target":"record","created_at":"2026-05-18T03:02:20Z","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":"f147e5e95fbbc851eb5414b966e49ff1be30a68eabae28475db5c33b767fe138","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-13T11:42:19Z","title_canon_sha256":"035e0fd8f87d81be028f88f6d6e48b7487067b0ac572b798e06cf1c81cbb5869"},"schema_version":"1.0","source":{"id":"1312.3779","kind":"arxiv","version":3}},"canonical_sha256":"952f5da4b9b50041bcdfa30ef94987aea1c28023a59e9d553b2f25c2ece1aa2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"952f5da4b9b50041bcdfa30ef94987aea1c28023a59e9d553b2f25c2ece1aa2c","first_computed_at":"2026-05-18T03:02:20.115028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:20.115028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4rkAS/npIZp/32WFoqHOKfhIbpKBdddryf9Fz8ICUBocERkmP2OxVMG7R+Bnz27b4wD3ztlNuDQWt+MWgbOlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:20.115799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3779","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8ce3c059cbb06fd727af55e15869be6391cdb0f836f5d155094b0a3fea254a8","sha256:61b3f77b1c41d783d86d43c455016ed26ae77bd1cb2cce33866deabd0f84e34a"],"state_sha256":"0dccf07d777de4530dfde35c7434cf0b24ff616bfaed14d5471528164ff4e221"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cvdxZD5+BGU1H0J2neV3dO5sksVtbhPaeFQx6idIUur15mYfHRTlKWGq6BfS//ExbTXP37hXfvjbg2VjINPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:48:36.163977Z","bundle_sha256":"9b2ce9cb3717b40f63f2adfc8b1566e1141e4bb99a5be07554903d1be04f4689"}}