{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6PKFRHFBTLHQHK6D5WXOYP7GZM","short_pith_number":"pith:6PKFRHFB","canonical_record":{"source":{"id":"1206.0277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T19:13:22Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"37fe5729843e0d2da0ec70dcc4addf80e4c05d314b9486935ddb99cfc4b9075b","abstract_canon_sha256":"74c2b19ed8682cc8eff8eba65990d6f021a5489788cb30337dacc9b0c4de8597"},"schema_version":"1.0"},"canonical_sha256":"f3d4589ca19acf03abc3edaeec3fe6cb1ae7340e93a75341d47bd0a378880294","source":{"kind":"arxiv","id":"1206.0277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0277","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0277v1","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0277","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"6PKFRHFBTLHQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6PKFRHFBTLHQHK6D","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6PKFRHFB","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6PKFRHFBTLHQHK6D5WXOYP7GZM","target":"record","payload":{"canonical_record":{"source":{"id":"1206.0277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T19:13:22Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"37fe5729843e0d2da0ec70dcc4addf80e4c05d314b9486935ddb99cfc4b9075b","abstract_canon_sha256":"74c2b19ed8682cc8eff8eba65990d6f021a5489788cb30337dacc9b0c4de8597"},"schema_version":"1.0"},"canonical_sha256":"f3d4589ca19acf03abc3edaeec3fe6cb1ae7340e93a75341d47bd0a378880294","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:26.641083Z","signature_b64":"KiwN9vuYf5JOtMss10zyXujyIEqZpnAW00VFanF6c4WJElSoGB//86szPHvLekMjjYE9RsQHLa2Z4OObBXBICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3d4589ca19acf03abc3edaeec3fe6cb1ae7340e93a75341d47bd0a378880294","last_reissued_at":"2026-05-18T03:54:26.640306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:26.640306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.0277","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-18T03:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJsBfTE8XskmqUOZIvm+jBg/6ohYxbA4Wo6dTudvol0Ye3iE4J9vhXvdfx+Li8MPzQk4ew5lbnoRioxlqiZvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:05:25.014931Z"},"content_sha256":"d932a09ec397eebb888b0e614fb718740c9dd5f42a556d20110356313265373b","schema_version":"1.0","event_id":"sha256:d932a09ec397eebb888b0e614fb718740c9dd5f42a556d20110356313265373b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6PKFRHFBTLHQHK6D5WXOYP7GZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sensing with Optimal Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Hema Kumari Achanta, Soura Dasgupta, Weiyu Xu","submitted_at":"2012-06-01T19:13:22Z","abstract_excerpt":"We consider the problem of designing optimal $M \\times N$ ($M \\leq N$) sensing matrices which minimize the maximum condition number of all the submatrices of $K$ columns. Such matrices minimize the worst-case estimation errors when only $K$ sensors out of $N$ sensors are available for sensing at a given time. For M=2 and matrices with unit-normed columns, this problem is equivalent to the problem of maximizing the minimum singular value among all the submatrices of $K$ columns. For M=2, we are able to give a closed form formula for the condition number of the submatrices. When M=2 and K=3, for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0277","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-18T03:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONJfxELffptDKVdyYOkmjSrDvGGIb6xLcGihSBdQNVXrNuqATQQFK3QdFGwmwUfpBzxW4iFi4iKm8+1uj3SJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:05:25.015675Z"},"content_sha256":"1e609eb738630d79da2827da20f0c39367ac2f6173c10deb50ca836c50e80e4d","schema_version":"1.0","event_id":"sha256:1e609eb738630d79da2827da20f0c39367ac2f6173c10deb50ca836c50e80e4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PKFRHFBTLHQHK6D5WXOYP7GZM/bundle.json","state_url":"https://pith.science/pith/6PKFRHFBTLHQHK6D5WXOYP7GZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PKFRHFBTLHQHK6D5WXOYP7GZM/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-04T04:05:25Z","links":{"resolver":"https://pith.science/pith/6PKFRHFBTLHQHK6D5WXOYP7GZM","bundle":"https://pith.science/pith/6PKFRHFBTLHQHK6D5WXOYP7GZM/bundle.json","state":"https://pith.science/pith/6PKFRHFBTLHQHK6D5WXOYP7GZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PKFRHFBTLHQHK6D5WXOYP7GZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6PKFRHFBTLHQHK6D5WXOYP7GZM","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":"74c2b19ed8682cc8eff8eba65990d6f021a5489788cb30337dacc9b0c4de8597","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T19:13:22Z","title_canon_sha256":"37fe5729843e0d2da0ec70dcc4addf80e4c05d314b9486935ddb99cfc4b9075b"},"schema_version":"1.0","source":{"id":"1206.0277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0277","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0277v1","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0277","created_at":"2026-05-18T03:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"6PKFRHFBTLHQ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6PKFRHFBTLHQHK6D","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6PKFRHFB","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:1e609eb738630d79da2827da20f0c39367ac2f6173c10deb50ca836c50e80e4d","target":"graph","created_at":"2026-05-18T03:54:26Z","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 designing optimal $M \\times N$ ($M \\leq N$) sensing matrices which minimize the maximum condition number of all the submatrices of $K$ columns. Such matrices minimize the worst-case estimation errors when only $K$ sensors out of $N$ sensors are available for sensing at a given time. For M=2 and matrices with unit-normed columns, this problem is equivalent to the problem of maximizing the minimum singular value among all the submatrices of $K$ columns. For M=2, we are able to give a closed form formula for the condition number of the submatrices. When M=2 and K=3, for","authors_text":"Hema Kumari Achanta, Soura Dasgupta, Weiyu Xu","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T19:13:22Z","title":"Sensing with Optimal Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0277","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:d932a09ec397eebb888b0e614fb718740c9dd5f42a556d20110356313265373b","target":"record","created_at":"2026-05-18T03:54:26Z","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":"74c2b19ed8682cc8eff8eba65990d6f021a5489788cb30337dacc9b0c4de8597","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T19:13:22Z","title_canon_sha256":"37fe5729843e0d2da0ec70dcc4addf80e4c05d314b9486935ddb99cfc4b9075b"},"schema_version":"1.0","source":{"id":"1206.0277","kind":"arxiv","version":1}},"canonical_sha256":"f3d4589ca19acf03abc3edaeec3fe6cb1ae7340e93a75341d47bd0a378880294","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3d4589ca19acf03abc3edaeec3fe6cb1ae7340e93a75341d47bd0a378880294","first_computed_at":"2026-05-18T03:54:26.640306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:26.640306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KiwN9vuYf5JOtMss10zyXujyIEqZpnAW00VFanF6c4WJElSoGB//86szPHvLekMjjYE9RsQHLa2Z4OObBXBICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:26.641083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.0277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d932a09ec397eebb888b0e614fb718740c9dd5f42a556d20110356313265373b","sha256:1e609eb738630d79da2827da20f0c39367ac2f6173c10deb50ca836c50e80e4d"],"state_sha256":"6cebecd9d33044b89e6128269a787d91d1c55a0974c83d98157be8ced80cbd56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lhk4Btt8uUCYsFPnuz7wLa5XrqM1viFZuSiHgFSwfn3JhPGkxYW29sZUmPtXHsCSpf2wHmssm3rPzMV9EZEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:05:25.019357Z","bundle_sha256":"2887810f320a2fad1843744136729b92dc673445ebd1269d9267efba1c93efcc"}}