{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DUNINRXP5PKVHQPUEGUBKVSY3H","short_pith_number":"pith:DUNINRXP","canonical_record":{"source":{"id":"1307.6609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-24T23:37:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c513629e8cda2aa4313613147c5c026c373d7ea3cecd9928fbae178f48dff90f","abstract_canon_sha256":"37f7a863a91b9fc158a173c0b3b838315c172705e452073866748a714b745aca"},"schema_version":"1.0"},"canonical_sha256":"1d1a86c6efebd553c1f421a8155658d9fd2f9effa5c94f7ab2bf26e6b8cbbad9","source":{"kind":"arxiv","id":"1307.6609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6609","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6609v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6609","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"DUNINRXP5PKV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DUNINRXP5PKVHQPU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DUNINRXP","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DUNINRXP5PKVHQPUEGUBKVSY3H","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-24T23:37:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c513629e8cda2aa4313613147c5c026c373d7ea3cecd9928fbae178f48dff90f","abstract_canon_sha256":"37f7a863a91b9fc158a173c0b3b838315c172705e452073866748a714b745aca"},"schema_version":"1.0"},"canonical_sha256":"1d1a86c6efebd553c1f421a8155658d9fd2f9effa5c94f7ab2bf26e6b8cbbad9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.267225Z","signature_b64":"7RKwgVgsSLIWfvWOSfUFEg8okCMIjqc/wq0PyrO+Z250wmJJV4GE8LL2QlASGa31nTO/Avsg5KzB6RyGIpAKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d1a86c6efebd553c1f421a8155658d9fd2f9effa5c94f7ab2bf26e6b8cbbad9","last_reissued_at":"2026-05-18T00:57:56.266856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.266856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6609","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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfoQQ//uj8Ybc15qS+bBWBBelJC0ZiVUs/5PWEvEv4I6IueW5ZRFBO3sneTEQVgdlS0WH7OVi7S2UFnTZcGqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:39:00.573755Z"},"content_sha256":"48d0047a046e83e61593ffe0c7331e15a970d32fb677a6c099e728cb34629aea","schema_version":"1.0","event_id":"sha256:48d0047a046e83e61593ffe0c7331e15a970d32fb677a6c099e728cb34629aea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DUNINRXP5PKVHQPUEGUBKVSY3H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compression for Quadratic Similarity Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Ingber, Thomas Courtade, Tsachy Weissman","submitted_at":"2013-07-24T23:37:01Z","abstract_excerpt":"The problem of performing similarity queries on compressed data is considered. We focus on the quadratic similarity measure, and study the fundamental tradeoff between compression rate, sequence length, and reliability of queries performed on compressed data. For a Gaussian source, we show that queries can be answered reliably if and only if the compression rate exceeds a given threshold - the identification rate - which we explicitly characterize. Moreover, when compression is performed at a rate greater than the identification rate, responses to queries on the compressed data can be made exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6609","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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtHYmOSJK00a+9HVz5os2Ai19sJ0bk9TZ/++F3egufuxnlClpP4w2qemOZ1axqduNhbyMLpDPgV19CcumosYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:39:00.574605Z"},"content_sha256":"671be20d2ebff77bbef7ffb7f13d7f5122c0790c1a2e039faca8099f6ac3f02b","schema_version":"1.0","event_id":"sha256:671be20d2ebff77bbef7ffb7f13d7f5122c0790c1a2e039faca8099f6ac3f02b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUNINRXP5PKVHQPUEGUBKVSY3H/bundle.json","state_url":"https://pith.science/pith/DUNINRXP5PKVHQPUEGUBKVSY3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUNINRXP5PKVHQPUEGUBKVSY3H/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-31T23:39:00Z","links":{"resolver":"https://pith.science/pith/DUNINRXP5PKVHQPUEGUBKVSY3H","bundle":"https://pith.science/pith/DUNINRXP5PKVHQPUEGUBKVSY3H/bundle.json","state":"https://pith.science/pith/DUNINRXP5PKVHQPUEGUBKVSY3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUNINRXP5PKVHQPUEGUBKVSY3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DUNINRXP5PKVHQPUEGUBKVSY3H","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":"37f7a863a91b9fc158a173c0b3b838315c172705e452073866748a714b745aca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-24T23:37:01Z","title_canon_sha256":"c513629e8cda2aa4313613147c5c026c373d7ea3cecd9928fbae178f48dff90f"},"schema_version":"1.0","source":{"id":"1307.6609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6609","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6609v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6609","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"DUNINRXP5PKV","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DUNINRXP5PKVHQPU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DUNINRXP","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:671be20d2ebff77bbef7ffb7f13d7f5122c0790c1a2e039faca8099f6ac3f02b","target":"graph","created_at":"2026-05-18T00:57:56Z","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":"The problem of performing similarity queries on compressed data is considered. We focus on the quadratic similarity measure, and study the fundamental tradeoff between compression rate, sequence length, and reliability of queries performed on compressed data. For a Gaussian source, we show that queries can be answered reliably if and only if the compression rate exceeds a given threshold - the identification rate - which we explicitly characterize. Moreover, when compression is performed at a rate greater than the identification rate, responses to queries on the compressed data can be made exp","authors_text":"Amir Ingber, Thomas Courtade, Tsachy Weissman","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-24T23:37:01Z","title":"Compression for Quadratic Similarity Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6609","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:48d0047a046e83e61593ffe0c7331e15a970d32fb677a6c099e728cb34629aea","target":"record","created_at":"2026-05-18T00:57:56Z","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":"37f7a863a91b9fc158a173c0b3b838315c172705e452073866748a714b745aca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-24T23:37:01Z","title_canon_sha256":"c513629e8cda2aa4313613147c5c026c373d7ea3cecd9928fbae178f48dff90f"},"schema_version":"1.0","source":{"id":"1307.6609","kind":"arxiv","version":1}},"canonical_sha256":"1d1a86c6efebd553c1f421a8155658d9fd2f9effa5c94f7ab2bf26e6b8cbbad9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d1a86c6efebd553c1f421a8155658d9fd2f9effa5c94f7ab2bf26e6b8cbbad9","first_computed_at":"2026-05-18T00:57:56.266856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.266856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7RKwgVgsSLIWfvWOSfUFEg8okCMIjqc/wq0PyrO+Z250wmJJV4GE8LL2QlASGa31nTO/Avsg5KzB6RyGIpAKAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.267225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48d0047a046e83e61593ffe0c7331e15a970d32fb677a6c099e728cb34629aea","sha256:671be20d2ebff77bbef7ffb7f13d7f5122c0790c1a2e039faca8099f6ac3f02b"],"state_sha256":"d30aae17daa5a814110026e4b61a3b56a2bc45374e0f30cccfdafea444c917cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2TnY9mHyrw8DG4kEcy4rIr/5A2s67uCosXknStLutf/k8K1/gsuQ1/cTvyrXPu92t5/nZmXICi5sDX4pulzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:39:00.579028Z","bundle_sha256":"f97c4b64e609ca8e5e7dfa0dfd7a8e7cda2c44c71748fd7d7ee999c8d2c65bc5"}}