{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PXHXQL5MVYREARQ3YMY3HSE6FQ","short_pith_number":"pith:PXHXQL5M","schema_version":"1.0","canonical_sha256":"7dcf782facae2240461bc331b3c89e2c3a57245c49b6049f9a2fa186a3e70235","source":{"kind":"arxiv","id":"1701.01470","version":1},"attestation_state":"computed","paper":{"title":"Graph Structure Learning from Unlabeled Data for Event Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"stat.ML","authors_text":"Daniel B. Neill, Sriram Somanchi","submitted_at":"2017-01-05T20:34:57Z","abstract_excerpt":"Processes such as disease propagation and information diffusion often spread over some latent network structure which must be learned from observation. Given a set of unlabeled training examples representing occurrences of an event type of interest (e.g., a disease outbreak), our goal is to learn a graph structure that can be used to accurately detect future events of that type. Motivated by new theoretical results on the consistency of constrained and unconstrained subset scans, we propose a novel framework for learning graph structure from unlabeled data by comparing the most anomalous subse"},"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":"1701.01470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-05T20:34:57Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"5da75c99e310638f939174c1998e078d19b425afa2d9b5deed1e753c234a038c","abstract_canon_sha256":"85948cd079fef3251a4e62ebbc4d767616d94836dbb2a3e1cf0ea51531e360a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:16.748852Z","signature_b64":"M9XOd28t4AS1hr/jyZ2T4q0ja5u5GmMGiRNkDmOEaSuTgH5NolJiLw+seg7iZZZFMMrbXTkLQShoE76USVX8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dcf782facae2240461bc331b3c89e2c3a57245c49b6049f9a2fa186a3e70235","last_reissued_at":"2026-05-18T00:53:16.748385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:16.748385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Structure Learning from Unlabeled Data for Event Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"stat.ML","authors_text":"Daniel B. Neill, Sriram Somanchi","submitted_at":"2017-01-05T20:34:57Z","abstract_excerpt":"Processes such as disease propagation and information diffusion often spread over some latent network structure which must be learned from observation. Given a set of unlabeled training examples representing occurrences of an event type of interest (e.g., a disease outbreak), our goal is to learn a graph structure that can be used to accurately detect future events of that type. Motivated by new theoretical results on the consistency of constrained and unconstrained subset scans, we propose a novel framework for learning graph structure from unlabeled data by comparing the most anomalous subse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01470","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":"1701.01470","created_at":"2026-05-18T00:53:16.748447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01470v1","created_at":"2026-05-18T00:53:16.748447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01470","created_at":"2026-05-18T00:53:16.748447+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXHXQL5MVYRE","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXHXQL5MVYREARQ3","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXHXQL5M","created_at":"2026-05-18T12:31:37.085036+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/PXHXQL5MVYREARQ3YMY3HSE6FQ","json":"https://pith.science/pith/PXHXQL5MVYREARQ3YMY3HSE6FQ.json","graph_json":"https://pith.science/api/pith-number/PXHXQL5MVYREARQ3YMY3HSE6FQ/graph.json","events_json":"https://pith.science/api/pith-number/PXHXQL5MVYREARQ3YMY3HSE6FQ/events.json","paper":"https://pith.science/paper/PXHXQL5M"},"agent_actions":{"view_html":"https://pith.science/pith/PXHXQL5MVYREARQ3YMY3HSE6FQ","download_json":"https://pith.science/pith/PXHXQL5MVYREARQ3YMY3HSE6FQ.json","view_paper":"https://pith.science/paper/PXHXQL5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01470&json=true","fetch_graph":"https://pith.science/api/pith-number/PXHXQL5MVYREARQ3YMY3HSE6FQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PXHXQL5MVYREARQ3YMY3HSE6FQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXHXQL5MVYREARQ3YMY3HSE6FQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXHXQL5MVYREARQ3YMY3HSE6FQ/action/storage_attestation","attest_author":"https://pith.science/pith/PXHXQL5MVYREARQ3YMY3HSE6FQ/action/author_attestation","sign_citation":"https://pith.science/pith/PXHXQL5MVYREARQ3YMY3HSE6FQ/action/citation_signature","submit_replication":"https://pith.science/pith/PXHXQL5MVYREARQ3YMY3HSE6FQ/action/replication_record"}},"created_at":"2026-05-18T00:53:16.748447+00:00","updated_at":"2026-05-18T00:53:16.748447+00:00"}