{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5UZPNKHE3MDZY4SBEUHHI4ABCA","short_pith_number":"pith:5UZPNKHE","schema_version":"1.0","canonical_sha256":"ed32f6a8e4db079c7241250e747001101bc2a9204f640e6ceea6afbd7c8ea6bb","source":{"kind":"arxiv","id":"1412.0681","version":3},"attestation_state":"computed","paper":{"title":"Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigory Yaroslavtsev, Konstantin Makarychev, Shuchi Chawla, Tselil Schramm","submitted_at":"2014-12-01T21:11:40Z","abstract_excerpt":"We give new rounding schemes for the standard linear programming relaxation of the correlation clustering problem, achieving approximation factors almost matching the integrality gaps:\n  - For complete graphs our appoximation is $2.06 - \\varepsilon$ for a fixed constant $\\varepsilon$, which almost matches the previously known integrality gap of $2$.\n  - For complete $k$-partite graphs our approximation is $3$. We also show a matching integrality gap.\n  - For complete graphs with edge weights satisfying triangle inequalities and probability constraints, our approximation is $1.5$, and we show a"},"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":"1412.0681","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-01T21:11:40Z","cross_cats_sorted":[],"title_canon_sha256":"1f3b6d2cffb11e08d4933c9c0da58b9ceaf6490efaf00041fdc647456ad38bf7","abstract_canon_sha256":"c9334a94f7c18bac29a1b8b910c558dda2b469a8ad693fd78b66cc159d430186"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:55.085123Z","signature_b64":"k+ijAX/MoGzGXV6QtsLbWWAolzoH6wSY4EEzONWoUigeeqlYPsszJ3Ol33EcSWcKZseH4RiErJk+rgxuHZhZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed32f6a8e4db079c7241250e747001101bc2a9204f640e6ceea6afbd7c8ea6bb","last_reissued_at":"2026-05-18T01:39:55.084575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:55.084575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigory Yaroslavtsev, Konstantin Makarychev, Shuchi Chawla, Tselil Schramm","submitted_at":"2014-12-01T21:11:40Z","abstract_excerpt":"We give new rounding schemes for the standard linear programming relaxation of the correlation clustering problem, achieving approximation factors almost matching the integrality gaps:\n  - For complete graphs our appoximation is $2.06 - \\varepsilon$ for a fixed constant $\\varepsilon$, which almost matches the previously known integrality gap of $2$.\n  - For complete $k$-partite graphs our approximation is $3$. We also show a matching integrality gap.\n  - For complete graphs with edge weights satisfying triangle inequalities and probability constraints, our approximation is $1.5$, and we show a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0681","kind":"arxiv","version":3},"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":"1412.0681","created_at":"2026-05-18T01:39:55.084640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0681v3","created_at":"2026-05-18T01:39:55.084640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0681","created_at":"2026-05-18T01:39:55.084640+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UZPNKHE3MDZ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UZPNKHE3MDZY4SB","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UZPNKHE","created_at":"2026-05-18T12:28:16.859392+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/5UZPNKHE3MDZY4SBEUHHI4ABCA","json":"https://pith.science/pith/5UZPNKHE3MDZY4SBEUHHI4ABCA.json","graph_json":"https://pith.science/api/pith-number/5UZPNKHE3MDZY4SBEUHHI4ABCA/graph.json","events_json":"https://pith.science/api/pith-number/5UZPNKHE3MDZY4SBEUHHI4ABCA/events.json","paper":"https://pith.science/paper/5UZPNKHE"},"agent_actions":{"view_html":"https://pith.science/pith/5UZPNKHE3MDZY4SBEUHHI4ABCA","download_json":"https://pith.science/pith/5UZPNKHE3MDZY4SBEUHHI4ABCA.json","view_paper":"https://pith.science/paper/5UZPNKHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0681&json=true","fetch_graph":"https://pith.science/api/pith-number/5UZPNKHE3MDZY4SBEUHHI4ABCA/graph.json","fetch_events":"https://pith.science/api/pith-number/5UZPNKHE3MDZY4SBEUHHI4ABCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UZPNKHE3MDZY4SBEUHHI4ABCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UZPNKHE3MDZY4SBEUHHI4ABCA/action/storage_attestation","attest_author":"https://pith.science/pith/5UZPNKHE3MDZY4SBEUHHI4ABCA/action/author_attestation","sign_citation":"https://pith.science/pith/5UZPNKHE3MDZY4SBEUHHI4ABCA/action/citation_signature","submit_replication":"https://pith.science/pith/5UZPNKHE3MDZY4SBEUHHI4ABCA/action/replication_record"}},"created_at":"2026-05-18T01:39:55.084640+00:00","updated_at":"2026-05-18T01:39:55.084640+00:00"}