{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UVPJTVXS5JKU4KT6OXALTKVAQZ","short_pith_number":"pith:UVPJTVXS","schema_version":"1.0","canonical_sha256":"a55e99d6f2ea554e2a7e75c0b9aaa0864a3dbc19ed3fc198ccebd0acc3c89e72","source":{"kind":"arxiv","id":"1705.09879","version":1},"attestation_state":"computed","paper":{"title":"Inexpensive Cost-Optimized Measurement Proposal for Sequential Model-Based Diagnosis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Konstantin Schekotihin, Patrick Rodler, Wolfgang Schmid","submitted_at":"2017-05-28T00:47:29Z","abstract_excerpt":"In this work we present strategies for (optimal) measurement selection in model-based sequential diagnosis. In particular, assuming a set of leading diagnoses being given, we show how queries (sets of measurements) can be computed and optimized along two dimensions: expected number of queries and cost per query. By means of a suitable decoupling of two optimizations and a clever search space reduction the computations are done without any inference engine calls. For the full search space, we give a method requiring only a polynomial number of inferences and guaranteeing query properties existi"},"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":"1705.09879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-28T00:47:29Z","cross_cats_sorted":[],"title_canon_sha256":"6418713b1fbb75f4366f58d356920c9141e9c1127b686d8524bc4673ffd5f64f","abstract_canon_sha256":"8285ee8b8f5af739f4255332434e0c9b823c7f71750d75d65ece0fdb29f36470"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:34.306808Z","signature_b64":"ypgk9Gj9BsRHvjWFKDXXHUhx5bviebK9uCFPqdXije+oDg/Ulz1JBuW+tBIf2d/OVjRO/faJMVujoFzz3jntCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a55e99d6f2ea554e2a7e75c0b9aaa0864a3dbc19ed3fc198ccebd0acc3c89e72","last_reissued_at":"2026-05-18T00:43:34.306367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:34.306367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inexpensive Cost-Optimized Measurement Proposal for Sequential Model-Based Diagnosis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Konstantin Schekotihin, Patrick Rodler, Wolfgang Schmid","submitted_at":"2017-05-28T00:47:29Z","abstract_excerpt":"In this work we present strategies for (optimal) measurement selection in model-based sequential diagnosis. In particular, assuming a set of leading diagnoses being given, we show how queries (sets of measurements) can be computed and optimized along two dimensions: expected number of queries and cost per query. By means of a suitable decoupling of two optimizations and a clever search space reduction the computations are done without any inference engine calls. For the full search space, we give a method requiring only a polynomial number of inferences and guaranteeing query properties existi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09879","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":"1705.09879","created_at":"2026-05-18T00:43:34.306436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09879v1","created_at":"2026-05-18T00:43:34.306436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09879","created_at":"2026-05-18T00:43:34.306436+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVPJTVXS5JKU","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVPJTVXS5JKU4KT6","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVPJTVXS","created_at":"2026-05-18T12:31:49.984773+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/UVPJTVXS5JKU4KT6OXALTKVAQZ","json":"https://pith.science/pith/UVPJTVXS5JKU4KT6OXALTKVAQZ.json","graph_json":"https://pith.science/api/pith-number/UVPJTVXS5JKU4KT6OXALTKVAQZ/graph.json","events_json":"https://pith.science/api/pith-number/UVPJTVXS5JKU4KT6OXALTKVAQZ/events.json","paper":"https://pith.science/paper/UVPJTVXS"},"agent_actions":{"view_html":"https://pith.science/pith/UVPJTVXS5JKU4KT6OXALTKVAQZ","download_json":"https://pith.science/pith/UVPJTVXS5JKU4KT6OXALTKVAQZ.json","view_paper":"https://pith.science/paper/UVPJTVXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09879&json=true","fetch_graph":"https://pith.science/api/pith-number/UVPJTVXS5JKU4KT6OXALTKVAQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UVPJTVXS5JKU4KT6OXALTKVAQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVPJTVXS5JKU4KT6OXALTKVAQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVPJTVXS5JKU4KT6OXALTKVAQZ/action/storage_attestation","attest_author":"https://pith.science/pith/UVPJTVXS5JKU4KT6OXALTKVAQZ/action/author_attestation","sign_citation":"https://pith.science/pith/UVPJTVXS5JKU4KT6OXALTKVAQZ/action/citation_signature","submit_replication":"https://pith.science/pith/UVPJTVXS5JKU4KT6OXALTKVAQZ/action/replication_record"}},"created_at":"2026-05-18T00:43:34.306436+00:00","updated_at":"2026-05-18T00:43:34.306436+00:00"}