{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DOWO2GOV4UDDELI3WGNAZZECCS","short_pith_number":"pith:DOWO2GOV","schema_version":"1.0","canonical_sha256":"1baced19d5e506322d1bb19a0ce48214949bdc2ef4d143dbf4f69d74d6e6a2a2","source":{"kind":"arxiv","id":"1711.10427","version":2},"attestation_state":"computed","paper":{"title":"Latent Association Mining in Binary Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Andrew B. Nobel, Carson Mosso, Kai Zhang, Kelly Bodwin, Suman Chakraborty","submitted_at":"2017-11-28T17:38:53Z","abstract_excerpt":"We consider the problem of identifying stable sets of mutually associated features in moderate or high-dimensional binary data. In this context we develop and investigate a method called Latent Association Mining for Binary Data (LAMB). The LAMB method is based on a simple threshold model in which the observed binary values represent a random thresholding of a latent continuous vector that may have a complex association structure. We consider a measure of latent association that quantifies association in the latent continuous vector without bias due to the random thresholding. The LAMB method "},"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":"1711.10427","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-11-28T17:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"f2a2e69751ad287adbef343bfe38117ea35a70b0257c611baeb7a3185120c484","abstract_canon_sha256":"086a6e3ba4d8be69efd6bfd6d5d5b3cdb212420f778a781b85aa3541b20825c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:21.617688Z","signature_b64":"aIDf/MpmicedXWKWHRdk3HjVM286LP2N4PmNAdtNTc62kciXRTQw/kj2r+6nax/j6xmrlnBepVD4xdru3V1FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1baced19d5e506322d1bb19a0ce48214949bdc2ef4d143dbf4f69d74d6e6a2a2","last_reissued_at":"2026-07-05T02:05:21.617281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:21.617281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latent Association Mining in Binary Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Andrew B. Nobel, Carson Mosso, Kai Zhang, Kelly Bodwin, Suman Chakraborty","submitted_at":"2017-11-28T17:38:53Z","abstract_excerpt":"We consider the problem of identifying stable sets of mutually associated features in moderate or high-dimensional binary data. In this context we develop and investigate a method called Latent Association Mining for Binary Data (LAMB). The LAMB method is based on a simple threshold model in which the observed binary values represent a random thresholding of a latent continuous vector that may have a complex association structure. We consider a measure of latent association that quantifies association in the latent continuous vector without bias due to the random thresholding. The LAMB method "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10427","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1711.10427/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1711.10427","created_at":"2026-07-05T02:05:21.617340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10427v2","created_at":"2026-07-05T02:05:21.617340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10427","created_at":"2026-07-05T02:05:21.617340+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOWO2GOV4UDD","created_at":"2026-07-05T02:05:21.617340+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOWO2GOV4UDDELI3","created_at":"2026-07-05T02:05:21.617340+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOWO2GOV","created_at":"2026-07-05T02:05:21.617340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19259","citing_title":"Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS","json":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS.json","graph_json":"https://pith.science/api/pith-number/DOWO2GOV4UDDELI3WGNAZZECCS/graph.json","events_json":"https://pith.science/api/pith-number/DOWO2GOV4UDDELI3WGNAZZECCS/events.json","paper":"https://pith.science/paper/DOWO2GOV"},"agent_actions":{"view_html":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS","download_json":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS.json","view_paper":"https://pith.science/paper/DOWO2GOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10427&json=true","fetch_graph":"https://pith.science/api/pith-number/DOWO2GOV4UDDELI3WGNAZZECCS/graph.json","fetch_events":"https://pith.science/api/pith-number/DOWO2GOV4UDDELI3WGNAZZECCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS/action/storage_attestation","attest_author":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS/action/author_attestation","sign_citation":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS/action/citation_signature","submit_replication":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS/action/replication_record"}},"created_at":"2026-07-05T02:05:21.617340+00:00","updated_at":"2026-07-05T02:05:21.617340+00:00"}