{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GWTVTMLRAE4IV7M76DXIQH2XGY","short_pith_number":"pith:GWTVTMLR","canonical_record":{"source":{"id":"1712.05825","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-15T20:04:39Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"80e19adf618ddb2c3e7b41f971354fe18b2df5ce22002f9324ac5b88b4371822","abstract_canon_sha256":"25ec3d5b09c52268bc2eab0d762a132b153955448a8446d340700be2818ba458"},"schema_version":"1.0"},"canonical_sha256":"35a759b17101388afd9ff0ee881f573616df763689e2025858d5438493a7fd60","source":{"kind":"arxiv","id":"1712.05825","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05825","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05825v3","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05825","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"GWTVTMLRAE4I","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWTVTMLRAE4IV7M7","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWTVTMLR","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GWTVTMLRAE4IV7M76DXIQH2XGY","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05825","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-15T20:04:39Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"80e19adf618ddb2c3e7b41f971354fe18b2df5ce22002f9324ac5b88b4371822","abstract_canon_sha256":"25ec3d5b09c52268bc2eab0d762a132b153955448a8446d340700be2818ba458"},"schema_version":"1.0"},"canonical_sha256":"35a759b17101388afd9ff0ee881f573616df763689e2025858d5438493a7fd60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:47.088285Z","signature_b64":"aCzDHOgsqD4/0QalMkcKIsBZotwkyTYH5asu2ejFHSWC3rlA8ZzvS6xvH/3Cd/X5yJeUI3kb58yvN6dZGI4/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35a759b17101388afd9ff0ee881f573616df763689e2025858d5438493a7fd60","last_reissued_at":"2026-05-18T00:10:47.087587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:47.087587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05825","source_version":3,"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:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4KWpH/i9kzxNcwi9msKbPLan//fORC/i9Jswbqyi21pD+rWtwo6ArjQhxHIAkTgvHzgr3wQ9EMY4ryp0GW0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:45:28.349698Z"},"content_sha256":"4ff55efa3044318015b1a1c361bf26437b82808cb6d50b44a28dd46babb29478","schema_version":"1.0","event_id":"sha256:4ff55efa3044318015b1a1c361bf26437b82808cb6d50b44a28dd46babb29478"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GWTVTMLRAE4IV7M76DXIQH2XGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Anthony Wirth, David Gleich, Nate Veldt","submitted_at":"2017-12-15T20:04:39Z","abstract_excerpt":"Graph clustering, or community detection, is the task of identifying groups of closely related objects in a large network. In this paper we introduce a new community-detection framework called LambdaCC that is based on a specially weighted version of correlation clustering. A key component in our methodology is a clustering resolution parameter, $\\lambda$, which implicitly controls the size and structure of clusters formed by our framework. We show that, by increasing this parameter, our objective effectively interpolates between two different strategies in graph clustering: finding a sparse c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05825","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"},"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:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ke28phuwDT0KZMrHUnPnIPf9iLYYdYq23JvawA+TzdIvBBlFfsl2N/DgD8Tg1psG+umO7k/x5nbRFTaI0cpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:45:28.350103Z"},"content_sha256":"bea650743a5f8aaf67328d4de6a0eb856f3aa495d2db32395c9b4abeecc7379b","schema_version":"1.0","event_id":"sha256:bea650743a5f8aaf67328d4de6a0eb856f3aa495d2db32395c9b4abeecc7379b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWTVTMLRAE4IV7M76DXIQH2XGY/bundle.json","state_url":"https://pith.science/pith/GWTVTMLRAE4IV7M76DXIQH2XGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWTVTMLRAE4IV7M76DXIQH2XGY/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-05-27T21:45:28Z","links":{"resolver":"https://pith.science/pith/GWTVTMLRAE4IV7M76DXIQH2XGY","bundle":"https://pith.science/pith/GWTVTMLRAE4IV7M76DXIQH2XGY/bundle.json","state":"https://pith.science/pith/GWTVTMLRAE4IV7M76DXIQH2XGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWTVTMLRAE4IV7M76DXIQH2XGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GWTVTMLRAE4IV7M76DXIQH2XGY","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":"25ec3d5b09c52268bc2eab0d762a132b153955448a8446d340700be2818ba458","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-15T20:04:39Z","title_canon_sha256":"80e19adf618ddb2c3e7b41f971354fe18b2df5ce22002f9324ac5b88b4371822"},"schema_version":"1.0","source":{"id":"1712.05825","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05825","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05825v3","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05825","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"GWTVTMLRAE4I","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWTVTMLRAE4IV7M7","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWTVTMLR","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:bea650743a5f8aaf67328d4de6a0eb856f3aa495d2db32395c9b4abeecc7379b","target":"graph","created_at":"2026-05-18T00:10:47Z","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":"Graph clustering, or community detection, is the task of identifying groups of closely related objects in a large network. In this paper we introduce a new community-detection framework called LambdaCC that is based on a specially weighted version of correlation clustering. A key component in our methodology is a clustering resolution parameter, $\\lambda$, which implicitly controls the size and structure of clusters formed by our framework. We show that, by increasing this parameter, our objective effectively interpolates between two different strategies in graph clustering: finding a sparse c","authors_text":"Anthony Wirth, David Gleich, Nate Veldt","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-15T20:04:39Z","title":"Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05825","kind":"arxiv","version":3},"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:4ff55efa3044318015b1a1c361bf26437b82808cb6d50b44a28dd46babb29478","target":"record","created_at":"2026-05-18T00:10:47Z","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":"25ec3d5b09c52268bc2eab0d762a132b153955448a8446d340700be2818ba458","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-15T20:04:39Z","title_canon_sha256":"80e19adf618ddb2c3e7b41f971354fe18b2df5ce22002f9324ac5b88b4371822"},"schema_version":"1.0","source":{"id":"1712.05825","kind":"arxiv","version":3}},"canonical_sha256":"35a759b17101388afd9ff0ee881f573616df763689e2025858d5438493a7fd60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35a759b17101388afd9ff0ee881f573616df763689e2025858d5438493a7fd60","first_computed_at":"2026-05-18T00:10:47.087587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:47.087587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aCzDHOgsqD4/0QalMkcKIsBZotwkyTYH5asu2ejFHSWC3rlA8ZzvS6xvH/3Cd/X5yJeUI3kb58yvN6dZGI4/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:47.088285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05825","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ff55efa3044318015b1a1c361bf26437b82808cb6d50b44a28dd46babb29478","sha256:bea650743a5f8aaf67328d4de6a0eb856f3aa495d2db32395c9b4abeecc7379b"],"state_sha256":"a215fca28c3d84be1b91033f51dca887964be3304dffdb4230e70e12175f8123"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STXVCh64PUA7OUAtxN0Rvm/Bt93j3ZVkSVTHcGbV/k5Yatk7HCLOvm0/KTiL9ljyNf9UKrIUdA4u+vw9j1FKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:45:28.353420Z","bundle_sha256":"4a2f954c6974571bbe02b75bf3b2eb86a15681c73541594e8a7cbd916e22b158"}}