{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OU5SY7ZVUB7VCEU2BGSYN4AVWM","short_pith_number":"pith:OU5SY7ZV","canonical_record":{"source":{"id":"1204.2033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T02:56:57Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"58bb2434828226c1c1cd7e2005695a7125d112aa88c5a28f165ced5207a70c00","abstract_canon_sha256":"1c2292a36d3286572882baf45283e1529fc7e8a994f277a9d88b0cdf7534f9a5"},"schema_version":"1.0"},"canonical_sha256":"753b2c7f35a07f51129a09a586f015b315006f623ce2a77de6b54bd5db6a1b14","source":{"kind":"arxiv","id":"1204.2033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2033","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2033v1","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2033","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"pith_short_12","alias_value":"OU5SY7ZVUB7V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OU5SY7ZVUB7VCEU2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OU5SY7ZV","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OU5SY7ZVUB7VCEU2BGSYN4AVWM","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T02:56:57Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"58bb2434828226c1c1cd7e2005695a7125d112aa88c5a28f165ced5207a70c00","abstract_canon_sha256":"1c2292a36d3286572882baf45283e1529fc7e8a994f277a9d88b0cdf7534f9a5"},"schema_version":"1.0"},"canonical_sha256":"753b2c7f35a07f51129a09a586f015b315006f623ce2a77de6b54bd5db6a1b14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:57:55.504602Z","signature_b64":"mDBnUdr0VC5BHnMlbyPEBsqUdd1KPK9+V8Nw0GFBWi+TGXmWvuVtwlkb9u+zz0aJQ3gel4J+WYF7lyA/vXTeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"753b2c7f35a07f51129a09a586f015b315006f623ce2a77de6b54bd5db6a1b14","last_reissued_at":"2026-05-18T01:57:55.504007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:57:55.504007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2033","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-18T01:57:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c33ss+QjT63pCxx4Djzd8Ol1KnzKV/xg7NgjJndOLWAWh1Ge0vCVhK39dXOPva1TEQk+l+vtCYF7H8GPZLAnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:31:39.003068Z"},"content_sha256":"92e0c1d650075a7634d903e25e7a0ea97f01ea138f46d2f4d150f9bc4ca9ab7b","schema_version":"1.0","event_id":"sha256:92e0c1d650075a7634d903e25e7a0ea97f01ea138f46d2f4d150f9bc4ca9ab7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OU5SY7ZVUB7VCEU2BGSYN4AVWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Constrained Cramer Rao Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Paul Tune","submitted_at":"2012-04-10T02:56:57Z","abstract_excerpt":"We revisit the problem of computing submatrices of the Cram\\'er-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter $\\vth$. We explore iterative methods that avoid direct inversion of the Fisher information matrix, which can be computationally expensive when the dimension of $\\vth$ is large. The computation of the bound is related to the quadratic matrix program, where there are highly efficient methods for solving it. We present several methods, and show that algorithms in prior work are special instances of existing optimization algorithms. Some o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2033","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-18T01:57:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X92pbNAFc8H+nFfo/NTZsSMG7qHknxYZTCRJfjpkd5dg28WvkmntoxJzBY80zPlLjA4buFJUUY1+XdSFTsulBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T13:31:39.003424Z"},"content_sha256":"587f8cb6041985db084a10626db7352564e61a157102a154aee2576c9b6eb92a","schema_version":"1.0","event_id":"sha256:587f8cb6041985db084a10626db7352564e61a157102a154aee2576c9b6eb92a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OU5SY7ZVUB7VCEU2BGSYN4AVWM/bundle.json","state_url":"https://pith.science/pith/OU5SY7ZVUB7VCEU2BGSYN4AVWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OU5SY7ZVUB7VCEU2BGSYN4AVWM/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-07-04T13:31:39Z","links":{"resolver":"https://pith.science/pith/OU5SY7ZVUB7VCEU2BGSYN4AVWM","bundle":"https://pith.science/pith/OU5SY7ZVUB7VCEU2BGSYN4AVWM/bundle.json","state":"https://pith.science/pith/OU5SY7ZVUB7VCEU2BGSYN4AVWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OU5SY7ZVUB7VCEU2BGSYN4AVWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OU5SY7ZVUB7VCEU2BGSYN4AVWM","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":"1c2292a36d3286572882baf45283e1529fc7e8a994f277a9d88b0cdf7534f9a5","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T02:56:57Z","title_canon_sha256":"58bb2434828226c1c1cd7e2005695a7125d112aa88c5a28f165ced5207a70c00"},"schema_version":"1.0","source":{"id":"1204.2033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2033","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2033v1","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2033","created_at":"2026-05-18T01:57:55Z"},{"alias_kind":"pith_short_12","alias_value":"OU5SY7ZVUB7V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OU5SY7ZVUB7VCEU2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OU5SY7ZV","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:587f8cb6041985db084a10626db7352564e61a157102a154aee2576c9b6eb92a","target":"graph","created_at":"2026-05-18T01:57:55Z","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 revisit the problem of computing submatrices of the Cram\\'er-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter $\\vth$. We explore iterative methods that avoid direct inversion of the Fisher information matrix, which can be computationally expensive when the dimension of $\\vth$ is large. The computation of the bound is related to the quadratic matrix program, where there are highly efficient methods for solving it. We present several methods, and show that algorithms in prior work are special instances of existing optimization algorithms. Some o","authors_text":"Paul Tune","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T02:56:57Z","title":"Computing Constrained Cramer Rao Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2033","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:92e0c1d650075a7634d903e25e7a0ea97f01ea138f46d2f4d150f9bc4ca9ab7b","target":"record","created_at":"2026-05-18T01:57:55Z","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":"1c2292a36d3286572882baf45283e1529fc7e8a994f277a9d88b0cdf7534f9a5","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-10T02:56:57Z","title_canon_sha256":"58bb2434828226c1c1cd7e2005695a7125d112aa88c5a28f165ced5207a70c00"},"schema_version":"1.0","source":{"id":"1204.2033","kind":"arxiv","version":1}},"canonical_sha256":"753b2c7f35a07f51129a09a586f015b315006f623ce2a77de6b54bd5db6a1b14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"753b2c7f35a07f51129a09a586f015b315006f623ce2a77de6b54bd5db6a1b14","first_computed_at":"2026-05-18T01:57:55.504007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:57:55.504007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mDBnUdr0VC5BHnMlbyPEBsqUdd1KPK9+V8Nw0GFBWi+TGXmWvuVtwlkb9u+zz0aJQ3gel4J+WYF7lyA/vXTeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:57:55.504602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92e0c1d650075a7634d903e25e7a0ea97f01ea138f46d2f4d150f9bc4ca9ab7b","sha256:587f8cb6041985db084a10626db7352564e61a157102a154aee2576c9b6eb92a"],"state_sha256":"0223ac5a622f1d42eca31228dbe6b74d495d4f145707e115dba8c1045c964203"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qurQJDVCrnd5JlYmLpdx3AeAUgS5yWC5ib784aVFpujyP4RVaw0MeJOwGxOHkVkuH2pKDbNUKGqhpSzBNh88CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T13:31:39.005305Z","bundle_sha256":"246860c24cd02332d3fa5182b5a6db9aa339031bd75d88d495d8c300f9a92472"}}