{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JXWYLBTZINSGEGLOB435QJVZXT","short_pith_number":"pith:JXWYLBTZ","schema_version":"1.0","canonical_sha256":"4ded858679436462196e0f37d826b9bceed9475c16eb0707e0ebf16a03d6d7e3","source":{"kind":"arxiv","id":"1210.4728","version":3},"attestation_state":"computed","paper":{"title":"Approximating Source Location and Star Survivable Network Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Zeev Nutov","submitted_at":"2012-10-17T13:08:59Z","abstract_excerpt":"In Source Location (SL) problems the goal is to select a mini-mum cost source set $S \\subseteq V$ such that the connectivity (or flow) $\\psi(S,v)$ from $S$ to any node $v$ is at least the demand $d_v$ of $v$. In many SL problems $\\psi(S,v)=d_v$ if $v \\in S$, namely, the demand of nodes selected to $S$ is completely satisfied. In a node-connectivity variant suggested recently by Fukunaga, every node $v$ gets a \"bonus\" $p_v \\leq d_v$ if it is selected to $S$. Fukunaga showed that for undirected graphs one can achieve ratio $O(k \\ln k)$ for his variant, where $k=\\max_{v \\in V}d_v$ is the maximum "},"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":"1210.4728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T13:08:59Z","cross_cats_sorted":[],"title_canon_sha256":"4759c8410148dfd6d06bd4b1c23debd079a540e48eb31822a9ff3654456f606a","abstract_canon_sha256":"e2bdd7348c68d507c89cdb4ef3c0c7dd5b1c804e0a287376f99a6017fd22ca62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:37.537617Z","signature_b64":"2nroDmijKk2xhnWrtUG6vG8chlmvsKX2Qc8mMKHPG0oS3qJynfgad0m+UFHuliN2ofiYqQ08Q8GOSQ++1xJ0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ded858679436462196e0f37d826b9bceed9475c16eb0707e0ebf16a03d6d7e3","last_reissued_at":"2026-05-18T02:38:37.537011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:37.537011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Source Location and Star Survivable Network Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Zeev Nutov","submitted_at":"2012-10-17T13:08:59Z","abstract_excerpt":"In Source Location (SL) problems the goal is to select a mini-mum cost source set $S \\subseteq V$ such that the connectivity (or flow) $\\psi(S,v)$ from $S$ to any node $v$ is at least the demand $d_v$ of $v$. In many SL problems $\\psi(S,v)=d_v$ if $v \\in S$, namely, the demand of nodes selected to $S$ is completely satisfied. In a node-connectivity variant suggested recently by Fukunaga, every node $v$ gets a \"bonus\" $p_v \\leq d_v$ if it is selected to $S$. Fukunaga showed that for undirected graphs one can achieve ratio $O(k \\ln k)$ for his variant, where $k=\\max_{v \\in V}d_v$ is the maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4728","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":"1210.4728","created_at":"2026-05-18T02:38:37.537098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4728v3","created_at":"2026-05-18T02:38:37.537098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4728","created_at":"2026-05-18T02:38:37.537098+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXWYLBTZINSG","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXWYLBTZINSGEGLO","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXWYLBTZ","created_at":"2026-05-18T12:27:11.947152+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/JXWYLBTZINSGEGLOB435QJVZXT","json":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT.json","graph_json":"https://pith.science/api/pith-number/JXWYLBTZINSGEGLOB435QJVZXT/graph.json","events_json":"https://pith.science/api/pith-number/JXWYLBTZINSGEGLOB435QJVZXT/events.json","paper":"https://pith.science/paper/JXWYLBTZ"},"agent_actions":{"view_html":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT","download_json":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT.json","view_paper":"https://pith.science/paper/JXWYLBTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4728&json=true","fetch_graph":"https://pith.science/api/pith-number/JXWYLBTZINSGEGLOB435QJVZXT/graph.json","fetch_events":"https://pith.science/api/pith-number/JXWYLBTZINSGEGLOB435QJVZXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT/action/storage_attestation","attest_author":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT/action/author_attestation","sign_citation":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT/action/citation_signature","submit_replication":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT/action/replication_record"}},"created_at":"2026-05-18T02:38:37.537098+00:00","updated_at":"2026-05-18T02:38:37.537098+00:00"}