{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LSW33GE4NUT2NABKQUFYVN6BJL","short_pith_number":"pith:LSW33GE4","canonical_record":{"source":{"id":"1603.08810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-29T15:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"d83c8b13910f52dbf7c6a2d53dbf17f57705b1fc29c9dbc9208c0901afb41f82","abstract_canon_sha256":"0abd0dc649caacaebb91ea9071f07ef48cacebc6667bdbc01ce696704fc73bf2"},"schema_version":"1.0"},"canonical_sha256":"5cadbd989c6d27a6802a850b8ab7c14ac554d9fa54e84abb00a9fa6bc37c2a35","source":{"kind":"arxiv","id":"1603.08810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08810","created_at":"2026-05-18T01:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08810v1","created_at":"2026-05-18T01:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08810","created_at":"2026-05-18T01:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"LSW33GE4NUT2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSW33GE4NUT2NABK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSW33GE4","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LSW33GE4NUT2NABKQUFYVN6BJL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-29T15:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"d83c8b13910f52dbf7c6a2d53dbf17f57705b1fc29c9dbc9208c0901afb41f82","abstract_canon_sha256":"0abd0dc649caacaebb91ea9071f07ef48cacebc6667bdbc01ce696704fc73bf2"},"schema_version":"1.0"},"canonical_sha256":"5cadbd989c6d27a6802a850b8ab7c14ac554d9fa54e84abb00a9fa6bc37c2a35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:05.277737Z","signature_b64":"kxblB23kzCls8Sw9kEhCcfIaXvCJj+DHOl85himtKNQY54Kw7yo1NVLpIJrdFjSrm9boFygbLWc58K1LFeYMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cadbd989c6d27a6802a850b8ab7c14ac554d9fa54e84abb00a9fa6bc37c2a35","last_reissued_at":"2026-05-18T01:18:05.276983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:05.276983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08810","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:18:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JtL6CVLnhgQCmSMiucg8VPlUJAbLiaH2ALfeEoKTZicdCI26ObsjXkfYNj9VK4sxBrCUO4vE+X6BpQw8tU4VCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:47:56.263558Z"},"content_sha256":"2d92a51d5a2765c0b81e62bcbf620db20002899c50b5008255d57fdaf29e321e","schema_version":"1.0","event_id":"sha256:2d92a51d5a2765c0b81e62bcbf620db20002899c50b5008255d57fdaf29e321e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LSW33GE4NUT2NABKQUFYVN6BJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Solution for Approximate Nearest Subspace Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Koichi Kise, Masakazu Iwamura, Masataka Konishi","submitted_at":"2016-03-29T15:24:43Z","abstract_excerpt":"Finding the nearest subspace is a fundamental problem and influential to many applications. In particular, a scalable solution that is fast and accurate for a large problem has a great impact. The existing methods for the problem are, however, useless in a large-scale problem with a large number of subspaces and high dimensionality of the feature space. A cause is that they are designed based on the traditional idea to represent a subspace by a single point. In this paper, we propose a scalable solution for the approximate nearest subspace search (ANSS) problem. Intuitively, the proposed metho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08810","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:18:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t10XJIokaclhr/ALNpcs6DisndmBloLDpSv/qlSoD6yP6okWVhMwX2TS5BUZ9lmErLT32Djn7IKt/TogGLnrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:47:56.264191Z"},"content_sha256":"fa58280670a2003101bf6ad1001ba421d191e2f726ca2cf2785d676bfd6dcad6","schema_version":"1.0","event_id":"sha256:fa58280670a2003101bf6ad1001ba421d191e2f726ca2cf2785d676bfd6dcad6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSW33GE4NUT2NABKQUFYVN6BJL/bundle.json","state_url":"https://pith.science/pith/LSW33GE4NUT2NABKQUFYVN6BJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSW33GE4NUT2NABKQUFYVN6BJL/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-05-31T09:47:56Z","links":{"resolver":"https://pith.science/pith/LSW33GE4NUT2NABKQUFYVN6BJL","bundle":"https://pith.science/pith/LSW33GE4NUT2NABKQUFYVN6BJL/bundle.json","state":"https://pith.science/pith/LSW33GE4NUT2NABKQUFYVN6BJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSW33GE4NUT2NABKQUFYVN6BJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LSW33GE4NUT2NABKQUFYVN6BJL","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":"0abd0dc649caacaebb91ea9071f07ef48cacebc6667bdbc01ce696704fc73bf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-29T15:24:43Z","title_canon_sha256":"d83c8b13910f52dbf7c6a2d53dbf17f57705b1fc29c9dbc9208c0901afb41f82"},"schema_version":"1.0","source":{"id":"1603.08810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08810","created_at":"2026-05-18T01:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08810v1","created_at":"2026-05-18T01:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08810","created_at":"2026-05-18T01:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"LSW33GE4NUT2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSW33GE4NUT2NABK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSW33GE4","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:fa58280670a2003101bf6ad1001ba421d191e2f726ca2cf2785d676bfd6dcad6","target":"graph","created_at":"2026-05-18T01:18:05Z","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":"Finding the nearest subspace is a fundamental problem and influential to many applications. In particular, a scalable solution that is fast and accurate for a large problem has a great impact. The existing methods for the problem are, however, useless in a large-scale problem with a large number of subspaces and high dimensionality of the feature space. A cause is that they are designed based on the traditional idea to represent a subspace by a single point. In this paper, we propose a scalable solution for the approximate nearest subspace search (ANSS) problem. Intuitively, the proposed metho","authors_text":"Koichi Kise, Masakazu Iwamura, Masataka Konishi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-29T15:24:43Z","title":"Scalable Solution for Approximate Nearest Subspace Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08810","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:2d92a51d5a2765c0b81e62bcbf620db20002899c50b5008255d57fdaf29e321e","target":"record","created_at":"2026-05-18T01:18:05Z","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":"0abd0dc649caacaebb91ea9071f07ef48cacebc6667bdbc01ce696704fc73bf2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-29T15:24:43Z","title_canon_sha256":"d83c8b13910f52dbf7c6a2d53dbf17f57705b1fc29c9dbc9208c0901afb41f82"},"schema_version":"1.0","source":{"id":"1603.08810","kind":"arxiv","version":1}},"canonical_sha256":"5cadbd989c6d27a6802a850b8ab7c14ac554d9fa54e84abb00a9fa6bc37c2a35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cadbd989c6d27a6802a850b8ab7c14ac554d9fa54e84abb00a9fa6bc37c2a35","first_computed_at":"2026-05-18T01:18:05.276983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:05.276983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kxblB23kzCls8Sw9kEhCcfIaXvCJj+DHOl85himtKNQY54Kw7yo1NVLpIJrdFjSrm9boFygbLWc58K1LFeYMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:05.277737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d92a51d5a2765c0b81e62bcbf620db20002899c50b5008255d57fdaf29e321e","sha256:fa58280670a2003101bf6ad1001ba421d191e2f726ca2cf2785d676bfd6dcad6"],"state_sha256":"f3bb12583e2d54cb4985359cd7c2a9736da84e4cf3614d96d7e3898b6f5cff4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jgH2vyIRTpiv9V5TTKNnkYv2mtP8uwdh7eAzPWEPs9b4U+EqNdtWdXHUDXJHenuHEKQjL8a6NOj0+7ROfht6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:47:56.267196Z","bundle_sha256":"24b8279167f3a12e361f8e346b0c3131ae2c66b09dbf393cdeb2b0fadf98357c"}}