{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MRIUJXHBETEGBNEDGGR7F7OUB3","short_pith_number":"pith:MRIUJXHB","schema_version":"1.0","canonical_sha256":"645144dce124c860b48331a3f2fdd40ed5dbfbc02da781882c7586ed81f2c5c5","source":{"kind":"arxiv","id":"1605.01443","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.01443","created_at":"2026-05-18T00:50:40.242115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01443v4","created_at":"2026-05-18T00:50:40.242115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01443","created_at":"2026-05-18T00:50:40.242115+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRIUJXHBETEG","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRIUJXHBETEGBNED","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRIUJXHB","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3","json":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3.json","graph_json":"https://pith.science/api/pith-number/MRIUJXHBETEGBNEDGGR7F7OUB3/graph.json","events_json":"https://pith.science/api/pith-number/MRIUJXHBETEGBNEDGGR7F7OUB3/events.json","paper":"https://pith.science/paper/MRIUJXHB"},"agent_actions":{"view_html":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3","download_json":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3.json","view_paper":"https://pith.science/paper/MRIUJXHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01443&json=true","fetch_graph":"https://pith.science/api/pith-number/MRIUJXHBETEGBNEDGGR7F7OUB3/graph.json","fetch_events":"https://pith.science/api/pith-number/MRIUJXHBETEGBNEDGGR7F7OUB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/action/storage_attestation","attest_author":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/action/author_attestation","sign_citation":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/action/citation_signature","submit_replication":"https://pith.science/pith/MRIUJXHBETEGBNEDGGR7F7OUB3/action/replication_record"}},"created_at":"2026-05-18T00:50:40.242115+00:00","updated_at":"2026-05-18T00:50:40.242115+00:00"}