{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HNMOMKPODOKD4CLJDYFAXV5TQO","short_pith_number":"pith:HNMOMKPO","canonical_record":{"source":{"id":"2604.19072","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-21T04:27:12Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"aefd48050c6592aa7cd471852669dc29977f5011743fba314bf475290a899c81","abstract_canon_sha256":"f39ecbbff5bfd1c66349d3ec117dbc79c405328f111c24b529b63f75976506f7"},"schema_version":"1.0"},"canonical_sha256":"3b58e629ee1b943e09691e0a0bd7b3839c42e51dac1a5909a7ca1bc1696697dd","source":{"kind":"arxiv","id":"2604.19072","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.19072","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2604.19072v3","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.19072","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"HNMOMKPODOKD","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"HNMOMKPODOKD4CLJ","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"HNMOMKPO","created_at":"2026-05-28T02:04:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HNMOMKPODOKD4CLJDYFAXV5TQO","target":"record","payload":{"canonical_record":{"source":{"id":"2604.19072","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-21T04:27:12Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"aefd48050c6592aa7cd471852669dc29977f5011743fba314bf475290a899c81","abstract_canon_sha256":"f39ecbbff5bfd1c66349d3ec117dbc79c405328f111c24b529b63f75976506f7"},"schema_version":"1.0"},"canonical_sha256":"3b58e629ee1b943e09691e0a0bd7b3839c42e51dac1a5909a7ca1bc1696697dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:48.088696Z","signature_b64":"eBb2s68mY756M5ymSqMChJ8Ul9q/i/jkk0E43bX/8rMvqafNDoXDzEu2ORTd1NM0KAsnEjLlib44o1qKkvDGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b58e629ee1b943e09691e0a0bd7b3839c42e51dac1a5909a7ca1bc1696697dd","last_reissued_at":"2026-05-28T02:04:48.088186Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:48.088186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.19072","source_version":3,"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-28T02:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f56OKx4wMKvnzX22fEStaUzpLLneje5ZYM8P4CpCoRHHKqmeeHXAb/SfoLztRr9Ir4Sug5hwsbPZ6aBjxsgBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:38:20.661212Z"},"content_sha256":"6e1e5c0021af624cd6c886eddf639b29f595b141aa41f25829139a65ba505126","schema_version":"1.0","event_id":"sha256:6e1e5c0021af624cd6c886eddf639b29f595b141aa41f25829139a65ba505126"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HNMOMKPODOKD4CLJDYFAXV5TQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"S2MAM: Semi-supervised Meta Additive Model for Robust Estimation and Variable Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"S2MAM uses bilevel optimization to automatically select informative variables and update similarity matrices in manifold-regularized semi-supervised learning.","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bin Gu, Hong Chen, Tieliang Gong, Xuelin Zhang, Yingjie Wang","submitted_at":"2026-04-21T04:27:12Z","abstract_excerpt":"Semi-supervised learning with manifold regularization is a classical framework for jointly learning from both labeled and unlabeled data, where the key requirement is that the support of the unknown marginal distribution has the geometric structure of a Riemannian manifold. Typically, the Laplace-Beltrami operator-based manifold regularization can be approximated empirically by the Laplacian regularization associated with the entire training data and its corresponding graph Laplacian matrix. However, the graph Laplacian matrix depends heavily on the prespecified similarity metric and may lead "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"This paper proposes a new Semi-Supervised Meta Additive Model (S2MAM) based on a bilevel optimization scheme that automatically identifies informative variables, updates the similarity matrix, and simultaneously achieves interpretable predictions. Theoretical guarantees are provided for S2MAM, including the computing convergence and the statistical generalization bound.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that the support of the unknown marginal distribution has the geometric structure of a Riemannian manifold, and that the bilevel optimization can effectively update the similarity matrix without introducing new biases.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"S2MAM is a new semi-supervised model that uses bilevel optimization to automatically identify informative variables, update similarity matrices, and provide interpretable predictions with theoretical guarantees.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"S2MAM uses bilevel optimization to automatically select informative variables and update similarity matrices in manifold-regularized semi-supervised learning.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8cad6b2a1a50673281f5ede8e54813eae07503d7148cf50b726306589211d769"},"source":{"id":"2604.19072","kind":"arxiv","version":3},"verdict":{"id":"74365cc2-f507-4b3a-a9bf-f73154b4edc2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T03:34:31.646993Z","strongest_claim":"This paper proposes a new Semi-Supervised Meta Additive Model (S2MAM) based on a bilevel optimization scheme that automatically identifies informative variables, updates the similarity matrix, and simultaneously achieves interpretable predictions. Theoretical guarantees are provided for S2MAM, including the computing convergence and the statistical generalization bound.","one_line_summary":"S2MAM is a new semi-supervised model that uses bilevel optimization to automatically identify informative variables, update similarity matrices, and provide interpretable predictions with theoretical guarantees.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that the support of the unknown marginal distribution has the geometric structure of a Riemannian manifold, and that the bilevel optimization can effectively update the similarity matrix without introducing new biases.","pith_extraction_headline":"S2MAM uses bilevel optimization to automatically select informative variables and update similarity matrices in manifold-regularized semi-supervised learning."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.19072/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-20T03:23:11.896930Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"a0293b565782c54636131c0069ce6ad637aadb41655d46666c2cbac788519598"},"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":"74365cc2-f507-4b3a-a9bf-f73154b4edc2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T02:04:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IewxwUS/BnNcd7K4baNMumKhJ1mxPbbxaPFdrC6GE0dUafOIRzRBxSq++cYwRkDdFj5cQo3B2amYgxNPmy+gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:38:20.661735Z"},"content_sha256":"5edf3e03497a5f757b65af705afaf457b1638ce615e5919fbe9f85b84b5b9faf","schema_version":"1.0","event_id":"sha256:5edf3e03497a5f757b65af705afaf457b1638ce615e5919fbe9f85b84b5b9faf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNMOMKPODOKD4CLJDYFAXV5TQO/bundle.json","state_url":"https://pith.science/pith/HNMOMKPODOKD4CLJDYFAXV5TQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNMOMKPODOKD4CLJDYFAXV5TQO/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-23T14:38:20Z","links":{"resolver":"https://pith.science/pith/HNMOMKPODOKD4CLJDYFAXV5TQO","bundle":"https://pith.science/pith/HNMOMKPODOKD4CLJDYFAXV5TQO/bundle.json","state":"https://pith.science/pith/HNMOMKPODOKD4CLJDYFAXV5TQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNMOMKPODOKD4CLJDYFAXV5TQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HNMOMKPODOKD4CLJDYFAXV5TQO","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":"f39ecbbff5bfd1c66349d3ec117dbc79c405328f111c24b529b63f75976506f7","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-21T04:27:12Z","title_canon_sha256":"aefd48050c6592aa7cd471852669dc29977f5011743fba314bf475290a899c81"},"schema_version":"1.0","source":{"id":"2604.19072","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.19072","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2604.19072v3","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.19072","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"HNMOMKPODOKD","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"HNMOMKPODOKD4CLJ","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"HNMOMKPO","created_at":"2026-05-28T02:04:48Z"}],"graph_snapshots":[{"event_id":"sha256:5edf3e03497a5f757b65af705afaf457b1638ce615e5919fbe9f85b84b5b9faf","target":"graph","created_at":"2026-05-28T02:04:48Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"This paper proposes a new Semi-Supervised Meta Additive Model (S2MAM) based on a bilevel optimization scheme that automatically identifies informative variables, updates the similarity matrix, and simultaneously achieves interpretable predictions. Theoretical guarantees are provided for S2MAM, including the computing convergence and the statistical generalization bound."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that the support of the unknown marginal distribution has the geometric structure of a Riemannian manifold, and that the bilevel optimization can effectively update the similarity matrix without introducing new biases."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"S2MAM is a new semi-supervised model that uses bilevel optimization to automatically identify informative variables, update similarity matrices, and provide interpretable predictions with theoretical guarantees."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"S2MAM uses bilevel optimization to automatically select informative variables and update similarity matrices in manifold-regularized semi-supervised learning."}],"snapshot_sha256":"8cad6b2a1a50673281f5ede8e54813eae07503d7148cf50b726306589211d769"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T03:23:11.896930Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.19072/integrity.json","findings":[],"snapshot_sha256":"a0293b565782c54636131c0069ce6ad637aadb41655d46666c2cbac788519598","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semi-supervised learning with manifold regularization is a classical framework for jointly learning from both labeled and unlabeled data, where the key requirement is that the support of the unknown marginal distribution has the geometric structure of a Riemannian manifold. Typically, the Laplace-Beltrami operator-based manifold regularization can be approximated empirically by the Laplacian regularization associated with the entire training data and its corresponding graph Laplacian matrix. However, the graph Laplacian matrix depends heavily on the prespecified similarity metric and may lead ","authors_text":"Bin Gu, Hong Chen, Tieliang Gong, Xuelin Zhang, Yingjie Wang","cross_cats":["cs.AI","stat.ML"],"headline":"S2MAM uses bilevel optimization to automatically select informative variables and update similarity matrices in manifold-regularized semi-supervised learning.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-21T04:27:12Z","title":"S2MAM: Semi-supervised Meta Additive Model for Robust Estimation and Variable Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.19072","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-10T03:34:31.646993Z","id":"74365cc2-f507-4b3a-a9bf-f73154b4edc2","model_set":{"reader":"grok-4.3"},"one_line_summary":"S2MAM is a new semi-supervised model that uses bilevel optimization to automatically identify informative variables, update similarity matrices, and provide interpretable predictions with theoretical guarantees.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"S2MAM uses bilevel optimization to automatically select informative variables and update similarity matrices in manifold-regularized semi-supervised learning.","strongest_claim":"This paper proposes a new Semi-Supervised Meta Additive Model (S2MAM) based on a bilevel optimization scheme that automatically identifies informative variables, updates the similarity matrix, and simultaneously achieves interpretable predictions. Theoretical guarantees are provided for S2MAM, including the computing convergence and the statistical generalization bound.","weakest_assumption":"The assumption that the support of the unknown marginal distribution has the geometric structure of a Riemannian manifold, and that the bilevel optimization can effectively update the similarity matrix without introducing new biases."}},"verdict_id":"74365cc2-f507-4b3a-a9bf-f73154b4edc2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e1e5c0021af624cd6c886eddf639b29f595b141aa41f25829139a65ba505126","target":"record","created_at":"2026-05-28T02:04:48Z","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":"f39ecbbff5bfd1c66349d3ec117dbc79c405328f111c24b529b63f75976506f7","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-21T04:27:12Z","title_canon_sha256":"aefd48050c6592aa7cd471852669dc29977f5011743fba314bf475290a899c81"},"schema_version":"1.0","source":{"id":"2604.19072","kind":"arxiv","version":3}},"canonical_sha256":"3b58e629ee1b943e09691e0a0bd7b3839c42e51dac1a5909a7ca1bc1696697dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b58e629ee1b943e09691e0a0bd7b3839c42e51dac1a5909a7ca1bc1696697dd","first_computed_at":"2026-05-28T02:04:48.088186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T02:04:48.088186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eBb2s68mY756M5ymSqMChJ8Ul9q/i/jkk0E43bX/8rMvqafNDoXDzEu2ORTd1NM0KAsnEjLlib44o1qKkvDGBA==","signature_status":"signed_v1","signed_at":"2026-05-28T02:04:48.088696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.19072","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e1e5c0021af624cd6c886eddf639b29f595b141aa41f25829139a65ba505126","sha256:5edf3e03497a5f757b65af705afaf457b1638ce615e5919fbe9f85b84b5b9faf"],"state_sha256":"fab90d86251bb68e0019b75b4235efaf902ea8ccb0ecb9fda02faddb9cb96d2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+VNq9ahS22NX7I2jnT09JGqC3OKP+F0Y9PThpl2clblO+GvAgrQ1J9Q9PJmEtq/e9NxUnjp4g5iJL7ZSFbrvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:38:20.664008Z","bundle_sha256":"4dd68817a3bbd8f6405121ca07626f145194222722a1061708d1f6f7cacc764a"}}