{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TI5BI2XDWX4M6NVABFQ6BAW7PC","short_pith_number":"pith:TI5BI2XD","schema_version":"1.0","canonical_sha256":"9a3a146ae3b5f8cf36a00961e082df7884c6921f789d9002a306302bf8c775d4","source":{"kind":"arxiv","id":"1212.5378","version":2},"attestation_state":"computed","paper":{"title":"An Optimal Query Assignment for Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.OC","authors_text":"Jan-Kees van Ommeren, Jasper Goseling, Martijn Onderwater, Maurits de Graaf, Mihaela Mitici, Nico van Dijk, Richard J. Boucherie","submitted_at":"2012-12-21T10:09:52Z","abstract_excerpt":"A trade-off between two QoS requirements of wireless sensor networks: query waiting time and validity (age) of the data feeding the queries, is investigated. We propose a Continuous Time Markov Decision Process with a drift that trades-off between the two QoS requirements by assigning incoming queries to the wireless sensor network or to the database. To compute an optimal assignment policy, we argue, by means of non-standard uniformization, a discrete time Markov decision process, stochastically equivalent to the initial continuous process. We determine an optimal query assignment policy for "},"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":"1212.5378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-21T10:09:52Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"4a2c97d89b64055ec5e869ec6957d6a556a77f6bd06ca95e05661dbbf4a941e9","abstract_canon_sha256":"7a7c1c737b4d5b1788ebdf0c8dfac077e706533e8d7a1f563bea8f423cbfbb9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:44.399052Z","signature_b64":"CfQXUEmVSKI0TF3ZljhjBS2Rf7IbJqJIlZlCUx1LYDdxarQlIigVIp6GV2A4l1hJDrVhNi7Ol5RxH4wpOQFlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a3a146ae3b5f8cf36a00961e082df7884c6921f789d9002a306302bf8c775d4","last_reissued_at":"2026-05-18T02:56:44.398565Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:44.398565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Query Assignment for Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"math.OC","authors_text":"Jan-Kees van Ommeren, Jasper Goseling, Martijn Onderwater, Maurits de Graaf, Mihaela Mitici, Nico van Dijk, Richard J. Boucherie","submitted_at":"2012-12-21T10:09:52Z","abstract_excerpt":"A trade-off between two QoS requirements of wireless sensor networks: query waiting time and validity (age) of the data feeding the queries, is investigated. We propose a Continuous Time Markov Decision Process with a drift that trades-off between the two QoS requirements by assigning incoming queries to the wireless sensor network or to the database. To compute an optimal assignment policy, we argue, by means of non-standard uniformization, a discrete time Markov decision process, stochastically equivalent to the initial continuous process. We determine an optimal query assignment policy for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5378","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":""},"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":"1212.5378","created_at":"2026-05-18T02:56:44.398635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.5378v2","created_at":"2026-05-18T02:56:44.398635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5378","created_at":"2026-05-18T02:56:44.398635+00:00"},{"alias_kind":"pith_short_12","alias_value":"TI5BI2XDWX4M","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TI5BI2XDWX4M6NVA","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TI5BI2XD","created_at":"2026-05-18T12:27:23.164592+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/TI5BI2XDWX4M6NVABFQ6BAW7PC","json":"https://pith.science/pith/TI5BI2XDWX4M6NVABFQ6BAW7PC.json","graph_json":"https://pith.science/api/pith-number/TI5BI2XDWX4M6NVABFQ6BAW7PC/graph.json","events_json":"https://pith.science/api/pith-number/TI5BI2XDWX4M6NVABFQ6BAW7PC/events.json","paper":"https://pith.science/paper/TI5BI2XD"},"agent_actions":{"view_html":"https://pith.science/pith/TI5BI2XDWX4M6NVABFQ6BAW7PC","download_json":"https://pith.science/pith/TI5BI2XDWX4M6NVABFQ6BAW7PC.json","view_paper":"https://pith.science/paper/TI5BI2XD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.5378&json=true","fetch_graph":"https://pith.science/api/pith-number/TI5BI2XDWX4M6NVABFQ6BAW7PC/graph.json","fetch_events":"https://pith.science/api/pith-number/TI5BI2XDWX4M6NVABFQ6BAW7PC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TI5BI2XDWX4M6NVABFQ6BAW7PC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TI5BI2XDWX4M6NVABFQ6BAW7PC/action/storage_attestation","attest_author":"https://pith.science/pith/TI5BI2XDWX4M6NVABFQ6BAW7PC/action/author_attestation","sign_citation":"https://pith.science/pith/TI5BI2XDWX4M6NVABFQ6BAW7PC/action/citation_signature","submit_replication":"https://pith.science/pith/TI5BI2XDWX4M6NVABFQ6BAW7PC/action/replication_record"}},"created_at":"2026-05-18T02:56:44.398635+00:00","updated_at":"2026-05-18T02:56:44.398635+00:00"}