{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:C4FWWOVANTPTBOQJFW3OKCAKF7","short_pith_number":"pith:C4FWWOVA","canonical_record":{"source":{"id":"1208.4696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-23T09:09:54Z","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"title_canon_sha256":"f812a119087f7a6df7e1cecb39338fa88184acd485605887c96ac3962749f1cd","abstract_canon_sha256":"364990b7fed4e2ee4f7e59eddb1779affa88ac4cc89ef25749ea50ec51807678"},"schema_version":"1.0"},"canonical_sha256":"170b6b3aa06cdf30ba092db6e5080a2fd62c0b9a96d8f066f747003db127d71f","source":{"kind":"arxiv","id":"1208.4696","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4696","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4696v2","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4696","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"C4FWWOVANTPT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C4FWWOVANTPTBOQJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C4FWWOVA","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:C4FWWOVANTPTBOQJFW3OKCAKF7","target":"record","payload":{"canonical_record":{"source":{"id":"1208.4696","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-23T09:09:54Z","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"title_canon_sha256":"f812a119087f7a6df7e1cecb39338fa88184acd485605887c96ac3962749f1cd","abstract_canon_sha256":"364990b7fed4e2ee4f7e59eddb1779affa88ac4cc89ef25749ea50ec51807678"},"schema_version":"1.0"},"canonical_sha256":"170b6b3aa06cdf30ba092db6e5080a2fd62c0b9a96d8f066f747003db127d71f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:00.583295Z","signature_b64":"8AKyy7UJkq/dPJw+wfBsMCjaNi1R+qqkg8K/HhH1Gj7JwTC55tPC3Rdhm1ps13sx61yeqtnZN32yNsQ5YLTrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"170b6b3aa06cdf30ba092db6e5080a2fd62c0b9a96d8f066f747003db127d71f","last_reissued_at":"2026-05-18T02:21:00.582717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:00.582717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.4696","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-18T02:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01UYydObbEH9loCb8bqGw6vCYbN2AlYdTdKvJUalla6Ig7CuVfKOt0u4YQmfLTUoozUJEbx3Th7jkZgllu8ABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:24.668256Z"},"content_sha256":"52f613454691287b3af8ba61dfa7cf596490664c8ab0ddb4b305ddbeeb409e55","schema_version":"1.0","event_id":"sha256:52f613454691287b3af8ba61dfa7cf596490664c8ab0ddb4b305ddbeeb409e55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:C4FWWOVANTPTBOQJFW3OKCAKF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Typical $l_1$-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math.IT"],"primary_cat":"cs.IT","authors_text":"Mikko Vehkapera, Saikat Chatterjee, Yoshiyuki Kabashima","submitted_at":"2012-08-23T09:09:54Z","abstract_excerpt":"We consider the problem of recovering an $N$-dimensional sparse vector $\\vm{x}$ from its linear transformation $\\vm{y}=\\vm{D} \\vm{x}$ of $M(< N)$ dimension. Minimizing the $l_{1}$-norm of $\\vm{x}$ under the constraint $\\vm{y} = \\vm{D} \\vm{x}$ is a standard approach for the recovery problem, and earlier studies report that the critical condition for typically successful $l_1$-recovery is universal over a variety of randomly constructed matrices $\\vm{D}$. For examining the extent of the universality, we focus on the case in which $\\vm{D}$ is provided by concatenating $\\nb=N/M$ matrices $\\vm{O}_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4696","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-18T02:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MaHpfL3kOe4GvnoPlYm3UoLuDj0YIupb6ZUVTcePS71nVZOcNdUTlwnCtqE1GOPDd3GmjiAgMcWCJf0Be2jLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:24.668967Z"},"content_sha256":"bbd3a161069148e87df7a02bd50e917eb6fd6e4feef2de712ed0fd119c38cbd7","schema_version":"1.0","event_id":"sha256:bbd3a161069148e87df7a02bd50e917eb6fd6e4feef2de712ed0fd119c38cbd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/bundle.json","state_url":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/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-05T19:58:24Z","links":{"resolver":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7","bundle":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/bundle.json","state":"https://pith.science/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4FWWOVANTPTBOQJFW3OKCAKF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C4FWWOVANTPTBOQJFW3OKCAKF7","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":"364990b7fed4e2ee4f7e59eddb1779affa88ac4cc89ef25749ea50ec51807678","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-23T09:09:54Z","title_canon_sha256":"f812a119087f7a6df7e1cecb39338fa88184acd485605887c96ac3962749f1cd"},"schema_version":"1.0","source":{"id":"1208.4696","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4696","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4696v2","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4696","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"C4FWWOVANTPT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C4FWWOVANTPTBOQJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C4FWWOVA","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:bbd3a161069148e87df7a02bd50e917eb6fd6e4feef2de712ed0fd119c38cbd7","target":"graph","created_at":"2026-05-18T02:21:00Z","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 consider the problem of recovering an $N$-dimensional sparse vector $\\vm{x}$ from its linear transformation $\\vm{y}=\\vm{D} \\vm{x}$ of $M(< N)$ dimension. Minimizing the $l_{1}$-norm of $\\vm{x}$ under the constraint $\\vm{y} = \\vm{D} \\vm{x}$ is a standard approach for the recovery problem, and earlier studies report that the critical condition for typically successful $l_1$-recovery is universal over a variety of randomly constructed matrices $\\vm{D}$. For examining the extent of the universality, we focus on the case in which $\\vm{D}$ is provided by concatenating $\\nb=N/M$ matrices $\\vm{O}_{","authors_text":"Mikko Vehkapera, Saikat Chatterjee, 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":"2012-08-23T09:09:54Z","title":"Typical $l_1$-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4696","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:52f613454691287b3af8ba61dfa7cf596490664c8ab0ddb4b305ddbeeb409e55","target":"record","created_at":"2026-05-18T02:21:00Z","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":"364990b7fed4e2ee4f7e59eddb1779affa88ac4cc89ef25749ea50ec51807678","cross_cats_sorted":["cond-mat.dis-nn","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-23T09:09:54Z","title_canon_sha256":"f812a119087f7a6df7e1cecb39338fa88184acd485605887c96ac3962749f1cd"},"schema_version":"1.0","source":{"id":"1208.4696","kind":"arxiv","version":2}},"canonical_sha256":"170b6b3aa06cdf30ba092db6e5080a2fd62c0b9a96d8f066f747003db127d71f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"170b6b3aa06cdf30ba092db6e5080a2fd62c0b9a96d8f066f747003db127d71f","first_computed_at":"2026-05-18T02:21:00.582717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:00.582717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8AKyy7UJkq/dPJw+wfBsMCjaNi1R+qqkg8K/HhH1Gj7JwTC55tPC3Rdhm1ps13sx61yeqtnZN32yNsQ5YLTrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:00.583295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.4696","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52f613454691287b3af8ba61dfa7cf596490664c8ab0ddb4b305ddbeeb409e55","sha256:bbd3a161069148e87df7a02bd50e917eb6fd6e4feef2de712ed0fd119c38cbd7"],"state_sha256":"431405b7ab90a89e287fd89a704f6b96293a86b5e3bdb68693ee4585783069dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4V00HKEyCKTP5qObgDPO0rlLeqDwL8QBdMGWQafejnBuZ+FNZZu+DBiNqcQ50KBzaYV/C3tn//YDqBZtx8PCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:58:24.674284Z","bundle_sha256":"67546feb988b6e2a67d6fd23d0c9ac188816f18234b37fec4d10d359a817c84b"}}