{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:TZEJZZHANTHRQJSSFZBLAN2I4J","short_pith_number":"pith:TZEJZZHA","canonical_record":{"source":{"id":"2308.12670","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-08-24T09:27:38Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"04c2d31837ec27a6f0e35e70f678dec6944379f9cf213e6ba2383e52aa4733a9","abstract_canon_sha256":"7fc0707ebf675bed93b9257c25a12d440468ac2b754de1b7823c10e6ab5e5ef4"},"schema_version":"1.0"},"canonical_sha256":"9e489ce4e06ccf1826522e42b03748e26d4298f40a8aeba2c356b9a5ad36b56e","source":{"kind":"arxiv","id":"2308.12670","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.12670","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"arxiv_version","alias_value":"2308.12670v2","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12670","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"pith_short_12","alias_value":"TZEJZZHANTHR","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"pith_short_16","alias_value":"TZEJZZHANTHRQJSS","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"pith_short_8","alias_value":"TZEJZZHA","created_at":"2026-07-05T07:09:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:TZEJZZHANTHRQJSSFZBLAN2I4J","target":"record","payload":{"canonical_record":{"source":{"id":"2308.12670","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-08-24T09:27:38Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"04c2d31837ec27a6f0e35e70f678dec6944379f9cf213e6ba2383e52aa4733a9","abstract_canon_sha256":"7fc0707ebf675bed93b9257c25a12d440468ac2b754de1b7823c10e6ab5e5ef4"},"schema_version":"1.0"},"canonical_sha256":"9e489ce4e06ccf1826522e42b03748e26d4298f40a8aeba2c356b9a5ad36b56e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:30.961896Z","signature_b64":"cplLYWJv+yBqWQugVXk2K4+GbqiHwt6sfrPjS30OkF4gd+7oJiBgL6BxKDCoSc7vYxvya2t/Qg+M9JFIhxbwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e489ce4e06ccf1826522e42b03748e26d4298f40a8aeba2c356b9a5ad36b56e","last_reissued_at":"2026-07-05T07:09:30.961389Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:30.961389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.12670","source_version":2,"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-07-05T07:09:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgl9Qi2so7ly1kQggkhL+r/aXJv3DYcrsTjh+AywQ/6yXSacfIFcYuU6DYZuyi+SiiLfWXJbI9d0fZ+8JhsJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:41:52.599622Z"},"content_sha256":"3a3d024fb0704dae8d35cdecafe9f308e11b0cdf9bb6183f78e1d3ed22c46ec0","schema_version":"1.0","event_id":"sha256:3a3d024fb0704dae8d35cdecafe9f308e11b0cdf9bb6183f78e1d3ed22c46ec0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:TZEJZZHANTHRQJSSFZBLAN2I4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal data pooling for shared learning in maintenance operations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.LG","authors_text":"Collin Drent, Geert-Jan van Houtum, Melvin Drent","submitted_at":"2023-08-24T09:27:38Z","abstract_excerpt":"We study optimal data pooling for shared learning in two common maintenance operations: condition-based maintenance and spare parts management. We consider a set of systems subject to Poisson input -- the degradation or demand process -- that are coupled through an a-priori unknown rate. Decision problems involving these systems are high-dimensional Markov decision processes (MDPs) and hence notoriously difficult to solve. We present a decomposition result that reduces such an MDP to two-dimensional MDPs, enabling structural analyses and computations. Leveraging this decomposition, we (i) demo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12670","kind":"arxiv","version":2},"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/2308.12670/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-07-05T07:09:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjCyG+qOjH/WqO5BoRPvnpeSvrNgfnEMVPH1JlTSUJDannyGxU9wgLJOsqKReaJBSt2hPIhxcQzftUjcRbobBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T20:41:52.599911Z"},"content_sha256":"a815343e0734a35c6e9cb387c329d3ebfd9d0118c4d433ab1236fdf06df5f7c0","schema_version":"1.0","event_id":"sha256:a815343e0734a35c6e9cb387c329d3ebfd9d0118c4d433ab1236fdf06df5f7c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZEJZZHANTHRQJSSFZBLAN2I4J/bundle.json","state_url":"https://pith.science/pith/TZEJZZHANTHRQJSSFZBLAN2I4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZEJZZHANTHRQJSSFZBLAN2I4J/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-31T20:41:52Z","links":{"resolver":"https://pith.science/pith/TZEJZZHANTHRQJSSFZBLAN2I4J","bundle":"https://pith.science/pith/TZEJZZHANTHRQJSSFZBLAN2I4J/bundle.json","state":"https://pith.science/pith/TZEJZZHANTHRQJSSFZBLAN2I4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZEJZZHANTHRQJSSFZBLAN2I4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TZEJZZHANTHRQJSSFZBLAN2I4J","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":"7fc0707ebf675bed93b9257c25a12d440468ac2b754de1b7823c10e6ab5e5ef4","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-08-24T09:27:38Z","title_canon_sha256":"04c2d31837ec27a6f0e35e70f678dec6944379f9cf213e6ba2383e52aa4733a9"},"schema_version":"1.0","source":{"id":"2308.12670","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.12670","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"arxiv_version","alias_value":"2308.12670v2","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12670","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"pith_short_12","alias_value":"TZEJZZHANTHR","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"pith_short_16","alias_value":"TZEJZZHANTHRQJSS","created_at":"2026-07-05T07:09:30Z"},{"alias_kind":"pith_short_8","alias_value":"TZEJZZHA","created_at":"2026-07-05T07:09:30Z"}],"graph_snapshots":[{"event_id":"sha256:a815343e0734a35c6e9cb387c329d3ebfd9d0118c4d433ab1236fdf06df5f7c0","target":"graph","created_at":"2026-07-05T07:09:30Z","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/2308.12670/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study optimal data pooling for shared learning in two common maintenance operations: condition-based maintenance and spare parts management. We consider a set of systems subject to Poisson input -- the degradation or demand process -- that are coupled through an a-priori unknown rate. Decision problems involving these systems are high-dimensional Markov decision processes (MDPs) and hence notoriously difficult to solve. We present a decomposition result that reduces such an MDP to two-dimensional MDPs, enabling structural analyses and computations. Leveraging this decomposition, we (i) demo","authors_text":"Collin Drent, Geert-Jan van Houtum, Melvin Drent","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-08-24T09:27:38Z","title":"Optimal data pooling for shared learning in maintenance operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12670","kind":"arxiv","version":2},"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:3a3d024fb0704dae8d35cdecafe9f308e11b0cdf9bb6183f78e1d3ed22c46ec0","target":"record","created_at":"2026-07-05T07:09:30Z","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":"7fc0707ebf675bed93b9257c25a12d440468ac2b754de1b7823c10e6ab5e5ef4","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-08-24T09:27:38Z","title_canon_sha256":"04c2d31837ec27a6f0e35e70f678dec6944379f9cf213e6ba2383e52aa4733a9"},"schema_version":"1.0","source":{"id":"2308.12670","kind":"arxiv","version":2}},"canonical_sha256":"9e489ce4e06ccf1826522e42b03748e26d4298f40a8aeba2c356b9a5ad36b56e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e489ce4e06ccf1826522e42b03748e26d4298f40a8aeba2c356b9a5ad36b56e","first_computed_at":"2026-07-05T07:09:30.961389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:09:30.961389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cplLYWJv+yBqWQugVXk2K4+GbqiHwt6sfrPjS30OkF4gd+7oJiBgL6BxKDCoSc7vYxvya2t/Qg+M9JFIhxbwAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:09:30.961896Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.12670","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a3d024fb0704dae8d35cdecafe9f308e11b0cdf9bb6183f78e1d3ed22c46ec0","sha256:a815343e0734a35c6e9cb387c329d3ebfd9d0118c4d433ab1236fdf06df5f7c0"],"state_sha256":"5d293430603af154b7f82e1d691e1a6b9b0ad97730970634abf089041d785def"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UpzHKwVhE/NUqHcf0oG6kkVNPy+ye5A4GBldquuGNWRAXNBEJotEeZujl4hu0UNWJCUuFn+tqNxt2dT2cYf4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T20:41:52.602121Z","bundle_sha256":"7b3e7efadf48c50de45f20b5a60bd0ff048c6c419d3cb32e43196b4e11446c7c"}}