{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JHI7YOCNZMCNM5N26YKA4VQQZU","short_pith_number":"pith:JHI7YOCN","canonical_record":{"source":{"id":"2606.25923","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T15:02:24Z","cross_cats_sorted":[],"title_canon_sha256":"e283d77c55ce09972c4d783730f1531e04a9272f4a0f33f3f9d9408775ae7769","abstract_canon_sha256":"d3381e84bdd529fd5d936de3f37f2c9247f9b9230a737b0165e735c4d545ab0c"},"schema_version":"1.0"},"canonical_sha256":"49d1fc384dcb04d675baf6140e5610cd114091f7d20d2fdd198a2b0bccf354b4","source":{"kind":"arxiv","id":"2606.25923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25923","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25923v1","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25923","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"pith_short_12","alias_value":"JHI7YOCNZMCN","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"pith_short_16","alias_value":"JHI7YOCNZMCNM5N2","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"pith_short_8","alias_value":"JHI7YOCN","created_at":"2026-06-25T01:18:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JHI7YOCNZMCNM5N26YKA4VQQZU","target":"record","payload":{"canonical_record":{"source":{"id":"2606.25923","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T15:02:24Z","cross_cats_sorted":[],"title_canon_sha256":"e283d77c55ce09972c4d783730f1531e04a9272f4a0f33f3f9d9408775ae7769","abstract_canon_sha256":"d3381e84bdd529fd5d936de3f37f2c9247f9b9230a737b0165e735c4d545ab0c"},"schema_version":"1.0"},"canonical_sha256":"49d1fc384dcb04d675baf6140e5610cd114091f7d20d2fdd198a2b0bccf354b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:43.323910Z","signature_b64":"5FswZj9KKSNf9hpfwbCoEMH9amzVCiz3mUi1ZU8n7PvnZb1gJQsUPJR+fKSFByrGJRemVoH79fKpfhclPENUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49d1fc384dcb04d675baf6140e5610cd114091f7d20d2fdd198a2b0bccf354b4","last_reissued_at":"2026-06-25T01:18:43.323560Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:43.323560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.25923","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-06-25T01:18:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wHGPFg1BncrkOUwCjsv7sopwf8hhSdt5OuKiksJpFcYm+cDmL+GkhDGiDXVNnoFfcZ0Mmep2iv4ON22AhiSOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:44:11.186390Z"},"content_sha256":"85245eff591f7b5092117796606a413e30eb8cb354cdcfc29a8af352f6c10bff","schema_version":"1.0","event_id":"sha256:85245eff591f7b5092117796606a413e30eb8cb354cdcfc29a8af352f6c10bff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JHI7YOCNZMCNM5N26YKA4VQQZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$\\text{DT}^2$: Decision-Targeted Digital Twins","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Harry Amad, Mihaela van der Schaar","submitted_at":"2026-06-24T15:02:24Z","abstract_excerpt":"A digital twin (DT) is a virtual model of a real-world system that can assist decision-making by simulating scenarios induced by different policies. However, typical machine learning-based DTs do not optimise for this use case. We prove that, when model capacity is limited, training DTs to minimise one-step transition errors can produce suboptimal models for ranking sets of policies according to a reward function. We further show that this holds empirically, even with expressive model classes. To address this, we introduce $\\text{DT}^2$, a decision-targeted DT training paradigm. Firstly, $\\tex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25923","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/2606.25923/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"},"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-06-25T01:18:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UP0nSBpAZp1DmFJapKZlHTec+DiQKHN+pmEJd1/pLDzK8bo0e8sPklbhBeZc1lhSWSX8EaY/YWIOPaI68g4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T15:44:11.186771Z"},"content_sha256":"7ad1530b48b7cd350345e8e79b6d4b6c439854062eb4e9e1dba3d6f99d68387e","schema_version":"1.0","event_id":"sha256:7ad1530b48b7cd350345e8e79b6d4b6c439854062eb4e9e1dba3d6f99d68387e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHI7YOCNZMCNM5N26YKA4VQQZU/bundle.json","state_url":"https://pith.science/pith/JHI7YOCNZMCNM5N26YKA4VQQZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHI7YOCNZMCNM5N26YKA4VQQZU/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-01T15:44:11Z","links":{"resolver":"https://pith.science/pith/JHI7YOCNZMCNM5N26YKA4VQQZU","bundle":"https://pith.science/pith/JHI7YOCNZMCNM5N26YKA4VQQZU/bundle.json","state":"https://pith.science/pith/JHI7YOCNZMCNM5N26YKA4VQQZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHI7YOCNZMCNM5N26YKA4VQQZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JHI7YOCNZMCNM5N26YKA4VQQZU","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":"d3381e84bdd529fd5d936de3f37f2c9247f9b9230a737b0165e735c4d545ab0c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T15:02:24Z","title_canon_sha256":"e283d77c55ce09972c4d783730f1531e04a9272f4a0f33f3f9d9408775ae7769"},"schema_version":"1.0","source":{"id":"2606.25923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25923","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25923v1","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25923","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"pith_short_12","alias_value":"JHI7YOCNZMCN","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"pith_short_16","alias_value":"JHI7YOCNZMCNM5N2","created_at":"2026-06-25T01:18:43Z"},{"alias_kind":"pith_short_8","alias_value":"JHI7YOCN","created_at":"2026-06-25T01:18:43Z"}],"graph_snapshots":[{"event_id":"sha256:7ad1530b48b7cd350345e8e79b6d4b6c439854062eb4e9e1dba3d6f99d68387e","target":"graph","created_at":"2026-06-25T01:18:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.25923/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A digital twin (DT) is a virtual model of a real-world system that can assist decision-making by simulating scenarios induced by different policies. However, typical machine learning-based DTs do not optimise for this use case. We prove that, when model capacity is limited, training DTs to minimise one-step transition errors can produce suboptimal models for ranking sets of policies according to a reward function. We further show that this holds empirically, even with expressive model classes. To address this, we introduce $\\text{DT}^2$, a decision-targeted DT training paradigm. Firstly, $\\tex","authors_text":"Harry Amad, Mihaela van der Schaar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T15:02:24Z","title":"$\\text{DT}^2$: Decision-Targeted Digital Twins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25923","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:85245eff591f7b5092117796606a413e30eb8cb354cdcfc29a8af352f6c10bff","target":"record","created_at":"2026-06-25T01:18:43Z","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":"d3381e84bdd529fd5d936de3f37f2c9247f9b9230a737b0165e735c4d545ab0c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-24T15:02:24Z","title_canon_sha256":"e283d77c55ce09972c4d783730f1531e04a9272f4a0f33f3f9d9408775ae7769"},"schema_version":"1.0","source":{"id":"2606.25923","kind":"arxiv","version":1}},"canonical_sha256":"49d1fc384dcb04d675baf6140e5610cd114091f7d20d2fdd198a2b0bccf354b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49d1fc384dcb04d675baf6140e5610cd114091f7d20d2fdd198a2b0bccf354b4","first_computed_at":"2026-06-25T01:18:43.323560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:43.323560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5FswZj9KKSNf9hpfwbCoEMH9amzVCiz3mUi1ZU8n7PvnZb1gJQsUPJR+fKSFByrGJRemVoH79fKpfhclPENUDQ==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:43.323910Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.25923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85245eff591f7b5092117796606a413e30eb8cb354cdcfc29a8af352f6c10bff","sha256:7ad1530b48b7cd350345e8e79b6d4b6c439854062eb4e9e1dba3d6f99d68387e"],"state_sha256":"b5abb51aa1ce97fdde765d4d634823c21f960f5399c47aaf0dd0bc9f5b4819ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auZlUW568tKg6uQKqeR+ecXzmbHEdxnm5/ETWnzNUhyqrG+6dhHKutdFOmQDdgRuPxZdz5wTWRooIzj7I8lKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T15:44:11.188939Z","bundle_sha256":"3d71e75c771a104449648f4531caec381a9a0adf844168fb399e9a19b0270353"}}