{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LASYEF6L34JSD4C2MTB234YSDA","short_pith_number":"pith:LASYEF6L","canonical_record":{"source":{"id":"1607.05396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T04:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"3ca41ffe6b9be5d8d77508dd4848e5629ef4fe513362cfc87c797b6a0557cfe9","abstract_canon_sha256":"aea7bb96df6a2707199768550ad2d478956cda79d4067f66b41a9c6fd93c8439"},"schema_version":"1.0"},"canonical_sha256":"58258217cbdf1321f05a64c3adf312180a57d60c16a96f3073e4b7d57faff6af","source":{"kind":"arxiv","id":"1607.05396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05396","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05396v1","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05396","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"pith_short_12","alias_value":"LASYEF6L34JS","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LASYEF6L34JSD4C2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LASYEF6L","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LASYEF6L34JSD4C2MTB234YSDA","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T04:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"3ca41ffe6b9be5d8d77508dd4848e5629ef4fe513362cfc87c797b6a0557cfe9","abstract_canon_sha256":"aea7bb96df6a2707199768550ad2d478956cda79d4067f66b41a9c6fd93c8439"},"schema_version":"1.0"},"canonical_sha256":"58258217cbdf1321f05a64c3adf312180a57d60c16a96f3073e4b7d57faff6af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:55.100687Z","signature_b64":"n8oTPVXx1wlikk0CsWSUJ/uTiU6eHD/8MN1sSbdhaDW0S5UmyaK9a9PkSiBxWY0jqqsfZfe15a30I0qtOy7cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58258217cbdf1321f05a64c3adf312180a57d60c16a96f3073e4b7d57faff6af","last_reissued_at":"2026-05-18T01:10:55.100261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:55.100261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05396","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-18T01:10:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AC9nafkFgrGNIOvAez04xaOe/frV2Oe3uU60r1OsKeDyKXmi30n7C/bndrJFVD05qm+h/4pj50G62Srj3vGmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:17:01.472008Z"},"content_sha256":"80d11e4242673616a2653f46ee04a3203ab8e828160743a0eadd3d21ceccf8ee","schema_version":"1.0","event_id":"sha256:80d11e4242673616a2653f46ee04a3203ab8e828160743a0eadd3d21ceccf8ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LASYEF6L34JSD4C2MTB234YSDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Hashing with Semidefinite Relaxation and Augmented Lagrangian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anh-Dzung Doan, Duc-Thanh Nguyen, Ngai-Man Cheung, Thanh-Toan Do","submitted_at":"2016-07-19T04:20:24Z","abstract_excerpt":"This paper proposes two approaches for inferencing binary codes in two-step (supervised, unsupervised) hashing. We first introduce an unified formulation for both supervised and unsupervised hashing. Then, we cast the learning of one bit as a Binary Quadratic Problem (BQP). We propose two approaches to solve BQP. In the first approach, we relax BQP as a semidefinite programming problem which its global optimum can be achieved. We theoretically prove that the objective value of the binary solution achieved by this approach is well bounded. In the second approach, we propose an augmented Lagrang"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05396","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-18T01:10:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WSbFvsO04lchL3BO22oH6dj2JmFYbd2pGqPxuL/G0XtI6AT9Jfq6Bv3pQbddOTF5rYDbOpxHp9HUko2d113CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:17:01.472352Z"},"content_sha256":"6a1ab8ea8464c2669ebd9c6d86cea77ffb67749420e72b826954508692f1e40a","schema_version":"1.0","event_id":"sha256:6a1ab8ea8464c2669ebd9c6d86cea77ffb67749420e72b826954508692f1e40a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LASYEF6L34JSD4C2MTB234YSDA/bundle.json","state_url":"https://pith.science/pith/LASYEF6L34JSD4C2MTB234YSDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LASYEF6L34JSD4C2MTB234YSDA/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-03T09:17:01Z","links":{"resolver":"https://pith.science/pith/LASYEF6L34JSD4C2MTB234YSDA","bundle":"https://pith.science/pith/LASYEF6L34JSD4C2MTB234YSDA/bundle.json","state":"https://pith.science/pith/LASYEF6L34JSD4C2MTB234YSDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LASYEF6L34JSD4C2MTB234YSDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LASYEF6L34JSD4C2MTB234YSDA","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":"aea7bb96df6a2707199768550ad2d478956cda79d4067f66b41a9c6fd93c8439","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T04:20:24Z","title_canon_sha256":"3ca41ffe6b9be5d8d77508dd4848e5629ef4fe513362cfc87c797b6a0557cfe9"},"schema_version":"1.0","source":{"id":"1607.05396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05396","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05396v1","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05396","created_at":"2026-05-18T01:10:55Z"},{"alias_kind":"pith_short_12","alias_value":"LASYEF6L34JS","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LASYEF6L34JSD4C2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LASYEF6L","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:6a1ab8ea8464c2669ebd9c6d86cea77ffb67749420e72b826954508692f1e40a","target":"graph","created_at":"2026-05-18T01:10:55Z","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":"This paper proposes two approaches for inferencing binary codes in two-step (supervised, unsupervised) hashing. We first introduce an unified formulation for both supervised and unsupervised hashing. Then, we cast the learning of one bit as a Binary Quadratic Problem (BQP). We propose two approaches to solve BQP. In the first approach, we relax BQP as a semidefinite programming problem which its global optimum can be achieved. We theoretically prove that the objective value of the binary solution achieved by this approach is well bounded. In the second approach, we propose an augmented Lagrang","authors_text":"Anh-Dzung Doan, Duc-Thanh Nguyen, Ngai-Man Cheung, Thanh-Toan Do","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T04:20:24Z","title":"Binary Hashing with Semidefinite Relaxation and Augmented Lagrangian"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05396","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:80d11e4242673616a2653f46ee04a3203ab8e828160743a0eadd3d21ceccf8ee","target":"record","created_at":"2026-05-18T01:10:55Z","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":"aea7bb96df6a2707199768550ad2d478956cda79d4067f66b41a9c6fd93c8439","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T04:20:24Z","title_canon_sha256":"3ca41ffe6b9be5d8d77508dd4848e5629ef4fe513362cfc87c797b6a0557cfe9"},"schema_version":"1.0","source":{"id":"1607.05396","kind":"arxiv","version":1}},"canonical_sha256":"58258217cbdf1321f05a64c3adf312180a57d60c16a96f3073e4b7d57faff6af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58258217cbdf1321f05a64c3adf312180a57d60c16a96f3073e4b7d57faff6af","first_computed_at":"2026-05-18T01:10:55.100261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:55.100261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n8oTPVXx1wlikk0CsWSUJ/uTiU6eHD/8MN1sSbdhaDW0S5UmyaK9a9PkSiBxWY0jqqsfZfe15a30I0qtOy7cAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:55.100687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80d11e4242673616a2653f46ee04a3203ab8e828160743a0eadd3d21ceccf8ee","sha256:6a1ab8ea8464c2669ebd9c6d86cea77ffb67749420e72b826954508692f1e40a"],"state_sha256":"22333535c23100a64ad15eaf11644cd0c507420bb310bedad0c7f7aeb11fbc50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+r6H73xiHoXdTp32D1wnQzyqjqipHopcSdnReSywwtfH5PgeaVxPPIb1olhA8R3TtlFWdz8ktN1kIH9dt57CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:17:01.474210Z","bundle_sha256":"a4969ca9ddf74c63bdb2321c09af98c6e3ec30864e0defde24536baac21bbd72"}}