{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L2EARY5EVJRCPJKZFX4KA5EQKY","short_pith_number":"pith:L2EARY5E","schema_version":"1.0","canonical_sha256":"5e8808e3a4aa6227a5592df8a07490560e78e20f99e09fd4371d115a7d268aaa","source":{"kind":"arxiv","id":"1509.04916","version":1},"attestation_state":"computed","paper":{"title":"Projection Bank: From High-dimensional Data to Medium-length Binary Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Li Liu, Ling Shao, Mengyang Yu","submitted_at":"2015-09-16T13:42:42Z","abstract_excerpt":"Recently, very high-dimensional feature representations, e.g., Fisher Vector, have achieved excellent performance for visual recognition and retrieval. However, these lengthy representations always cause extremely heavy computational and storage costs and even become unfeasible in some large-scale applications. A few existing techniques can transfer very high-dimensional data into binary codes, but they still require the reduced code length to be relatively long to maintain acceptable accuracies. To target a better balance between computational efficiency and accuracies, in this paper, we prop"},"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":"1509.04916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-16T13:42:42Z","cross_cats_sorted":[],"title_canon_sha256":"00b55c4a05091c87244dedbc3a186adfe98b933a0b459898db9fa4c2fa744744","abstract_canon_sha256":"58aef1f0d494711d6f6ab6632324535cab209f85b45d7d6e9166ccb62cc55f45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:51.353032Z","signature_b64":"eLFbE9Kr7Dl0HbubT/aE4E/Tv9nUesxX7Hj1VIhfmYcQLS5ELEelnozC1WkV7o2fmCFFQHmfdXxT6BBFOnsHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e8808e3a4aa6227a5592df8a07490560e78e20f99e09fd4371d115a7d268aaa","last_reissued_at":"2026-05-18T01:32:51.352469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:51.352469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection Bank: From High-dimensional Data to Medium-length Binary Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Li Liu, Ling Shao, Mengyang Yu","submitted_at":"2015-09-16T13:42:42Z","abstract_excerpt":"Recently, very high-dimensional feature representations, e.g., Fisher Vector, have achieved excellent performance for visual recognition and retrieval. However, these lengthy representations always cause extremely heavy computational and storage costs and even become unfeasible in some large-scale applications. A few existing techniques can transfer very high-dimensional data into binary codes, but they still require the reduced code length to be relatively long to maintain acceptable accuracies. To target a better balance between computational efficiency and accuracies, in this paper, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04916","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":"1509.04916","created_at":"2026-05-18T01:32:51.352551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04916v1","created_at":"2026-05-18T01:32:51.352551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04916","created_at":"2026-05-18T01:32:51.352551+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2EARY5EVJRC","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2EARY5EVJRCPJKZ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2EARY5E","created_at":"2026-05-18T12:29:29.992203+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/L2EARY5EVJRCPJKZFX4KA5EQKY","json":"https://pith.science/pith/L2EARY5EVJRCPJKZFX4KA5EQKY.json","graph_json":"https://pith.science/api/pith-number/L2EARY5EVJRCPJKZFX4KA5EQKY/graph.json","events_json":"https://pith.science/api/pith-number/L2EARY5EVJRCPJKZFX4KA5EQKY/events.json","paper":"https://pith.science/paper/L2EARY5E"},"agent_actions":{"view_html":"https://pith.science/pith/L2EARY5EVJRCPJKZFX4KA5EQKY","download_json":"https://pith.science/pith/L2EARY5EVJRCPJKZFX4KA5EQKY.json","view_paper":"https://pith.science/paper/L2EARY5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04916&json=true","fetch_graph":"https://pith.science/api/pith-number/L2EARY5EVJRCPJKZFX4KA5EQKY/graph.json","fetch_events":"https://pith.science/api/pith-number/L2EARY5EVJRCPJKZFX4KA5EQKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2EARY5EVJRCPJKZFX4KA5EQKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2EARY5EVJRCPJKZFX4KA5EQKY/action/storage_attestation","attest_author":"https://pith.science/pith/L2EARY5EVJRCPJKZFX4KA5EQKY/action/author_attestation","sign_citation":"https://pith.science/pith/L2EARY5EVJRCPJKZFX4KA5EQKY/action/citation_signature","submit_replication":"https://pith.science/pith/L2EARY5EVJRCPJKZFX4KA5EQKY/action/replication_record"}},"created_at":"2026-05-18T01:32:51.352551+00:00","updated_at":"2026-05-18T01:32:51.352551+00:00"}