{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OO257YRQ6QWKYG7SKAACICUVCK","short_pith_number":"pith:OO257YRQ","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"},"canonical_sha256":"73b5dfe230f42cac1bf25000240a9512bd297c691189db7d91f3596f40a57605","source":{"kind":"arxiv","id":"1811.10810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10810","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10810v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10810","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"OO257YRQ6QWK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OO257YRQ6QWKYG7S","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OO257YRQ","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OO257YRQ6QWKYG7SKAACICUVCK","target":"record","payload":{"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"},"canonical_sha256":"73b5dfe230f42cac1bf25000240a9512bd297c691189db7d91f3596f40a57605","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"},"source_kind":"arxiv","source_id":"1811.10810","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:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3ib0pUoFgK621Bi/t7xa2d5UIOSP6b+XCkoYyYG0dSOucbrvJ57oG4+RHbs3b4hagLf9ERPzPxBoA2opBbDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:29:08.442531Z"},"content_sha256":"da3103bd2f3fd30c96da53d72694720771e2dcdfcd98bc4e7e2929b358e898d1","schema_version":"1.0","event_id":"sha256:da3103bd2f3fd30c96da53d72694720771e2dcdfcd98bc4e7e2929b358e898d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OO257YRQ6QWKYG7SKAACICUVCK","target":"graph","payload":{"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"},"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:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OEwcdK0Vky2VmRld5OZASdxwV0+6IsMQhHBTJ5dmjbbZPL3jT3h2eWEyCYiD7iRk1iUVbcsAiUJ+JLI3kwCECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:29:08.443187Z"},"content_sha256":"cd73cf941a2c029398ae63d8bb844f106b7f4d9c7d3e19739ed6afc8533a8e58","schema_version":"1.0","event_id":"sha256:cd73cf941a2c029398ae63d8bb844f106b7f4d9c7d3e19739ed6afc8533a8e58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK/bundle.json","state_url":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OO257YRQ6QWKYG7SKAACICUVCK/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-06T20:29:08Z","links":{"resolver":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK","bundle":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK/bundle.json","state":"https://pith.science/pith/OO257YRQ6QWKYG7SKAACICUVCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OO257YRQ6QWKYG7SKAACICUVCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OO257YRQ6QWKYG7SKAACICUVCK","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":"486dac22b7c659d23cd789296168eea6ad5796da29c6524642201f1adcc4f57f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-27T04:50:30Z","title_canon_sha256":"bfa840277b139c160d035fc998b32ae6da0742beaf071359879d9ee1f5810ded"},"schema_version":"1.0","source":{"id":"1811.10810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10810","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10810v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10810","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"OO257YRQ6QWK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OO257YRQ6QWKYG7S","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OO257YRQ","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:cd73cf941a2c029398ae63d8bb844f106b7f4d9c7d3e19739ed6afc8533a8e58","target":"graph","created_at":"2026-05-17T23:59:47Z","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":"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 ","authors_text":"Fuyong Xing, Lin Yang, Manish Sapkota, Xiaoshuang Shi, Zhenhua Guo, Zizhao Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-27T04:50:30Z","title":"A Scalable Optimization Mechanism for Pairwise based Discrete Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10810","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:da3103bd2f3fd30c96da53d72694720771e2dcdfcd98bc4e7e2929b358e898d1","target":"record","created_at":"2026-05-17T23:59:47Z","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":"486dac22b7c659d23cd789296168eea6ad5796da29c6524642201f1adcc4f57f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-11-27T04:50:30Z","title_canon_sha256":"bfa840277b139c160d035fc998b32ae6da0742beaf071359879d9ee1f5810ded"},"schema_version":"1.0","source":{"id":"1811.10810","kind":"arxiv","version":1}},"canonical_sha256":"73b5dfe230f42cac1bf25000240a9512bd297c691189db7d91f3596f40a57605","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73b5dfe230f42cac1bf25000240a9512bd297c691189db7d91f3596f40a57605","first_computed_at":"2026-05-17T23:59:47.491870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:47.491870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g9+4MYn9x0XUYLYymRdcfLmF1VckKzJ7HPo+TMJKFbLZPeZt1QgYMi+ntRwkDJnVgc4L0xcAj4iMvg/uQ3VQBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:47.492389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da3103bd2f3fd30c96da53d72694720771e2dcdfcd98bc4e7e2929b358e898d1","sha256:cd73cf941a2c029398ae63d8bb844f106b7f4d9c7d3e19739ed6afc8533a8e58"],"state_sha256":"40ef65ae63785e1b5f87389b508ebc913f842416eb5ad9c72f6ee18f6eae3300"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ayb44MoHttyiqhhpfikBsMXGD9HbtKzt83SGuDBFT7bYOjDjg3t4b4au9rgYmwDSITG3uvaw71dvO8qsuF4ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:29:08.446853Z","bundle_sha256":"b655e9f03e95175477e1db2b62463e19f8a17a830980db643b3cbaf1fb10e3fe"}}