{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VNL23XHCJW6DLSXFRUDE3AXSPQ","short_pith_number":"pith:VNL23XHC","canonical_record":{"source":{"id":"1709.03573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T20:16:29Z","cross_cats_sorted":[],"title_canon_sha256":"6aa7b980ab88bc4caeef45296d9421771891ef91896f047d432a46ab0d09a790","abstract_canon_sha256":"2d6a34b68e097b5ad1d44a0c46791bfecb424cde0f7775fb3371f1ec306a9520"},"schema_version":"1.0"},"canonical_sha256":"ab57addce24dbc35cae58d064d82f27c27f0a6d5448963731e0d60d2f9fe6f3b","source":{"kind":"arxiv","id":"1709.03573","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03573","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03573v1","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03573","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"VNL23XHCJW6D","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VNL23XHCJW6DLSXF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VNL23XHC","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VNL23XHCJW6DLSXFRUDE3AXSPQ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T20:16:29Z","cross_cats_sorted":[],"title_canon_sha256":"6aa7b980ab88bc4caeef45296d9421771891ef91896f047d432a46ab0d09a790","abstract_canon_sha256":"2d6a34b68e097b5ad1d44a0c46791bfecb424cde0f7775fb3371f1ec306a9520"},"schema_version":"1.0"},"canonical_sha256":"ab57addce24dbc35cae58d064d82f27c27f0a6d5448963731e0d60d2f9fe6f3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:30.128495Z","signature_b64":"fW1MKXXKSuOKVoOZC1NvqQM9K3NERMQrl2wDyhb3t82hp6GLU3yrOdjBVF3cvO/cv84Gp9IGNvziE5DlAKBGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab57addce24dbc35cae58d064d82f27c27f0a6d5448963731e0d60d2f9fe6f3b","last_reissued_at":"2026-05-18T00:35:30.127898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:30.127898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03573","source_version":1,"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-18T00:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JSI6ya1BLxsKKv2CEDK3TQ4B1QB4Q26k9MAJzn/+xrhI9A7p24j2XTc7wH4w48Quht0TWJ6aZQoJUqhWtsI1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:57:04.163898Z"},"content_sha256":"675f225fb71879c824d8c6bf119e10e16a6832884b78f1ed01574d6e890bb2e1","schema_version":"1.0","event_id":"sha256:675f225fb71879c824d8c6bf119e10e16a6832884b78f1ed01574d6e890bb2e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VNL23XHCJW6DLSXFRUDE3AXSPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anomaly Detection in Hierarchical Data Streams under Unknown Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chang Liu, Chen-Nee Chuah, Qing Zhao, Sattar Vakili","submitted_at":"2017-09-11T20:16:29Z","abstract_excerpt":"We consider the problem of detecting a few targets among a large number of hierarchical data streams. The data streams are modeled as random processes with unknown and potentially heavy-tailed distributions. The objective is an active inference strategy that determines, sequentially, which data stream to collect samples from in order to minimize the sample complexity under a reliability constraint. We propose an active inference strategy that induces a biased random walk on the tree-structured hierarchy based on confidence bounds of sample statistics. We then establish its order optimality in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03573","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"},"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-18T00:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UCbgfi3TfP/ygCLl8PA1rckvc0smWmbxWQeZqsPzEhd6ts1ixzCQp8Ih3AX88+msGwCR/Pxomt2KoUF9506AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:57:04.164236Z"},"content_sha256":"0990e3695fccd782848754b2fc66a43f6566707066c0bb44b67d9ee61958689d","schema_version":"1.0","event_id":"sha256:0990e3695fccd782848754b2fc66a43f6566707066c0bb44b67d9ee61958689d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNL23XHCJW6DLSXFRUDE3AXSPQ/bundle.json","state_url":"https://pith.science/pith/VNL23XHCJW6DLSXFRUDE3AXSPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNL23XHCJW6DLSXFRUDE3AXSPQ/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-06-27T18:57:04Z","links":{"resolver":"https://pith.science/pith/VNL23XHCJW6DLSXFRUDE3AXSPQ","bundle":"https://pith.science/pith/VNL23XHCJW6DLSXFRUDE3AXSPQ/bundle.json","state":"https://pith.science/pith/VNL23XHCJW6DLSXFRUDE3AXSPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNL23XHCJW6DLSXFRUDE3AXSPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VNL23XHCJW6DLSXFRUDE3AXSPQ","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":"2d6a34b68e097b5ad1d44a0c46791bfecb424cde0f7775fb3371f1ec306a9520","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T20:16:29Z","title_canon_sha256":"6aa7b980ab88bc4caeef45296d9421771891ef91896f047d432a46ab0d09a790"},"schema_version":"1.0","source":{"id":"1709.03573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03573","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03573v1","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03573","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"VNL23XHCJW6D","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VNL23XHCJW6DLSXF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VNL23XHC","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:0990e3695fccd782848754b2fc66a43f6566707066c0bb44b67d9ee61958689d","target":"graph","created_at":"2026-05-18T00:35:30Z","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 consider the problem of detecting a few targets among a large number of hierarchical data streams. The data streams are modeled as random processes with unknown and potentially heavy-tailed distributions. The objective is an active inference strategy that determines, sequentially, which data stream to collect samples from in order to minimize the sample complexity under a reliability constraint. We propose an active inference strategy that induces a biased random walk on the tree-structured hierarchy based on confidence bounds of sample statistics. We then establish its order optimality in ","authors_text":"Chang Liu, Chen-Nee Chuah, Qing Zhao, Sattar Vakili","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T20:16:29Z","title":"Anomaly Detection in Hierarchical Data Streams under Unknown Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03573","kind":"arxiv","version":1},"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:675f225fb71879c824d8c6bf119e10e16a6832884b78f1ed01574d6e890bb2e1","target":"record","created_at":"2026-05-18T00:35:30Z","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":"2d6a34b68e097b5ad1d44a0c46791bfecb424cde0f7775fb3371f1ec306a9520","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-11T20:16:29Z","title_canon_sha256":"6aa7b980ab88bc4caeef45296d9421771891ef91896f047d432a46ab0d09a790"},"schema_version":"1.0","source":{"id":"1709.03573","kind":"arxiv","version":1}},"canonical_sha256":"ab57addce24dbc35cae58d064d82f27c27f0a6d5448963731e0d60d2f9fe6f3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab57addce24dbc35cae58d064d82f27c27f0a6d5448963731e0d60d2f9fe6f3b","first_computed_at":"2026-05-18T00:35:30.127898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:30.127898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fW1MKXXKSuOKVoOZC1NvqQM9K3NERMQrl2wDyhb3t82hp6GLU3yrOdjBVF3cvO/cv84Gp9IGNvziE5DlAKBGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:30.128495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:675f225fb71879c824d8c6bf119e10e16a6832884b78f1ed01574d6e890bb2e1","sha256:0990e3695fccd782848754b2fc66a43f6566707066c0bb44b67d9ee61958689d"],"state_sha256":"27332ec87f9fea18a33020b27ff6d96e11fcdad01867927ffa5b451daaed693e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8kpuFJBQrZF0m9r9IF8pJLuNP9SniTUV8nrColLmAd+zKsvao264Hpm/LW9f6KzUPUws4rVdSDzp9Q8YNSKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:57:04.166078Z","bundle_sha256":"79ff1ad05f9256e138c56086990d8ad958629617d05600c578008c59f0e54475"}}