{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QM33UVKBGENERWHSU3DWLVPVU4","short_pith_number":"pith:QM33UVKB","schema_version":"1.0","canonical_sha256":"8337ba5541311a48d8f2a6c765d5f5a7078a630eb7dfe607c4b38daf5d384899","source":{"kind":"arxiv","id":"2002.06028","version":1},"attestation_state":"computed","paper":{"title":"Constrained Dominant sets and Its applications in computer vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alemu Leulseged Tesfaye","submitted_at":"2020-02-12T20:19:44Z","abstract_excerpt":"In this thesis, we present new schemes which leverage a constrained clustering method to solve several computer vision tasks ranging from image retrieval, image segmentation and co-segmentation, to person re-identification. In the last decades clustering methods have played a vital role in computer vision applications; herein, we focus on the extension, reformulation, and integration of a well-known graph and game theoretic clustering method known as Dominant Sets. Thus, we have demonstrated the validity of the proposed methods with extensive experiments which are conducted on several benchmar"},"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":"2002.06028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-02-12T20:19:44Z","cross_cats_sorted":[],"title_canon_sha256":"afdf62794dc3ae18a20a54fcea18c7c0d01a220d6dcc1bef8f6f3753c7f7d8a8","abstract_canon_sha256":"081e90151258a65bdb230529ac88859b7234f1bfd662ec16e4e147f3e807573e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:49.185400Z","signature_b64":"zyhuNhUzzxvFMnNHApM/mGAigobWpEjZ2MwcEk5r888reG14YA490O90XWCwtyTb5wOHGeFikVVMlcoEB/aKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8337ba5541311a48d8f2a6c765d5f5a7078a630eb7dfe607c4b38daf5d384899","last_reissued_at":"2026-07-05T00:40:49.184990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:49.184990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Dominant sets and Its applications in computer vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alemu Leulseged Tesfaye","submitted_at":"2020-02-12T20:19:44Z","abstract_excerpt":"In this thesis, we present new schemes which leverage a constrained clustering method to solve several computer vision tasks ranging from image retrieval, image segmentation and co-segmentation, to person re-identification. In the last decades clustering methods have played a vital role in computer vision applications; herein, we focus on the extension, reformulation, and integration of a well-known graph and game theoretic clustering method known as Dominant Sets. Thus, we have demonstrated the validity of the proposed methods with extensive experiments which are conducted on several benchmar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.06028","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.06028/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2002.06028","created_at":"2026-07-05T00:40:49.185053+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.06028v1","created_at":"2026-07-05T00:40:49.185053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.06028","created_at":"2026-07-05T00:40:49.185053+00:00"},{"alias_kind":"pith_short_12","alias_value":"QM33UVKBGENE","created_at":"2026-07-05T00:40:49.185053+00:00"},{"alias_kind":"pith_short_16","alias_value":"QM33UVKBGENERWHS","created_at":"2026-07-05T00:40:49.185053+00:00"},{"alias_kind":"pith_short_8","alias_value":"QM33UVKB","created_at":"2026-07-05T00:40:49.185053+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.03667","citing_title":"Accelerating SfM-based Pose Estimation with Dominating Set","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QM33UVKBGENERWHSU3DWLVPVU4","json":"https://pith.science/pith/QM33UVKBGENERWHSU3DWLVPVU4.json","graph_json":"https://pith.science/api/pith-number/QM33UVKBGENERWHSU3DWLVPVU4/graph.json","events_json":"https://pith.science/api/pith-number/QM33UVKBGENERWHSU3DWLVPVU4/events.json","paper":"https://pith.science/paper/QM33UVKB"},"agent_actions":{"view_html":"https://pith.science/pith/QM33UVKBGENERWHSU3DWLVPVU4","download_json":"https://pith.science/pith/QM33UVKBGENERWHSU3DWLVPVU4.json","view_paper":"https://pith.science/paper/QM33UVKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.06028&json=true","fetch_graph":"https://pith.science/api/pith-number/QM33UVKBGENERWHSU3DWLVPVU4/graph.json","fetch_events":"https://pith.science/api/pith-number/QM33UVKBGENERWHSU3DWLVPVU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QM33UVKBGENERWHSU3DWLVPVU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QM33UVKBGENERWHSU3DWLVPVU4/action/storage_attestation","attest_author":"https://pith.science/pith/QM33UVKBGENERWHSU3DWLVPVU4/action/author_attestation","sign_citation":"https://pith.science/pith/QM33UVKBGENERWHSU3DWLVPVU4/action/citation_signature","submit_replication":"https://pith.science/pith/QM33UVKBGENERWHSU3DWLVPVU4/action/replication_record"}},"created_at":"2026-07-05T00:40:49.185053+00:00","updated_at":"2026-07-05T00:40:49.185053+00:00"}