{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UTJVCWYHVCOOHVEJ4W447YPY6K","short_pith_number":"pith:UTJVCWYH","canonical_record":{"source":{"id":"2606.30100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-29T10:34:56Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"0ebfc79e3826d80f794159be84ba7ba4c86956727358559da778c1dc2ff12765","abstract_canon_sha256":"38ea6e9d866f8762bdfc1ddbcc8b316fa3328071255e0405019c472f8d82403c"},"schema_version":"1.0"},"canonical_sha256":"a4d3515b07a89ce3d489e5b9cfe1f8f288471fd53f70c56ce207107bccf50a3a","source":{"kind":"arxiv","id":"2606.30100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30100","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30100v1","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30100","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"UTJVCWYHVCOO","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"pith_short_16","alias_value":"UTJVCWYHVCOOHVEJ","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"pith_short_8","alias_value":"UTJVCWYH","created_at":"2026-06-30T02:17:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UTJVCWYHVCOOHVEJ4W447YPY6K","target":"record","payload":{"canonical_record":{"source":{"id":"2606.30100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-29T10:34:56Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"0ebfc79e3826d80f794159be84ba7ba4c86956727358559da778c1dc2ff12765","abstract_canon_sha256":"38ea6e9d866f8762bdfc1ddbcc8b316fa3328071255e0405019c472f8d82403c"},"schema_version":"1.0"},"canonical_sha256":"a4d3515b07a89ce3d489e5b9cfe1f8f288471fd53f70c56ce207107bccf50a3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:49.560225Z","signature_b64":"kD3zloaDJfw4lJYcbTp8bmXkdH71rS0Og3v7jp6lSEX957cExfR7mf39hD/E8qcqwQdiGuF73E7Zpoqx4y0GDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4d3515b07a89ce3d489e5b9cfe1f8f288471fd53f70c56ce207107bccf50a3a","last_reissued_at":"2026-06-30T02:17:49.559634Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:49.559634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.30100","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-06-30T02:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zW+2o/LPBV8L22nWhCxajo/cjR5I/xah6qE6BSE+jgb/+1v1ehrV2RGQt1BM+dymz1jO3VFGYz2Mbr6LCwiwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T02:34:57.499569Z"},"content_sha256":"256f5e4682959e341bf452788ae5eba74a07ffdd0349f9d0010b5a2118afc2f6","schema_version":"1.0","event_id":"sha256:256f5e4682959e341bf452788ae5eba74a07ffdd0349f9d0010b5a2118afc2f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UTJVCWYHVCOOHVEJ4W447YPY6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Signal Recovery in Undersampling: Iterative SDP with Majority Voting and Successive Interference Cancellation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Burhan Gulbahar, Ece Abay, Fatih Alagoz","submitted_at":"2026-06-29T10:34:56Z","abstract_excerpt":"Binary compressive sensing (BCS) seeks to recover a $k$-sparse binary vector of length $n$ from $m$ linear measurements. Classical CS guarantees break down for $m < k$ and convex/greedy BCS algorithms with random Gaussian sensing matrices perform poorly. We introduce ISDP-MVSIC, which combines randomized semidefinite programming (SDP) sampling, majority voting (MV) and successive interference cancellation (SIC) across $L \\ll n$ stages, wrapped in a residual-cost driven retry loop. The method exposes a tunable complexity--performance trade-off: for $n=100, 144$, raising the worst-case complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30100","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.30100/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-06-30T02:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XeGdkD1uVi7pAod4c0TJz44SVnCA/fhA7oKbi7pT6brUALlgx6LjuspmnyJaNI/q0zFVcvFkV29jSdvTDFsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T02:34:57.499952Z"},"content_sha256":"9d29d1638282a9972d46ce4d31bd0b113665e5cc76bed65931eef2e2db5ad639","schema_version":"1.0","event_id":"sha256:9d29d1638282a9972d46ce4d31bd0b113665e5cc76bed65931eef2e2db5ad639"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTJVCWYHVCOOHVEJ4W447YPY6K/bundle.json","state_url":"https://pith.science/pith/UTJVCWYHVCOOHVEJ4W447YPY6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTJVCWYHVCOOHVEJ4W447YPY6K/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-07-03T02:34:57Z","links":{"resolver":"https://pith.science/pith/UTJVCWYHVCOOHVEJ4W447YPY6K","bundle":"https://pith.science/pith/UTJVCWYHVCOOHVEJ4W447YPY6K/bundle.json","state":"https://pith.science/pith/UTJVCWYHVCOOHVEJ4W447YPY6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTJVCWYHVCOOHVEJ4W447YPY6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UTJVCWYHVCOOHVEJ4W447YPY6K","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":"38ea6e9d866f8762bdfc1ddbcc8b316fa3328071255e0405019c472f8d82403c","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-29T10:34:56Z","title_canon_sha256":"0ebfc79e3826d80f794159be84ba7ba4c86956727358559da778c1dc2ff12765"},"schema_version":"1.0","source":{"id":"2606.30100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30100","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30100v1","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30100","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"UTJVCWYHVCOO","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"pith_short_16","alias_value":"UTJVCWYHVCOOHVEJ","created_at":"2026-06-30T02:17:49Z"},{"alias_kind":"pith_short_8","alias_value":"UTJVCWYH","created_at":"2026-06-30T02:17:49Z"}],"graph_snapshots":[{"event_id":"sha256:9d29d1638282a9972d46ce4d31bd0b113665e5cc76bed65931eef2e2db5ad639","target":"graph","created_at":"2026-06-30T02:17:49Z","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/2606.30100/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Binary compressive sensing (BCS) seeks to recover a $k$-sparse binary vector of length $n$ from $m$ linear measurements. Classical CS guarantees break down for $m < k$ and convex/greedy BCS algorithms with random Gaussian sensing matrices perform poorly. We introduce ISDP-MVSIC, which combines randomized semidefinite programming (SDP) sampling, majority voting (MV) and successive interference cancellation (SIC) across $L \\ll n$ stages, wrapped in a residual-cost driven retry loop. The method exposes a tunable complexity--performance trade-off: for $n=100, 144$, raising the worst-case complexit","authors_text":"Burhan Gulbahar, Ece Abay, Fatih Alagoz","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-29T10:34:56Z","title":"Binary Signal Recovery in Undersampling: Iterative SDP with Majority Voting and Successive Interference Cancellation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30100","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:256f5e4682959e341bf452788ae5eba74a07ffdd0349f9d0010b5a2118afc2f6","target":"record","created_at":"2026-06-30T02:17:49Z","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":"38ea6e9d866f8762bdfc1ddbcc8b316fa3328071255e0405019c472f8d82403c","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-29T10:34:56Z","title_canon_sha256":"0ebfc79e3826d80f794159be84ba7ba4c86956727358559da778c1dc2ff12765"},"schema_version":"1.0","source":{"id":"2606.30100","kind":"arxiv","version":1}},"canonical_sha256":"a4d3515b07a89ce3d489e5b9cfe1f8f288471fd53f70c56ce207107bccf50a3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4d3515b07a89ce3d489e5b9cfe1f8f288471fd53f70c56ce207107bccf50a3a","first_computed_at":"2026-06-30T02:17:49.559634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:17:49.559634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kD3zloaDJfw4lJYcbTp8bmXkdH71rS0Og3v7jp6lSEX957cExfR7mf39hD/E8qcqwQdiGuF73E7Zpoqx4y0GDA==","signature_status":"signed_v1","signed_at":"2026-06-30T02:17:49.560225Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.30100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:256f5e4682959e341bf452788ae5eba74a07ffdd0349f9d0010b5a2118afc2f6","sha256:9d29d1638282a9972d46ce4d31bd0b113665e5cc76bed65931eef2e2db5ad639"],"state_sha256":"b650aeeec47115a59c10eef9ff23c7f8a27e4fe2aa5a06a45597d317066d6d20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w55SBW+oA4b+p/E17L6/TLO6e7nwPuVGbTS7iem+pj0386e+qgQDU1hbVIOcCP4iURaSMX2l/l/kqykycGudDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T02:34:57.501998Z","bundle_sha256":"2a3e4345b2201820d4656d4e9df44ba814401f89dbc0ba7a3c7a7f23406f3f7f"}}