{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:E6AD4QXM3SAHSEF3JFZDECLC6I","short_pith_number":"pith:E6AD4QXM","canonical_record":{"source":{"id":"1311.6615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-26T10:49:36Z","cross_cats_sorted":[],"title_canon_sha256":"d8fbf158228e8c3122797f72b82b20b2dbb2f3ea27ac6224fbf48f18a94b9573","abstract_canon_sha256":"269d0603cad7251136c8b4bda5d9a34c47ca8902a80f3921357aed3bf54fe0dc"},"schema_version":"1.0"},"canonical_sha256":"27803e42ecdc807910bb4972320962f206e8e909f8d516f3ddbb5cabcad77d56","source":{"kind":"arxiv","id":"1311.6615","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6615","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6615v2","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6615","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"pith_short_12","alias_value":"E6AD4QXM3SAH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E6AD4QXM3SAHSEF3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E6AD4QXM","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:E6AD4QXM3SAHSEF3JFZDECLC6I","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-26T10:49:36Z","cross_cats_sorted":[],"title_canon_sha256":"d8fbf158228e8c3122797f72b82b20b2dbb2f3ea27ac6224fbf48f18a94b9573","abstract_canon_sha256":"269d0603cad7251136c8b4bda5d9a34c47ca8902a80f3921357aed3bf54fe0dc"},"schema_version":"1.0"},"canonical_sha256":"27803e42ecdc807910bb4972320962f206e8e909f8d516f3ddbb5cabcad77d56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:20.461020Z","signature_b64":"98h/QATQLe1JrpC0OFl9guhCzQ8ctzUfwwmGLYPkU+E3jk4JAxa1f9jxh+AmPREUduDLjDQIPLdlhg6g35fuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27803e42ecdc807910bb4972320962f206e8e909f8d516f3ddbb5cabcad77d56","last_reissued_at":"2026-05-18T02:59:20.460124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:20.460124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6615","source_version":2,"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:59:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtsbJNVNMH8ZUec7tSD5uUgXh13rjdNetvn4XnBTxY33hX6qCwTIoqqXcjABzkQGB1yNQKprP5LNtZzEyQBDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:48:23.546383Z"},"content_sha256":"1a6107d95c6c355cf4e72ad83263cf56a9267f400d5f1a85c593e4b871a6b088","schema_version":"1.0","event_id":"sha256:1a6107d95c6c355cf4e72ad83263cf56a9267f400d5f1a85c593e4b871a6b088"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:E6AD4QXM3SAHSEF3JFZDECLC6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved approximation algorithm for Fault-Tolerant Facility Placement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bartosz Rybicki, Jaroslaw Byrka","submitted_at":"2013-11-26T10:49:36Z","abstract_excerpt":"We consider the Fault-Tolerant Facility Placement problem ($FTFP$), which is a generalization of the classical Uncapacitated Facility Location problem ($UFL$). In the $FTFP$ problem we have a set of clients $C$ and a set of facilities $F$. Each facility $i \\in F$ can be opened many times. For each opening of facility $i$ we pay $f_i \\geq 0$. Our goal is to connect each client $j \\in C$ with $r_j \\geq 1$ open facilities in a way that minimizes the total cost of open facilities and established connections.\n  In a series of recent papers $FTFP$ was essentially reduced to $FTFL$ and then to $UFL$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6615","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"},"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:59:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOLRckr91RaS3OrtYOWKRZZ1HUHBQjDsG55jV0wgk9G4ZQJPUpBA8sPnp8NUzREDNBioYcn8st/T61fu0MewBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:48:23.546914Z"},"content_sha256":"caa135f7ce2be08a51adcf3cf18f13c6322913ed9413c05913c45f62f19baa14","schema_version":"1.0","event_id":"sha256:caa135f7ce2be08a51adcf3cf18f13c6322913ed9413c05913c45f62f19baa14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/bundle.json","state_url":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/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-01T21:48:23Z","links":{"resolver":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I","bundle":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/bundle.json","state":"https://pith.science/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6AD4QXM3SAHSEF3JFZDECLC6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:E6AD4QXM3SAHSEF3JFZDECLC6I","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":"269d0603cad7251136c8b4bda5d9a34c47ca8902a80f3921357aed3bf54fe0dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-26T10:49:36Z","title_canon_sha256":"d8fbf158228e8c3122797f72b82b20b2dbb2f3ea27ac6224fbf48f18a94b9573"},"schema_version":"1.0","source":{"id":"1311.6615","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6615","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6615v2","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6615","created_at":"2026-05-18T02:59:20Z"},{"alias_kind":"pith_short_12","alias_value":"E6AD4QXM3SAH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E6AD4QXM3SAHSEF3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E6AD4QXM","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:caa135f7ce2be08a51adcf3cf18f13c6322913ed9413c05913c45f62f19baa14","target":"graph","created_at":"2026-05-18T02:59:20Z","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 consider the Fault-Tolerant Facility Placement problem ($FTFP$), which is a generalization of the classical Uncapacitated Facility Location problem ($UFL$). In the $FTFP$ problem we have a set of clients $C$ and a set of facilities $F$. Each facility $i \\in F$ can be opened many times. For each opening of facility $i$ we pay $f_i \\geq 0$. Our goal is to connect each client $j \\in C$ with $r_j \\geq 1$ open facilities in a way that minimizes the total cost of open facilities and established connections.\n  In a series of recent papers $FTFP$ was essentially reduced to $FTFL$ and then to $UFL$ ","authors_text":"Bartosz Rybicki, Jaroslaw Byrka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-26T10:49:36Z","title":"Improved approximation algorithm for Fault-Tolerant Facility Placement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6615","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:1a6107d95c6c355cf4e72ad83263cf56a9267f400d5f1a85c593e4b871a6b088","target":"record","created_at":"2026-05-18T02:59:20Z","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":"269d0603cad7251136c8b4bda5d9a34c47ca8902a80f3921357aed3bf54fe0dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-26T10:49:36Z","title_canon_sha256":"d8fbf158228e8c3122797f72b82b20b2dbb2f3ea27ac6224fbf48f18a94b9573"},"schema_version":"1.0","source":{"id":"1311.6615","kind":"arxiv","version":2}},"canonical_sha256":"27803e42ecdc807910bb4972320962f206e8e909f8d516f3ddbb5cabcad77d56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27803e42ecdc807910bb4972320962f206e8e909f8d516f3ddbb5cabcad77d56","first_computed_at":"2026-05-18T02:59:20.460124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:20.460124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"98h/QATQLe1JrpC0OFl9guhCzQ8ctzUfwwmGLYPkU+E3jk4JAxa1f9jxh+AmPREUduDLjDQIPLdlhg6g35fuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:20.461020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6615","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a6107d95c6c355cf4e72ad83263cf56a9267f400d5f1a85c593e4b871a6b088","sha256:caa135f7ce2be08a51adcf3cf18f13c6322913ed9413c05913c45f62f19baa14"],"state_sha256":"82247bff39e68dcbae3d821be668299c2c257a494b6653bbaaa17131c222bf9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZyYs98Q+H+dlt/We65eBJLSVW8nDQ1aUxTEdx5AGQkY3c6n52Z70r3CwjTv0UJin2hwiPpydsP1qR5v6bf2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:48:23.549430Z","bundle_sha256":"56e380f6b781c72a4f4052e1a577d4bb4d6f34ff3c0b6c2cd395734a86069a6c"}}