{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:534LIQHOMWJNQTBA24HIXWJ7DG","short_pith_number":"pith:534LIQHO","canonical_record":{"source":{"id":"1009.2452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-13T17:04:34Z","cross_cats_sorted":[],"title_canon_sha256":"22704da1be5de4c2f14bd10b274504d712a36d5e55724134ff5d1dcf34625527","abstract_canon_sha256":"0d1fe218c12f787688bb5f47d9bdea1d6793f27b107aa0d8da209c3ecb034da4"},"schema_version":"1.0"},"canonical_sha256":"eef8b440ee6592d84c20d70e8bd93f199a572b2b8b1f425f6025777f94fb55f5","source":{"kind":"arxiv","id":"1009.2452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2452","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2452v1","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2452","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"534LIQHOMWJN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"534LIQHOMWJNQTBA","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"534LIQHO","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:534LIQHOMWJNQTBA24HIXWJ7DG","target":"record","payload":{"canonical_record":{"source":{"id":"1009.2452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-13T17:04:34Z","cross_cats_sorted":[],"title_canon_sha256":"22704da1be5de4c2f14bd10b274504d712a36d5e55724134ff5d1dcf34625527","abstract_canon_sha256":"0d1fe218c12f787688bb5f47d9bdea1d6793f27b107aa0d8da209c3ecb034da4"},"schema_version":"1.0"},"canonical_sha256":"eef8b440ee6592d84c20d70e8bd93f199a572b2b8b1f425f6025777f94fb55f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:04.209088Z","signature_b64":"fBAWTrHveq3RXZspco3XtkCIuJPIsZfyNh+p9s9xigrOwUBRc0dP+s4A7n9Sd3Vc29fWXx77p/1X4r/QiKCjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eef8b440ee6592d84c20d70e8bd93f199a572b2b8b1f425f6025777f94fb55f5","last_reissued_at":"2026-05-18T04:41:04.208653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:04.208653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.2452","source_version":1,"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-18T04:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ve8yCTlI2GrUWWdf6PHv0NW0r86FPYFEnwquDxyYANxIPf3HqdS6sNif1ayg+Dpl0RDaUsVwR9s6je9ZVDUnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:54:19.985339Z"},"content_sha256":"4dc73b4d6aa2a19ed58783dc916ee9d0e031add4b04eae964cac62713e7b0a0a","schema_version":"1.0","event_id":"sha256:4dc73b4d6aa2a19ed58783dc916ee9d0e031add4b04eae964cac62713e7b0a0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:534LIQHOMWJNQTBA24HIXWJ7DG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","submitted_at":"2010-09-13T17:04:34Z","abstract_excerpt":"We introduce a problem that is a common generalization of the uncapacitated facility location and minimum latency (ML) problems, where facilities need to be opened to serve clients and also need to be sequentially activated before they can provide service. Formally, we are given a set \\F of n facilities with facility-opening costs {f_i}, a set of m clients, and connection costs {c_{ij}} specifying the cost of assigning a client j to a facility i, a root node r denoting the depot, and a time metric d on \\F\\cup{r}. Our goal is to open a subset F of facilities, find a path P starting at r and spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2452","kind":"arxiv","version":1},"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-18T04:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPyminx/7NWqYdfhSRKZ1UB4L4tkM1v0K2HwMXx+ZCz0YzyNSvL1kBIUdbuiL/j5gNVp7Af6Ox7LTGLZYfzvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:54:19.985680Z"},"content_sha256":"bf954d50851749a2bdb12e9a0298957a0495132c90aca049e08b7f406a3619e3","schema_version":"1.0","event_id":"sha256:bf954d50851749a2bdb12e9a0298957a0495132c90aca049e08b7f406a3619e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/534LIQHOMWJNQTBA24HIXWJ7DG/bundle.json","state_url":"https://pith.science/pith/534LIQHOMWJNQTBA24HIXWJ7DG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/534LIQHOMWJNQTBA24HIXWJ7DG/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-01T19:54:19Z","links":{"resolver":"https://pith.science/pith/534LIQHOMWJNQTBA24HIXWJ7DG","bundle":"https://pith.science/pith/534LIQHOMWJNQTBA24HIXWJ7DG/bundle.json","state":"https://pith.science/pith/534LIQHOMWJNQTBA24HIXWJ7DG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/534LIQHOMWJNQTBA24HIXWJ7DG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:534LIQHOMWJNQTBA24HIXWJ7DG","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":"0d1fe218c12f787688bb5f47d9bdea1d6793f27b107aa0d8da209c3ecb034da4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-13T17:04:34Z","title_canon_sha256":"22704da1be5de4c2f14bd10b274504d712a36d5e55724134ff5d1dcf34625527"},"schema_version":"1.0","source":{"id":"1009.2452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2452","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2452v1","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2452","created_at":"2026-05-18T04:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"534LIQHOMWJN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"534LIQHOMWJNQTBA","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"534LIQHO","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:bf954d50851749a2bdb12e9a0298957a0495132c90aca049e08b7f406a3619e3","target":"graph","created_at":"2026-05-18T04:41:04Z","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":"We introduce a problem that is a common generalization of the uncapacitated facility location and minimum latency (ML) problems, where facilities need to be opened to serve clients and also need to be sequentially activated before they can provide service. Formally, we are given a set \\F of n facilities with facility-opening costs {f_i}, a set of m clients, and connection costs {c_{ij}} specifying the cost of assigning a client j to a facility i, a root node r denoting the depot, and a time metric d on \\F\\cup{r}. Our goal is to open a subset F of facilities, find a path P starting at r and spa","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-13T17:04:34Z","title":"Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2452","kind":"arxiv","version":1},"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:4dc73b4d6aa2a19ed58783dc916ee9d0e031add4b04eae964cac62713e7b0a0a","target":"record","created_at":"2026-05-18T04:41:04Z","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":"0d1fe218c12f787688bb5f47d9bdea1d6793f27b107aa0d8da209c3ecb034da4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-13T17:04:34Z","title_canon_sha256":"22704da1be5de4c2f14bd10b274504d712a36d5e55724134ff5d1dcf34625527"},"schema_version":"1.0","source":{"id":"1009.2452","kind":"arxiv","version":1}},"canonical_sha256":"eef8b440ee6592d84c20d70e8bd93f199a572b2b8b1f425f6025777f94fb55f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eef8b440ee6592d84c20d70e8bd93f199a572b2b8b1f425f6025777f94fb55f5","first_computed_at":"2026-05-18T04:41:04.208653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:04.208653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fBAWTrHveq3RXZspco3XtkCIuJPIsZfyNh+p9s9xigrOwUBRc0dP+s4A7n9Sd3Vc29fWXx77p/1X4r/QiKCjAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:04.209088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dc73b4d6aa2a19ed58783dc916ee9d0e031add4b04eae964cac62713e7b0a0a","sha256:bf954d50851749a2bdb12e9a0298957a0495132c90aca049e08b7f406a3619e3"],"state_sha256":"b9be174a5dff3a907c622d25dc154c7255831d597338dd801ec0e858160846e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BSC586T+FAo+4ipGwrifkbW754TWsKUsuoDVuinAXHOSfgZ3pdEq5azrvOkIB6+S3YUHAPr3i7nxZEMqjyqyDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:54:19.987586Z","bundle_sha256":"88a04771d529501b66a88bf5752a33e1ce7ebfa4f7a730e5da3fde4fdae0355d"}}