{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JYHEISIQMU4XWJ6PH3MEQVCJRQ","short_pith_number":"pith:JYHEISIQ","schema_version":"1.0","canonical_sha256":"4e0e44491065397b27cf3ed84854498c02d43db1aad8d3a508d16fcdce6f36bb","source":{"kind":"arxiv","id":"1503.01986","version":2},"attestation_state":"computed","paper":{"title":"Convex Color Image Segmentation with Optimal Transport Distances","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Julien Rabin, Nicolas Papadakis","submitted_at":"2015-03-06T15:19:19Z","abstract_excerpt":"This work is about the use of regularized optimal-transport distances for convex, histogram-based image segmentation. In the considered framework, fixed exemplar histograms define a prior on the statistical features of the two regions in competition. In this paper, we investigate the use of various transport-based cost functions as discrepancy measures and rely on a primal-dual algorithm to solve the obtained convex optimization problem."},"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":"1503.01986","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CV","submitted_at":"2015-03-06T15:19:19Z","cross_cats_sorted":[],"title_canon_sha256":"f2cc324a51db6bb274e3f580142d185bf83c6c564a261fd641427f1b406787e3","abstract_canon_sha256":"42c8cc9f2959939acf35a2421252b7453f963cc4541cdf79c93317bb06960567"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:25.910431Z","signature_b64":"hIlvfFgH4bh/nutNzhSuVFSw5WufvtI+0ekeeZHxdB75m3rCuxrU2P88FUpI6akSiGFchSggL9vBENFvgTXbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e0e44491065397b27cf3ed84854498c02d43db1aad8d3a508d16fcdce6f36bb","last_reissued_at":"2026-05-18T02:23:25.909779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:25.909779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Color Image Segmentation with Optimal Transport Distances","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Julien Rabin, Nicolas Papadakis","submitted_at":"2015-03-06T15:19:19Z","abstract_excerpt":"This work is about the use of regularized optimal-transport distances for convex, histogram-based image segmentation. In the considered framework, fixed exemplar histograms define a prior on the statistical features of the two regions in competition. In this paper, we investigate the use of various transport-based cost functions as discrepancy measures and rely on a primal-dual algorithm to solve the obtained convex optimization problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01986","kind":"arxiv","version":2},"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":"1503.01986","created_at":"2026-05-18T02:23:25.909890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01986v2","created_at":"2026-05-18T02:23:25.909890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01986","created_at":"2026-05-18T02:23:25.909890+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYHEISIQMU4X","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYHEISIQMU4XWJ6P","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYHEISIQ","created_at":"2026-05-18T12:29:27.538025+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/JYHEISIQMU4XWJ6PH3MEQVCJRQ","json":"https://pith.science/pith/JYHEISIQMU4XWJ6PH3MEQVCJRQ.json","graph_json":"https://pith.science/api/pith-number/JYHEISIQMU4XWJ6PH3MEQVCJRQ/graph.json","events_json":"https://pith.science/api/pith-number/JYHEISIQMU4XWJ6PH3MEQVCJRQ/events.json","paper":"https://pith.science/paper/JYHEISIQ"},"agent_actions":{"view_html":"https://pith.science/pith/JYHEISIQMU4XWJ6PH3MEQVCJRQ","download_json":"https://pith.science/pith/JYHEISIQMU4XWJ6PH3MEQVCJRQ.json","view_paper":"https://pith.science/paper/JYHEISIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01986&json=true","fetch_graph":"https://pith.science/api/pith-number/JYHEISIQMU4XWJ6PH3MEQVCJRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JYHEISIQMU4XWJ6PH3MEQVCJRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYHEISIQMU4XWJ6PH3MEQVCJRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYHEISIQMU4XWJ6PH3MEQVCJRQ/action/storage_attestation","attest_author":"https://pith.science/pith/JYHEISIQMU4XWJ6PH3MEQVCJRQ/action/author_attestation","sign_citation":"https://pith.science/pith/JYHEISIQMU4XWJ6PH3MEQVCJRQ/action/citation_signature","submit_replication":"https://pith.science/pith/JYHEISIQMU4XWJ6PH3MEQVCJRQ/action/replication_record"}},"created_at":"2026-05-18T02:23:25.909890+00:00","updated_at":"2026-05-18T02:23:25.909890+00:00"}