{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6X5GRVXCRZHWEWEFVAO5KL276R","short_pith_number":"pith:6X5GRVXC","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"},"canonical_sha256":"f5fa68d6e28e4f625885a81dd52f5ff4768b226250636a49f0aa4fbc545c84dc","source":{"kind":"arxiv","id":"1303.6867","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6867","created_at":"2026-05-18T02:54:30Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6867v2","created_at":"2026-05-18T02:54:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6867","created_at":"2026-05-18T02:54:30Z"},{"alias_kind":"pith_short_12","alias_value":"6X5GRVXCRZHW","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6X5GRVXCRZHWEWEF","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6X5GRVXC","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6X5GRVXCRZHWEWEFVAO5KL276R","target":"record","payload":{"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"},"canonical_sha256":"f5fa68d6e28e4f625885a81dd52f5ff4768b226250636a49f0aa4fbc545c84dc","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"},"source_kind":"arxiv","source_id":"1303.6867","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-18T02:54:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pkkF5cbxE73FQkQOOFT24OXLWXOInLFJkunTB5H1Im0dnHCMib4cdK2e/WoOPbLuRfKub2TK+T86+Zvfv3uhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:58:58.387737Z"},"content_sha256":"4529146ba8e709e2b4dbd92265d5ec602f8f088b3cd6004d59c25e82a1e51e9f","schema_version":"1.0","event_id":"sha256:4529146ba8e709e2b4dbd92265d5ec602f8f088b3cd6004d59c25e82a1e51e9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6X5GRVXCRZHWEWEFVAO5KL276R","target":"graph","payload":{"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"},"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-18T02:54:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1R/UgbVk9pErWGKh17RSFm8BgvlhivHy1znAeE7XBEu6K6IpP3G6A+iosrfbIuT87WUeQIgmuXdxbTzQfxAdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:58:58.388079Z"},"content_sha256":"6288895680f34bba371aa7760bb76f0109823ae4c782d953e8a0bd135f432e39","schema_version":"1.0","event_id":"sha256:6288895680f34bba371aa7760bb76f0109823ae4c782d953e8a0bd135f432e39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R/bundle.json","state_url":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6X5GRVXCRZHWEWEFVAO5KL276R/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-26T01:58:58Z","links":{"resolver":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R","bundle":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R/bundle.json","state":"https://pith.science/pith/6X5GRVXCRZHWEWEFVAO5KL276R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6X5GRVXCRZHWEWEFVAO5KL276R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6X5GRVXCRZHWEWEFVAO5KL276R","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":"f6bd4b7c0ed4fcab8b7335ab36095df0c2f4c37ea32345777ca195fb6e971b4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T15:57:58Z","title_canon_sha256":"41b3ace8ef3053ea1b76b9f19817a83f86f680fd3d7c945752fa575fc9893241"},"schema_version":"1.0","source":{"id":"1303.6867","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6867","created_at":"2026-05-18T02:54:30Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6867v2","created_at":"2026-05-18T02:54:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6867","created_at":"2026-05-18T02:54:30Z"},{"alias_kind":"pith_short_12","alias_value":"6X5GRVXCRZHW","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6X5GRVXCRZHWEWEF","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6X5GRVXC","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:6288895680f34bba371aa7760bb76f0109823ae4c782d953e8a0bd135f432e39","target":"graph","created_at":"2026-05-18T02:54:30Z","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":"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","authors_text":"Bang Ye Wu, Li-Hsuan Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T15:57:58Z","title":"Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6867","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:4529146ba8e709e2b4dbd92265d5ec602f8f088b3cd6004d59c25e82a1e51e9f","target":"record","created_at":"2026-05-18T02:54:30Z","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":"f6bd4b7c0ed4fcab8b7335ab36095df0c2f4c37ea32345777ca195fb6e971b4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-27T15:57:58Z","title_canon_sha256":"41b3ace8ef3053ea1b76b9f19817a83f86f680fd3d7c945752fa575fc9893241"},"schema_version":"1.0","source":{"id":"1303.6867","kind":"arxiv","version":2}},"canonical_sha256":"f5fa68d6e28e4f625885a81dd52f5ff4768b226250636a49f0aa4fbc545c84dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5fa68d6e28e4f625885a81dd52f5ff4768b226250636a49f0aa4fbc545c84dc","first_computed_at":"2026-05-18T02:54:30.823576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:30.823576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RJFcioDRWGhsmxhnuq1z+rBzpvD9dT7/Hc70CLfprc3J076qQG0Js2KVyAP3FTVeE4FWAhc1hbqPRnXHOGgfAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:30.824121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6867","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4529146ba8e709e2b4dbd92265d5ec602f8f088b3cd6004d59c25e82a1e51e9f","sha256:6288895680f34bba371aa7760bb76f0109823ae4c782d953e8a0bd135f432e39"],"state_sha256":"dd1bae3ce0f9e9338e7e871c3cf679dbde21a237631f732401c6d2c2fd95e1b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUNPHH34wJrm1wYBDS3E5EjgjU6rsCUUXPqqT8bF5XYJf1VrAVwVY8biSmL/4ZwZ4RdTkg8GgmNuhRLpr5mcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:58:58.390056Z","bundle_sha256":"de8bfa3605aac7337aa26950fb662abef1b6e48a497772f7a560f83ffa408fd0"}}