{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MRIUJXHBETEGBNEDGGR7F7OUB3","short_pith_number":"pith:MRIUJXHB","canonical_record":{"source":{"id":"1605.01443","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:50:34Z","cross_cats_sorted":[],"title_canon_sha256":"f919e05356f94b40acf0fb276df0492cbc8032ea0e156a394884bc93d4132dcc","abstract_canon_sha256":"abb31746cb8fe40a9175c5cebdf4a751348d31f2b323151eb4acbf69bf9d02c3"},"schema_version":"1.0"},"canonical_sha256":"645144dce124c860b48331a3f2fdd40ed5dbfbc02da781882c7586ed81f2c5c5","source":{"kind":"arxiv","id":"1605.01443","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01443","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01443v4","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01443","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"MRIUJXHBETEG","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MRIUJXHBETEGBNED","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MRIUJXHB","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MRIUJXHBETEGBNEDGGR7F7OUB3","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01443","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:50:34Z","cross_cats_sorted":[],"title_canon_sha256":"f919e05356f94b40acf0fb276df0492cbc8032ea0e156a394884bc93d4132dcc","abstract_canon_sha256":"abb31746cb8fe40a9175c5cebdf4a751348d31f2b323151eb4acbf69bf9d02c3"},"schema_version":"1.0"},"canonical_sha256":"645144dce124c860b48331a3f2fdd40ed5dbfbc02da781882c7586ed81f2c5c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:40.242756Z","signature_b64":"sdNHhvfqWklbL/GfGlvVCtY54KJt6yvXh7RWtvgkFfNFV+3V8jrNtUbw6wHveGOQ1NhGv2J8XAHnfE4x+EVEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"645144dce124c860b48331a3f2fdd40ed5dbfbc02da781882c7586ed81f2c5c5","last_reissued_at":"2026-05-18T00:50:40.242010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:40.242010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01443","source_version":4,"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:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qhf9t2BRwce3mUv/dIHRUSDxS32tLTM9ZnnPiLynfrucG/3C5GrW+a6NUq70w5uyqRG6ZxiARvClmBZ4BZ4FBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:49:15.610130Z"},"content_sha256":"b03145f2394fa892c3a585fe3fa376ca1cd17825cca348969a44dc4adaef2c2f","schema_version":"1.0","event_id":"sha256:b03145f2394fa892c3a585fe3fa376ca1cd17825cca348969a44dc4adaef2c2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MRIUJXHBETEGBNEDGGR7F7OUB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex variational methods for multiclass data segmentation on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Egil Bae, Ekaterina Merkurjev","submitted_at":"2016-05-04T21:50:34Z","abstract_excerpt":"Graph-based variational methods have recently shown to be highly competitive for various classification problems of high-dimensional data, but are inherently difficult to handle from an optimization perspective. This paper proposes a convex relaxation for a certain set of graph-based multiclass data segmentation problems, featuring region homogeneity terms, supervised information and/or certain constraints or penalty terms acting on the class sizes. Particular applications include semi-supervised classification of high-dimensional data and unsupervised segmentation of unstructured 3D point clo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01443","kind":"arxiv","version":4},"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:50:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhbteceKHOINQUvZ4IsekUl0VtaGqh0OrAWBCspapvEYOjrmk9IQk1q3YVa7LkkBpaV9TPSvjusvH6z/Y10hCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:49:15.610494Z"},"content_sha256":"16be0b6624dfca89ab643688cb219f59fcf35edaa6f906afb25a49dd01e0060a","schema_version":"1.0","event_id":"sha256:16be0b6624dfca89ab643688cb219f59fcf35edaa6f906afb25a49dd01e0060a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/bundle.json","state_url":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/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-28T10:49:15Z","links":{"resolver":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3","bundle":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/bundle.json","state":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MRIUJXHBETEGBNEDGGR7F7OUB3","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":"abb31746cb8fe40a9175c5cebdf4a751348d31f2b323151eb4acbf69bf9d02c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:50:34Z","title_canon_sha256":"f919e05356f94b40acf0fb276df0492cbc8032ea0e156a394884bc93d4132dcc"},"schema_version":"1.0","source":{"id":"1605.01443","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01443","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01443v4","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01443","created_at":"2026-05-18T00:50:40Z"},{"alias_kind":"pith_short_12","alias_value":"MRIUJXHBETEG","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MRIUJXHBETEGBNED","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MRIUJXHB","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:16be0b6624dfca89ab643688cb219f59fcf35edaa6f906afb25a49dd01e0060a","target":"graph","created_at":"2026-05-18T00:50:40Z","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-based variational methods have recently shown to be highly competitive for various classification problems of high-dimensional data, but are inherently difficult to handle from an optimization perspective. This paper proposes a convex relaxation for a certain set of graph-based multiclass data segmentation problems, featuring region homogeneity terms, supervised information and/or certain constraints or penalty terms acting on the class sizes. Particular applications include semi-supervised classification of high-dimensional data and unsupervised segmentation of unstructured 3D point clo","authors_text":"Egil Bae, Ekaterina Merkurjev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:50:34Z","title":"Convex variational methods for multiclass data segmentation on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01443","kind":"arxiv","version":4},"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:b03145f2394fa892c3a585fe3fa376ca1cd17825cca348969a44dc4adaef2c2f","target":"record","created_at":"2026-05-18T00:50:40Z","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":"abb31746cb8fe40a9175c5cebdf4a751348d31f2b323151eb4acbf69bf9d02c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-04T21:50:34Z","title_canon_sha256":"f919e05356f94b40acf0fb276df0492cbc8032ea0e156a394884bc93d4132dcc"},"schema_version":"1.0","source":{"id":"1605.01443","kind":"arxiv","version":4}},"canonical_sha256":"645144dce124c860b48331a3f2fdd40ed5dbfbc02da781882c7586ed81f2c5c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"645144dce124c860b48331a3f2fdd40ed5dbfbc02da781882c7586ed81f2c5c5","first_computed_at":"2026-05-18T00:50:40.242010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:40.242010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sdNHhvfqWklbL/GfGlvVCtY54KJt6yvXh7RWtvgkFfNFV+3V8jrNtUbw6wHveGOQ1NhGv2J8XAHnfE4x+EVEAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:40.242756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01443","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b03145f2394fa892c3a585fe3fa376ca1cd17825cca348969a44dc4adaef2c2f","sha256:16be0b6624dfca89ab643688cb219f59fcf35edaa6f906afb25a49dd01e0060a"],"state_sha256":"0e0cc05e243172895cfa7e678ef321f6ed14f28a738c578bfcb35cdeaf39b611"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OJDeiMZ6abxrqxgvf0yLlF23O8WbqvGsKVZ4Ffw2sT6LUlebC7JftAKw+PaPOlJhidpfU/HIwvsa5izMNEDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:49:15.612455Z","bundle_sha256":"07d0dc804f3ae27e992d17f06519ea08a3d20139386280ecebda773a3a38372a"}}