{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:USLLTRR5IKKA4WLICBLZ6T7E5X","short_pith_number":"pith:USLLTRR5","canonical_record":{"source":{"id":"1509.06557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-22T11:56:21Z","cross_cats_sorted":[],"title_canon_sha256":"d5c3f4c2be9ef081d2485d7fa572215c255c9f41da8736966980fa34eac21a56","abstract_canon_sha256":"7b0bae2b5cb9b41bec6f720143d7bec161d24869b9c341d7613a37f0d5561bea"},"schema_version":"1.0"},"canonical_sha256":"a496b9c63d42940e596810579f4fe4edd80fb31dcf95efeebeeda9db1ce96907","source":{"kind":"arxiv","id":"1509.06557","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06557","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06557v1","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06557","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"USLLTRR5IKKA","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"USLLTRR5IKKA4WLI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"USLLTRR5","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:USLLTRR5IKKA4WLICBLZ6T7E5X","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-22T11:56:21Z","cross_cats_sorted":[],"title_canon_sha256":"d5c3f4c2be9ef081d2485d7fa572215c255c9f41da8736966980fa34eac21a56","abstract_canon_sha256":"7b0bae2b5cb9b41bec6f720143d7bec161d24869b9c341d7613a37f0d5561bea"},"schema_version":"1.0"},"canonical_sha256":"a496b9c63d42940e596810579f4fe4edd80fb31dcf95efeebeeda9db1ce96907","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:45.817938Z","signature_b64":"MnS28RjOjFb7G0BubhFA7XjHYXaPFXVAz73RSG58I7Q7cnoGAsObZDZmq7onWm1wYBk+DzoWmfVbcGgK/4mGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a496b9c63d42940e596810579f4fe4edd80fb31dcf95efeebeeda9db1ce96907","last_reissued_at":"2026-05-18T01:28:45.817403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:45.817403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06557","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:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9AiQ1lrqDrFcOiArlNG4JTN0Af5B1+7Wo5E4o/s/n/blluWptTf3caXtjiLUt5f/X6EZ+pzbUcpbj/E8f06Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:39:15.782006Z"},"content_sha256":"261a3d17a7803099540c7b12d74d71c32d6a2ede20e834db3562c24ed9bf0ba1","schema_version":"1.0","event_id":"sha256:261a3d17a7803099540c7b12d74d71c32d6a2ede20e834db3562c24ed9bf0ba1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:USLLTRR5IKKA4WLICBLZ6T7E5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Multi-Grouped Binary Descriptor with Ring-based Pooling Configuration and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Weilin Huang, Yongqiang Gao, Yu Qiao","submitted_at":"2015-09-22T11:56:21Z","abstract_excerpt":"Local binary descriptors are attracting increasingly attention due to their great advantages in computational speed, which are able to achieve real-time performance in numerous image/vision applications. Various methods have been proposed to learn data-dependent binary descriptors. However, most existing binary descriptors aim overly at computational simplicity at the expense of significant information loss which causes ambiguity in similarity measure using Hamming distance. In this paper, by considering multiple features might share complementary information, we present a novel local binary d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06557","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:28:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQyJaVhPqH+LUFy2K1i/4xwevaQ6liiNvKI+UyKfYnle3kQVB/RB+xYkBpxzweMkEwxKGUW/CVVqhDv5utulBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:39:15.782945Z"},"content_sha256":"72ae47b1e5c65b6ab3c67200aef74b0bf7e1430b3b057832061c5f63de1616e6","schema_version":"1.0","event_id":"sha256:72ae47b1e5c65b6ab3c67200aef74b0bf7e1430b3b057832061c5f63de1616e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USLLTRR5IKKA4WLICBLZ6T7E5X/bundle.json","state_url":"https://pith.science/pith/USLLTRR5IKKA4WLICBLZ6T7E5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USLLTRR5IKKA4WLICBLZ6T7E5X/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-05T20:39:15Z","links":{"resolver":"https://pith.science/pith/USLLTRR5IKKA4WLICBLZ6T7E5X","bundle":"https://pith.science/pith/USLLTRR5IKKA4WLICBLZ6T7E5X/bundle.json","state":"https://pith.science/pith/USLLTRR5IKKA4WLICBLZ6T7E5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USLLTRR5IKKA4WLICBLZ6T7E5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:USLLTRR5IKKA4WLICBLZ6T7E5X","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":"7b0bae2b5cb9b41bec6f720143d7bec161d24869b9c341d7613a37f0d5561bea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-22T11:56:21Z","title_canon_sha256":"d5c3f4c2be9ef081d2485d7fa572215c255c9f41da8736966980fa34eac21a56"},"schema_version":"1.0","source":{"id":"1509.06557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06557","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06557v1","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06557","created_at":"2026-05-18T01:28:45Z"},{"alias_kind":"pith_short_12","alias_value":"USLLTRR5IKKA","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"USLLTRR5IKKA4WLI","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"USLLTRR5","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:72ae47b1e5c65b6ab3c67200aef74b0bf7e1430b3b057832061c5f63de1616e6","target":"graph","created_at":"2026-05-18T01:28:45Z","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":"Local binary descriptors are attracting increasingly attention due to their great advantages in computational speed, which are able to achieve real-time performance in numerous image/vision applications. Various methods have been proposed to learn data-dependent binary descriptors. However, most existing binary descriptors aim overly at computational simplicity at the expense of significant information loss which causes ambiguity in similarity measure using Hamming distance. In this paper, by considering multiple features might share complementary information, we present a novel local binary d","authors_text":"Weilin Huang, Yongqiang Gao, Yu Qiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-22T11:56:21Z","title":"Local Multi-Grouped Binary Descriptor with Ring-based Pooling Configuration and Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06557","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:261a3d17a7803099540c7b12d74d71c32d6a2ede20e834db3562c24ed9bf0ba1","target":"record","created_at":"2026-05-18T01:28:45Z","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":"7b0bae2b5cb9b41bec6f720143d7bec161d24869b9c341d7613a37f0d5561bea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-22T11:56:21Z","title_canon_sha256":"d5c3f4c2be9ef081d2485d7fa572215c255c9f41da8736966980fa34eac21a56"},"schema_version":"1.0","source":{"id":"1509.06557","kind":"arxiv","version":1}},"canonical_sha256":"a496b9c63d42940e596810579f4fe4edd80fb31dcf95efeebeeda9db1ce96907","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a496b9c63d42940e596810579f4fe4edd80fb31dcf95efeebeeda9db1ce96907","first_computed_at":"2026-05-18T01:28:45.817403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:45.817403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MnS28RjOjFb7G0BubhFA7XjHYXaPFXVAz73RSG58I7Q7cnoGAsObZDZmq7onWm1wYBk+DzoWmfVbcGgK/4mGDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:45.817938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:261a3d17a7803099540c7b12d74d71c32d6a2ede20e834db3562c24ed9bf0ba1","sha256:72ae47b1e5c65b6ab3c67200aef74b0bf7e1430b3b057832061c5f63de1616e6"],"state_sha256":"110e6a1b4d2c6e321ade54df03ed4f4feb294c1a648196207e13e39d81fe2f74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPkBU5Ej6459VPsPXkJJ6kAf4fmuuzG+Zld+vNGanCn0H7nldQvlJjSlo/H1SvVuybHIgcmkpHdyCge0zHmEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:39:15.786670Z","bundle_sha256":"4d32001a4cb0c866957ef8894beabbd2a3ea8f78ee3fe2de89e17618a8465699"}}