{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ODMXRDYSHNDSMXYRIBKYGUMA2G","short_pith_number":"pith:ODMXRDYS","schema_version":"1.0","canonical_sha256":"70d9788f123b47265f114055835180d1a420b8cee4667a3098c67660a9d1b33e","source":{"kind":"arxiv","id":"1410.8819","version":2},"attestation_state":"computed","paper":{"title":"On Kernelization and Approximation for the Vector Connectivity Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Manuel Sorge, Stefan Kratsch","submitted_at":"2014-10-31T17:19:11Z","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"},"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":"1410.8819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-31T17:19:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"be977d69804b5100e54cedb4b16bef7bac8ec98cafa7c335df7fc024f5a03ae1","abstract_canon_sha256":"408391dad8884641285f205d53ae2dc5c2b16e56dfcc1947c4a6187326c7d3ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:59.586926Z","signature_b64":"lHMqUNfEqcgozAxmaHoMc50grqGgY6DlkVzjAFpT6BPE/uU0WKJYWztXOrI1/vWv3c8i2peCukzcilyZyIGdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70d9788f123b47265f114055835180d1a420b8cee4667a3098c67660a9d1b33e","last_reissued_at":"2026-05-18T01:40:59.586254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:59.586254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Kernelization and Approximation for the Vector Connectivity Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Manuel Sorge, Stefan Kratsch","submitted_at":"2014-10-31T17:19:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8819","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.8819","created_at":"2026-05-18T01:40:59.586368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8819v2","created_at":"2026-05-18T01:40:59.586368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8819","created_at":"2026-05-18T01:40:59.586368+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODMXRDYSHNDS","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODMXRDYSHNDSMXYR","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODMXRDYS","created_at":"2026-05-18T12:28:41.024544+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/ODMXRDYSHNDSMXYRIBKYGUMA2G","json":"https://pith.science/pith/ODMXRDYSHNDSMXYRIBKYGUMA2G.json","graph_json":"https://pith.science/api/pith-number/ODMXRDYSHNDSMXYRIBKYGUMA2G/graph.json","events_json":"https://pith.science/api/pith-number/ODMXRDYSHNDSMXYRIBKYGUMA2G/events.json","paper":"https://pith.science/paper/ODMXRDYS"},"agent_actions":{"view_html":"https://pith.science/pith/ODMXRDYSHNDSMXYRIBKYGUMA2G","download_json":"https://pith.science/pith/ODMXRDYSHNDSMXYRIBKYGUMA2G.json","view_paper":"https://pith.science/paper/ODMXRDYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8819&json=true","fetch_graph":"https://pith.science/api/pith-number/ODMXRDYSHNDSMXYRIBKYGUMA2G/graph.json","fetch_events":"https://pith.science/api/pith-number/ODMXRDYSHNDSMXYRIBKYGUMA2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODMXRDYSHNDSMXYRIBKYGUMA2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODMXRDYSHNDSMXYRIBKYGUMA2G/action/storage_attestation","attest_author":"https://pith.science/pith/ODMXRDYSHNDSMXYRIBKYGUMA2G/action/author_attestation","sign_citation":"https://pith.science/pith/ODMXRDYSHNDSMXYRIBKYGUMA2G/action/citation_signature","submit_replication":"https://pith.science/pith/ODMXRDYSHNDSMXYRIBKYGUMA2G/action/replication_record"}},"created_at":"2026-05-18T01:40:59.586368+00:00","updated_at":"2026-05-18T01:40:59.586368+00:00"}