{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ST6HGADQPEJBZE5E5I5TDXFMZS","short_pith_number":"pith:ST6HGADQ","canonical_record":{"source":{"id":"1806.08658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T18:06:55Z","cross_cats_sorted":["cs.CR","cs.DB","cs.DC","cs.DS","math.IT"],"title_canon_sha256":"868bd75078df937e845b52eca1ca9269ae83cf2e4b405195fe5e6503ff8c5484","abstract_canon_sha256":"34b31887c7c0325b453fd5a36eae9e15b4fe43f3a4126986e62d0de6c3363833"},"schema_version":"1.0"},"canonical_sha256":"94fc73007079121c93a4ea3b31dcaccca4a53d1ddf6ca2260b07a555eb5656c3","source":{"kind":"arxiv","id":"1806.08658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08658","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08658v1","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08658","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"ST6HGADQPEJB","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"ST6HGADQPEJBZE5E","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"ST6HGADQ","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ST6HGADQPEJBZE5E5I5TDXFMZS","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T18:06:55Z","cross_cats_sorted":["cs.CR","cs.DB","cs.DC","cs.DS","math.IT"],"title_canon_sha256":"868bd75078df937e845b52eca1ca9269ae83cf2e4b405195fe5e6503ff8c5484","abstract_canon_sha256":"34b31887c7c0325b453fd5a36eae9e15b4fe43f3a4126986e62d0de6c3363833"},"schema_version":"1.0"},"canonical_sha256":"94fc73007079121c93a4ea3b31dcaccca4a53d1ddf6ca2260b07a555eb5656c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:36.545726Z","signature_b64":"9kaxVtI5xwEoeb5/5Hj7qxX9dRVpzh49HniwKYfwbTK0gnuDXHq3Eg0zwGrXogXk/2EWLQ8gdPQ7tmZMuGcVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94fc73007079121c93a4ea3b31dcaccca4a53d1ddf6ca2260b07a555eb5656c3","last_reissued_at":"2026-05-18T00:12:36.545156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:36.545156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08658","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-18T00:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FCeBr8Ti8zo9Br0ZqcLt2hQRVoSUnUPV/a7ONnDhwA14AmCWS1theBCeiTSpDphCV5CB9fE2GlqhwpRL8f+nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:17:41.171549Z"},"content_sha256":"4fde149efbb80c33fecc086351d46a08e38acc05b52720412a6e5d6094ecb219","schema_version":"1.0","event_id":"sha256:4fde149efbb80c33fecc086351d46a08e38acc05b52720412a6e5d6094ecb219"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ST6HGADQPEJBZE5E5I5TDXFMZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Privacy-Preserving Identification via Layered Sparse Code Design: Distributed Servers and Multiple Access Authorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DB","cs.DC","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Razeghi, Dimche Kostadinov, Slava Voloshynovskiy, Sohrab Ferdowsi","submitted_at":"2018-06-07T18:06:55Z","abstract_excerpt":"We propose a new computationally efficient privacy-preserving identification framework based on layered sparse coding. The key idea of the proposed framework is a sparsifying transform learning with ambiguization, which consists of a trained linear map, a component-wise nonlinearity and a privacy amplification. We introduce a practical identification framework, which consists of two phases: public and private identification. The public untrusted server provides the fast search service based on the sparse privacy protected codebook stored at its side. The private trusted server or the local cli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08658","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-18T00:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2icavbOmmpXoR+e9bkNSK0uzhTATwWNOs4W/WaxwBMXJqxDJ7SROYqLn9SMfTxARQtmbCAEgV7FkGwt8XubAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:17:41.171904Z"},"content_sha256":"f003ad81d251164d2e81a9dc5963a8041c49c18e04c52c29b8a5085f4b250d70","schema_version":"1.0","event_id":"sha256:f003ad81d251164d2e81a9dc5963a8041c49c18e04c52c29b8a5085f4b250d70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ST6HGADQPEJBZE5E5I5TDXFMZS/bundle.json","state_url":"https://pith.science/pith/ST6HGADQPEJBZE5E5I5TDXFMZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ST6HGADQPEJBZE5E5I5TDXFMZS/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-31T22:17:41Z","links":{"resolver":"https://pith.science/pith/ST6HGADQPEJBZE5E5I5TDXFMZS","bundle":"https://pith.science/pith/ST6HGADQPEJBZE5E5I5TDXFMZS/bundle.json","state":"https://pith.science/pith/ST6HGADQPEJBZE5E5I5TDXFMZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ST6HGADQPEJBZE5E5I5TDXFMZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ST6HGADQPEJBZE5E5I5TDXFMZS","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":"34b31887c7c0325b453fd5a36eae9e15b4fe43f3a4126986e62d0de6c3363833","cross_cats_sorted":["cs.CR","cs.DB","cs.DC","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T18:06:55Z","title_canon_sha256":"868bd75078df937e845b52eca1ca9269ae83cf2e4b405195fe5e6503ff8c5484"},"schema_version":"1.0","source":{"id":"1806.08658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08658","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08658v1","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08658","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"ST6HGADQPEJB","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"ST6HGADQPEJBZE5E","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"ST6HGADQ","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:f003ad81d251164d2e81a9dc5963a8041c49c18e04c52c29b8a5085f4b250d70","target":"graph","created_at":"2026-05-18T00:12:36Z","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":"We propose a new computationally efficient privacy-preserving identification framework based on layered sparse coding. The key idea of the proposed framework is a sparsifying transform learning with ambiguization, which consists of a trained linear map, a component-wise nonlinearity and a privacy amplification. We introduce a practical identification framework, which consists of two phases: public and private identification. The public untrusted server provides the fast search service based on the sparse privacy protected codebook stored at its side. The private trusted server or the local cli","authors_text":"Behrooz Razeghi, Dimche Kostadinov, Slava Voloshynovskiy, Sohrab Ferdowsi","cross_cats":["cs.CR","cs.DB","cs.DC","cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T18:06:55Z","title":"Privacy-Preserving Identification via Layered Sparse Code Design: Distributed Servers and Multiple Access Authorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08658","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:4fde149efbb80c33fecc086351d46a08e38acc05b52720412a6e5d6094ecb219","target":"record","created_at":"2026-05-18T00:12:36Z","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":"34b31887c7c0325b453fd5a36eae9e15b4fe43f3a4126986e62d0de6c3363833","cross_cats_sorted":["cs.CR","cs.DB","cs.DC","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T18:06:55Z","title_canon_sha256":"868bd75078df937e845b52eca1ca9269ae83cf2e4b405195fe5e6503ff8c5484"},"schema_version":"1.0","source":{"id":"1806.08658","kind":"arxiv","version":1}},"canonical_sha256":"94fc73007079121c93a4ea3b31dcaccca4a53d1ddf6ca2260b07a555eb5656c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94fc73007079121c93a4ea3b31dcaccca4a53d1ddf6ca2260b07a555eb5656c3","first_computed_at":"2026-05-18T00:12:36.545156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:36.545156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9kaxVtI5xwEoeb5/5Hj7qxX9dRVpzh49HniwKYfwbTK0gnuDXHq3Eg0zwGrXogXk/2EWLQ8gdPQ7tmZMuGcVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:36.545726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fde149efbb80c33fecc086351d46a08e38acc05b52720412a6e5d6094ecb219","sha256:f003ad81d251164d2e81a9dc5963a8041c49c18e04c52c29b8a5085f4b250d70"],"state_sha256":"996d8b90e8a3dac9717d750ddbde60527807ed9792fec13b148410bd2e9b88da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAEvNpTSw2valGFTkfM+Ku+Avs5Gw7zmoK8Y+IpzyeiAkbgQIH+7PEjF9Vi5C4+nSVriQABDzxolaePEzsQeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:17:41.174297Z","bundle_sha256":"319a1726c0281e9f260d96170aab41c6509d99dafa2dd518806bf5daa6bbceaf"}}