{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TDORQOFKDD42XVZ5CUM4GQHD5X","short_pith_number":"pith:TDORQOFK","canonical_record":{"source":{"id":"1311.0095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:09:15Z","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"title_canon_sha256":"63df71b8cacf12979aa06553b5f15e49f3324be1e6342dc2520c020afbff5cef","abstract_canon_sha256":"ed054d25abf4cc0cdb9c841474c0230b2c55a94b66fb000b8bc78d759ddf20c8"},"schema_version":"1.0"},"canonical_sha256":"98dd1838aa18f9abd73d1519c340e3edf15ee3cc580642056026e94baaa3b865","source":{"kind":"arxiv","id":"1311.0095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0095","created_at":"2026-05-18T02:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0095v1","created_at":"2026-05-18T02:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0095","created_at":"2026-05-18T02:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"TDORQOFKDD42","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TDORQOFKDD42XVZ5","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TDORQOFK","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TDORQOFKDD42XVZ5CUM4GQHD5X","target":"record","payload":{"canonical_record":{"source":{"id":"1311.0095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:09:15Z","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"title_canon_sha256":"63df71b8cacf12979aa06553b5f15e49f3324be1e6342dc2520c020afbff5cef","abstract_canon_sha256":"ed054d25abf4cc0cdb9c841474c0230b2c55a94b66fb000b8bc78d759ddf20c8"},"schema_version":"1.0"},"canonical_sha256":"98dd1838aa18f9abd73d1519c340e3edf15ee3cc580642056026e94baaa3b865","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:37.748297Z","signature_b64":"q/YzYT3If0RDLwYTqC0mihLcnylsRMbCUEA3OveQ/G7lbdmOyXWWGG9kdBnJUBLkc0E15GTg4Gym8pkMsxfaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98dd1838aa18f9abd73d1519c340e3edf15ee3cc580642056026e94baaa3b865","last_reissued_at":"2026-05-18T02:54:37.747776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:37.747776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.0095","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-18T02:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXCCnd5Qr9BLDXLrc/GMmIIqKMZOPBMnqO2+ROnN6+ZjKzO8And/bxgjYgqjh1Ar2iJrAs1lYx2Sv+fgmCBZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:02:37.728788Z"},"content_sha256":"3ba6305077b3970e375976a0904cad28ecb21ede1d29eb8a0402faf3bf4528c1","schema_version":"1.0","event_id":"sha256:3ba6305077b3970e375976a0904cad28ecb21ede1d29eb8a0402faf3bf4528c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TDORQOFKDD42XVZ5CUM4GQHD5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstruction algorithm in compressed sensing based on maximum a posteriori estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math.IT"],"primary_cat":"cs.IT","authors_text":"Koujin Takeda, Yoshiyuki Kabashima","submitted_at":"2013-11-01T06:09:15Z","abstract_excerpt":"We propose a systematic method for constructing a sparse data reconstruction algorithm in compressed sensing at a relatively low computational cost for general observation matrix. It is known that the cost of l1-norm minimization using a standard linear programming algorithm is O(N^3). We show that this cost can be reduced to O(N^2) by applying the approach of posterior maximization. Furthermore, in principle, the algorithm from our approach is expected to achieve the widest successful reconstruction region, which is evaluated from theoretical argument. We also discuss the relation between the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0095","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-18T02:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"atY9sKOb7SEqrx3NpvOuP5Ek+ONrapfkSzT5X5IwAuRiXExIpCLy8po/9npEG4z+wkHwju8lubbB62yZ+kT3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:02:37.729453Z"},"content_sha256":"dcb544ccdcd84bc8e6832f98320101eba57d551fcb6547ff5077bcacb7f8e674","schema_version":"1.0","event_id":"sha256:dcb544ccdcd84bc8e6832f98320101eba57d551fcb6547ff5077bcacb7f8e674"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDORQOFKDD42XVZ5CUM4GQHD5X/bundle.json","state_url":"https://pith.science/pith/TDORQOFKDD42XVZ5CUM4GQHD5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDORQOFKDD42XVZ5CUM4GQHD5X/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-26T22:02:37Z","links":{"resolver":"https://pith.science/pith/TDORQOFKDD42XVZ5CUM4GQHD5X","bundle":"https://pith.science/pith/TDORQOFKDD42XVZ5CUM4GQHD5X/bundle.json","state":"https://pith.science/pith/TDORQOFKDD42XVZ5CUM4GQHD5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDORQOFKDD42XVZ5CUM4GQHD5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TDORQOFKDD42XVZ5CUM4GQHD5X","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":"ed054d25abf4cc0cdb9c841474c0230b2c55a94b66fb000b8bc78d759ddf20c8","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:09:15Z","title_canon_sha256":"63df71b8cacf12979aa06553b5f15e49f3324be1e6342dc2520c020afbff5cef"},"schema_version":"1.0","source":{"id":"1311.0095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0095","created_at":"2026-05-18T02:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0095v1","created_at":"2026-05-18T02:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0095","created_at":"2026-05-18T02:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"TDORQOFKDD42","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TDORQOFKDD42XVZ5","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TDORQOFK","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:dcb544ccdcd84bc8e6832f98320101eba57d551fcb6547ff5077bcacb7f8e674","target":"graph","created_at":"2026-05-18T02:54:37Z","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 propose a systematic method for constructing a sparse data reconstruction algorithm in compressed sensing at a relatively low computational cost for general observation matrix. It is known that the cost of l1-norm minimization using a standard linear programming algorithm is O(N^3). We show that this cost can be reduced to O(N^2) by applying the approach of posterior maximization. Furthermore, in principle, the algorithm from our approach is expected to achieve the widest successful reconstruction region, which is evaluated from theoretical argument. We also discuss the relation between the","authors_text":"Koujin Takeda, Yoshiyuki Kabashima","cross_cats":["cond-mat.dis-nn","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:09:15Z","title":"Reconstruction algorithm in compressed sensing based on maximum a posteriori estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0095","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:3ba6305077b3970e375976a0904cad28ecb21ede1d29eb8a0402faf3bf4528c1","target":"record","created_at":"2026-05-18T02:54:37Z","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":"ed054d25abf4cc0cdb9c841474c0230b2c55a94b66fb000b8bc78d759ddf20c8","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-01T06:09:15Z","title_canon_sha256":"63df71b8cacf12979aa06553b5f15e49f3324be1e6342dc2520c020afbff5cef"},"schema_version":"1.0","source":{"id":"1311.0095","kind":"arxiv","version":1}},"canonical_sha256":"98dd1838aa18f9abd73d1519c340e3edf15ee3cc580642056026e94baaa3b865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98dd1838aa18f9abd73d1519c340e3edf15ee3cc580642056026e94baaa3b865","first_computed_at":"2026-05-18T02:54:37.747776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:37.747776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q/YzYT3If0RDLwYTqC0mihLcnylsRMbCUEA3OveQ/G7lbdmOyXWWGG9kdBnJUBLkc0E15GTg4Gym8pkMsxfaDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:37.748297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ba6305077b3970e375976a0904cad28ecb21ede1d29eb8a0402faf3bf4528c1","sha256:dcb544ccdcd84bc8e6832f98320101eba57d551fcb6547ff5077bcacb7f8e674"],"state_sha256":"9a8972f0b71445eb99b55d9523cdc8e110913fb0ff43da06d65bb6d377893d9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AG+PYME/bsjMlu2gxXdMLUCxlofc9b0s2JQfBNMqwC+xQXvgmuRXsWL9VZBUXtEd5jEcj+Hd7wIQPlqk2BwYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:02:37.733526Z","bundle_sha256":"3b73a2c7aad38c53dbfc74346db3ee49280519f3f2f19714ae0015e250c7f72d"}}