{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FGNJZPMBFLZKIY47RRPWQNE4EG","short_pith_number":"pith:FGNJZPMB","canonical_record":{"source":{"id":"1901.00088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-01T04:17:08Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"81fde30e2ca2e3d6d1414988d9f767f94fec05418da5709187eec5f174648e82","abstract_canon_sha256":"f67531fa83d1a2d858e37f7f2e2ebb3425225296c983ba0d9401ea9dfc85834e"},"schema_version":"1.0"},"canonical_sha256":"299a9cbd812af2a4639f8c5f68349c21acb5b26922fc9b910563e6643d1ddb32","source":{"kind":"arxiv","id":"1901.00088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00088","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00088v1","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00088","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"FGNJZPMBFLZK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGNJZPMBFLZKIY47","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGNJZPMB","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FGNJZPMBFLZKIY47RRPWQNE4EG","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-01T04:17:08Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"81fde30e2ca2e3d6d1414988d9f767f94fec05418da5709187eec5f174648e82","abstract_canon_sha256":"f67531fa83d1a2d858e37f7f2e2ebb3425225296c983ba0d9401ea9dfc85834e"},"schema_version":"1.0"},"canonical_sha256":"299a9cbd812af2a4639f8c5f68349c21acb5b26922fc9b910563e6643d1ddb32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:06.956915Z","signature_b64":"upEQl6x/vh1OzFWRAVDIHMRP1cYZRUx7mf5N4v5NomW1B1ZuW8mu+NxKu4SOQNmPGJBTO2dY2iKuNy4ih03xCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"299a9cbd812af2a4639f8c5f68349c21acb5b26922fc9b910563e6643d1ddb32","last_reissued_at":"2026-05-17T23:57:06.956550Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:06.956550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00088","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-17T23:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XmDhR8UCisnAwLcOUHC5sJueFP1gX17RDGX6JAkhQO+uvdLI0/hYuh76Mrn0pHUQ+FLk9EcsSBIgepbpGl/LCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:43:33.517763Z"},"content_sha256":"1344983d990f62ed9aea5c131d9d4a04bf28bdd4f4a9cf38e25a8dfd07077f9e","schema_version":"1.0","event_id":"sha256:1344983d990f62ed9aea5c131d9d4a04bf28bdd4f4a9cf38e25a8dfd07077f9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FGNJZPMBFLZKIY47RRPWQNE4EG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Annealing Based Binary Compressive Sensing with Matrix Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Milton Halem, Ramin Ayanzadeh, Seyedahmad Mousavi, Tim Finin","submitted_at":"2019-01-01T04:17:08Z","abstract_excerpt":"Compressive sensing is a novel approach that linearly samples sparse or compressible signals at a rate much below the Nyquist-Shannon sampling rate and outperforms traditional signal processing techniques in acquiring and reconstructing such signals. Compressive sensing with matrix uncertainty is an extension of the standard compressive sensing problem that appears in various applications including but not limited to cognitive radio sensing, calibration of the antenna, and deconvolution. The original problem of compressive sensing is NP-hard so the traditional techniques, such as convex and no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00088","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-17T23:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aV0YC0cyEsXiei/jwnQK5O2abwgWo+ZxWrowIG+/opBbTeFETqL9Y18/9Gg9f5EWM5G4iBdjjHOV3O65P0B/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:43:33.518518Z"},"content_sha256":"d404b85a3be58d7ff8b7f45e45ac3d09a1920c385c1c31588f34dfd02f3cb231","schema_version":"1.0","event_id":"sha256:d404b85a3be58d7ff8b7f45e45ac3d09a1920c385c1c31588f34dfd02f3cb231"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGNJZPMBFLZKIY47RRPWQNE4EG/bundle.json","state_url":"https://pith.science/pith/FGNJZPMBFLZKIY47RRPWQNE4EG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGNJZPMBFLZKIY47RRPWQNE4EG/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-01T00:43:33Z","links":{"resolver":"https://pith.science/pith/FGNJZPMBFLZKIY47RRPWQNE4EG","bundle":"https://pith.science/pith/FGNJZPMBFLZKIY47RRPWQNE4EG/bundle.json","state":"https://pith.science/pith/FGNJZPMBFLZKIY47RRPWQNE4EG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGNJZPMBFLZKIY47RRPWQNE4EG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FGNJZPMBFLZKIY47RRPWQNE4EG","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":"f67531fa83d1a2d858e37f7f2e2ebb3425225296c983ba0d9401ea9dfc85834e","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-01T04:17:08Z","title_canon_sha256":"81fde30e2ca2e3d6d1414988d9f767f94fec05418da5709187eec5f174648e82"},"schema_version":"1.0","source":{"id":"1901.00088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00088","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00088v1","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00088","created_at":"2026-05-17T23:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"FGNJZPMBFLZK","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGNJZPMBFLZKIY47","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGNJZPMB","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:d404b85a3be58d7ff8b7f45e45ac3d09a1920c385c1c31588f34dfd02f3cb231","target":"graph","created_at":"2026-05-17T23:57:06Z","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":"Compressive sensing is a novel approach that linearly samples sparse or compressible signals at a rate much below the Nyquist-Shannon sampling rate and outperforms traditional signal processing techniques in acquiring and reconstructing such signals. Compressive sensing with matrix uncertainty is an extension of the standard compressive sensing problem that appears in various applications including but not limited to cognitive radio sensing, calibration of the antenna, and deconvolution. The original problem of compressive sensing is NP-hard so the traditional techniques, such as convex and no","authors_text":"Milton Halem, Ramin Ayanzadeh, Seyedahmad Mousavi, Tim Finin","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-01T04:17:08Z","title":"Quantum Annealing Based Binary Compressive Sensing with Matrix Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00088","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:1344983d990f62ed9aea5c131d9d4a04bf28bdd4f4a9cf38e25a8dfd07077f9e","target":"record","created_at":"2026-05-17T23:57:06Z","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":"f67531fa83d1a2d858e37f7f2e2ebb3425225296c983ba0d9401ea9dfc85834e","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-01T04:17:08Z","title_canon_sha256":"81fde30e2ca2e3d6d1414988d9f767f94fec05418da5709187eec5f174648e82"},"schema_version":"1.0","source":{"id":"1901.00088","kind":"arxiv","version":1}},"canonical_sha256":"299a9cbd812af2a4639f8c5f68349c21acb5b26922fc9b910563e6643d1ddb32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"299a9cbd812af2a4639f8c5f68349c21acb5b26922fc9b910563e6643d1ddb32","first_computed_at":"2026-05-17T23:57:06.956550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:06.956550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"upEQl6x/vh1OzFWRAVDIHMRP1cYZRUx7mf5N4v5NomW1B1ZuW8mu+NxKu4SOQNmPGJBTO2dY2iKuNy4ih03xCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:06.956915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1344983d990f62ed9aea5c131d9d4a04bf28bdd4f4a9cf38e25a8dfd07077f9e","sha256:d404b85a3be58d7ff8b7f45e45ac3d09a1920c385c1c31588f34dfd02f3cb231"],"state_sha256":"3e1ea324ab8210a81724658f0cb9aa330914e3f153ee90a96dda0f790408019e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvC69CHWA/vjWxXoAmXx9SRXEk4QCR71+mycOrxqTyG1dQo06dI62h3jEbL7n/Ku6Ve/1jaTkJ+rwMvHwDbQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:43:33.523025Z","bundle_sha256":"18164d90b640fe5ebaaf36d8602eddc57b1515d0fa14f5bdc6ca5ec50be36f9c"}}