{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4SBHWVQ6OS765HRWFVTUG47POQ","short_pith_number":"pith:4SBHWVQ6","canonical_record":{"source":{"id":"1712.10211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-29T13:02:12Z","cross_cats_sorted":[],"title_canon_sha256":"2e86ce84bd55902da8ade40600e2dbeb8f1a8d3021c30dc15a725ff943c6bc17","abstract_canon_sha256":"9c32620f80ff1550ad08d34fca954a0ebb1af281e6dfe906dc8dd5b837a8331a"},"schema_version":"1.0"},"canonical_sha256":"e4827b561e74bfee9e362d674373ef7418073eccadec5f841cdaf5450a00d51b","source":{"kind":"arxiv","id":"1712.10211","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10211","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10211v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10211","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"4SBHWVQ6OS76","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4SBHWVQ6OS765HRW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4SBHWVQ6","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4SBHWVQ6OS765HRWFVTUG47POQ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.10211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-29T13:02:12Z","cross_cats_sorted":[],"title_canon_sha256":"2e86ce84bd55902da8ade40600e2dbeb8f1a8d3021c30dc15a725ff943c6bc17","abstract_canon_sha256":"9c32620f80ff1550ad08d34fca954a0ebb1af281e6dfe906dc8dd5b837a8331a"},"schema_version":"1.0"},"canonical_sha256":"e4827b561e74bfee9e362d674373ef7418073eccadec5f841cdaf5450a00d51b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:03.693725Z","signature_b64":"/mqptE63/3fcmPNvh2E4MTLjk6jX7xjv19OuUoRdyTJ2+dl5xqt1AazpbiI46I5U1ES/J6Kb8juBd0ykyrxnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4827b561e74bfee9e362d674373ef7418073eccadec5f841cdaf5450a00d51b","last_reissued_at":"2026-05-18T00:27:03.693125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:03.693125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.10211","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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fkKYsfxXmibozun8GIDTgFHdDeikJ+T10m+8ZlKjWhXpaDgBftNB8pBc168mm7SD8ytW3EmzRpc/KIuo0msyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:19:38.669838Z"},"content_sha256":"2f36d9027dec59c66b05c74e41a6b3cec996deebe0406c4faaffb5b3409a1083","schema_version":"1.0","event_id":"sha256:2f36d9027dec59c66b05c74e41a6b3cec996deebe0406c4faaffb5b3409a1083"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4SBHWVQ6OS765HRWFVTUG47POQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Deep Similarity Models with Focus Ranking for Fabric Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daiguo Deng, Hefeng Wu, Huayong He, Qi Li, Ruomei Wang, Xiaonan Luo","submitted_at":"2017-12-29T13:02:12Z","abstract_excerpt":"Fabric image retrieval is beneficial to many applications including clothing searching, online shopping and cloth modeling. Learning pairwise image similarity is of great importance to an image retrieval task. With the resurgence of Convolutional Neural Networks (CNNs), recent works have achieved significant progresses via deep representation learning with metric embedding, which drives similar examples close to each other in a feature space, and dissimilar ones apart from each other. In this paper, we propose a novel embedding method termed focus ranking that can be easily unified into a CNN "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10211","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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"civdZz3yvU38mDPbf19gTIVILsc+nAMjZJgnkxt5tg0fIaISqQjJPfxlYrQSAHsSldAvX+o+m53CGxPLYiGsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:19:38.670178Z"},"content_sha256":"6e60a6d310b89c35cc680122e5e6ef7397baae5993cfa9a341c5b0ac1c169772","schema_version":"1.0","event_id":"sha256:6e60a6d310b89c35cc680122e5e6ef7397baae5993cfa9a341c5b0ac1c169772"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SBHWVQ6OS765HRWFVTUG47POQ/bundle.json","state_url":"https://pith.science/pith/4SBHWVQ6OS765HRWFVTUG47POQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SBHWVQ6OS765HRWFVTUG47POQ/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-11T10:19:38Z","links":{"resolver":"https://pith.science/pith/4SBHWVQ6OS765HRWFVTUG47POQ","bundle":"https://pith.science/pith/4SBHWVQ6OS765HRWFVTUG47POQ/bundle.json","state":"https://pith.science/pith/4SBHWVQ6OS765HRWFVTUG47POQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SBHWVQ6OS765HRWFVTUG47POQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4SBHWVQ6OS765HRWFVTUG47POQ","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":"9c32620f80ff1550ad08d34fca954a0ebb1af281e6dfe906dc8dd5b837a8331a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-29T13:02:12Z","title_canon_sha256":"2e86ce84bd55902da8ade40600e2dbeb8f1a8d3021c30dc15a725ff943c6bc17"},"schema_version":"1.0","source":{"id":"1712.10211","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10211","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10211v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10211","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"4SBHWVQ6OS76","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4SBHWVQ6OS765HRW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4SBHWVQ6","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:6e60a6d310b89c35cc680122e5e6ef7397baae5993cfa9a341c5b0ac1c169772","target":"graph","created_at":"2026-05-18T00:27:03Z","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":"Fabric image retrieval is beneficial to many applications including clothing searching, online shopping and cloth modeling. Learning pairwise image similarity is of great importance to an image retrieval task. With the resurgence of Convolutional Neural Networks (CNNs), recent works have achieved significant progresses via deep representation learning with metric embedding, which drives similar examples close to each other in a feature space, and dissimilar ones apart from each other. In this paper, we propose a novel embedding method termed focus ranking that can be easily unified into a CNN ","authors_text":"Daiguo Deng, Hefeng Wu, Huayong He, Qi Li, Ruomei Wang, Xiaonan Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-29T13:02:12Z","title":"Learning Deep Similarity Models with Focus Ranking for Fabric Image Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10211","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:2f36d9027dec59c66b05c74e41a6b3cec996deebe0406c4faaffb5b3409a1083","target":"record","created_at":"2026-05-18T00:27:03Z","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":"9c32620f80ff1550ad08d34fca954a0ebb1af281e6dfe906dc8dd5b837a8331a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-12-29T13:02:12Z","title_canon_sha256":"2e86ce84bd55902da8ade40600e2dbeb8f1a8d3021c30dc15a725ff943c6bc17"},"schema_version":"1.0","source":{"id":"1712.10211","kind":"arxiv","version":1}},"canonical_sha256":"e4827b561e74bfee9e362d674373ef7418073eccadec5f841cdaf5450a00d51b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4827b561e74bfee9e362d674373ef7418073eccadec5f841cdaf5450a00d51b","first_computed_at":"2026-05-18T00:27:03.693125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:03.693125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/mqptE63/3fcmPNvh2E4MTLjk6jX7xjv19OuUoRdyTJ2+dl5xqt1AazpbiI46I5U1ES/J6Kb8juBd0ykyrxnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:03.693725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.10211","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f36d9027dec59c66b05c74e41a6b3cec996deebe0406c4faaffb5b3409a1083","sha256:6e60a6d310b89c35cc680122e5e6ef7397baae5993cfa9a341c5b0ac1c169772"],"state_sha256":"04f34d652953a9fd8d96d19e02dcee207ed2a75cda38a2ae4c54ea47ff9e69cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Za8PqbvXKBtwq5Jab82HnMHykwu6x75G+SAdUF8nYtSeC5hzDeCpuIe4WMv6zhu7R45zsiLkweH1JZV49krBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:19:38.672162Z","bundle_sha256":"405ccccd07b71eabf5a10f37deb5d6754c241fcdb23a6dfd7e4490115aa7747b"}}