{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6X5GRVXCRZHWEWEFVAO5KL276R","short_pith_number":"pith:6X5GRVXC","schema_version":"1.0","canonical_sha256":"f5fa68d6e28e4f625885a81dd52f5ff4768b226250636a49f0aa4fbc545c84dc","source":{"kind":"arxiv","id":"1303.6867","version":2},"attestation_state":"computed","paper":{"title":"Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bang Ye Wu, Li-Hsuan Chen","submitted_at":"2013-03-27T15:57:58Z","abstract_excerpt":"In the {\\sc Min-Sum 2-Clustering} problem, we are given a graph and a parameter $k$, and the goal is to determine if there exists a 2-partition of the vertex set such that the total conflict number is at most $k$, where the conflict number of a vertex is the number of its non-neighbors in the same cluster and neighbors in the different cluster. The problem is equivalent to {\\sc 2-Cluster Editing} and {\\sc 2-Correlation Clustering} with an additional multiplicative factor two in the cost function. In this paper we show an algorithm for {\\sc Min-Sum 2-Clustering} with time complexity $O(n\\cdot 2"},"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":"1303.6867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T15:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"41b3ace8ef3053ea1b76b9f19817a83f86f680fd3d7c945752fa575fc9893241","abstract_canon_sha256":"f6bd4b7c0ed4fcab8b7335ab36095df0c2f4c37ea32345777ca195fb6e971b4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:30.824121Z","signature_b64":"RJFcioDRWGhsmxhnuq1z+rBzpvD9dT7/Hc70CLfprc3J076qQG0Js2KVyAP3FTVeE4FWAhc1hbqPRnXHOGgfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5fa68d6e28e4f625885a81dd52f5ff4768b226250636a49f0aa4fbc545c84dc","last_reissued_at":"2026-05-18T02:54:30.823576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:30.823576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bang Ye Wu, Li-Hsuan Chen","submitted_at":"2013-03-27T15:57:58Z","abstract_excerpt":"In the {\\sc Min-Sum 2-Clustering} problem, we are given a graph and a parameter $k$, and the goal is to determine if there exists a 2-partition of the vertex set such that the total conflict number is at most $k$, where the conflict number of a vertex is the number of its non-neighbors in the same cluster and neighbors in the different cluster. The problem is equivalent to {\\sc 2-Cluster Editing} and {\\sc 2-Correlation Clustering} with an additional multiplicative factor two in the cost function. In this paper we show an algorithm for {\\sc Min-Sum 2-Clustering} with time complexity $O(n\\cdot 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6867","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":"1303.6867","created_at":"2026-05-18T02:54:30.823657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.6867v2","created_at":"2026-05-18T02:54:30.823657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6867","created_at":"2026-05-18T02:54:30.823657+00:00"},{"alias_kind":"pith_short_12","alias_value":"6X5GRVXCRZHW","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6X5GRVXCRZHWEWEF","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6X5GRVXC","created_at":"2026-05-18T12:27:36.564083+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/6X5GRVXCRZHWEWEFVAO5KL276R","json":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R.json","graph_json":"https://pith.science/api/pith-number/6X5GRVXCRZHWEWEFVAO5KL276R/graph.json","events_json":"https://pith.science/api/pith-number/6X5GRVXCRZHWEWEFVAO5KL276R/events.json","paper":"https://pith.science/paper/6X5GRVXC"},"agent_actions":{"view_html":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R","download_json":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R.json","view_paper":"https://pith.science/paper/6X5GRVXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.6867&json=true","fetch_graph":"https://pith.science/api/pith-number/6X5GRVXCRZHWEWEFVAO5KL276R/graph.json","fetch_events":"https://pith.science/api/pith-number/6X5GRVXCRZHWEWEFVAO5KL276R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R/action/storage_attestation","attest_author":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R/action/author_attestation","sign_citation":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R/action/citation_signature","submit_replication":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R/action/replication_record"}},"created_at":"2026-05-18T02:54:30.823657+00:00","updated_at":"2026-05-18T02:54:30.823657+00:00"}