{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PC3X3UTDACW3EEU64NTMIHVTKT","short_pith_number":"pith:PC3X3UTD","canonical_record":{"source":{"id":"1112.2143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-09T16:43:59Z","cross_cats_sorted":[],"title_canon_sha256":"1d90d525db867704a639124436f0790aae1e336cd322338c622430de74620825","abstract_canon_sha256":"b79ad0ca327a9882cea9eb4440c52101dc2f995027dce5c8d3e366692e834685"},"schema_version":"1.0"},"canonical_sha256":"78b77dd26300adb2129ee366c41eb354f924f51c91e5327e497abcdc7d06d3f7","source":{"kind":"arxiv","id":"1112.2143","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2143","created_at":"2026-05-18T04:06:44Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2143v1","created_at":"2026-05-18T04:06:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2143","created_at":"2026-05-18T04:06:44Z"},{"alias_kind":"pith_short_12","alias_value":"PC3X3UTDACW3","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PC3X3UTDACW3EEU6","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PC3X3UTD","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PC3X3UTDACW3EEU64NTMIHVTKT","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-09T16:43:59Z","cross_cats_sorted":[],"title_canon_sha256":"1d90d525db867704a639124436f0790aae1e336cd322338c622430de74620825","abstract_canon_sha256":"b79ad0ca327a9882cea9eb4440c52101dc2f995027dce5c8d3e366692e834685"},"schema_version":"1.0"},"canonical_sha256":"78b77dd26300adb2129ee366c41eb354f924f51c91e5327e497abcdc7d06d3f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:44.005440Z","signature_b64":"qY4oapE7c7vCs6EbLLp8a+4Bk2BwU5ZfDMmaw9c3fnEcHJPlI/nXXIyZs7RUFWqxsfkGn4YACftY1bXG74K0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78b77dd26300adb2129ee366c41eb354f924f51c91e5327e497abcdc7d06d3f7","last_reissued_at":"2026-05-18T04:06:44.004873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:44.004873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2143","source_version":1,"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-18T04:06:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/59/vp8G7+y9vObTLYIMXjTPlr5kWnnUYPGnoWME6J9Uuxviajq8YrZQMsM3UN57zDB2SE2I8K3U7CgKQ0k9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:11:35.030850Z"},"content_sha256":"9e3b997331f7ecdf4e353d33b55bcdd52ef57567f5a019ac27ef48ab06fc76a7","schema_version":"1.0","event_id":"sha256:9e3b997331f7ecdf4e353d33b55bcdd52ef57567f5a019ac27ef48ab06fc76a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PC3X3UTDACW3EEU64NTMIHVTKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Experiments on Density-Constrained Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrea Schumm, Dorothea Wagner, Robert G\\\"orke","submitted_at":"2011-12-09T16:43:59Z","abstract_excerpt":"Clustering a graph means identifying internally dense subgraphs which are only sparsely interconnected. Formalizations of this notion lead to measures that quantify the quality of a clustering and to algorithms that actually find clusterings. Since, most generally, corresponding optimization problems are hard, heuristic clustering algorithms are used in practice, or other approaches which are not based on an objective function. In this work we conduct a comprehensive experimental evaluation of the qualitative behavior of greedy bottom-up heuristics driven by cut-based objectives and constraine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2143","kind":"arxiv","version":1},"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-18T04:06:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fG7uxR64dF1hWKrUlSjRiWf0LqXHgS86HOCKr9+OKkSrbMCpTQmMMsZGZ7mV37MBldjh9ylCxSPpZZQo302TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:11:35.031546Z"},"content_sha256":"326254aafab5aa76a663e1dabe3901413c062a253fe9a4b7db45b62ea6e5af6f","schema_version":"1.0","event_id":"sha256:326254aafab5aa76a663e1dabe3901413c062a253fe9a4b7db45b62ea6e5af6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PC3X3UTDACW3EEU64NTMIHVTKT/bundle.json","state_url":"https://pith.science/pith/PC3X3UTDACW3EEU64NTMIHVTKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PC3X3UTDACW3EEU64NTMIHVTKT/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-26T14:11:35Z","links":{"resolver":"https://pith.science/pith/PC3X3UTDACW3EEU64NTMIHVTKT","bundle":"https://pith.science/pith/PC3X3UTDACW3EEU64NTMIHVTKT/bundle.json","state":"https://pith.science/pith/PC3X3UTDACW3EEU64NTMIHVTKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PC3X3UTDACW3EEU64NTMIHVTKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PC3X3UTDACW3EEU64NTMIHVTKT","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":"b79ad0ca327a9882cea9eb4440c52101dc2f995027dce5c8d3e366692e834685","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-09T16:43:59Z","title_canon_sha256":"1d90d525db867704a639124436f0790aae1e336cd322338c622430de74620825"},"schema_version":"1.0","source":{"id":"1112.2143","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2143","created_at":"2026-05-18T04:06:44Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2143v1","created_at":"2026-05-18T04:06:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2143","created_at":"2026-05-18T04:06:44Z"},{"alias_kind":"pith_short_12","alias_value":"PC3X3UTDACW3","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PC3X3UTDACW3EEU6","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PC3X3UTD","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:326254aafab5aa76a663e1dabe3901413c062a253fe9a4b7db45b62ea6e5af6f","target":"graph","created_at":"2026-05-18T04:06:44Z","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":"Clustering a graph means identifying internally dense subgraphs which are only sparsely interconnected. Formalizations of this notion lead to measures that quantify the quality of a clustering and to algorithms that actually find clusterings. Since, most generally, corresponding optimization problems are hard, heuristic clustering algorithms are used in practice, or other approaches which are not based on an objective function. In this work we conduct a comprehensive experimental evaluation of the qualitative behavior of greedy bottom-up heuristics driven by cut-based objectives and constraine","authors_text":"Andrea Schumm, Dorothea Wagner, Robert G\\\"orke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-09T16:43:59Z","title":"Experiments on Density-Constrained Graph Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2143","kind":"arxiv","version":1},"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:9e3b997331f7ecdf4e353d33b55bcdd52ef57567f5a019ac27ef48ab06fc76a7","target":"record","created_at":"2026-05-18T04:06:44Z","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":"b79ad0ca327a9882cea9eb4440c52101dc2f995027dce5c8d3e366692e834685","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-09T16:43:59Z","title_canon_sha256":"1d90d525db867704a639124436f0790aae1e336cd322338c622430de74620825"},"schema_version":"1.0","source":{"id":"1112.2143","kind":"arxiv","version":1}},"canonical_sha256":"78b77dd26300adb2129ee366c41eb354f924f51c91e5327e497abcdc7d06d3f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78b77dd26300adb2129ee366c41eb354f924f51c91e5327e497abcdc7d06d3f7","first_computed_at":"2026-05-18T04:06:44.004873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:44.004873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qY4oapE7c7vCs6EbLLp8a+4Bk2BwU5ZfDMmaw9c3fnEcHJPlI/nXXIyZs7RUFWqxsfkGn4YACftY1bXG74K0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:44.005440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2143","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e3b997331f7ecdf4e353d33b55bcdd52ef57567f5a019ac27ef48ab06fc76a7","sha256:326254aafab5aa76a663e1dabe3901413c062a253fe9a4b7db45b62ea6e5af6f"],"state_sha256":"600c9a3ecaf4bae1ac8edc8aebba19f740d45f64975a7bae0cb43f254fa65593"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDWsjryuyR/aWbJc8zq+w3a2xF3pllIbGs5+wM55gylYQt1CvrhpYaJmon4JPMXHO6o17IQkh/APtnABC91VCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:11:35.034996Z","bundle_sha256":"9956f178fda84190279bff958077e69b0200c3f9f128d72037f2d61860d22e9f"}}