{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ODMXRDYSHNDSMXYRIBKYGUMA2G","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":"408391dad8884641285f205d53ae2dc5c2b16e56dfcc1947c4a6187326c7d3ff","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-31T17:19:11Z","title_canon_sha256":"be977d69804b5100e54cedb4b16bef7bac8ec98cafa7c335df7fc024f5a03ae1"},"schema_version":"1.0","source":{"id":"1410.8819","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8819","created_at":"2026-05-18T01:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8819v2","created_at":"2026-05-18T01:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8819","created_at":"2026-05-18T01:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"ODMXRDYSHNDS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ODMXRDYSHNDSMXYR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ODMXRDYS","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:0c0801c9ff7d2cb3c1997fb7a873aec7dd7bea9004765e1df853ad0070370d9f","target":"graph","created_at":"2026-05-18T01:40:59Z","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 the Vector Connectivity problem we are given an undirected graph $G=(V,E)$, a demand function $\\phi\\colon V\\to\\{0,\\ldots,d\\}$, and an integer $k$. The question is whether there exists a set $S$ of at most $k$ vertices such that every vertex $v\\in V\\setminus S$ has at least $\\phi(v)$ vertex-disjoint paths to $S$; this abstractly captures questions about placing servers or warehouses relative to demands. The problem is \\NP-hard already for instances with $d=4$ (Cicalese et al., arXiv '14), admits a log-factor approximation (Boros et al., Networks '14), and is fixed-parameter tractable in term","authors_text":"Manuel Sorge, Stefan Kratsch","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-31T17:19:11Z","title":"On Kernelization and Approximation for the Vector Connectivity Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8819","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:6c41ede570f27e6ac5b15fd7d46c64b3b481873ccb4eb1d94144e3c74b253942","target":"record","created_at":"2026-05-18T01:40:59Z","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":"408391dad8884641285f205d53ae2dc5c2b16e56dfcc1947c4a6187326c7d3ff","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-31T17:19:11Z","title_canon_sha256":"be977d69804b5100e54cedb4b16bef7bac8ec98cafa7c335df7fc024f5a03ae1"},"schema_version":"1.0","source":{"id":"1410.8819","kind":"arxiv","version":2}},"canonical_sha256":"70d9788f123b47265f114055835180d1a420b8cee4667a3098c67660a9d1b33e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70d9788f123b47265f114055835180d1a420b8cee4667a3098c67660a9d1b33e","first_computed_at":"2026-05-18T01:40:59.586254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:40:59.586254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lHMqUNfEqcgozAxmaHoMc50grqGgY6DlkVzjAFpT6BPE/uU0WKJYWztXOrI1/vWv3c8i2peCukzcilyZyIGdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:40:59.586926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8819","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c41ede570f27e6ac5b15fd7d46c64b3b481873ccb4eb1d94144e3c74b253942","sha256:0c0801c9ff7d2cb3c1997fb7a873aec7dd7bea9004765e1df853ad0070370d9f"],"state_sha256":"3037f4788f15d9fc51e60c1476fe79f8743e3455f5cba386545cc0c651d8a5ea"}