{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DOWO2GOV4UDDELI3WGNAZZECCS","short_pith_number":"pith:DOWO2GOV","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"},"canonical_sha256":"1baced19d5e506322d1bb19a0ce48214949bdc2ef4d143dbf4f69d74d6e6a2a2","source":{"kind":"arxiv","id":"1711.10427","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10427","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10427v2","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10427","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"DOWO2GOV4UDD","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"pith_short_16","alias_value":"DOWO2GOV4UDDELI3","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"pith_short_8","alias_value":"DOWO2GOV","created_at":"2026-07-05T02:05:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DOWO2GOV4UDDELI3WGNAZZECCS","target":"record","payload":{"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"},"canonical_sha256":"1baced19d5e506322d1bb19a0ce48214949bdc2ef4d143dbf4f69d74d6e6a2a2","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"},"source_kind":"arxiv","source_id":"1711.10427","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-07-05T02:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tx/WGQkPzdLa0qKUCAxGCZSc64RocUFQgPN+/LjE4bZUbBh7ICnYu5VTUT0kiFFlZNa1oMCaS60odyiYvNpOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:38:02.478485Z"},"content_sha256":"e8e1a5184f59a66557bca7317182fa69a35b631f7017a84fa1e396752c01ecd2","schema_version":"1.0","event_id":"sha256:e8e1a5184f59a66557bca7317182fa69a35b631f7017a84fa1e396752c01ecd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DOWO2GOV4UDDELI3WGNAZZECCS","target":"graph","payload":{"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"},"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-07-05T02:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omOJV31KrbkJicLE/c8KVjwPZKafeTYoEzxmVMd6CtcebSle4BlZ/4jZdroT8F58gfrLci7w0BmXCYbdw95kCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:38:02.479017Z"},"content_sha256":"c6c58f5a5ad0c427059e6efd38dbbee93912dd49de4b0987c49a1fe93c2e8b3e","schema_version":"1.0","event_id":"sha256:c6c58f5a5ad0c427059e6efd38dbbee93912dd49de4b0987c49a1fe93c2e8b3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS/bundle.json","state_url":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOWO2GOV4UDDELI3WGNAZZECCS/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-08-21T23:38:02Z","links":{"resolver":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS","bundle":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS/bundle.json","state":"https://pith.science/pith/DOWO2GOV4UDDELI3WGNAZZECCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOWO2GOV4UDDELI3WGNAZZECCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DOWO2GOV4UDDELI3WGNAZZECCS","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":"086a6e3ba4d8be69efd6bfd6d5d5b3cdb212420f778a781b85aa3541b20825c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-11-28T17:38:53Z","title_canon_sha256":"f2a2e69751ad287adbef343bfe38117ea35a70b0257c611baeb7a3185120c484"},"schema_version":"1.0","source":{"id":"1711.10427","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10427","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10427v2","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10427","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"DOWO2GOV4UDD","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"pith_short_16","alias_value":"DOWO2GOV4UDDELI3","created_at":"2026-07-05T02:05:21Z"},{"alias_kind":"pith_short_8","alias_value":"DOWO2GOV","created_at":"2026-07-05T02:05:21Z"}],"graph_snapshots":[{"event_id":"sha256:c6c58f5a5ad0c427059e6efd38dbbee93912dd49de4b0987c49a1fe93c2e8b3e","target":"graph","created_at":"2026-07-05T02:05:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1711.10427/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Andrew B. Nobel, Carson Mosso, Kai Zhang, Kelly Bodwin, Suman Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-11-28T17:38:53Z","title":"Latent Association Mining in Binary Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10427","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:e8e1a5184f59a66557bca7317182fa69a35b631f7017a84fa1e396752c01ecd2","target":"record","created_at":"2026-07-05T02:05:21Z","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":"086a6e3ba4d8be69efd6bfd6d5d5b3cdb212420f778a781b85aa3541b20825c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-11-28T17:38:53Z","title_canon_sha256":"f2a2e69751ad287adbef343bfe38117ea35a70b0257c611baeb7a3185120c484"},"schema_version":"1.0","source":{"id":"1711.10427","kind":"arxiv","version":2}},"canonical_sha256":"1baced19d5e506322d1bb19a0ce48214949bdc2ef4d143dbf4f69d74d6e6a2a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1baced19d5e506322d1bb19a0ce48214949bdc2ef4d143dbf4f69d74d6e6a2a2","first_computed_at":"2026-07-05T02:05:21.617281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:05:21.617281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aIDf/MpmicedXWKWHRdk3HjVM286LP2N4PmNAdtNTc62kciXRTQw/kj2r+6nax/j6xmrlnBepVD4xdru3V1FCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:05:21.617688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10427","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8e1a5184f59a66557bca7317182fa69a35b631f7017a84fa1e396752c01ecd2","sha256:c6c58f5a5ad0c427059e6efd38dbbee93912dd49de4b0987c49a1fe93c2e8b3e"],"state_sha256":"72fed6ee2654be93a17784db75b384b9d1264dbe1a07811df2762708adc4a6e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WObSO9vKxJreLDiN5cGB5/DG8qGwR+DSY8CmKIDFOkULhvtNQfkoRtrteZVPanSFhB2xXyep2glBsT2LnbRFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:38:02.482783Z","bundle_sha256":"a70daee5b9148fefd2273ed979af58287c7336234a55778bbc108bf0f98313a1"}}