{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6UU54A4UESLBK6S4E63WKKTBR7","short_pith_number":"pith:6UU54A4U","schema_version":"1.0","canonical_sha256":"f529de03942496157a5c27b7652a618fd93ef266dcd4e937af4b3f8265778545","source":{"kind":"arxiv","id":"1904.05008","version":1},"attestation_state":"computed","paper":{"title":"Efficient Retrieval of Logos Using Rough Set Reducts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jayanta Mukhopadhyay, Partha Bhowmick, Ushasi Chaudhuri","submitted_at":"2019-04-10T05:34:04Z","abstract_excerpt":"Searching for similar logos in the registered logo database is a very important and tedious task at the trademark office. Speed and accuracy are two aspects that one must attend to while developing a system for retrieval of logos. In this paper, we propose a rough-set based method to quantify the structural information in a logo image that can be used to efficiently index an image. A logo is split into a number of polygons, and for each polygon, we compute the tight upper and lower approximations based on the principles of a rough set. This representation is used for forming feature vectors fo"},"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":"1904.05008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-10T05:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"f79bf78d2a95677cf7169df3d1d34ef97b3416b31087b615a16cea98d4fd0311","abstract_canon_sha256":"4bc8c27c6fb37f43985d2e4f62a653ce07ca93c4f46aa7a75050adaebc2d51f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:54.439226Z","signature_b64":"di34RcdlWz0uoGlgAelB727MLAhW89e8PdUPD72ersSGQ9GW9/eGETlyvZmEGW6HoEy2q2PwPSxdY4pmnxeYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f529de03942496157a5c27b7652a618fd93ef266dcd4e937af4b3f8265778545","last_reissued_at":"2026-05-17T23:48:54.438777Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:54.438777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Retrieval of Logos Using Rough Set Reducts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jayanta Mukhopadhyay, Partha Bhowmick, Ushasi Chaudhuri","submitted_at":"2019-04-10T05:34:04Z","abstract_excerpt":"Searching for similar logos in the registered logo database is a very important and tedious task at the trademark office. Speed and accuracy are two aspects that one must attend to while developing a system for retrieval of logos. In this paper, we propose a rough-set based method to quantify the structural information in a logo image that can be used to efficiently index an image. A logo is split into a number of polygons, and for each polygon, we compute the tight upper and lower approximations based on the principles of a rough set. This representation is used for forming feature vectors fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05008","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.05008","created_at":"2026-05-17T23:48:54.438844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05008v1","created_at":"2026-05-17T23:48:54.438844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05008","created_at":"2026-05-17T23:48:54.438844+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UU54A4UESLB","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UU54A4UESLBK6S4","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UU54A4U","created_at":"2026-05-18T12:33:10.108867+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/6UU54A4UESLBK6S4E63WKKTBR7","json":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7.json","graph_json":"https://pith.science/api/pith-number/6UU54A4UESLBK6S4E63WKKTBR7/graph.json","events_json":"https://pith.science/api/pith-number/6UU54A4UESLBK6S4E63WKKTBR7/events.json","paper":"https://pith.science/paper/6UU54A4U"},"agent_actions":{"view_html":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7","download_json":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7.json","view_paper":"https://pith.science/paper/6UU54A4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05008&json=true","fetch_graph":"https://pith.science/api/pith-number/6UU54A4UESLBK6S4E63WKKTBR7/graph.json","fetch_events":"https://pith.science/api/pith-number/6UU54A4UESLBK6S4E63WKKTBR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7/action/storage_attestation","attest_author":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7/action/author_attestation","sign_citation":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7/action/citation_signature","submit_replication":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7/action/replication_record"}},"created_at":"2026-05-17T23:48:54.438844+00:00","updated_at":"2026-05-17T23:48:54.438844+00:00"}