{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OYODT3L6WKYOQO4N6TDWET5NKB","short_pith_number":"pith:OYODT3L6","canonical_record":{"source":{"id":"1305.6292","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T18:54:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fc5b710ca6f9523b40e9b2eb0356a5fd77b2bac74b10a4dacac450154b9991d9","abstract_canon_sha256":"dd74f25c57ba0d3a88951a4617cb0d82c478066fb4fe3339646d0fe4d9aa1f7b"},"schema_version":"1.0"},"canonical_sha256":"761c39ed7eb2b0e83b8df4c7624fad5078f598fbdf00abcccea1be3bba019c8d","source":{"kind":"arxiv","id":"1305.6292","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6292","created_at":"2026-05-18T01:49:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6292v4","created_at":"2026-05-18T01:49:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6292","created_at":"2026-05-18T01:49:41Z"},{"alias_kind":"pith_short_12","alias_value":"OYODT3L6WKYO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OYODT3L6WKYOQO4N","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OYODT3L6","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OYODT3L6WKYOQO4N6TDWET5NKB","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6292","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T18:54:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fc5b710ca6f9523b40e9b2eb0356a5fd77b2bac74b10a4dacac450154b9991d9","abstract_canon_sha256":"dd74f25c57ba0d3a88951a4617cb0d82c478066fb4fe3339646d0fe4d9aa1f7b"},"schema_version":"1.0"},"canonical_sha256":"761c39ed7eb2b0e83b8df4c7624fad5078f598fbdf00abcccea1be3bba019c8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:41.080732Z","signature_b64":"rsw1rnI7IY9O5JRTG4nVjWfV12QGnZ/hEVVhxhqgeXwSYfugZmrfTUk16Se4zhozhpbizf38E9DEd/gsU+0+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"761c39ed7eb2b0e83b8df4c7624fad5078f598fbdf00abcccea1be3bba019c8d","last_reissued_at":"2026-05-18T01:49:41.080235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:41.080235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6292","source_version":4,"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-18T01:49:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gN6DP83aJTSoymMT0qx4mjPLocSwSs6CfxvizK48/KWJUZnHyBgS3bxolLh1jGe4EXA6GskKf84jvrsLpLhmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:41.084648Z"},"content_sha256":"1b741cd270f04ea66cfb4d92978f9cdebcc161f56c08aad4c9dc0da109f851c8","schema_version":"1.0","event_id":"sha256:1b741cd270f04ea66cfb4d92978f9cdebcc161f56c08aad4c9dc0da109f851c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OYODT3L6WKYOQO4N6TDWET5NKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Sensor Placement for Linear Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amina Chebira, Juri Ranieri, Martin Vetterli","submitted_at":"2013-05-27T18:54:03Z","abstract_excerpt":"A classic problem is the estimation of a set of parameters from measurements collected by only a few sensors. The number of sensors is often limited by physical or economical constraints and their placement is of fundamental importance to obtain accurate estimates. Unfortunately, the selection of the optimal sensor locations is intrinsically combinatorial and the available approximation algorithms are not guaranteed to generate good solutions in all cases of interest. We propose FrameSense, a greedy algorithm for the selection of optimal sensor locations. The core cost function of the algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6292","kind":"arxiv","version":4},"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-18T01:49:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRrd984UX1W+u9IMGV1jCoVERUXQAshSNS9u2YW+SQgfrhAi/XKiD86wFLtnVbUj+RVtogdsiiPTaVM0rOdqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:41.085259Z"},"content_sha256":"896cfeca94d2e1e1e5a24dbff4b7d45d4f11a898697a3b3bca48a395aa63b783","schema_version":"1.0","event_id":"sha256:896cfeca94d2e1e1e5a24dbff4b7d45d4f11a898697a3b3bca48a395aa63b783"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYODT3L6WKYOQO4N6TDWET5NKB/bundle.json","state_url":"https://pith.science/pith/OYODT3L6WKYOQO4N6TDWET5NKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYODT3L6WKYOQO4N6TDWET5NKB/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-05T04:51:41Z","links":{"resolver":"https://pith.science/pith/OYODT3L6WKYOQO4N6TDWET5NKB","bundle":"https://pith.science/pith/OYODT3L6WKYOQO4N6TDWET5NKB/bundle.json","state":"https://pith.science/pith/OYODT3L6WKYOQO4N6TDWET5NKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYODT3L6WKYOQO4N6TDWET5NKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OYODT3L6WKYOQO4N6TDWET5NKB","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":"dd74f25c57ba0d3a88951a4617cb0d82c478066fb4fe3339646d0fe4d9aa1f7b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T18:54:03Z","title_canon_sha256":"fc5b710ca6f9523b40e9b2eb0356a5fd77b2bac74b10a4dacac450154b9991d9"},"schema_version":"1.0","source":{"id":"1305.6292","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6292","created_at":"2026-05-18T01:49:41Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6292v4","created_at":"2026-05-18T01:49:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6292","created_at":"2026-05-18T01:49:41Z"},{"alias_kind":"pith_short_12","alias_value":"OYODT3L6WKYO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OYODT3L6WKYOQO4N","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OYODT3L6","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:896cfeca94d2e1e1e5a24dbff4b7d45d4f11a898697a3b3bca48a395aa63b783","target":"graph","created_at":"2026-05-18T01:49:41Z","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":"A classic problem is the estimation of a set of parameters from measurements collected by only a few sensors. The number of sensors is often limited by physical or economical constraints and their placement is of fundamental importance to obtain accurate estimates. Unfortunately, the selection of the optimal sensor locations is intrinsically combinatorial and the available approximation algorithms are not guaranteed to generate good solutions in all cases of interest. We propose FrameSense, a greedy algorithm for the selection of optimal sensor locations. The core cost function of the algorith","authors_text":"Amina Chebira, Juri Ranieri, Martin Vetterli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T18:54:03Z","title":"Near-Optimal Sensor Placement for Linear Inverse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6292","kind":"arxiv","version":4},"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:1b741cd270f04ea66cfb4d92978f9cdebcc161f56c08aad4c9dc0da109f851c8","target":"record","created_at":"2026-05-18T01:49:41Z","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":"dd74f25c57ba0d3a88951a4617cb0d82c478066fb4fe3339646d0fe4d9aa1f7b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T18:54:03Z","title_canon_sha256":"fc5b710ca6f9523b40e9b2eb0356a5fd77b2bac74b10a4dacac450154b9991d9"},"schema_version":"1.0","source":{"id":"1305.6292","kind":"arxiv","version":4}},"canonical_sha256":"761c39ed7eb2b0e83b8df4c7624fad5078f598fbdf00abcccea1be3bba019c8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"761c39ed7eb2b0e83b8df4c7624fad5078f598fbdf00abcccea1be3bba019c8d","first_computed_at":"2026-05-18T01:49:41.080235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:41.080235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rsw1rnI7IY9O5JRTG4nVjWfV12QGnZ/hEVVhxhqgeXwSYfugZmrfTUk16Se4zhozhpbizf38E9DEd/gsU+0+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:41.080732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6292","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b741cd270f04ea66cfb4d92978f9cdebcc161f56c08aad4c9dc0da109f851c8","sha256:896cfeca94d2e1e1e5a24dbff4b7d45d4f11a898697a3b3bca48a395aa63b783"],"state_sha256":"41dbe1f08b677ed5683d75372bfc0c1a657c49f88e8a55749871c49e4d296beb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3Arn0rOfMBjzpmIH5dhmiyicO7ARDSG+PPe5VwIoVTW96FMvgRnh1YmNVfPVMCq0rW9c1BHZ2erT46npNIQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:51:41.088439Z","bundle_sha256":"63109fd42f5abcb020e10fab983e98d847e605a6abb7e0b246b73e057ff532fc"}}