{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CMUY344N7FKACTDBEPR3XDVZ5Q","short_pith_number":"pith:CMUY344N","canonical_record":{"source":{"id":"1710.07973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-22T16:28:24Z","cross_cats_sorted":[],"title_canon_sha256":"25f8d1b5dd0eaf9b2992ca9c514d0a9a2388bbcfec99a86f276992108a5797ed","abstract_canon_sha256":"1a933c8cf90a408692948d6395cc509eacdccc26f922d09339bdbf375a72aaaf"},"schema_version":"1.0"},"canonical_sha256":"13298df38df954014c6123e3bb8eb9ec0c7a8a8d8b14479e1fb90e694addb662","source":{"kind":"arxiv","id":"1710.07973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07973","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07973v1","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07973","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"CMUY344N7FKA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMUY344N7FKACTDB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMUY344N","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CMUY344N7FKACTDBEPR3XDVZ5Q","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-22T16:28:24Z","cross_cats_sorted":[],"title_canon_sha256":"25f8d1b5dd0eaf9b2992ca9c514d0a9a2388bbcfec99a86f276992108a5797ed","abstract_canon_sha256":"1a933c8cf90a408692948d6395cc509eacdccc26f922d09339bdbf375a72aaaf"},"schema_version":"1.0"},"canonical_sha256":"13298df38df954014c6123e3bb8eb9ec0c7a8a8d8b14479e1fb90e694addb662","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:19.288380Z","signature_b64":"sXO0TThYooGejQ4wxY3iJEMP35YUNFtSTOXNXt0zaXvgwxOtlbkb2VmTjA3OhaHGvT4evxDhiahbDC2bKUfGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13298df38df954014c6123e3bb8eb9ec0c7a8a8d8b14479e1fb90e694addb662","last_reissued_at":"2026-05-18T00:32:19.287876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:19.287876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07973","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:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xc1Bb1MDD+B77uJJGvF9Mu9G5a4NwOiuZ8ANFKql66KV9XsiZqvOpfLUKF9GNh3lU7lngUzTnAw1rlTB57O9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:00:44.608909Z"},"content_sha256":"a86ab0f704b0ce38cf4646224f3423bf870a0fcdc2fb50273e434c1d3dff54f9","schema_version":"1.0","event_id":"sha256:a86ab0f704b0ce38cf4646224f3423bf870a0fcdc2fb50273e434c1d3dff54f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CMUY344N7FKACTDBEPR3XDVZ5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Mathukumalli Vidyasagar, Mehmet Eren Ahsen","submitted_at":"2017-10-22T16:28:24Z","abstract_excerpt":"In this paper, the problem of one-bit compressed sensing (OBCS) is formulated as a problem in probably approximately correct (PAC) learning. It is shown that the Vapnik-Chervonenkis (VC-) dimension of the set of half-spaces in $\\mathbb{R}^n$ generated by $k$-sparse vectors is bounded below by $k \\lg (n/k)$ and above by $2k \\lg (n/k)$, plus some round-off terms. By coupling this estimate with well-established results in PAC learning theory, we show that a consistent algorithm can recover a $k$-sparse vector with $O(k \\lg (n/k))$ measurements, given only the signs of the measurement vector. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07973","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:32:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJkHkzHrPEVaTDdXNZlB8Mvfd57QY083hslO6DVCdYgE+qCQ+tHCyYWHDrot89vOFct9JQh8QntPylFMmKeBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:00:44.609606Z"},"content_sha256":"efa2b36a769f7951e49648e9694ba425ec5b8c5eabd47dec51965e5f4d26947c","schema_version":"1.0","event_id":"sha256:efa2b36a769f7951e49648e9694ba425ec5b8c5eabd47dec51965e5f4d26947c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMUY344N7FKACTDBEPR3XDVZ5Q/bundle.json","state_url":"https://pith.science/pith/CMUY344N7FKACTDBEPR3XDVZ5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMUY344N7FKACTDBEPR3XDVZ5Q/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-06T19:00:44Z","links":{"resolver":"https://pith.science/pith/CMUY344N7FKACTDBEPR3XDVZ5Q","bundle":"https://pith.science/pith/CMUY344N7FKACTDBEPR3XDVZ5Q/bundle.json","state":"https://pith.science/pith/CMUY344N7FKACTDBEPR3XDVZ5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMUY344N7FKACTDBEPR3XDVZ5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CMUY344N7FKACTDBEPR3XDVZ5Q","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":"1a933c8cf90a408692948d6395cc509eacdccc26f922d09339bdbf375a72aaaf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-22T16:28:24Z","title_canon_sha256":"25f8d1b5dd0eaf9b2992ca9c514d0a9a2388bbcfec99a86f276992108a5797ed"},"schema_version":"1.0","source":{"id":"1710.07973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07973","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07973v1","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07973","created_at":"2026-05-18T00:32:19Z"},{"alias_kind":"pith_short_12","alias_value":"CMUY344N7FKA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMUY344N7FKACTDB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMUY344N","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:efa2b36a769f7951e49648e9694ba425ec5b8c5eabd47dec51965e5f4d26947c","target":"graph","created_at":"2026-05-18T00:32:19Z","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":"In this paper, the problem of one-bit compressed sensing (OBCS) is formulated as a problem in probably approximately correct (PAC) learning. It is shown that the Vapnik-Chervonenkis (VC-) dimension of the set of half-spaces in $\\mathbb{R}^n$ generated by $k$-sparse vectors is bounded below by $k \\lg (n/k)$ and above by $2k \\lg (n/k)$, plus some round-off terms. By coupling this estimate with well-established results in PAC learning theory, we show that a consistent algorithm can recover a $k$-sparse vector with $O(k \\lg (n/k))$ measurements, given only the signs of the measurement vector. This","authors_text":"Mathukumalli Vidyasagar, Mehmet Eren Ahsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-22T16:28:24Z","title":"An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07973","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:a86ab0f704b0ce38cf4646224f3423bf870a0fcdc2fb50273e434c1d3dff54f9","target":"record","created_at":"2026-05-18T00:32:19Z","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":"1a933c8cf90a408692948d6395cc509eacdccc26f922d09339bdbf375a72aaaf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-22T16:28:24Z","title_canon_sha256":"25f8d1b5dd0eaf9b2992ca9c514d0a9a2388bbcfec99a86f276992108a5797ed"},"schema_version":"1.0","source":{"id":"1710.07973","kind":"arxiv","version":1}},"canonical_sha256":"13298df38df954014c6123e3bb8eb9ec0c7a8a8d8b14479e1fb90e694addb662","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13298df38df954014c6123e3bb8eb9ec0c7a8a8d8b14479e1fb90e694addb662","first_computed_at":"2026-05-18T00:32:19.287876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:19.287876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sXO0TThYooGejQ4wxY3iJEMP35YUNFtSTOXNXt0zaXvgwxOtlbkb2VmTjA3OhaHGvT4evxDhiahbDC2bKUfGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:19.288380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a86ab0f704b0ce38cf4646224f3423bf870a0fcdc2fb50273e434c1d3dff54f9","sha256:efa2b36a769f7951e49648e9694ba425ec5b8c5eabd47dec51965e5f4d26947c"],"state_sha256":"699c1fa9b83d5459e5b33828c40476b25fb4d544e5c4cf8ce3e299100b297333"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iW6CkM2nm4XGeIsiAn8CpiOSLXDXexEy2RbcxVwA/FToK9T8XegFrj7TqzxhdmbCHlCsOqyd0yfEDT01+KZSBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:00:44.613369Z","bundle_sha256":"db477ca4f5502ff2b6936d5aea8f85de94c651fb6ce4f86d57d9f4bf085546a7"}}