{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XSOHQSQLO2NJKABED4OYWFAMSU","short_pith_number":"pith:XSOHQSQL","schema_version":"1.0","canonical_sha256":"bc9c784a0b769a9500241f1d8b140c9536cf5b5cc8b60d4d60bbfd312aef3dec","source":{"kind":"arxiv","id":"2607.15229","version":1},"attestation_state":"computed","paper":{"title":"Data Driven Block Replacement Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.AP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aniruddhan Ganesaraman, Vidyadhar Kulkarni","submitted_at":"2026-07-16T17:31:15Z","abstract_excerpt":"We develop data-driven algorithms for maintaining $N$ independent identical machines under a \\textit{block replacement policy}, in which each machine is replaced upon failure and all machines are jointly replaced at regular intervals of length $k$. The goal is to learn the cost-minimizing interval $k^*$ from operational data when the lifetime distribution is unknown. At each decision epoch, the operator selects $k \\in \\{1, 2, \\ldots, K\\}$, observes the resulting failure history (a mixture of complete and right-censored lifetimes) and incurs a per-unit-time cost governed by the renewal function"},"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.15229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-16T17:31:15Z","cross_cats_sorted":["math.OC","stat.AP","stat.ML"],"title_canon_sha256":"760cbf3379dff0ab30dc7327e4d828499738a1c6ddea7ab6b807dba7e45f0d06","abstract_canon_sha256":"9c1e76745849044d0f4cad52ce43b07caf829fe43050e9e71065357da1c81c18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:22:15.680803Z","signature_b64":"1IIM4CD/HXcl8+QABmpHtx5ZuKDRRjimJxERl+xRoKEAYQ66/BIkAYOlvc94edmXW5pVQysrpzc7vtFTsCORCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc9c784a0b769a9500241f1d8b140c9536cf5b5cc8b60d4d60bbfd312aef3dec","last_reissued_at":"2026-07-17T01:22:15.679978Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:22:15.679978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Driven Block Replacement Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.AP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aniruddhan Ganesaraman, Vidyadhar Kulkarni","submitted_at":"2026-07-16T17:31:15Z","abstract_excerpt":"We develop data-driven algorithms for maintaining $N$ independent identical machines under a \\textit{block replacement policy}, in which each machine is replaced upon failure and all machines are jointly replaced at regular intervals of length $k$. The goal is to learn the cost-minimizing interval $k^*$ from operational data when the lifetime distribution is unknown. At each decision epoch, the operator selects $k \\in \\{1, 2, \\ldots, K\\}$, observes the resulting failure history (a mixture of complete and right-censored lifetimes) and incurs a per-unit-time cost governed by the renewal function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.15229","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.15229/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.15229","created_at":"2026-07-17T01:22:15.680412+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.15229v1","created_at":"2026-07-17T01:22:15.680412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.15229","created_at":"2026-07-17T01:22:15.680412+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSOHQSQLO2NJ","created_at":"2026-07-17T01:22:15.680412+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSOHQSQLO2NJKABE","created_at":"2026-07-17T01:22:15.680412+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSOHQSQL","created_at":"2026-07-17T01:22:15.680412+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/XSOHQSQLO2NJKABED4OYWFAMSU","json":"https://pith.science/pith/XSOHQSQLO2NJKABED4OYWFAMSU.json","graph_json":"https://pith.science/api/pith-number/XSOHQSQLO2NJKABED4OYWFAMSU/graph.json","events_json":"https://pith.science/api/pith-number/XSOHQSQLO2NJKABED4OYWFAMSU/events.json","paper":"https://pith.science/paper/XSOHQSQL"},"agent_actions":{"view_html":"https://pith.science/pith/XSOHQSQLO2NJKABED4OYWFAMSU","download_json":"https://pith.science/pith/XSOHQSQLO2NJKABED4OYWFAMSU.json","view_paper":"https://pith.science/paper/XSOHQSQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.15229&json=true","fetch_graph":"https://pith.science/api/pith-number/XSOHQSQLO2NJKABED4OYWFAMSU/graph.json","fetch_events":"https://pith.science/api/pith-number/XSOHQSQLO2NJKABED4OYWFAMSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSOHQSQLO2NJKABED4OYWFAMSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSOHQSQLO2NJKABED4OYWFAMSU/action/storage_attestation","attest_author":"https://pith.science/pith/XSOHQSQLO2NJKABED4OYWFAMSU/action/author_attestation","sign_citation":"https://pith.science/pith/XSOHQSQLO2NJKABED4OYWFAMSU/action/citation_signature","submit_replication":"https://pith.science/pith/XSOHQSQLO2NJKABED4OYWFAMSU/action/replication_record"}},"created_at":"2026-07-17T01:22:15.680412+00:00","updated_at":"2026-07-17T01:22:15.680412+00:00"}