{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5Y5N6VD3Q2F63NPX3FVMBYXXMB","short_pith_number":"pith:5Y5N6VD3","canonical_record":{"source":{"id":"1206.6532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-06-27T22:14:54Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"62f6c194c09e5c021e5cf8b0d3955072097c2b6a25e381347fda20e56faf689c","abstract_canon_sha256":"f9de5ef1960b484cb75772612ffb3abc363f9fe72e1dfb8f316073b6fc0dc13d"},"schema_version":"1.0"},"canonical_sha256":"ee3adf547b868bedb5f7d96ac0e2f7605e7f3d3ba2a7d15515bd7605bb30fd7d","source":{"kind":"arxiv","id":"1206.6532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6532","created_at":"2026-05-18T01:56:41Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6532v1","created_at":"2026-05-18T01:56:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6532","created_at":"2026-05-18T01:56:41Z"},{"alias_kind":"pith_short_12","alias_value":"5Y5N6VD3Q2F6","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5Y5N6VD3Q2F63NPX","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5Y5N6VD3","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5Y5N6VD3Q2F63NPX3FVMBYXXMB","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-06-27T22:14:54Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"62f6c194c09e5c021e5cf8b0d3955072097c2b6a25e381347fda20e56faf689c","abstract_canon_sha256":"f9de5ef1960b484cb75772612ffb3abc363f9fe72e1dfb8f316073b6fc0dc13d"},"schema_version":"1.0"},"canonical_sha256":"ee3adf547b868bedb5f7d96ac0e2f7605e7f3d3ba2a7d15515bd7605bb30fd7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:56:41.082651Z","signature_b64":"lppZDRyNfXThtUfd66BHgDA1wKexQUT7VMgGB4Dbe+yrX5Tth3XtMnxjt5aYdsqIP2ZRre9AYBwM7XbHdIq7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee3adf547b868bedb5f7d96ac0e2f7605e7f3d3ba2a7d15515bd7605bb30fd7d","last_reissued_at":"2026-05-18T01:56:41.082259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:56:41.082259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6532","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:56:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7zQ7e9YitkFaXnPllS4ErwL5N1ot6ati4DgERMPI5ueKHBsaKa3G/PpFWQI5j2892H+AODMFhnyiY34TN+KCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:17:52.090232Z"},"content_sha256":"b45d977954968f9516f233f0c0b9dd21de8cdf57a32a031ec74721927fbd2da3","schema_version":"1.0","event_id":"sha256:b45d977954968f9516f233f0c0b9dd21de8cdf57a32a031ec74721927fbd2da3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5Y5N6VD3Q2F63NPX3FVMBYXXMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating Nuisance Parameters in Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.NA","authors_text":"Aleksandr Y. Aravkin, Tristan van Leeuwen","submitted_at":"2012-06-27T22:14:54Z","abstract_excerpt":"Many inverse problems include nuisance parameters which, while not of direct interest, are required to recover primary parameters. Structure present in these problems allows efficient optimization strategies - a well known example is variable projection, where nonlinear least squares problems which are linear in some parameters can be very efficiently optimized. In this paper, we extend the idea of projecting out a subset over the variables to a broad class of maximum likelihood (ML) and maximum a posteriori likelihood (MAP) problems with nuisance parameters, such as variance or degrees of fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6532","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:56:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gInParWmBUywHy+MyHCwsCW5YUatQcGnn0VfjL4qnYc2WGl/XS0HwTh8LZBND1wc0wcCrroha+js33H7eQRAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:17:52.090607Z"},"content_sha256":"2fd178af3c48726f0b92d2eb82eafb02bfc68b3b92c043af99635645dc95a2a9","schema_version":"1.0","event_id":"sha256:2fd178af3c48726f0b92d2eb82eafb02bfc68b3b92c043af99635645dc95a2a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Y5N6VD3Q2F63NPX3FVMBYXXMB/bundle.json","state_url":"https://pith.science/pith/5Y5N6VD3Q2F63NPX3FVMBYXXMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Y5N6VD3Q2F63NPX3FVMBYXXMB/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-01T20:17:52Z","links":{"resolver":"https://pith.science/pith/5Y5N6VD3Q2F63NPX3FVMBYXXMB","bundle":"https://pith.science/pith/5Y5N6VD3Q2F63NPX3FVMBYXXMB/bundle.json","state":"https://pith.science/pith/5Y5N6VD3Q2F63NPX3FVMBYXXMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Y5N6VD3Q2F63NPX3FVMBYXXMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5Y5N6VD3Q2F63NPX3FVMBYXXMB","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":"f9de5ef1960b484cb75772612ffb3abc363f9fe72e1dfb8f316073b6fc0dc13d","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-06-27T22:14:54Z","title_canon_sha256":"62f6c194c09e5c021e5cf8b0d3955072097c2b6a25e381347fda20e56faf689c"},"schema_version":"1.0","source":{"id":"1206.6532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6532","created_at":"2026-05-18T01:56:41Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6532v1","created_at":"2026-05-18T01:56:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6532","created_at":"2026-05-18T01:56:41Z"},{"alias_kind":"pith_short_12","alias_value":"5Y5N6VD3Q2F6","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5Y5N6VD3Q2F63NPX","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5Y5N6VD3","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:2fd178af3c48726f0b92d2eb82eafb02bfc68b3b92c043af99635645dc95a2a9","target":"graph","created_at":"2026-05-18T01:56: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":"Many inverse problems include nuisance parameters which, while not of direct interest, are required to recover primary parameters. Structure present in these problems allows efficient optimization strategies - a well known example is variable projection, where nonlinear least squares problems which are linear in some parameters can be very efficiently optimized. In this paper, we extend the idea of projecting out a subset over the variables to a broad class of maximum likelihood (ML) and maximum a posteriori likelihood (MAP) problems with nuisance parameters, such as variance or degrees of fre","authors_text":"Aleksandr Y. Aravkin, Tristan van Leeuwen","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-06-27T22:14:54Z","title":"Estimating Nuisance Parameters in Inverse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6532","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:b45d977954968f9516f233f0c0b9dd21de8cdf57a32a031ec74721927fbd2da3","target":"record","created_at":"2026-05-18T01:56: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":"f9de5ef1960b484cb75772612ffb3abc363f9fe72e1dfb8f316073b6fc0dc13d","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-06-27T22:14:54Z","title_canon_sha256":"62f6c194c09e5c021e5cf8b0d3955072097c2b6a25e381347fda20e56faf689c"},"schema_version":"1.0","source":{"id":"1206.6532","kind":"arxiv","version":1}},"canonical_sha256":"ee3adf547b868bedb5f7d96ac0e2f7605e7f3d3ba2a7d15515bd7605bb30fd7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee3adf547b868bedb5f7d96ac0e2f7605e7f3d3ba2a7d15515bd7605bb30fd7d","first_computed_at":"2026-05-18T01:56:41.082259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:56:41.082259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lppZDRyNfXThtUfd66BHgDA1wKexQUT7VMgGB4Dbe+yrX5Tth3XtMnxjt5aYdsqIP2ZRre9AYBwM7XbHdIq7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:56:41.082651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b45d977954968f9516f233f0c0b9dd21de8cdf57a32a031ec74721927fbd2da3","sha256:2fd178af3c48726f0b92d2eb82eafb02bfc68b3b92c043af99635645dc95a2a9"],"state_sha256":"a149b9d67f12fc4ab6e970db55298a7d8206b9ff2c0a0ad4c64fb99db64e242a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEDID+oEmTQJCYVSQXr13Ny3UdxbLxo9CyM1UrZH+CQv7KMoQGv4v+cQQZ6beY0G9gHCeD104ZwjPgimIUdLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:17:52.092551Z","bundle_sha256":"04ef7210c87c23427f3678259fca316e801c8ce7d08c713ef9c95e029e60452d"}}