{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YTHBYAVIFLP23SDDEQOFHDDQBR","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":"6b3ae24d2d5dcd5416062d72809a37a65cdc08819b27f8a860ced64f64a9f76a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2021-08-31T11:24:44Z","title_canon_sha256":"01f73ee1cd225069069210561cf254d997353146f90629efe352fcdf0fbec932"},"schema_version":"1.0","source":{"id":"2108.13760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.13760","created_at":"2026-07-05T03:10:17Z"},{"alias_kind":"arxiv_version","alias_value":"2108.13760v1","created_at":"2026-07-05T03:10:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.13760","created_at":"2026-07-05T03:10:17Z"},{"alias_kind":"pith_short_12","alias_value":"YTHBYAVIFLP2","created_at":"2026-07-05T03:10:17Z"},{"alias_kind":"pith_short_16","alias_value":"YTHBYAVIFLP23SDD","created_at":"2026-07-05T03:10:17Z"},{"alias_kind":"pith_short_8","alias_value":"YTHBYAVI","created_at":"2026-07-05T03:10:17Z"}],"graph_snapshots":[{"event_id":"sha256:129ce7d8787fcc25d0b39ce1bb36a7e7b98ea211f781a2b5b4fa5c52de52a760","target":"graph","created_at":"2026-07-05T03:10:17Z","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/2108.13760/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, a novel coded compressed sensing (CCS) approach was proposed in [1] for dealing with the scalability problem for large sensing matrices in massive machine-type communications. The approach is to divide the compressed sensing (CS) problem into smaller CS sub-problems. However, such an approach requires stitching the results from the sub-problems to recover the result in the original CS problem. For this stitching problem, we propose a hierarchical stitching algorithm that is easier to implement in hardware for parallelization than the tree coding algorithm in [1]. For our algorithm, w","authors_text":"Cheng-Shang Chang, Chia-Ming Chang, Yi-Jheng Lin","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2021-08-31T11:24:44Z","title":"A Hierarchical Stitching Algorithm for Coded Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.13760","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:0ba3877c4b50d5600d0111e6af2362c504e8dd743375edd0aca1e3a8ca219dba","target":"record","created_at":"2026-07-05T03:10:17Z","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":"6b3ae24d2d5dcd5416062d72809a37a65cdc08819b27f8a860ced64f64a9f76a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2021-08-31T11:24:44Z","title_canon_sha256":"01f73ee1cd225069069210561cf254d997353146f90629efe352fcdf0fbec932"},"schema_version":"1.0","source":{"id":"2108.13760","kind":"arxiv","version":1}},"canonical_sha256":"c4ce1c02a82adfadc863241c538c700c40fb8fd545d0b34459bdb9b02149649a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4ce1c02a82adfadc863241c538c700c40fb8fd545d0b34459bdb9b02149649a","first_computed_at":"2026-07-05T03:10:17.469414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:10:17.469414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhonR4azOWqdIOWdgOoUGrDE9CZ45qgLL6Jk5Y9z64UiByk2AFcKcgcRP4sQ7udCwaG1bdZts7HMWi/E1fnHDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:10:17.469876Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.13760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ba3877c4b50d5600d0111e6af2362c504e8dd743375edd0aca1e3a8ca219dba","sha256:129ce7d8787fcc25d0b39ce1bb36a7e7b98ea211f781a2b5b4fa5c52de52a760"],"state_sha256":"bc99dc4494ca0b37943c7604fd3f50b6462972715e31678da24cd9441acec83a"}