{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HYNN3SUOXEG4MMXFLYMTQHLU5E","short_pith_number":"pith:HYNN3SUO","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"},"canonical_sha256":"3e1addca8eb90dc632e55e19381d74e93ea4557d4c4879647fdbd13a6925a7cb","source":{"kind":"arxiv","id":"1606.05198","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05198","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05198v2","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05198","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"HYNN3SUOXEG4","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HYNN3SUOXEG4MMXF","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HYNN3SUO","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HYNN3SUOXEG4MMXFLYMTQHLU5E","target":"record","payload":{"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"},"canonical_sha256":"3e1addca8eb90dc632e55e19381d74e93ea4557d4c4879647fdbd13a6925a7cb","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"},"source_kind":"arxiv","source_id":"1606.05198","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-18T00:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+C2pL3H8/AbaK9k1kOCUv/Wv20jLj96CBW2v97MDFlQ7YSbxwyoICtzsG20DhZjH4E25HZ+uthYViaWK1x/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:06:24.107093Z"},"content_sha256":"c55fb42b33f3b3c7beeb415af2bf4559a4fb10603fce07352a285dd9dc1cfc66","schema_version":"1.0","event_id":"sha256:c55fb42b33f3b3c7beeb415af2bf4559a4fb10603fce07352a285dd9dc1cfc66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HYNN3SUOXEG4MMXFLYMTQHLU5E","target":"graph","payload":{"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"},"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-18T00:51:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tVzQ8GF+8XpCgsL51qSKiLlDiuhO9eWwCQiSfd9eZSgU/VKfXMEa+6X9yl0hMZ7VQ/0s4EEpt3sJNXNFj5K4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:06:24.107459Z"},"content_sha256":"1f8cc2f09fdae70f8c170b70888b1c7e6db4b9b33a72fc658651ee129ca34850","schema_version":"1.0","event_id":"sha256:1f8cc2f09fdae70f8c170b70888b1c7e6db4b9b33a72fc658651ee129ca34850"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/bundle.json","state_url":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/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-24T13:06:24Z","links":{"resolver":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E","bundle":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/bundle.json","state":"https://pith.science/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYNN3SUOXEG4MMXFLYMTQHLU5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HYNN3SUOXEG4MMXFLYMTQHLU5E","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":"5f3509cd8d4e3196a4015bf89d4c5d515b0eaa609b72932a3ada9fafc39c73b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T14:23:23Z","title_canon_sha256":"7550a929d598a45fa7b011d91d1072db71339d03db5c844fc03eaea30e52f1d5"},"schema_version":"1.0","source":{"id":"1606.05198","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05198","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05198v2","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05198","created_at":"2026-05-18T00:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"HYNN3SUOXEG4","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HYNN3SUOXEG4MMXF","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HYNN3SUO","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:1f8cc2f09fdae70f8c170b70888b1c7e6db4b9b33a72fc658651ee129ca34850","target":"graph","created_at":"2026-05-18T00:51: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":"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))","authors_text":"Daniel Reichman, Nikhil Bansal, Seeun William Umboh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T14:23:23Z","title":"LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05198","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:c55fb42b33f3b3c7beeb415af2bf4559a4fb10603fce07352a285dd9dc1cfc66","target":"record","created_at":"2026-05-18T00:51: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":"5f3509cd8d4e3196a4015bf89d4c5d515b0eaa609b72932a3ada9fafc39c73b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T14:23:23Z","title_canon_sha256":"7550a929d598a45fa7b011d91d1072db71339d03db5c844fc03eaea30e52f1d5"},"schema_version":"1.0","source":{"id":"1606.05198","kind":"arxiv","version":2}},"canonical_sha256":"3e1addca8eb90dc632e55e19381d74e93ea4557d4c4879647fdbd13a6925a7cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e1addca8eb90dc632e55e19381d74e93ea4557d4c4879647fdbd13a6925a7cb","first_computed_at":"2026-05-18T00:51:34.054625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:34.054625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7RXc3iuqYKWBNjnO4Jgodbj86ilgPb0wnDd+kvtoNobwsoUG2SQcvX4YyXvY4fNSE4Xk+qo90lit8ax40izzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:34.055196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05198","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c55fb42b33f3b3c7beeb415af2bf4559a4fb10603fce07352a285dd9dc1cfc66","sha256:1f8cc2f09fdae70f8c170b70888b1c7e6db4b9b33a72fc658651ee129ca34850"],"state_sha256":"0c76372203dfb3e28f69c3b05e1a21b4ab6dcdd69cc24ec7cdba7e3baefd7584"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucBtArVGq+8kH8V4vY2XNpaRE+52MLeBSaXSuFjEwpNh2IfAGKa02FbDhaytZyFt3QR4v3UAviXm/B7YSOS1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:06:24.109416Z","bundle_sha256":"6c263bc6c6e8a9a1a7bb955b456667259cc93ce78cb5aae6932c2ed2fa310bec"}}