{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ON5TEIFDQUYKEN5AN3NODXPCFL","short_pith_number":"pith:ON5TEIFD","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"},"canonical_sha256":"737b3220a38530a237a06edae1dde22afb8284e91a295a40f30325679c2989e7","source":{"kind":"arxiv","id":"1509.02487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02487","created_at":"2026-05-18T01:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02487v2","created_at":"2026-05-18T01:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02487","created_at":"2026-05-18T01:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"ON5TEIFDQUYK","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"ON5TEIFDQUYKEN5A","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"ON5TEIFD","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ON5TEIFDQUYKEN5AN3NODXPCFL","target":"record","payload":{"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"},"canonical_sha256":"737b3220a38530a237a06edae1dde22afb8284e91a295a40f30325679c2989e7","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"},"source_kind":"arxiv","source_id":"1509.02487","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CduA6K7eQ/DvTSzBVL0hEl9n0jp0kRKoEm5vr9tz83aI3mTKFI3i4cQQEdKsy8cvsxIrvOfjcCS1lbEziEFrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:09:52.330727Z"},"content_sha256":"f753f5558e95c72433f6e5880ff417193056c380cc0c37f801320e6a71a69ee0","schema_version":"1.0","event_id":"sha256:f753f5558e95c72433f6e5880ff417193056c380cc0c37f801320e6a71a69ee0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ON5TEIFDQUYKEN5AN3NODXPCFL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/96GvmgieBxPYih+CMlXeg7nwjjQbBndt20yDCZNYFlrQJGelE11Rc6OHVEovDR2bryw55rw3Hjk3zfW3+e3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:09:52.331131Z"},"content_sha256":"c3df7ac06ff8639968c00125349b99ca9ba35273e8bee90a3787ef129be316e1","schema_version":"1.0","event_id":"sha256:c3df7ac06ff8639968c00125349b99ca9ba35273e8bee90a3787ef129be316e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/bundle.json","state_url":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T21:09:52Z","links":{"resolver":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL","bundle":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/bundle.json","state":"https://pith.science/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ON5TEIFDQUYKEN5AN3NODXPCFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ON5TEIFDQUYKEN5AN3NODXPCFL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"97487416b3e927fb93f67551bc71d07f41b8e2c613c7d3c71c9a958da448d50c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-08T18:28:24Z","title_canon_sha256":"746472098505c13ee16bd74645bfdcebadb720af881fced00cccd07168dbf2c4"},"schema_version":"1.0","source":{"id":"1509.02487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02487","created_at":"2026-05-18T01:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02487v2","created_at":"2026-05-18T01:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02487","created_at":"2026-05-18T01:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"ON5TEIFDQUYK","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"ON5TEIFDQUYKEN5A","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"ON5TEIFD","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:c3df7ac06ff8639968c00125349b99ca9ba35273e8bee90a3787ef129be316e1","target":"graph","created_at":"2026-05-18T01:33:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Ahmad Mahmoody, Eli Upfal, Evgenios M. Kornaropoulos","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-08T18:28:24Z","title":"Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02487","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f753f5558e95c72433f6e5880ff417193056c380cc0c37f801320e6a71a69ee0","target":"record","created_at":"2026-05-18T01:33:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"97487416b3e927fb93f67551bc71d07f41b8e2c613c7d3c71c9a958da448d50c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-08T18:28:24Z","title_canon_sha256":"746472098505c13ee16bd74645bfdcebadb720af881fced00cccd07168dbf2c4"},"schema_version":"1.0","source":{"id":"1509.02487","kind":"arxiv","version":2}},"canonical_sha256":"737b3220a38530a237a06edae1dde22afb8284e91a295a40f30325679c2989e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"737b3220a38530a237a06edae1dde22afb8284e91a295a40f30325679c2989e7","first_computed_at":"2026-05-18T01:33:26.093546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:26.093546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BWjZT4zrawUcatVBem+5iD5dgXMfFJV3q+ecZ0q/g+JaT7KM/Pp6Hr0azI0oXEulz0aN5kxgSd/NkVtY0hWSBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:26.094197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f753f5558e95c72433f6e5880ff417193056c380cc0c37f801320e6a71a69ee0","sha256:c3df7ac06ff8639968c00125349b99ca9ba35273e8bee90a3787ef129be316e1"],"state_sha256":"f5db80d73c8c5c06b0a9c8dd7abe78e1dab0ebc62b431e310008da692e79b555"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgF1TwNxBdCaC1Oy9w/WQGTQVvKBjaXv+5fAniJ4T3LC2uF8gPnNrZMG3ahhKUU2/9fvVLr/A9f70kQWJldrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:09:52.334114Z","bundle_sha256":"b3b4cf6b16ad2c80a60bc2e23bb4e9373699d44f93e869b0c9292262e8d8aee1"}}