{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZIAJLDYXSOLIDQRIWZWQ3PK2MP","short_pith_number":"pith:ZIAJLDYX","canonical_record":{"source":{"id":"1810.07856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-18T01:24:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1b55c0c2ab3460aebd98fb85b3eb423b23490c9192de52cf751f729f7df375f8","abstract_canon_sha256":"4d09b3a698b0d6b7c28acf771aba13b0dc047f7c406f081f6d35f537c06385bc"},"schema_version":"1.0"},"canonical_sha256":"ca00958f17939681c228b66d0dbd5a63ed15c8c3455d86885d375996d5c1765c","source":{"kind":"arxiv","id":"1810.07856","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07856","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07856v2","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07856","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZIAJLDYXSOLI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZIAJLDYXSOLIDQRI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZIAJLDYX","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZIAJLDYXSOLIDQRIWZWQ3PK2MP","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-18T01:24:46Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1b55c0c2ab3460aebd98fb85b3eb423b23490c9192de52cf751f729f7df375f8","abstract_canon_sha256":"4d09b3a698b0d6b7c28acf771aba13b0dc047f7c406f081f6d35f537c06385bc"},"schema_version":"1.0"},"canonical_sha256":"ca00958f17939681c228b66d0dbd5a63ed15c8c3455d86885d375996d5c1765c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:41.524263Z","signature_b64":"++yiU1FXWmFIlxy+VvZIJXn0sAGVz1AVyOUyLjj/Fb+z/kSGd14/BfL9jD6GSTtcvO7wg24KWhUmXNsf4IRCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca00958f17939681c228b66d0dbd5a63ed15c8c3455d86885d375996d5c1765c","last_reissued_at":"2026-05-17T23:46:41.523657Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:41.523657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07856","source_version":2,"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:46:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UxjXZAiFlKXGU30eVheUu/bUqyiKrn16omdHtkh3JKWQlTBBM0DDu95MI5n0tBkQQ9AR1jLxznrayrn5T6cAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:44:08.870039Z"},"content_sha256":"4c2947c702e7060ddb56459e8d28f9b00dcc731c1bddd03bce0da4099d4ff471","schema_version":"1.0","event_id":"sha256:4c2947c702e7060ddb56459e8d28f9b00dcc731c1bddd03bce0da4099d4ff471"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZIAJLDYXSOLIDQRIWZWQ3PK2MP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Blind MIMO Decoding through Vertex Hopping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"eess.SP","authors_text":"Andrea Goldsmith, Jonathan Perlstein, Mary Wootters, Thomas Dean","submitted_at":"2018-10-18T01:24:46Z","abstract_excerpt":"We present an algorithm that efficiently performs blind decoding of MIMO signals. That is, given no channel state information (CSI) at either the transmitter or receiver, our algorithm takes a block of samples and returns an estimate of the underlying data symbols. In prior work, the problem of blind decoding was formulated as a non-convex optimization problem. In this work, we present an algorithm that efficiently solves this non-convex problem in practical settings. This algorithm leverages concepts of linear and mixed-integer linear programming. Empirically, we show that our technique has a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07856","kind":"arxiv","version":2},"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:46:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luA9nIcLyOxRuKlluWOq41+P7hwQBcveVY76iiwX7rdbNjkURFb7I1i96P1FEdcg+rVQ9szGDp7rBVIIrG1YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:44:08.870755Z"},"content_sha256":"173c50af6f5b6536172e0d555de8c44cbbee25d135f0cfb2afca8dc6687d6ae8","schema_version":"1.0","event_id":"sha256:173c50af6f5b6536172e0d555de8c44cbbee25d135f0cfb2afca8dc6687d6ae8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/bundle.json","state_url":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/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-27T13:44:08Z","links":{"resolver":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP","bundle":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/bundle.json","state":"https://pith.science/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIAJLDYXSOLIDQRIWZWQ3PK2MP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZIAJLDYXSOLIDQRIWZWQ3PK2MP","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":"4d09b3a698b0d6b7c28acf771aba13b0dc047f7c406f081f6d35f537c06385bc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-18T01:24:46Z","title_canon_sha256":"1b55c0c2ab3460aebd98fb85b3eb423b23490c9192de52cf751f729f7df375f8"},"schema_version":"1.0","source":{"id":"1810.07856","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07856","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07856v2","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07856","created_at":"2026-05-17T23:46:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZIAJLDYXSOLI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZIAJLDYXSOLIDQRI","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZIAJLDYX","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:173c50af6f5b6536172e0d555de8c44cbbee25d135f0cfb2afca8dc6687d6ae8","target":"graph","created_at":"2026-05-17T23:46:41Z","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 present an algorithm that efficiently performs blind decoding of MIMO signals. That is, given no channel state information (CSI) at either the transmitter or receiver, our algorithm takes a block of samples and returns an estimate of the underlying data symbols. In prior work, the problem of blind decoding was formulated as a non-convex optimization problem. In this work, we present an algorithm that efficiently solves this non-convex problem in practical settings. This algorithm leverages concepts of linear and mixed-integer linear programming. Empirically, we show that our technique has a","authors_text":"Andrea Goldsmith, Jonathan Perlstein, Mary Wootters, Thomas Dean","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-18T01:24:46Z","title":"Fast Blind MIMO Decoding through Vertex Hopping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07856","kind":"arxiv","version":2},"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:4c2947c702e7060ddb56459e8d28f9b00dcc731c1bddd03bce0da4099d4ff471","target":"record","created_at":"2026-05-17T23:46:41Z","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":"4d09b3a698b0d6b7c28acf771aba13b0dc047f7c406f081f6d35f537c06385bc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-10-18T01:24:46Z","title_canon_sha256":"1b55c0c2ab3460aebd98fb85b3eb423b23490c9192de52cf751f729f7df375f8"},"schema_version":"1.0","source":{"id":"1810.07856","kind":"arxiv","version":2}},"canonical_sha256":"ca00958f17939681c228b66d0dbd5a63ed15c8c3455d86885d375996d5c1765c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca00958f17939681c228b66d0dbd5a63ed15c8c3455d86885d375996d5c1765c","first_computed_at":"2026-05-17T23:46:41.523657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:41.523657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"++yiU1FXWmFIlxy+VvZIJXn0sAGVz1AVyOUyLjj/Fb+z/kSGd14/BfL9jD6GSTtcvO7wg24KWhUmXNsf4IRCDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:41.524263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07856","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c2947c702e7060ddb56459e8d28f9b00dcc731c1bddd03bce0da4099d4ff471","sha256:173c50af6f5b6536172e0d555de8c44cbbee25d135f0cfb2afca8dc6687d6ae8"],"state_sha256":"6edfe567a0bc2759655d2999f3d6c0ea22a1b2ad63cfa28db36175f3596a9e2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6pimJAd9ByKIKKpwqj3nhJLKEHepuJ7mYcFLY3FCnM0BfYZJl6qGWZ2uj2DWrEbgpdOmXTdDuXhAuPAhixV1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:44:08.874390Z","bundle_sha256":"e2ed10bc9e3f8485b46134c3e184af2dbbf75767fb580f172b26f432edf39d25"}}