{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE","short_pith_number":"pith:Q2D6HA3Z","canonical_record":{"source":{"id":"1804.06061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-17T06:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"e42cb6a1babc2ac53713dd98a0e0fb26398dfe3d0b65e3ae515b76b466a60e6f","abstract_canon_sha256":"9a3fca74392738b7565cf70deb8e6761963135d9a44b72fb10e7d2250cf97538"},"schema_version":"1.0"},"canonical_sha256":"8687e38379abb19eb580014cd9d21b5130a987c02a15903bc64111f4a7ee0b85","source":{"kind":"arxiv","id":"1804.06061","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06061","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06061v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06061","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"Q2D6HA3ZVOYZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q2D6HA3ZVOYZ5NMA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q2D6HA3Z","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-17T06:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"e42cb6a1babc2ac53713dd98a0e0fb26398dfe3d0b65e3ae515b76b466a60e6f","abstract_canon_sha256":"9a3fca74392738b7565cf70deb8e6761963135d9a44b72fb10e7d2250cf97538"},"schema_version":"1.0"},"canonical_sha256":"8687e38379abb19eb580014cd9d21b5130a987c02a15903bc64111f4a7ee0b85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.855241Z","signature_b64":"CDQ51C89sXHtwXlSLnzfUhMLxsVCwYedGQXL/dOIIAtAGXwQ4cxpwKdegPiK+EPqohW/wHgNvqOkb6bSn7oiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8687e38379abb19eb580014cd9d21b5130a987c02a15903bc64111f4a7ee0b85","last_reissued_at":"2026-05-18T00:18:21.854541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.854541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06061","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:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCkGFi91MatiV71exXfEInhNBF1M3ZfmY4dKK3joQVv4kfu/208W3I8tbXU6STJjS5okm4efb7LYjL8hInPGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:14:36.102977Z"},"content_sha256":"89850a729f511427526e0c3a1abd36ab3a6e06b447a00a54b071e80cebd97681","schema_version":"1.0","event_id":"sha256:89850a729f511427526e0c3a1abd36ab3a6e06b447a00a54b071e80cebd97681"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Deep Binary Embedding Networks by Order-aware Reweighting of Triplets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hanjiang Lai, Jikai Chen, Libing Geng, Yan Pan","submitted_at":"2018-04-17T06:29:40Z","abstract_excerpt":"In this paper, we focus on triplet-based deep binary embedding networks for image retrieval task. The triplet loss has been shown to be most effective for the ranking problem. However, most of the previous works treat the triplets equally or select the hard triplets based on the loss. Such strategies do not consider the order relations, which is important for retrieval task. To this end, we propose an order-aware reweighting method to effectively train the triplet-based deep networks, which up-weights the important triplets and down-weights the uninformative triplets. First, we present the ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06061","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:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6sKNCUS0NZ3Ex16GCnDygeYMgpmVucUBVIRfsZu8c66Au2+VYbQR4gP5Rk5eyEEzTCYk4ERzPAySJoqyaFFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:14:36.103691Z"},"content_sha256":"05a459156c3b860beb0eac421cfc66799a248e0ebec9487d65ce513ca6bd0cf9","schema_version":"1.0","event_id":"sha256:05a459156c3b860beb0eac421cfc66799a248e0ebec9487d65ce513ca6bd0cf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE/bundle.json","state_url":"https://pith.science/pith/Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE/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-06T08:14:36Z","links":{"resolver":"https://pith.science/pith/Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE","bundle":"https://pith.science/pith/Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE/bundle.json","state":"https://pith.science/pith/Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q2D6HA3ZVOYZ5NMAAFGNTUQ3KE","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":"9a3fca74392738b7565cf70deb8e6761963135d9a44b72fb10e7d2250cf97538","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-17T06:29:40Z","title_canon_sha256":"e42cb6a1babc2ac53713dd98a0e0fb26398dfe3d0b65e3ae515b76b466a60e6f"},"schema_version":"1.0","source":{"id":"1804.06061","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06061","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06061v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06061","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"Q2D6HA3ZVOYZ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q2D6HA3ZVOYZ5NMA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q2D6HA3Z","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:05a459156c3b860beb0eac421cfc66799a248e0ebec9487d65ce513ca6bd0cf9","target":"graph","created_at":"2026-05-18T00:18:21Z","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":"In this paper, we focus on triplet-based deep binary embedding networks for image retrieval task. The triplet loss has been shown to be most effective for the ranking problem. However, most of the previous works treat the triplets equally or select the hard triplets based on the loss. Such strategies do not consider the order relations, which is important for retrieval task. To this end, we propose an order-aware reweighting method to effectively train the triplet-based deep networks, which up-weights the important triplets and down-weights the uninformative triplets. First, we present the ord","authors_text":"Hanjiang Lai, Jikai Chen, Libing Geng, Yan Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-17T06:29:40Z","title":"Improving Deep Binary Embedding Networks by Order-aware Reweighting of Triplets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06061","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:89850a729f511427526e0c3a1abd36ab3a6e06b447a00a54b071e80cebd97681","target":"record","created_at":"2026-05-18T00:18:21Z","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":"9a3fca74392738b7565cf70deb8e6761963135d9a44b72fb10e7d2250cf97538","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-17T06:29:40Z","title_canon_sha256":"e42cb6a1babc2ac53713dd98a0e0fb26398dfe3d0b65e3ae515b76b466a60e6f"},"schema_version":"1.0","source":{"id":"1804.06061","kind":"arxiv","version":1}},"canonical_sha256":"8687e38379abb19eb580014cd9d21b5130a987c02a15903bc64111f4a7ee0b85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8687e38379abb19eb580014cd9d21b5130a987c02a15903bc64111f4a7ee0b85","first_computed_at":"2026-05-18T00:18:21.854541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:21.854541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CDQ51C89sXHtwXlSLnzfUhMLxsVCwYedGQXL/dOIIAtAGXwQ4cxpwKdegPiK+EPqohW/wHgNvqOkb6bSn7oiBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:21.855241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06061","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89850a729f511427526e0c3a1abd36ab3a6e06b447a00a54b071e80cebd97681","sha256:05a459156c3b860beb0eac421cfc66799a248e0ebec9487d65ce513ca6bd0cf9"],"state_sha256":"22e116846b6ba01ee3ec58603c9680ee37707cf87c085de740d0892832f5f862"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AXCdJmTZA0crShsOQzK2Qf4d4dK/4rxdhSzMVpu+qVwwH4mEodpXhsa2VcwKxkr9ktmBRUc6r1ohKS344ZHzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:14:36.107802Z","bundle_sha256":"3d2b85e0f1c3672114066a7bed0640cda39b9272eaef15e72fbfea2db4a0c5d4"}}