{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AKGS4VM5NOJJQ7OETDM23CJKN7","short_pith_number":"pith:AKGS4VM5","schema_version":"1.0","canonical_sha256":"028d2e559d6b92987dc498d9ad892a6fc4c4bedaf67a0afbb951afc5e64eb2b9","source":{"kind":"arxiv","id":"2506.18074","version":1},"attestation_state":"computed","paper":{"title":"Distributionally robust minimization in meta-learning for system identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Dario Piga, Marco Forgione, Matteo Rufolo","submitted_at":"2025-06-22T15:41:22Z","abstract_excerpt":"Meta learning aims at learning how to solve tasks, and thus it allows to estimate models that can be quickly adapted to new scenarios. This work explores distributionally robust minimization in meta learning for system identification. Standard meta learning approaches optimize the expected loss, overlooking task variability. We use an alternative approach, adopting a distributionally robust optimization paradigm that prioritizes high-loss tasks, enhancing performance in worst-case scenarios. Evaluated on a meta model trained on a class of synthetic dynamical systems and tested in both in-distr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.18074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-22T15:41:22Z","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"title_canon_sha256":"d67c2a8d765599be5cff97e1a6c58f4512a2272664192126dcdb5cea4a2109ee","abstract_canon_sha256":"7e0088139b4a63df11b02bfdff4c686e856c10bbf14ba38059fbd05c992d2574"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:28.109822Z","signature_b64":"F1zuqZpxKJCeeE4ikeFsDD9VVVcaTu3tZY0K/2ljJ1F+fHzwbNybIn35wZRKBL1oPAvc4s0fLWXPPOxYZ0jICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"028d2e559d6b92987dc498d9ad892a6fc4c4bedaf67a0afbb951afc5e64eb2b9","last_reissued_at":"2026-07-05T11:25:28.109465Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:28.109465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributionally robust minimization in meta-learning for system identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Dario Piga, Marco Forgione, Matteo Rufolo","submitted_at":"2025-06-22T15:41:22Z","abstract_excerpt":"Meta learning aims at learning how to solve tasks, and thus it allows to estimate models that can be quickly adapted to new scenarios. This work explores distributionally robust minimization in meta learning for system identification. Standard meta learning approaches optimize the expected loss, overlooking task variability. We use an alternative approach, adopting a distributionally robust optimization paradigm that prioritizes high-loss tasks, enhancing performance in worst-case scenarios. Evaluated on a meta model trained on a class of synthetic dynamical systems and tested in both in-distr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.18074","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.18074/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.18074","created_at":"2026-07-05T11:25:28.109522+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.18074v1","created_at":"2026-07-05T11:25:28.109522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.18074","created_at":"2026-07-05T11:25:28.109522+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKGS4VM5NOJJ","created_at":"2026-07-05T11:25:28.109522+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKGS4VM5NOJJQ7OE","created_at":"2026-07-05T11:25:28.109522+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKGS4VM5","created_at":"2026-07-05T11:25:28.109522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AKGS4VM5NOJJQ7OETDM23CJKN7","json":"https://pith.science/pith/AKGS4VM5NOJJQ7OETDM23CJKN7.json","graph_json":"https://pith.science/api/pith-number/AKGS4VM5NOJJQ7OETDM23CJKN7/graph.json","events_json":"https://pith.science/api/pith-number/AKGS4VM5NOJJQ7OETDM23CJKN7/events.json","paper":"https://pith.science/paper/AKGS4VM5"},"agent_actions":{"view_html":"https://pith.science/pith/AKGS4VM5NOJJQ7OETDM23CJKN7","download_json":"https://pith.science/pith/AKGS4VM5NOJJQ7OETDM23CJKN7.json","view_paper":"https://pith.science/paper/AKGS4VM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.18074&json=true","fetch_graph":"https://pith.science/api/pith-number/AKGS4VM5NOJJQ7OETDM23CJKN7/graph.json","fetch_events":"https://pith.science/api/pith-number/AKGS4VM5NOJJQ7OETDM23CJKN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKGS4VM5NOJJQ7OETDM23CJKN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKGS4VM5NOJJQ7OETDM23CJKN7/action/storage_attestation","attest_author":"https://pith.science/pith/AKGS4VM5NOJJQ7OETDM23CJKN7/action/author_attestation","sign_citation":"https://pith.science/pith/AKGS4VM5NOJJQ7OETDM23CJKN7/action/citation_signature","submit_replication":"https://pith.science/pith/AKGS4VM5NOJJQ7OETDM23CJKN7/action/replication_record"}},"created_at":"2026-07-05T11:25:28.109522+00:00","updated_at":"2026-07-05T11:25:28.109522+00:00"}