{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:U7CJVD6POUPT5UWOOKGWNHHFUN","short_pith_number":"pith:U7CJVD6P","canonical_record":{"source":{"id":"2602.04463","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-04T11:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"e7c2eaeb20db0e3a046cb4f2207120330823b8fd00d64afcef034173088e69f7","abstract_canon_sha256":"97782c89c9db795d9aadfffe659c09f16742d98352eb5f8a4d79d19d021be3fd"},"schema_version":"1.0"},"canonical_sha256":"a7c49a8fcf751f3ed2ce728d669ce5a365bc576e8e27bcf30ab6f75ae7dda2a0","source":{"kind":"arxiv","id":"2602.04463","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.04463","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"arxiv_version","alias_value":"2602.04463v2","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.04463","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"pith_short_12","alias_value":"U7CJVD6POUPT","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"pith_short_16","alias_value":"U7CJVD6POUPT5UWO","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"pith_short_8","alias_value":"U7CJVD6P","created_at":"2026-05-28T01:04:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:U7CJVD6POUPT5UWOOKGWNHHFUN","target":"record","payload":{"canonical_record":{"source":{"id":"2602.04463","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-04T11:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"e7c2eaeb20db0e3a046cb4f2207120330823b8fd00d64afcef034173088e69f7","abstract_canon_sha256":"97782c89c9db795d9aadfffe659c09f16742d98352eb5f8a4d79d19d021be3fd"},"schema_version":"1.0"},"canonical_sha256":"a7c49a8fcf751f3ed2ce728d669ce5a365bc576e8e27bcf30ab6f75ae7dda2a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:36.287625Z","signature_b64":"tLh6hfXU+n8MBAyXZflpQKlXBrZBuBSN0rnOkAEhxxwl1l759QQnnIGNOJJ5fOp/GecSySVozEUXstCkKFZdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7c49a8fcf751f3ed2ce728d669ce5a365bc576e8e27bcf30ab6f75ae7dda2a0","last_reissued_at":"2026-05-28T01:04:36.287282Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:36.287282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.04463","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-28T01:04:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21IRqg/sbsQGJdY1zeTVSJ85mLPgV84HU39iyAXD4LFH6l1TPX8YeMU5YPFgr4XJNMa528938+UXJqsPdWNOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:52:10.968123Z"},"content_sha256":"d65ae4111340c3bcf86388d4985368c9e869678d9d542dd25dc5e9f2beed7b2c","schema_version":"1.0","event_id":"sha256:d65ae4111340c3bcf86388d4985368c9e869678d9d542dd25dc5e9f2beed7b2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:U7CJVD6POUPT5UWOOKGWNHHFUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Adriaens, Nikolaj Tatti","submitted_at":"2026-02-04T11:48:41Z","abstract_excerpt":"The Bad Triangle Transversal (BTT) problem asks for the smallest set of edges that need to be removed from a given signed graph, so that the resulting graph does not have a bad triangle. Here, a bad triangle is a triangle with exactly one negative edge. Several 2-approximations for BTT are proposed in this paper. On the hardness side, we show that BTT is NP-hard to approximate with factor better than $\\frac{2137}{2136}$ on complete graphs. Our reduction also works for Correlation Clustering (CC), the Cluster Deletion problem (CD) and the Minimum Strong Triadic Closure problem (MinSTC). Lastly,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.04463","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.04463/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-28T01:04:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgrCcKUqSGkc52QiG/Y/7w8hyyOrkKu+Ls7P4g8sJYzGRpseIsYmGSHQTnwAt22pfkbWP4CNQOkGfPqe9RJfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:52:10.968923Z"},"content_sha256":"61fad90f998db7787c304c39e07d2fd14e96b18efc2bc3f951590bc1d8c5b8f9","schema_version":"1.0","event_id":"sha256:61fad90f998db7787c304c39e07d2fd14e96b18efc2bc3f951590bc1d8c5b8f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7CJVD6POUPT5UWOOKGWNHHFUN/bundle.json","state_url":"https://pith.science/pith/U7CJVD6POUPT5UWOOKGWNHHFUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7CJVD6POUPT5UWOOKGWNHHFUN/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-11T15:52:10Z","links":{"resolver":"https://pith.science/pith/U7CJVD6POUPT5UWOOKGWNHHFUN","bundle":"https://pith.science/pith/U7CJVD6POUPT5UWOOKGWNHHFUN/bundle.json","state":"https://pith.science/pith/U7CJVD6POUPT5UWOOKGWNHHFUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7CJVD6POUPT5UWOOKGWNHHFUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:U7CJVD6POUPT5UWOOKGWNHHFUN","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":"97782c89c9db795d9aadfffe659c09f16742d98352eb5f8a4d79d19d021be3fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-04T11:48:41Z","title_canon_sha256":"e7c2eaeb20db0e3a046cb4f2207120330823b8fd00d64afcef034173088e69f7"},"schema_version":"1.0","source":{"id":"2602.04463","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.04463","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"arxiv_version","alias_value":"2602.04463v2","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.04463","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"pith_short_12","alias_value":"U7CJVD6POUPT","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"pith_short_16","alias_value":"U7CJVD6POUPT5UWO","created_at":"2026-05-28T01:04:36Z"},{"alias_kind":"pith_short_8","alias_value":"U7CJVD6P","created_at":"2026-05-28T01:04:36Z"}],"graph_snapshots":[{"event_id":"sha256:61fad90f998db7787c304c39e07d2fd14e96b18efc2bc3f951590bc1d8c5b8f9","target":"graph","created_at":"2026-05-28T01:04:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.04463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Bad Triangle Transversal (BTT) problem asks for the smallest set of edges that need to be removed from a given signed graph, so that the resulting graph does not have a bad triangle. Here, a bad triangle is a triangle with exactly one negative edge. Several 2-approximations for BTT are proposed in this paper. On the hardness side, we show that BTT is NP-hard to approximate with factor better than $\\frac{2137}{2136}$ on complete graphs. Our reduction also works for Correlation Clustering (CC), the Cluster Deletion problem (CD) and the Minimum Strong Triadic Closure problem (MinSTC). Lastly,","authors_text":"Florian Adriaens, Nikolaj Tatti","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-04T11:48:41Z","title":"Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.04463","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:d65ae4111340c3bcf86388d4985368c9e869678d9d542dd25dc5e9f2beed7b2c","target":"record","created_at":"2026-05-28T01:04:36Z","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":"97782c89c9db795d9aadfffe659c09f16742d98352eb5f8a4d79d19d021be3fd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-02-04T11:48:41Z","title_canon_sha256":"e7c2eaeb20db0e3a046cb4f2207120330823b8fd00d64afcef034173088e69f7"},"schema_version":"1.0","source":{"id":"2602.04463","kind":"arxiv","version":2}},"canonical_sha256":"a7c49a8fcf751f3ed2ce728d669ce5a365bc576e8e27bcf30ab6f75ae7dda2a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7c49a8fcf751f3ed2ce728d669ce5a365bc576e8e27bcf30ab6f75ae7dda2a0","first_computed_at":"2026-05-28T01:04:36.287282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:36.287282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tLh6hfXU+n8MBAyXZflpQKlXBrZBuBSN0rnOkAEhxxwl1l759QQnnIGNOJJ5fOp/GecSySVozEUXstCkKFZdDw==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:36.287625Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.04463","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d65ae4111340c3bcf86388d4985368c9e869678d9d542dd25dc5e9f2beed7b2c","sha256:61fad90f998db7787c304c39e07d2fd14e96b18efc2bc3f951590bc1d8c5b8f9"],"state_sha256":"ef899346cd22beff6d3e310fee268bf0d1d19dbdb2aacb76aa602f905c2b88f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRPZub2SRv41fDgqQJCEoy5OxqeyskFFpezGGEURcKRolAvShD6bh/ixt4a9iDKbKZL7tu7rkdoWCDET/z/NAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:52:10.973562Z","bundle_sha256":"2d97fae10b00ba23850d5a31ed3ccf81ced4e54afb78f458ac84e0e5c937403f"}}