{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3BELSR3P6UZIGNNJI4NEXMKXYE","short_pith_number":"pith:3BELSR3P","canonical_record":{"source":{"id":"1306.3409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-14T14:20:29Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"037f24d671a7bfe4658f10b6cafc131f3d9b07c93b8d9cc8b083e9433e388001","abstract_canon_sha256":"b75a973b78c07c6fa14c167d48a4caad4462ad6fbe4d38bd90fea9abb9f1a473"},"schema_version":"1.0"},"canonical_sha256":"d848b9476ff5328335a9471a4bb157c10df53adb4355effcf88cbd33fa5bce44","source":{"kind":"arxiv","id":"1306.3409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3409","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3409v1","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3409","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"pith_short_12","alias_value":"3BELSR3P6UZI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3BELSR3P6UZIGNNJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3BELSR3P","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3BELSR3P6UZIGNNJI4NEXMKXYE","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-14T14:20:29Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"037f24d671a7bfe4658f10b6cafc131f3d9b07c93b8d9cc8b083e9433e388001","abstract_canon_sha256":"b75a973b78c07c6fa14c167d48a4caad4462ad6fbe4d38bd90fea9abb9f1a473"},"schema_version":"1.0"},"canonical_sha256":"d848b9476ff5328335a9471a4bb157c10df53adb4355effcf88cbd33fa5bce44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:57.722961Z","signature_b64":"oRhlKBQ5HVsqYOBoucDbTk5L5aZtNNE9tyYRWrik2IBqRQWBs3njxMIfKHOTE0FBg3rixyDfWALmupKC8obGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d848b9476ff5328335a9471a4bb157c10df53adb4355effcf88cbd33fa5bce44","last_reissued_at":"2026-05-18T03:20:57.722392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:57.722392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3409","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-18T03:20:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GNHpP+1USpLf5bLHNzSp0tCa1tIm0brH2vcDyGTRhxIGLhujkBzp4mCUJn+7AQziQeQI7AXi7nMRRme0TBLnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:31:34.203068Z"},"content_sha256":"024c7b5cf78d02e5d8b65ae9f90109b8f1147d56ae3725a840781ae325b88f74","schema_version":"1.0","event_id":"sha256:024c7b5cf78d02e5d8b65ae9f90109b8f1147d56ae3725a840781ae325b88f74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3BELSR3P6UZIGNNJI4NEXMKXYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained fractional set programs and their application in local clustering and community detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Matthias Hein, Simon Setzer, Syama Sundar Rangapuram, Thomas B\\\"uhler","submitted_at":"2013-06-14T14:20:29Z","abstract_excerpt":"The (constrained) minimization of a ratio of set functions is a problem frequently occurring in clustering and community detection. As these optimization problems are typically NP-hard, one uses convex or spectral relaxations in practice. While these relaxations can be solved globally optimally, they are often too loose and thus lead to results far away from the optimum. In this paper we show that every constrained minimization problem of a ratio of non-negative set functions allows a tight relaxation into an unconstrained continuous optimization problem. This result leads to a flexible framew"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3409","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-18T03:20:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTP/R3PgOrueCNsPBL35BqsbMwneHeyODhv3R9yHGTfGy8kKXMcIGisgtj4zwR0tI0VtVDJThRDizf0HS7OBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:31:34.203501Z"},"content_sha256":"467758959f9d64af7694915baeb6719fe88aa5c094319fda6fc0c4c325a459a6","schema_version":"1.0","event_id":"sha256:467758959f9d64af7694915baeb6719fe88aa5c094319fda6fc0c4c325a459a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BELSR3P6UZIGNNJI4NEXMKXYE/bundle.json","state_url":"https://pith.science/pith/3BELSR3P6UZIGNNJI4NEXMKXYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BELSR3P6UZIGNNJI4NEXMKXYE/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-02T08:31:34Z","links":{"resolver":"https://pith.science/pith/3BELSR3P6UZIGNNJI4NEXMKXYE","bundle":"https://pith.science/pith/3BELSR3P6UZIGNNJI4NEXMKXYE/bundle.json","state":"https://pith.science/pith/3BELSR3P6UZIGNNJI4NEXMKXYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BELSR3P6UZIGNNJI4NEXMKXYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3BELSR3P6UZIGNNJI4NEXMKXYE","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":"b75a973b78c07c6fa14c167d48a4caad4462ad6fbe4d38bd90fea9abb9f1a473","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-14T14:20:29Z","title_canon_sha256":"037f24d671a7bfe4658f10b6cafc131f3d9b07c93b8d9cc8b083e9433e388001"},"schema_version":"1.0","source":{"id":"1306.3409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3409","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3409v1","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3409","created_at":"2026-05-18T03:20:57Z"},{"alias_kind":"pith_short_12","alias_value":"3BELSR3P6UZI","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3BELSR3P6UZIGNNJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3BELSR3P","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:467758959f9d64af7694915baeb6719fe88aa5c094319fda6fc0c4c325a459a6","target":"graph","created_at":"2026-05-18T03:20:57Z","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":"The (constrained) minimization of a ratio of set functions is a problem frequently occurring in clustering and community detection. As these optimization problems are typically NP-hard, one uses convex or spectral relaxations in practice. While these relaxations can be solved globally optimally, they are often too loose and thus lead to results far away from the optimum. In this paper we show that every constrained minimization problem of a ratio of non-negative set functions allows a tight relaxation into an unconstrained continuous optimization problem. This result leads to a flexible framew","authors_text":"Matthias Hein, Simon Setzer, Syama Sundar Rangapuram, Thomas B\\\"uhler","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-14T14:20:29Z","title":"Constrained fractional set programs and their application in local clustering and community detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3409","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:024c7b5cf78d02e5d8b65ae9f90109b8f1147d56ae3725a840781ae325b88f74","target":"record","created_at":"2026-05-18T03:20:57Z","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":"b75a973b78c07c6fa14c167d48a4caad4462ad6fbe4d38bd90fea9abb9f1a473","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-14T14:20:29Z","title_canon_sha256":"037f24d671a7bfe4658f10b6cafc131f3d9b07c93b8d9cc8b083e9433e388001"},"schema_version":"1.0","source":{"id":"1306.3409","kind":"arxiv","version":1}},"canonical_sha256":"d848b9476ff5328335a9471a4bb157c10df53adb4355effcf88cbd33fa5bce44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d848b9476ff5328335a9471a4bb157c10df53adb4355effcf88cbd33fa5bce44","first_computed_at":"2026-05-18T03:20:57.722392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:57.722392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oRhlKBQ5HVsqYOBoucDbTk5L5aZtNNE9tyYRWrik2IBqRQWBs3njxMIfKHOTE0FBg3rixyDfWALmupKC8obGDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:57.722961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:024c7b5cf78d02e5d8b65ae9f90109b8f1147d56ae3725a840781ae325b88f74","sha256:467758959f9d64af7694915baeb6719fe88aa5c094319fda6fc0c4c325a459a6"],"state_sha256":"529d9b9d727aab5f66d52ce3fcc403528b2241919ecec5a255cb00264c49c7d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DSJLe85m6JsF8ESnkL5+iZrOMLDXvwMwL7RYsm/lf7ze80QIhVMUWL7DEQsYi4CI9TgcZMLjMDMK1HWTqzkMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:31:34.205477Z","bundle_sha256":"060af867eddd2a0f1ad98b3811d23afa9c234d217fc7b4eeb11ab587edf0ad3a"}}