{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JXWYLBTZINSGEGLOB435QJVZXT","short_pith_number":"pith:JXWYLBTZ","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"},"canonical_sha256":"4ded858679436462196e0f37d826b9bceed9475c16eb0707e0ebf16a03d6d7e3","source":{"kind":"arxiv","id":"1210.4728","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4728","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4728v3","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4728","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"JXWYLBTZINSG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JXWYLBTZINSGEGLO","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JXWYLBTZ","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JXWYLBTZINSGEGLOB435QJVZXT","target":"record","payload":{"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"},"canonical_sha256":"4ded858679436462196e0f37d826b9bceed9475c16eb0707e0ebf16a03d6d7e3","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"},"source_kind":"arxiv","source_id":"1210.4728","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-18T02:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"myPUZFyuMzYv78IMophCDq5xpRMOhKCI4xVlqWhhIXiq4DUDo57qZzJjigMWTj1wsHE6asWSGhXcEptGt2J4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:52.730629Z"},"content_sha256":"705c32f760b8865f7b4af5173f27835e555c1939136d98be1f12be91233deefc","schema_version":"1.0","event_id":"sha256:705c32f760b8865f7b4af5173f27835e555c1939136d98be1f12be91233deefc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JXWYLBTZINSGEGLOB435QJVZXT","target":"graph","payload":{"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"},"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-18T02:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jY2MreXv3OReDZeN0Ho2QLJhFaxDGyQYSH8mH6Rz6s8PsQhjWXiVAt+Mpxf6owyhmFu+f/8jMLqmcPgaLB3HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:52.731006Z"},"content_sha256":"09c90f2247bcc5c270ad56757f209b02d016e3361ff18e839ad349b11e4df5b7","schema_version":"1.0","event_id":"sha256:09c90f2247bcc5c270ad56757f209b02d016e3361ff18e839ad349b11e4df5b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT/bundle.json","state_url":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXWYLBTZINSGEGLOB435QJVZXT/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-05-26T06:51:52Z","links":{"resolver":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT","bundle":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT/bundle.json","state":"https://pith.science/pith/JXWYLBTZINSGEGLOB435QJVZXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXWYLBTZINSGEGLOB435QJVZXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JXWYLBTZINSGEGLOB435QJVZXT","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":"e2bdd7348c68d507c89cdb4ef3c0c7dd5b1c804e0a287376f99a6017fd22ca62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T13:08:59Z","title_canon_sha256":"4759c8410148dfd6d06bd4b1c23debd079a540e48eb31822a9ff3654456f606a"},"schema_version":"1.0","source":{"id":"1210.4728","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4728","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4728v3","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4728","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"JXWYLBTZINSG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JXWYLBTZINSGEGLO","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JXWYLBTZ","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:09c90f2247bcc5c270ad56757f209b02d016e3361ff18e839ad349b11e4df5b7","target":"graph","created_at":"2026-05-18T02:38:37Z","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 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 ","authors_text":"Guy Kortsarz, Zeev Nutov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T13:08:59Z","title":"Approximating Source Location and Star Survivable Network Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4728","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:705c32f760b8865f7b4af5173f27835e555c1939136d98be1f12be91233deefc","target":"record","created_at":"2026-05-18T02:38:37Z","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":"e2bdd7348c68d507c89cdb4ef3c0c7dd5b1c804e0a287376f99a6017fd22ca62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T13:08:59Z","title_canon_sha256":"4759c8410148dfd6d06bd4b1c23debd079a540e48eb31822a9ff3654456f606a"},"schema_version":"1.0","source":{"id":"1210.4728","kind":"arxiv","version":3}},"canonical_sha256":"4ded858679436462196e0f37d826b9bceed9475c16eb0707e0ebf16a03d6d7e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ded858679436462196e0f37d826b9bceed9475c16eb0707e0ebf16a03d6d7e3","first_computed_at":"2026-05-18T02:38:37.537011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:37.537011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2nroDmijKk2xhnWrtUG6vG8chlmvsKX2Qc8mMKHPG0oS3qJynfgad0m+UFHuliN2ofiYqQ08Q8GOSQ++1xJ0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:37.537617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4728","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:705c32f760b8865f7b4af5173f27835e555c1939136d98be1f12be91233deefc","sha256:09c90f2247bcc5c270ad56757f209b02d016e3361ff18e839ad349b11e4df5b7"],"state_sha256":"add2d1bdb087c7ee280ac5e486ce8903de30642328b97b6ac7181e1450d1e7b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkHkS+mZkBZd2wTcFL8rAQr/V/cFGuPraMPu2HS7o70lQwRyGUIi/8QYJQnYSmC0K8z9CLtcJJPiBKMHYo0cBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:51:52.733522Z","bundle_sha256":"914c52cbce4d51def123f5d0eb9a0d79fb7b9c3598fff69920d4036b9183775f"}}