{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ON5TEIFDQUYKEN5AN3NODXPCFL","short_pith_number":"pith:ON5TEIFD","schema_version":"1.0","canonical_sha256":"737b3220a38530a237a06edae1dde22afb8284e91a295a40f30325679c2989e7","source":{"kind":"arxiv","id":"1509.02487","version":2},"attestation_state":"computed","paper":{"title":"Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ahmad Mahmoody, Eli Upfal, Evgenios M. Kornaropoulos","submitted_at":"2015-09-08T18:28:24Z","abstract_excerpt":"We formulate and study a fundamental search and detection problem, Schedule Optimization, motivated by a variety of real-world applications, ranging from monitoring content changes on the web, social networks, and user activities to detecting failure on large systems with many individual machines.\n  We consider a large system consists of many nodes, where each node has its own rate of generating new events, or items. A monitoring application can probe a small number of nodes at each step, and our goal is to compute a probing schedule that minimizes the expected number of undiscovered items at "},"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":"1509.02487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-08T18:28:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"746472098505c13ee16bd74645bfdcebadb720af881fced00cccd07168dbf2c4","abstract_canon_sha256":"97487416b3e927fb93f67551bc71d07f41b8e2c613c7d3c71c9a958da448d50c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:26.094197Z","signature_b64":"BWjZT4zrawUcatVBem+5iD5dgXMfFJV3q+ecZ0q/g+JaT7KM/Pp6Hr0azI0oXEulz0aN5kxgSd/NkVtY0hWSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737b3220a38530a237a06edae1dde22afb8284e91a295a40f30325679c2989e7","last_reissued_at":"2026-05-18T01:33:26.093546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:26.093546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ahmad Mahmoody, Eli Upfal, Evgenios M. Kornaropoulos","submitted_at":"2015-09-08T18:28:24Z","abstract_excerpt":"We formulate and study a fundamental search and detection problem, Schedule Optimization, motivated by a variety of real-world applications, ranging from monitoring content changes on the web, social networks, and user activities to detecting failure on large systems with many individual machines.\n  We consider a large system consists of many nodes, where each node has its own rate of generating new events, or items. A monitoring application can probe a small number of nodes at each step, and our goal is to compute a probing schedule that minimizes the expected number of undiscovered items at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02487","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":"1509.02487","created_at":"2026-05-18T01:33:26.093670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02487v2","created_at":"2026-05-18T01:33:26.093670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02487","created_at":"2026-05-18T01:33:26.093670+00:00"},{"alias_kind":"pith_short_12","alias_value":"ON5TEIFDQUYK","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"ON5TEIFDQUYKEN5A","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"ON5TEIFD","created_at":"2026-05-18T12:29:34.919912+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/ON5TEIFDQUYKEN5AN3NODXPCFL","json":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL.json","graph_json":"https://pith.science/api/pith-number/ON5TEIFDQUYKEN5AN3NODXPCFL/graph.json","events_json":"https://pith.science/api/pith-number/ON5TEIFDQUYKEN5AN3NODXPCFL/events.json","paper":"https://pith.science/paper/ON5TEIFD"},"agent_actions":{"view_html":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL","download_json":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL.json","view_paper":"https://pith.science/paper/ON5TEIFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02487&json=true","fetch_graph":"https://pith.science/api/pith-number/ON5TEIFDQUYKEN5AN3NODXPCFL/graph.json","fetch_events":"https://pith.science/api/pith-number/ON5TEIFDQUYKEN5AN3NODXPCFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/action/storage_attestation","attest_author":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/action/author_attestation","sign_citation":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/action/citation_signature","submit_replication":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/action/replication_record"}},"created_at":"2026-05-18T01:33:26.093670+00:00","updated_at":"2026-05-18T01:33:26.093670+00:00"}