{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NB4OFQPO65WB7YOAJUWINHDCU6","short_pith_number":"pith:NB4OFQPO","canonical_record":{"source":{"id":"1602.04502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-14T20:24:57Z","cross_cats_sorted":[],"title_canon_sha256":"57791b017ce998ce02e58bf95bea70569b3c12c4cd3ce58da3f6f8266de1cb95","abstract_canon_sha256":"c335a832dcc5014b03eb22b53e8eeb8eaad740a253a9131b82dec75c3724978c"},"schema_version":"1.0"},"canonical_sha256":"6878e2c1eef76c1fe1c04d2c869c62a7a472a8c3769ff9e69e1ce53b69afd4ed","source":{"kind":"arxiv","id":"1602.04502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04502","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04502v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04502","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"NB4OFQPO65WB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NB4OFQPO65WB7YOA","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NB4OFQPO","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NB4OFQPO65WB7YOAJUWINHDCU6","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-14T20:24:57Z","cross_cats_sorted":[],"title_canon_sha256":"57791b017ce998ce02e58bf95bea70569b3c12c4cd3ce58da3f6f8266de1cb95","abstract_canon_sha256":"c335a832dcc5014b03eb22b53e8eeb8eaad740a253a9131b82dec75c3724978c"},"schema_version":"1.0"},"canonical_sha256":"6878e2c1eef76c1fe1c04d2c869c62a7a472a8c3769ff9e69e1ce53b69afd4ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:49.786586Z","signature_b64":"Mg37MbVR3BdUQsSMv7oq6C9B3/XoLSaQjErtRi7RLIPVRd0zeM6lvnbyUOBVY7kyeIK8oWx2Knsc6jB4ZWoVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6878e2c1eef76c1fe1c04d2c869c62a7a472a8c3769ff9e69e1ce53b69afd4ed","last_reissued_at":"2026-05-18T01:20:49.786094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:49.786094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04502","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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8R/bGwsfv4TO9FAZLrxefqMQxYg3JUI3WCeWCES4CX8srbEXZIBjB7WJCHsI/rlLtFdXg32hXeAQmrLjChDCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:33:35.859180Z"},"content_sha256":"cf41ecb654db1351ee6b016d28094fa14accd7726853ba6e309b4a12276efd69","schema_version":"1.0","event_id":"sha256:cf41ecb654db1351ee6b016d28094fa14accd7726853ba6e309b4a12276efd69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NB4OFQPO65WB7YOAJUWINHDCU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Do We Need Binary Features for 3D Reconstruction?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bin Fan, Chunhong Pan, Pascal Fua, Qingqun Kong, Shiming Xiang, Wei Sui, Xinchao Wang, Zhiheng Wang","submitted_at":"2016-02-14T20:24:57Z","abstract_excerpt":"Binary features have been incrementally popular in the past few years due to their low memory footprints and the efficient computation of Hamming distance between binary descriptors. They have been shown with promising results on some real time applications, e.g., SLAM, where the matching operations are relative few. However, in computer vision, there are many applications such as 3D reconstruction requiring lots of matching operations between local features. Therefore, a natural question is that is the binary feature still a promising solution to this kind of applications? To get the answer, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04502","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:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K8csC6sWuC9W3f14DFuCn6EOvr6y0CaVXnk3lz4WQinW6ejRdzL2J7cBMyeH3/RtQO/c94RzQENHbaOKyZt4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:33:35.859952Z"},"content_sha256":"39cc2de9f2a2a06c7fc1f21fbfe27cee96ef476b4cf15a1acd07026984b57d37","schema_version":"1.0","event_id":"sha256:39cc2de9f2a2a06c7fc1f21fbfe27cee96ef476b4cf15a1acd07026984b57d37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NB4OFQPO65WB7YOAJUWINHDCU6/bundle.json","state_url":"https://pith.science/pith/NB4OFQPO65WB7YOAJUWINHDCU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NB4OFQPO65WB7YOAJUWINHDCU6/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-10T23:33:35Z","links":{"resolver":"https://pith.science/pith/NB4OFQPO65WB7YOAJUWINHDCU6","bundle":"https://pith.science/pith/NB4OFQPO65WB7YOAJUWINHDCU6/bundle.json","state":"https://pith.science/pith/NB4OFQPO65WB7YOAJUWINHDCU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NB4OFQPO65WB7YOAJUWINHDCU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NB4OFQPO65WB7YOAJUWINHDCU6","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":"c335a832dcc5014b03eb22b53e8eeb8eaad740a253a9131b82dec75c3724978c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-14T20:24:57Z","title_canon_sha256":"57791b017ce998ce02e58bf95bea70569b3c12c4cd3ce58da3f6f8266de1cb95"},"schema_version":"1.0","source":{"id":"1602.04502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04502","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04502v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04502","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"NB4OFQPO65WB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NB4OFQPO65WB7YOA","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NB4OFQPO","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:39cc2de9f2a2a06c7fc1f21fbfe27cee96ef476b4cf15a1acd07026984b57d37","target":"graph","created_at":"2026-05-18T01:20:49Z","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":"Binary features have been incrementally popular in the past few years due to their low memory footprints and the efficient computation of Hamming distance between binary descriptors. They have been shown with promising results on some real time applications, e.g., SLAM, where the matching operations are relative few. However, in computer vision, there are many applications such as 3D reconstruction requiring lots of matching operations between local features. Therefore, a natural question is that is the binary feature still a promising solution to this kind of applications? To get the answer, ","authors_text":"Bin Fan, Chunhong Pan, Pascal Fua, Qingqun Kong, Shiming Xiang, Wei Sui, Xinchao Wang, Zhiheng Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-14T20:24:57Z","title":"Do We Need Binary Features for 3D Reconstruction?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04502","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:cf41ecb654db1351ee6b016d28094fa14accd7726853ba6e309b4a12276efd69","target":"record","created_at":"2026-05-18T01:20:49Z","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":"c335a832dcc5014b03eb22b53e8eeb8eaad740a253a9131b82dec75c3724978c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-14T20:24:57Z","title_canon_sha256":"57791b017ce998ce02e58bf95bea70569b3c12c4cd3ce58da3f6f8266de1cb95"},"schema_version":"1.0","source":{"id":"1602.04502","kind":"arxiv","version":1}},"canonical_sha256":"6878e2c1eef76c1fe1c04d2c869c62a7a472a8c3769ff9e69e1ce53b69afd4ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6878e2c1eef76c1fe1c04d2c869c62a7a472a8c3769ff9e69e1ce53b69afd4ed","first_computed_at":"2026-05-18T01:20:49.786094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:49.786094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mg37MbVR3BdUQsSMv7oq6C9B3/XoLSaQjErtRi7RLIPVRd0zeM6lvnbyUOBVY7kyeIK8oWx2Knsc6jB4ZWoVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:49.786586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf41ecb654db1351ee6b016d28094fa14accd7726853ba6e309b4a12276efd69","sha256:39cc2de9f2a2a06c7fc1f21fbfe27cee96ef476b4cf15a1acd07026984b57d37"],"state_sha256":"30b4ad919de155deebf97f951ad4d27c5e670a08a4a3eca685ff06f941f8c060"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcuop8SJdu0+koOhTdud0JM5P9oo9TpkFcojrGcJ7evRGsKDpf3YB4McVYbB/+2A+jlPrsdK4T+34fEELBAZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:33:35.863812Z","bundle_sha256":"d98ed97a84f97c5fbafbdfb582994d0baf034e76d1adb469f636e1dce1f2c303"}}