{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7FYCRMZ3WJJ57HNY47MMFVJKT6","short_pith_number":"pith:7FYCRMZ3","canonical_record":{"source":{"id":"1501.02579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-12T09:34:27Z","cross_cats_sorted":[],"title_canon_sha256":"b35a042df6584a81d0a42fe3355a2e02275e89a87aca6710dd9c6e5ba6471a3e","abstract_canon_sha256":"3e4d79a47d7402713750b9d85974c5f72ee21533d2e549947142109c86616663"},"schema_version":"1.0"},"canonical_sha256":"f97028b33bb253df9db8e7d8c2d52a9f9d4b78a15503ded3d7c41346dcd8ae7f","source":{"kind":"arxiv","id":"1501.02579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02579","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02579v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02579","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"7FYCRMZ3WJJ5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7FYCRMZ3WJJ57HNY","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7FYCRMZ3","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7FYCRMZ3WJJ57HNY47MMFVJKT6","target":"record","payload":{"canonical_record":{"source":{"id":"1501.02579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-12T09:34:27Z","cross_cats_sorted":[],"title_canon_sha256":"b35a042df6584a81d0a42fe3355a2e02275e89a87aca6710dd9c6e5ba6471a3e","abstract_canon_sha256":"3e4d79a47d7402713750b9d85974c5f72ee21533d2e549947142109c86616663"},"schema_version":"1.0"},"canonical_sha256":"f97028b33bb253df9db8e7d8c2d52a9f9d4b78a15503ded3d7c41346dcd8ae7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.641667Z","signature_b64":"2auKmUUtWkvrQN/trkO634bx1arcxq5F9waOfxfqhPM1/umv3ramT8+Cy63D6YaM62WDUxeldS9vnXxZMG6tCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f97028b33bb253df9db8e7d8c2d52a9f9d4b78a15503ded3d7c41346dcd8ae7f","last_reissued_at":"2026-05-18T02:29:37.641307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.641307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.02579","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-18T02:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lv9/+ugDMit6lKWJa9b2NCcYdjCsio6IH251CKBcowWP1jVBt/3uDt28nJtS7tMcHvjcTqWdteO03lR6XX7SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:02:34.324800Z"},"content_sha256":"469666beffa2ba99be657e71735d191c1a27377bb306fcc01081090444333aef","schema_version":"1.0","event_id":"sha256:469666beffa2ba99be657e71735d191c1a27377bb306fcc01081090444333aef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7FYCRMZ3WJJ57HNY47MMFVJKT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combined modeling of sparse and dense noise for improvement of Relevance Vector Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Magnus Jansson, Martin Sundin, Saikat Chatterjee","submitted_at":"2015-01-12T09:34:27Z","abstract_excerpt":"Using a Bayesian approach, we consider the problem of recovering sparse signals under additive sparse and dense noise. Typically, sparse noise models outliers, impulse bursts or data loss. To handle sparse noise, existing methods simultaneously estimate the sparse signal of interest and the sparse noise of no interest. For estimating the sparse signal, without the need of estimating the sparse noise, we construct a robust Relevance Vector Machine (RVM). In the RVM, sparse noise and ever present dense noise are treated through a combined noise model. The precision of combined noise is modeled b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02579","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-18T02:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"taGIz8nQQDqpvzzBgYAtEhxJaOXJn8V2t2KWHXaR4j66SkAABSgOuZEn0hzk82hnLCag+U9SklUH23zaTpKODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T11:02:34.325520Z"},"content_sha256":"b500e3a4ff4ff1fc32a0adb8aa3cd7aed3739936b509ea4ae31d064c60b763f9","schema_version":"1.0","event_id":"sha256:b500e3a4ff4ff1fc32a0adb8aa3cd7aed3739936b509ea4ae31d064c60b763f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FYCRMZ3WJJ57HNY47MMFVJKT6/bundle.json","state_url":"https://pith.science/pith/7FYCRMZ3WJJ57HNY47MMFVJKT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FYCRMZ3WJJ57HNY47MMFVJKT6/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-08-20T11:02:34Z","links":{"resolver":"https://pith.science/pith/7FYCRMZ3WJJ57HNY47MMFVJKT6","bundle":"https://pith.science/pith/7FYCRMZ3WJJ57HNY47MMFVJKT6/bundle.json","state":"https://pith.science/pith/7FYCRMZ3WJJ57HNY47MMFVJKT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FYCRMZ3WJJ57HNY47MMFVJKT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7FYCRMZ3WJJ57HNY47MMFVJKT6","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":"3e4d79a47d7402713750b9d85974c5f72ee21533d2e549947142109c86616663","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-12T09:34:27Z","title_canon_sha256":"b35a042df6584a81d0a42fe3355a2e02275e89a87aca6710dd9c6e5ba6471a3e"},"schema_version":"1.0","source":{"id":"1501.02579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02579","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02579v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02579","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"7FYCRMZ3WJJ5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7FYCRMZ3WJJ57HNY","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7FYCRMZ3","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:b500e3a4ff4ff1fc32a0adb8aa3cd7aed3739936b509ea4ae31d064c60b763f9","target":"graph","created_at":"2026-05-18T02:29:37Z","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":"Using a Bayesian approach, we consider the problem of recovering sparse signals under additive sparse and dense noise. Typically, sparse noise models outliers, impulse bursts or data loss. To handle sparse noise, existing methods simultaneously estimate the sparse signal of interest and the sparse noise of no interest. For estimating the sparse signal, without the need of estimating the sparse noise, we construct a robust Relevance Vector Machine (RVM). In the RVM, sparse noise and ever present dense noise are treated through a combined noise model. The precision of combined noise is modeled b","authors_text":"Magnus Jansson, Martin Sundin, Saikat Chatterjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-12T09:34:27Z","title":"Combined modeling of sparse and dense noise for improvement of Relevance Vector Machine"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02579","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:469666beffa2ba99be657e71735d191c1a27377bb306fcc01081090444333aef","target":"record","created_at":"2026-05-18T02:29:37Z","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":"3e4d79a47d7402713750b9d85974c5f72ee21533d2e549947142109c86616663","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-12T09:34:27Z","title_canon_sha256":"b35a042df6584a81d0a42fe3355a2e02275e89a87aca6710dd9c6e5ba6471a3e"},"schema_version":"1.0","source":{"id":"1501.02579","kind":"arxiv","version":1}},"canonical_sha256":"f97028b33bb253df9db8e7d8c2d52a9f9d4b78a15503ded3d7c41346dcd8ae7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f97028b33bb253df9db8e7d8c2d52a9f9d4b78a15503ded3d7c41346dcd8ae7f","first_computed_at":"2026-05-18T02:29:37.641307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:37.641307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2auKmUUtWkvrQN/trkO634bx1arcxq5F9waOfxfqhPM1/umv3ramT8+Cy63D6YaM62WDUxeldS9vnXxZMG6tCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:37.641667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:469666beffa2ba99be657e71735d191c1a27377bb306fcc01081090444333aef","sha256:b500e3a4ff4ff1fc32a0adb8aa3cd7aed3739936b509ea4ae31d064c60b763f9"],"state_sha256":"a3f5aafec1accbd8848ed148bdb04136f7146ae7564acc082f8cde2ceca64a65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N0ZixwuOxI9XDi9xYmIMuZ51bP1hLxcq20VlRUXMGV4Hb7WSVv9qYEWtgaHZuS7/fDWkEdxdiH/LQ28pwMLTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T11:02:34.329774Z","bundle_sha256":"7c2432dc07518da944440315ae0fedac68567a21437b51d48474e54101eda671"}}