{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OO257YRQ6QWKYG7SKAACICUVCK","short_pith_number":"pith:OO257YRQ","schema_version":"1.0","canonical_sha256":"73b5dfe230f42cac1bf25000240a9512bd297c691189db7d91f3596f40a57605","source":{"kind":"arxiv","id":"1811.10810","version":1},"attestation_state":"computed","paper":{"title":"A Scalable Optimization Mechanism for Pairwise based Discrete Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Fuyong Xing, Lin Yang, Manish Sapkota, Xiaoshuang Shi, Zhenhua Guo, Zizhao Zhang","submitted_at":"2018-11-27T04:50:30Z","abstract_excerpt":"Maintaining the pair similarity relationship among originally high-dimensional data into a low-dimensional binary space is a popular strategy to learn binary codes. One simiple and intutive method is to utilize two identical code matrices produced by hash functions to approximate a pairwise real label matrix. However, the resulting quartic problem is difficult to directly solve due to the non-convex and non-smooth nature of the objective. In this paper, unlike previous optimization methods using various relaxation strategies, we aim to directly solve the original quartic problem using a novel "},"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":"1811.10810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-27T04:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"bfa840277b139c160d035fc998b32ae6da0742beaf071359879d9ee1f5810ded","abstract_canon_sha256":"486dac22b7c659d23cd789296168eea6ad5796da29c6524642201f1adcc4f57f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.492389Z","signature_b64":"g9+4MYn9x0XUYLYymRdcfLmF1VckKzJ7HPo+TMJKFbLZPeZt1QgYMi+ntRwkDJnVgc4L0xcAj4iMvg/uQ3VQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73b5dfe230f42cac1bf25000240a9512bd297c691189db7d91f3596f40a57605","last_reissued_at":"2026-05-17T23:59:47.491870Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.491870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scalable Optimization Mechanism for Pairwise based Discrete Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Fuyong Xing, Lin Yang, Manish Sapkota, Xiaoshuang Shi, Zhenhua Guo, Zizhao Zhang","submitted_at":"2018-11-27T04:50:30Z","abstract_excerpt":"Maintaining the pair similarity relationship among originally high-dimensional data into a low-dimensional binary space is a popular strategy to learn binary codes. One simiple and intutive method is to utilize two identical code matrices produced by hash functions to approximate a pairwise real label matrix. However, the resulting quartic problem is difficult to directly solve due to the non-convex and non-smooth nature of the objective. In this paper, unlike previous optimization methods using various relaxation strategies, we aim to directly solve the original quartic problem using a novel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10810","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":"1811.10810","created_at":"2026-05-17T23:59:47.491934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10810v1","created_at":"2026-05-17T23:59:47.491934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10810","created_at":"2026-05-17T23:59:47.491934+00:00"},{"alias_kind":"pith_short_12","alias_value":"OO257YRQ6QWK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OO257YRQ6QWKYG7S","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OO257YRQ","created_at":"2026-05-18T12:32:43.782077+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/OO257YRQ6QWKYG7SKAACICUVCK","json":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK.json","graph_json":"https://pith.science/api/pith-number/OO257YRQ6QWKYG7SKAACICUVCK/graph.json","events_json":"https://pith.science/api/pith-number/OO257YRQ6QWKYG7SKAACICUVCK/events.json","paper":"https://pith.science/paper/OO257YRQ"},"agent_actions":{"view_html":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK","download_json":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK.json","view_paper":"https://pith.science/paper/OO257YRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10810&json=true","fetch_graph":"https://pith.science/api/pith-number/OO257YRQ6QWKYG7SKAACICUVCK/graph.json","fetch_events":"https://pith.science/api/pith-number/OO257YRQ6QWKYG7SKAACICUVCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK/action/storage_attestation","attest_author":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK/action/author_attestation","sign_citation":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK/action/citation_signature","submit_replication":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK/action/replication_record"}},"created_at":"2026-05-17T23:59:47.491934+00:00","updated_at":"2026-05-17T23:59:47.491934+00:00"}