{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6UU54A4UESLBK6S4E63WKKTBR7","short_pith_number":"pith:6UU54A4U","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"},"canonical_sha256":"f529de03942496157a5c27b7652a618fd93ef266dcd4e937af4b3f8265778545","source":{"kind":"arxiv","id":"1904.05008","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05008","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05008v1","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05008","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"6UU54A4UESLB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6UU54A4UESLBK6S4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6UU54A4U","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6UU54A4UESLBK6S4E63WKKTBR7","target":"record","payload":{"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"},"canonical_sha256":"f529de03942496157a5c27b7652a618fd93ef266dcd4e937af4b3f8265778545","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"},"source_kind":"arxiv","source_id":"1904.05008","source_version":1,"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-17T23:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNc0lBibzZeiFlgw+5kcEpQKUCjpDgixKlH6XXSxN8yIvLpDcLcM0OE2SM+5h5eqnoUtIx6hRhaE886Fqa7SCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:00:27.682721Z"},"content_sha256":"9af7429a2096b9bdaf5edc0b9ef121c18fa2099e314226ad036091a85b200e60","schema_version":"1.0","event_id":"sha256:9af7429a2096b9bdaf5edc0b9ef121c18fa2099e314226ad036091a85b200e60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6UU54A4UESLBK6S4E63WKKTBR7","target":"graph","payload":{"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"},"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-17T23:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y5Ge9HvW7gZAipzcbebpLpDkSx9NJR48oOxgvzNMNNA13Icqc6tDxd1c7SnjDXpny2V2XFmE+6iYisIAG6zfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:00:27.683131Z"},"content_sha256":"5cfb872fdd3e7e3948e28c778fccaf4a63c9cb4733657c02ac2f34ac5b0e8be4","schema_version":"1.0","event_id":"sha256:5cfb872fdd3e7e3948e28c778fccaf4a63c9cb4733657c02ac2f34ac5b0e8be4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7/bundle.json","state_url":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6UU54A4UESLBK6S4E63WKKTBR7/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-06-11T09:00:27Z","links":{"resolver":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7","bundle":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7/bundle.json","state":"https://pith.science/pith/6UU54A4UESLBK6S4E63WKKTBR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6UU54A4UESLBK6S4E63WKKTBR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6UU54A4UESLBK6S4E63WKKTBR7","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":"4bc8c27c6fb37f43985d2e4f62a653ce07ca93c4f46aa7a75050adaebc2d51f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-10T05:34:04Z","title_canon_sha256":"f79bf78d2a95677cf7169df3d1d34ef97b3416b31087b615a16cea98d4fd0311"},"schema_version":"1.0","source":{"id":"1904.05008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05008","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05008v1","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05008","created_at":"2026-05-17T23:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"6UU54A4UESLB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6UU54A4UESLBK6S4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6UU54A4U","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:5cfb872fdd3e7e3948e28c778fccaf4a63c9cb4733657c02ac2f34ac5b0e8be4","target":"graph","created_at":"2026-05-17T23:48:54Z","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":"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","authors_text":"Jayanta Mukhopadhyay, Partha Bhowmick, Ushasi Chaudhuri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-10T05:34:04Z","title":"Efficient Retrieval of Logos Using Rough Set Reducts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05008","kind":"arxiv","version":1},"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:9af7429a2096b9bdaf5edc0b9ef121c18fa2099e314226ad036091a85b200e60","target":"record","created_at":"2026-05-17T23:48:54Z","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":"4bc8c27c6fb37f43985d2e4f62a653ce07ca93c4f46aa7a75050adaebc2d51f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-10T05:34:04Z","title_canon_sha256":"f79bf78d2a95677cf7169df3d1d34ef97b3416b31087b615a16cea98d4fd0311"},"schema_version":"1.0","source":{"id":"1904.05008","kind":"arxiv","version":1}},"canonical_sha256":"f529de03942496157a5c27b7652a618fd93ef266dcd4e937af4b3f8265778545","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f529de03942496157a5c27b7652a618fd93ef266dcd4e937af4b3f8265778545","first_computed_at":"2026-05-17T23:48:54.438777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:54.438777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"di34RcdlWz0uoGlgAelB727MLAhW89e8PdUPD72ersSGQ9GW9/eGETlyvZmEGW6HoEy2q2PwPSxdY4pmnxeYAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:54.439226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9af7429a2096b9bdaf5edc0b9ef121c18fa2099e314226ad036091a85b200e60","sha256:5cfb872fdd3e7e3948e28c778fccaf4a63c9cb4733657c02ac2f34ac5b0e8be4"],"state_sha256":"c8a059e1ce377f257bee3eda00246f03f0487cd6b06c657730c87dce970d5c12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ga0CpNT79ySRuJHyQDPQcL0rP4lm+9AFbgykFKMO4VQAUL93jUxaOkg4UPELD7JnkGNlhkMOhBjEZDaCt2bhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:00:27.685081Z","bundle_sha256":"b4887d310943d438014bf3f32d17448f250d44b1371d4b572efc59a5b7446775"}}