{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HYNN3SUOXEG4MMXFLYMTQHLU5E","short_pith_number":"pith:HYNN3SUO","schema_version":"1.0","canonical_sha256":"3e1addca8eb90dc632e55e19381d74e93ea4557d4c4879647fdbd13a6925a7cb","source":{"kind":"arxiv","id":"1606.05198","version":2},"attestation_state":"computed","paper":{"title":"LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Reichman, Nikhil Bansal, Seeun William Umboh","submitted_at":"2016-06-16T14:23:23Z","abstract_excerpt":"We give a general approach for solving optimization problems on noisy minor free graphs, where a \\delta-fraction of edges and vertices are adversarially corrupted. The noisy setting was first considered by Magen and Moharrami and they gave a (1 + \\delta)-estimation algorithm for the independent set problem. Later, Chan and Har-Peled designed a local search algorithm that finds a (1 + O(\\delta))-approximate independent set. However, nothing was known regarding other problems in the noisy setting. Our main contribution is a general LP-based framework that yields a (1 + O(\\delta log m log log m))"},"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":"1606.05198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T14:23:23Z","cross_cats_sorted":[],"title_canon_sha256":"7550a929d598a45fa7b011d91d1072db71339d03db5c844fc03eaea30e52f1d5","abstract_canon_sha256":"5f3509cd8d4e3196a4015bf89d4c5d515b0eaa609b72932a3ada9fafc39c73b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:34.055196Z","signature_b64":"7RXc3iuqYKWBNjnO4Jgodbj86ilgPb0wnDd+kvtoNobwsoUG2SQcvX4YyXvY4fNSE4Xk+qo90lit8ax40izzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e1addca8eb90dc632e55e19381d74e93ea4557d4c4879647fdbd13a6925a7cb","last_reissued_at":"2026-05-18T00:51:34.054625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:34.054625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Reichman, Nikhil Bansal, Seeun William Umboh","submitted_at":"2016-06-16T14:23:23Z","abstract_excerpt":"We give a general approach for solving optimization problems on noisy minor free graphs, where a \\delta-fraction of edges and vertices are adversarially corrupted. The noisy setting was first considered by Magen and Moharrami and they gave a (1 + \\delta)-estimation algorithm for the independent set problem. Later, Chan and Har-Peled designed a local search algorithm that finds a (1 + O(\\delta))-approximate independent set. However, nothing was known regarding other problems in the noisy setting. Our main contribution is a general LP-based framework that yields a (1 + O(\\delta log m log log m))"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05198","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.05198","created_at":"2026-05-18T00:51:34.054691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05198v2","created_at":"2026-05-18T00:51:34.054691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05198","created_at":"2026-05-18T00:51:34.054691+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYNN3SUOXEG4","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYNN3SUOXEG4MMXF","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYNN3SUO","created_at":"2026-05-18T12:30:22.444734+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/HYNN3SUOXEG4MMXFLYMTQHLU5E","json":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E.json","graph_json":"https://pith.science/api/pith-number/HYNN3SUOXEG4MMXFLYMTQHLU5E/graph.json","events_json":"https://pith.science/api/pith-number/HYNN3SUOXEG4MMXFLYMTQHLU5E/events.json","paper":"https://pith.science/paper/HYNN3SUO"},"agent_actions":{"view_html":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E","download_json":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E.json","view_paper":"https://pith.science/paper/HYNN3SUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05198&json=true","fetch_graph":"https://pith.science/api/pith-number/HYNN3SUOXEG4MMXFLYMTQHLU5E/graph.json","fetch_events":"https://pith.science/api/pith-number/HYNN3SUOXEG4MMXFLYMTQHLU5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/action/storage_attestation","attest_author":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/action/author_attestation","sign_citation":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/action/citation_signature","submit_replication":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/action/replication_record"}},"created_at":"2026-05-18T00:51:34.054691+00:00","updated_at":"2026-05-18T00:51:34.054691+00:00"}