{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NK57OQFOPWRZ7TXL23MTOYRYAH","short_pith_number":"pith:NK57OQFO","canonical_record":{"source":{"id":"2002.01697","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T09:44:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"65cdd6b37022b9bd27c4cf1d6fe8ae12439091669cb629636002687161713140","abstract_canon_sha256":"b3129556d0c05e90a646311ca38beaca2c64db75fa565b81bf9a8c6631bd6012"},"schema_version":"1.0"},"canonical_sha256":"6abbf740ae7da39fceebd6d937623801c50fbdc427987898f2dd2b376a134afe","source":{"kind":"arxiv","id":"2002.01697","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.01697","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"2002.01697v3","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01697","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"NK57OQFOPWRZ","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"pith_short_16","alias_value":"NK57OQFOPWRZ7TXL","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"pith_short_8","alias_value":"NK57OQFO","created_at":"2026-07-05T01:11:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NK57OQFOPWRZ7TXL23MTOYRYAH","target":"record","payload":{"canonical_record":{"source":{"id":"2002.01697","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T09:44:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"65cdd6b37022b9bd27c4cf1d6fe8ae12439091669cb629636002687161713140","abstract_canon_sha256":"b3129556d0c05e90a646311ca38beaca2c64db75fa565b81bf9a8c6631bd6012"},"schema_version":"1.0"},"canonical_sha256":"6abbf740ae7da39fceebd6d937623801c50fbdc427987898f2dd2b376a134afe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:45.020649Z","signature_b64":"yk2HUDcUOstxGaa8XEWhQ6fh8WaK4FzhPQeiB5J0y20XI/vT24CH5cDMPZD+AodpPFJh3zV/LriHRXeq0dU+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6abbf740ae7da39fceebd6d937623801c50fbdc427987898f2dd2b376a134afe","last_reissued_at":"2026-07-05T01:11:45.020259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:45.020259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.01697","source_version":3,"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-07-05T01:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzSDuJro1fHX8WLq3KWYeDScrToEOnY5SNXL6C26MVtGKLHGExiGi7kNA4/lm4zawpH+rLr9oY5Z+BNJ2FYACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T14:48:06.640391Z"},"content_sha256":"2eb589e40ec2450293169e4272f9e4489484fa1010e2bbf9e17258b1a9248553","schema_version":"1.0","event_id":"sha256:2eb589e40ec2450293169e4272f9e4489484fa1010e2bbf9e17258b1a9248553"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NK57OQFOPWRZ7TXL23MTOYRYAH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Avtansh Tiwari, Jonathan Scarlett, Selwyn Gomes, Zhaoqiang Liu","submitted_at":"2020-02-05T09:44:10Z","abstract_excerpt":"The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binary-valued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances in compressive sensing with generative models, where a generative modeling assumption replaces the usual sparsity assumption, we study the problem of 1-bit compressive sensing with generative models. We first consider noiseless 1-bit measurements, and provide sample complexity bounds for approximate recovery under i.i.d.~Gaussian measurements and a Lipschitz continuous generati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01697","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.01697/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nb1j7p/5LP2beFeYqryOtOzUi1jXQKv2hlUG0UH1+Iwyy7esnWzn3yquN/NNXQR8Wf+F8nqsU2nG6/tvYIMDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T14:48:06.640988Z"},"content_sha256":"1441a392805d9d61a547cbda113e60abd24604df69eb9ec30aa6637ab41ecec8","schema_version":"1.0","event_id":"sha256:1441a392805d9d61a547cbda113e60abd24604df69eb9ec30aa6637ab41ecec8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/bundle.json","state_url":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/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-08-19T14:48:06Z","links":{"resolver":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH","bundle":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/bundle.json","state":"https://pith.science/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NK57OQFOPWRZ7TXL23MTOYRYAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NK57OQFOPWRZ7TXL23MTOYRYAH","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":"b3129556d0c05e90a646311ca38beaca2c64db75fa565b81bf9a8c6631bd6012","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T09:44:10Z","title_canon_sha256":"65cdd6b37022b9bd27c4cf1d6fe8ae12439091669cb629636002687161713140"},"schema_version":"1.0","source":{"id":"2002.01697","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.01697","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"2002.01697v3","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01697","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"NK57OQFOPWRZ","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"pith_short_16","alias_value":"NK57OQFOPWRZ7TXL","created_at":"2026-07-05T01:11:45Z"},{"alias_kind":"pith_short_8","alias_value":"NK57OQFO","created_at":"2026-07-05T01:11:45Z"}],"graph_snapshots":[{"event_id":"sha256:1441a392805d9d61a547cbda113e60abd24604df69eb9ec30aa6637ab41ecec8","target":"graph","created_at":"2026-07-05T01:11:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.01697/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binary-valued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances in compressive sensing with generative models, where a generative modeling assumption replaces the usual sparsity assumption, we study the problem of 1-bit compressive sensing with generative models. We first consider noiseless 1-bit measurements, and provide sample complexity bounds for approximate recovery under i.i.d.~Gaussian measurements and a Lipschitz continuous generati","authors_text":"Avtansh Tiwari, Jonathan Scarlett, Selwyn Gomes, Zhaoqiang Liu","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T09:44:10Z","title":"Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01697","kind":"arxiv","version":3},"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:2eb589e40ec2450293169e4272f9e4489484fa1010e2bbf9e17258b1a9248553","target":"record","created_at":"2026-07-05T01:11:45Z","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":"b3129556d0c05e90a646311ca38beaca2c64db75fa565b81bf9a8c6631bd6012","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-05T09:44:10Z","title_canon_sha256":"65cdd6b37022b9bd27c4cf1d6fe8ae12439091669cb629636002687161713140"},"schema_version":"1.0","source":{"id":"2002.01697","kind":"arxiv","version":3}},"canonical_sha256":"6abbf740ae7da39fceebd6d937623801c50fbdc427987898f2dd2b376a134afe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6abbf740ae7da39fceebd6d937623801c50fbdc427987898f2dd2b376a134afe","first_computed_at":"2026-07-05T01:11:45.020259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:11:45.020259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yk2HUDcUOstxGaa8XEWhQ6fh8WaK4FzhPQeiB5J0y20XI/vT24CH5cDMPZD+AodpPFJh3zV/LriHRXeq0dU+AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:11:45.020649Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.01697","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2eb589e40ec2450293169e4272f9e4489484fa1010e2bbf9e17258b1a9248553","sha256:1441a392805d9d61a547cbda113e60abd24604df69eb9ec30aa6637ab41ecec8"],"state_sha256":"e078b449b60c5499c9c71b48c5bd483541c7901486fe04b25ec401b821048ff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ty0lfeHRfauTNIpJWoRo9JOMiyE6JE6i1WIygC0rBrzFh5dtGqOduDyFfDRDeu09LR6IxSMVFp/emSmJcxTcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T14:48:06.646306Z","bundle_sha256":"c9d7c9c3d604caf9efdcf0e491fabdf7ec14da7240ca2bb16106f6f94a9a0bed"}}