{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HRXM6JQUOREQHWCLZFDJBXOZYC","short_pith_number":"pith:HRXM6JQU","schema_version":"1.0","canonical_sha256":"3c6ecf2614744903d84bc94690ddd9c096ce210c8e81bd74485933b37ff32939","source":{"kind":"arxiv","id":"1505.02694","version":1},"attestation_state":"computed","paper":{"title":"Antibiotics Time Machine is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","q-bio.PE"],"primary_cat":"math.OC","authors_text":"Jed Yang, Ngoc Mai Tran","submitted_at":"2015-05-11T16:23:44Z","abstract_excerpt":"The antibiotics time machine is an optimization question posed by Mira \\latin{et al.} on the design of antibiotic treatment plans to minimize antibiotic resistance. The problem is a variation of the Markov decision process. These authors asked if the problem can be solved efficiently. In this paper, we show that this problem is NP-hard in general."},"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":"1505.02694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-11T16:23:44Z","cross_cats_sorted":["math.DS","q-bio.PE"],"title_canon_sha256":"8d874e7508c423a6114fb92611bec9b34cf10c4e613fb46db186b51ff5c7eecf","abstract_canon_sha256":"6d2b6a0e0bbe0a33ff7951e7764de3e776fb3bceec1847e13a2736ffcf9913cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:11.846057Z","signature_b64":"UwEG8pN2LUXCzB0Th9JnDjfCFrm1qXBG/R7QEp3X22QOo6eOV9nFKKmhxxq6UsHcVu3IqS6110B0GrlwM6bOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c6ecf2614744903d84bc94690ddd9c096ce210c8e81bd74485933b37ff32939","last_reissued_at":"2026-05-18T02:16:11.845499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:11.845499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Antibiotics Time Machine is NP-hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","q-bio.PE"],"primary_cat":"math.OC","authors_text":"Jed Yang, Ngoc Mai Tran","submitted_at":"2015-05-11T16:23:44Z","abstract_excerpt":"The antibiotics time machine is an optimization question posed by Mira \\latin{et al.} on the design of antibiotic treatment plans to minimize antibiotic resistance. The problem is a variation of the Markov decision process. These authors asked if the problem can be solved efficiently. In this paper, we show that this problem is NP-hard in general."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02694","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":""},"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":"1505.02694","created_at":"2026-05-18T02:16:11.845588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02694v1","created_at":"2026-05-18T02:16:11.845588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02694","created_at":"2026-05-18T02:16:11.845588+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRXM6JQUOREQ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRXM6JQUOREQHWCL","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRXM6JQU","created_at":"2026-05-18T12:29:25.134429+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/HRXM6JQUOREQHWCLZFDJBXOZYC","json":"https://pith.science/pith/HRXM6JQUOREQHWCLZFDJBXOZYC.json","graph_json":"https://pith.science/api/pith-number/HRXM6JQUOREQHWCLZFDJBXOZYC/graph.json","events_json":"https://pith.science/api/pith-number/HRXM6JQUOREQHWCLZFDJBXOZYC/events.json","paper":"https://pith.science/paper/HRXM6JQU"},"agent_actions":{"view_html":"https://pith.science/pith/HRXM6JQUOREQHWCLZFDJBXOZYC","download_json":"https://pith.science/pith/HRXM6JQUOREQHWCLZFDJBXOZYC.json","view_paper":"https://pith.science/paper/HRXM6JQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02694&json=true","fetch_graph":"https://pith.science/api/pith-number/HRXM6JQUOREQHWCLZFDJBXOZYC/graph.json","fetch_events":"https://pith.science/api/pith-number/HRXM6JQUOREQHWCLZFDJBXOZYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRXM6JQUOREQHWCLZFDJBXOZYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRXM6JQUOREQHWCLZFDJBXOZYC/action/storage_attestation","attest_author":"https://pith.science/pith/HRXM6JQUOREQHWCLZFDJBXOZYC/action/author_attestation","sign_citation":"https://pith.science/pith/HRXM6JQUOREQHWCLZFDJBXOZYC/action/citation_signature","submit_replication":"https://pith.science/pith/HRXM6JQUOREQHWCLZFDJBXOZYC/action/replication_record"}},"created_at":"2026-05-18T02:16:11.845588+00:00","updated_at":"2026-05-18T02:16:11.845588+00:00"}