{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HJHUA6ZQFEYSD535ZFKOAMVGWV","short_pith_number":"pith:HJHUA6ZQ","canonical_record":{"source":{"id":"1601.06342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T03:32:22Z","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"title_canon_sha256":"213348675f6cb6f9780acfa9ed7a6b5cbb37cf5c8e30785bfa382fccbb3951ae","abstract_canon_sha256":"8a5a8b031abc901b14f3b4e792be7c07af12fdc8ab75bc426666b561aa7451a9"},"schema_version":"1.0"},"canonical_sha256":"3a4f407b30293121f77dc954e032a6b54d9a67a4317ae01fbf2479d4aafd2262","source":{"kind":"arxiv","id":"1601.06342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06342","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06342v1","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06342","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"HJHUA6ZQFEYS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJHUA6ZQFEYSD535","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJHUA6ZQ","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HJHUA6ZQFEYSD535ZFKOAMVGWV","target":"record","payload":{"canonical_record":{"source":{"id":"1601.06342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T03:32:22Z","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"title_canon_sha256":"213348675f6cb6f9780acfa9ed7a6b5cbb37cf5c8e30785bfa382fccbb3951ae","abstract_canon_sha256":"8a5a8b031abc901b14f3b4e792be7c07af12fdc8ab75bc426666b561aa7451a9"},"schema_version":"1.0"},"canonical_sha256":"3a4f407b30293121f77dc954e032a6b54d9a67a4317ae01fbf2479d4aafd2262","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:04.695975Z","signature_b64":"nNi3HQ5MDQzIlLTgj+8mj+csP8gISabzZhDMfG9Tb+mAsbDUqyuBLyzu7kxQzTeeT4gRc+A94TOzPeYIbXnzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a4f407b30293121f77dc954e032a6b54d9a67a4317ae01fbf2479d4aafd2262","last_reissued_at":"2026-05-18T01:22:04.695222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:04.695222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.06342","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:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0Lt+BL3RNpeb/pg2JS/paxeodp6wq0IyyH6W5ZjFlyWi7R6p3Z902x3hfJoOLzrBKrHcUU63RMTawtvsLfWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:35:01.208195Z"},"content_sha256":"ad091dc8eb930f2f9d1551ac3c6863701e3946f1f25ec487873f653eca3bb251","schema_version":"1.0","event_id":"sha256:ad091dc8eb930f2f9d1551ac3c6863701e3946f1f25ec487873f653eca3bb251"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HJHUA6ZQFEYSD535ZFKOAMVGWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Binary Embedding via Circulant Downsampled Matrix -- A Data-Independent Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Chun-Shien Lu, Soo-Chang Pei, Sung-Hsien Hsieh","submitted_at":"2016-01-24T03:32:22Z","abstract_excerpt":"Binary embedding of high-dimensional data aims to produce low-dimensional binary codes while preserving discriminative power. State-of-the-art methods often suffer from high computation and storage costs. We present a simple and fast embedding scheme by first downsampling N-dimensional data into M-dimensional data and then multiplying the data with an MxM circulant matrix. Our method requires O(N +M log M) computation and O(N) storage costs. We prove if data have sparsity, our scheme can achieve similarity-preserving well. Experiments further demonstrate that though our method is cost-effectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06342","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:22:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qOg5DRxxcrVfJm/qBBwKdaB1SpsubJguVFXCbaHD3Sj40RCrmy0pDBOLB/94lCHx4iAawMya5WdRv6OXsKoVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:35:01.208558Z"},"content_sha256":"2fd5a63550b97bb1651ed8f338cd1288829596cf37e3fbd414315f8cd69a35e6","schema_version":"1.0","event_id":"sha256:2fd5a63550b97bb1651ed8f338cd1288829596cf37e3fbd414315f8cd69a35e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJHUA6ZQFEYSD535ZFKOAMVGWV/bundle.json","state_url":"https://pith.science/pith/HJHUA6ZQFEYSD535ZFKOAMVGWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJHUA6ZQFEYSD535ZFKOAMVGWV/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-26T13:35:01Z","links":{"resolver":"https://pith.science/pith/HJHUA6ZQFEYSD535ZFKOAMVGWV","bundle":"https://pith.science/pith/HJHUA6ZQFEYSD535ZFKOAMVGWV/bundle.json","state":"https://pith.science/pith/HJHUA6ZQFEYSD535ZFKOAMVGWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJHUA6ZQFEYSD535ZFKOAMVGWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HJHUA6ZQFEYSD535ZFKOAMVGWV","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":"8a5a8b031abc901b14f3b4e792be7c07af12fdc8ab75bc426666b561aa7451a9","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T03:32:22Z","title_canon_sha256":"213348675f6cb6f9780acfa9ed7a6b5cbb37cf5c8e30785bfa382fccbb3951ae"},"schema_version":"1.0","source":{"id":"1601.06342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.06342","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"arxiv_version","alias_value":"1601.06342v1","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.06342","created_at":"2026-05-18T01:22:04Z"},{"alias_kind":"pith_short_12","alias_value":"HJHUA6ZQFEYS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJHUA6ZQFEYSD535","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJHUA6ZQ","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:2fd5a63550b97bb1651ed8f338cd1288829596cf37e3fbd414315f8cd69a35e6","target":"graph","created_at":"2026-05-18T01:22:04Z","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 embedding of high-dimensional data aims to produce low-dimensional binary codes while preserving discriminative power. State-of-the-art methods often suffer from high computation and storage costs. We present a simple and fast embedding scheme by first downsampling N-dimensional data into M-dimensional data and then multiplying the data with an MxM circulant matrix. Our method requires O(N +M log M) computation and O(N) storage costs. We prove if data have sparsity, our scheme can achieve similarity-preserving well. Experiments further demonstrate that though our method is cost-effectiv","authors_text":"Chun-Shien Lu, Soo-Chang Pei, Sung-Hsien Hsieh","cross_cats":["cs.CV","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T03:32:22Z","title":"Fast Binary Embedding via Circulant Downsampled Matrix -- A Data-Independent Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.06342","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:ad091dc8eb930f2f9d1551ac3c6863701e3946f1f25ec487873f653eca3bb251","target":"record","created_at":"2026-05-18T01:22:04Z","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":"8a5a8b031abc901b14f3b4e792be7c07af12fdc8ab75bc426666b561aa7451a9","cross_cats_sorted":["cs.CV","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-24T03:32:22Z","title_canon_sha256":"213348675f6cb6f9780acfa9ed7a6b5cbb37cf5c8e30785bfa382fccbb3951ae"},"schema_version":"1.0","source":{"id":"1601.06342","kind":"arxiv","version":1}},"canonical_sha256":"3a4f407b30293121f77dc954e032a6b54d9a67a4317ae01fbf2479d4aafd2262","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a4f407b30293121f77dc954e032a6b54d9a67a4317ae01fbf2479d4aafd2262","first_computed_at":"2026-05-18T01:22:04.695222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:04.695222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nNi3HQ5MDQzIlLTgj+8mj+csP8gISabzZhDMfG9Tb+mAsbDUqyuBLyzu7kxQzTeeT4gRc+A94TOzPeYIbXnzBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:04.695975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.06342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad091dc8eb930f2f9d1551ac3c6863701e3946f1f25ec487873f653eca3bb251","sha256:2fd5a63550b97bb1651ed8f338cd1288829596cf37e3fbd414315f8cd69a35e6"],"state_sha256":"8bcfe8db4a387cdf20314ff8ce3016f57c3e2031842124c6d25aa68d418fed70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"srOc8xnyguS6U72hxwJ0NmBiEPxiyZXsQRYdk9cbsxGimfJrLAuhkSj4t0WiWCOiKtOR5gl/RirobW2sesabCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:35:01.210478Z","bundle_sha256":"9431a8e708e0e37ab346b6ff86323ded45420e7d5c2bcf1cfc1ce1125d7bc50f"}}