{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DIKI7AGI6LTBKW7TQIZZEYBRLV","short_pith_number":"pith:DIKI7AGI","schema_version":"1.0","canonical_sha256":"1a148f80c8f2e6155bf382339260315d7e29de27303d80fbff9286149ebf4005","source":{"kind":"arxiv","id":"2607.27899","version":1},"attestation_state":"computed","paper":{"title":"Branching out: Prognostics-Based Replacement Policies for Series Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Koutas, Daniel Straub","submitted_at":"2026-07-30T09:14:58Z","abstract_excerpt":"We propose a hybrid planning method for deriving prognostics-based predictive maintenance policies. The method accounts for the available decision options, the information on the future state of the system provided by a prognostic model, and the costs of the underlying renewal-reward process. It results in policies defined by only a few parameters, which can be determined based on theoretical considerations or by optimization from run-to-failure data. We demonstrate the potential of the method in two separate predictive maintenance decision settings: preventive replacement and preventive order"},"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":"2607.27899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-30T09:14:58Z","cross_cats_sorted":[],"title_canon_sha256":"dc5121a6c08596b32b142bde5eeccd8303ac59bfe7ce75c0a0f5cd62442e4898","abstract_canon_sha256":"e72df5c7be02ceee968207149069cefd0bc5f0d2d1d3ca4365e6c555dfebab4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a148f80c8f2e6155bf382339260315d7e29de27303d80fbff9286149ebf4005","last_reissued_at":"2026-07-31T01:34:45.258734Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:34:45.258734Z"},"graph_snapshot":{"paper":{"title":"Branching out: Prognostics-Based Replacement Policies for Series Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Koutas, Daniel Straub","submitted_at":"2026-07-30T09:14:58Z","abstract_excerpt":"We propose a hybrid planning method for deriving prognostics-based predictive maintenance policies. The method accounts for the available decision options, the information on the future state of the system provided by a prognostic model, and the costs of the underlying renewal-reward process. It results in policies defined by only a few parameters, which can be determined based on theoretical considerations or by optimization from run-to-failure data. We demonstrate the potential of the method in two separate predictive maintenance decision settings: preventive replacement and preventive order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27899","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/2607.27899/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":"2607.27899","created_at":"2026-07-31T01:34:45.263483+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27899v1","created_at":"2026-07-31T01:34:45.263483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27899","created_at":"2026-07-31T01:34:45.263483+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIKI7AGI6LTB","created_at":"2026-07-31T01:34:45.263483+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIKI7AGI6LTBKW7T","created_at":"2026-07-31T01:34:45.263483+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIKI7AGI","created_at":"2026-07-31T01:34:45.263483+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/DIKI7AGI6LTBKW7TQIZZEYBRLV","json":"https://pith.science/pith/DIKI7AGI6LTBKW7TQIZZEYBRLV.json","graph_json":"https://pith.science/api/pith-number/DIKI7AGI6LTBKW7TQIZZEYBRLV/graph.json","events_json":"https://pith.science/api/pith-number/DIKI7AGI6LTBKW7TQIZZEYBRLV/events.json","paper":"https://pith.science/paper/DIKI7AGI"},"agent_actions":{"view_html":"https://pith.science/pith/DIKI7AGI6LTBKW7TQIZZEYBRLV","download_json":"https://pith.science/pith/DIKI7AGI6LTBKW7TQIZZEYBRLV.json","view_paper":"https://pith.science/paper/DIKI7AGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27899&json=true","fetch_graph":"https://pith.science/api/pith-number/DIKI7AGI6LTBKW7TQIZZEYBRLV/graph.json","fetch_events":"https://pith.science/api/pith-number/DIKI7AGI6LTBKW7TQIZZEYBRLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIKI7AGI6LTBKW7TQIZZEYBRLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIKI7AGI6LTBKW7TQIZZEYBRLV/action/storage_attestation","attest_author":"https://pith.science/pith/DIKI7AGI6LTBKW7TQIZZEYBRLV/action/author_attestation","sign_citation":"https://pith.science/pith/DIKI7AGI6LTBKW7TQIZZEYBRLV/action/citation_signature","submit_replication":"https://pith.science/pith/DIKI7AGI6LTBKW7TQIZZEYBRLV/action/replication_record"}},"created_at":"2026-07-31T01:34:45.263483+00:00","updated_at":"2026-07-31T01:34:45.263483+00:00"}