{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:P36XBGCG2RRD3NJLNNRA5KAIFE","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":"540f58d79ccf82c4b8c8417355ea539f7c5412702388617634dcd93fa1e58d1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:37:12Z","title_canon_sha256":"3b4c09d306002200dbfa0bc0a32935c77b2af84b952ff77d342f7d49ded03ab6"},"schema_version":"1.0","source":{"id":"1111.1672","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1672","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1672v3","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1672","created_at":"2026-05-18T02:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"P36XBGCG2RRD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P36XBGCG2RRD3NJL","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P36XBGCG","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:3ce3b094d2e674a8038394b9d358aadd0a724a01a28e2e6d2089f3fdd9294bce","target":"graph","created_at":"2026-05-18T02:21:34Z","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":"A systematic technique to bound factor-revealing linear programs is presented. We show how to derive a family of upper bound factor-revealing programs (UPFRP), and show that each such program can be solved by a computer to bound the approximation factor of an associated algorithm. Obtaining an UPFRP is straightforward, and can be used as an alternative to analytical proofs, that are usually very long and tedious. We apply this technique to the Metric Facility Location Problem (MFLP) and to a generalization where the distance function is a squared metric. We call this generalization the Squared","authors_text":"Cristina G. Fernandes, Fl\\'avio K. Miyazawa, Lehilton L. C. Pedrosa, Lu\\'is A. A. Meira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:37:12Z","title":"A Systematic Approach to Bound Factor-Revealing LPs and its Application to the Metric and Squared Metric Facility Location Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1672","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:93e5cee6cba688513389ff0216ac10d05e10d62627504addd22ac79733c7bdf9","target":"record","created_at":"2026-05-18T02:21:34Z","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":"540f58d79ccf82c4b8c8417355ea539f7c5412702388617634dcd93fa1e58d1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:37:12Z","title_canon_sha256":"3b4c09d306002200dbfa0bc0a32935c77b2af84b952ff77d342f7d49ded03ab6"},"schema_version":"1.0","source":{"id":"1111.1672","kind":"arxiv","version":3}},"canonical_sha256":"7efd709846d4623db52b6b620ea808290f1fe6cdce854420c777a71b32a86099","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7efd709846d4623db52b6b620ea808290f1fe6cdce854420c777a71b32a86099","first_computed_at":"2026-05-18T02:21:34.847275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:34.847275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g4QqD5fR/3QsitM12cBimgdiJxM4t2L5hNfC9i9E2JQlmnpi2FD0Zi6Af2sTqvHf+6Zg7pEourAxh/pNl+k4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:34.847869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1672","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93e5cee6cba688513389ff0216ac10d05e10d62627504addd22ac79733c7bdf9","sha256:3ce3b094d2e674a8038394b9d358aadd0a724a01a28e2e6d2089f3fdd9294bce"],"state_sha256":"b2ed699515afdd5c931a069a00d247cf758195b1dcc98ad57956d7083cd29ab9"}