{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VPKY6ZUDEGRUD7WEHVSLHDQR53","short_pith_number":"pith:VPKY6ZUD","canonical_record":{"source":{"id":"1906.05255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-12T17:28:21Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"0f3b8c826798dca24b1b21b0d83b5453db7a0bf4295fe180e48afb3631d69f09","abstract_canon_sha256":"ad5069f977167fa6365745736bea51524b37e128faf34e63ca8686a9f18682ce"},"schema_version":"1.0"},"canonical_sha256":"abd58f668321a341fec43d64b38e11eeee632cdaa875d633d4d04f2488a0629e","source":{"kind":"arxiv","id":"1906.05255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05255","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05255v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05255","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"VPKY6ZUDEGRU","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VPKY6ZUDEGRUD7WE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VPKY6ZUD","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VPKY6ZUDEGRUD7WEHVSLHDQR53","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-12T17:28:21Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"0f3b8c826798dca24b1b21b0d83b5453db7a0bf4295fe180e48afb3631d69f09","abstract_canon_sha256":"ad5069f977167fa6365745736bea51524b37e128faf34e63ca8686a9f18682ce"},"schema_version":"1.0"},"canonical_sha256":"abd58f668321a341fec43d64b38e11eeee632cdaa875d633d4d04f2488a0629e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:29.041234Z","signature_b64":"ghE0jyKOqMa7dsejDu+7Tiv/XiXvVt4TF1HCm0TdS/1fY49T3gZoxkURFO5cRfqwDQ1GeRVnxStu2NI54+MyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abd58f668321a341fec43d64b38e11eeee632cdaa875d633d4d04f2488a0629e","last_reissued_at":"2026-05-17T23:43:29.040589Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:29.040589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05255","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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vW9ta9Svc17LJIFVLuTXyD6T3vTX9UGT4ASWlFFrydI2oPK5UOeULCBgIwcPYROvvCNrsDXupqWjjJ+z+YgeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:39:24.100645Z"},"content_sha256":"e47c9249e4d73dc3f27f4467065fde5673de83a55d7d388af3d1e6fbf942593f","schema_version":"1.0","event_id":"sha256:e47c9249e4d73dc3f27f4467065fde5673de83a55d7d388af3d1e6fbf942593f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VPKY6ZUDEGRUD7WEHVSLHDQR53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Text Mining Approach for Ranking Pairwise Associations in Biomedical Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.IR","authors_text":"David Page, Finn Kuusisto, James Thomson, John Steill, Ron Stewart, Zhaobin Kuang","submitted_at":"2019-06-12T17:28:21Z","abstract_excerpt":"We present a simple text mining method that is easy to implement, requires minimal data collection and preparation, and is easy to use for proposing ranked associations between a list of target terms and a key phrase. We call this method KinderMiner, and apply it to two biomedical applications. The first application is to identify relevant transcription factors for cell reprogramming, and the second is to identify potential drugs for investigation in drug repositioning. We compare the results from our algorithm to existing data and state-of-the-art algorithms, demonstrating compelling results "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05255","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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmQdgxmBQBZCfVxMJ+pep8/Xbx6nddhjWFaw4r+nvLNJHX+TrCQR1QKF/mkevhANyISgW7/9KDyzfK7K0xtTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:39:24.101006Z"},"content_sha256":"8d6222452d5a1e22654fe1d551670d917393a267285a5be18cd6a5cf7809aafc","schema_version":"1.0","event_id":"sha256:8d6222452d5a1e22654fe1d551670d917393a267285a5be18cd6a5cf7809aafc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPKY6ZUDEGRUD7WEHVSLHDQR53/bundle.json","state_url":"https://pith.science/pith/VPKY6ZUDEGRUD7WEHVSLHDQR53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPKY6ZUDEGRUD7WEHVSLHDQR53/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-01T03:39:24Z","links":{"resolver":"https://pith.science/pith/VPKY6ZUDEGRUD7WEHVSLHDQR53","bundle":"https://pith.science/pith/VPKY6ZUDEGRUD7WEHVSLHDQR53/bundle.json","state":"https://pith.science/pith/VPKY6ZUDEGRUD7WEHVSLHDQR53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPKY6ZUDEGRUD7WEHVSLHDQR53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VPKY6ZUDEGRUD7WEHVSLHDQR53","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":"ad5069f977167fa6365745736bea51524b37e128faf34e63ca8686a9f18682ce","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-12T17:28:21Z","title_canon_sha256":"0f3b8c826798dca24b1b21b0d83b5453db7a0bf4295fe180e48afb3631d69f09"},"schema_version":"1.0","source":{"id":"1906.05255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05255","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05255v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05255","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"VPKY6ZUDEGRU","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VPKY6ZUDEGRUD7WE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VPKY6ZUD","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:8d6222452d5a1e22654fe1d551670d917393a267285a5be18cd6a5cf7809aafc","target":"graph","created_at":"2026-05-17T23:43:29Z","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 present a simple text mining method that is easy to implement, requires minimal data collection and preparation, and is easy to use for proposing ranked associations between a list of target terms and a key phrase. We call this method KinderMiner, and apply it to two biomedical applications. The first application is to identify relevant transcription factors for cell reprogramming, and the second is to identify potential drugs for investigation in drug repositioning. We compare the results from our algorithm to existing data and state-of-the-art algorithms, demonstrating compelling results ","authors_text":"David Page, Finn Kuusisto, James Thomson, John Steill, Ron Stewart, Zhaobin Kuang","cross_cats":["q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-12T17:28:21Z","title":"A Simple Text Mining Approach for Ranking Pairwise Associations in Biomedical Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05255","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:e47c9249e4d73dc3f27f4467065fde5673de83a55d7d388af3d1e6fbf942593f","target":"record","created_at":"2026-05-17T23:43:29Z","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":"ad5069f977167fa6365745736bea51524b37e128faf34e63ca8686a9f18682ce","cross_cats_sorted":["q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-12T17:28:21Z","title_canon_sha256":"0f3b8c826798dca24b1b21b0d83b5453db7a0bf4295fe180e48afb3631d69f09"},"schema_version":"1.0","source":{"id":"1906.05255","kind":"arxiv","version":1}},"canonical_sha256":"abd58f668321a341fec43d64b38e11eeee632cdaa875d633d4d04f2488a0629e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abd58f668321a341fec43d64b38e11eeee632cdaa875d633d4d04f2488a0629e","first_computed_at":"2026-05-17T23:43:29.040589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:29.040589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ghE0jyKOqMa7dsejDu+7Tiv/XiXvVt4TF1HCm0TdS/1fY49T3gZoxkURFO5cRfqwDQ1GeRVnxStu2NI54+MyBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:29.041234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e47c9249e4d73dc3f27f4467065fde5673de83a55d7d388af3d1e6fbf942593f","sha256:8d6222452d5a1e22654fe1d551670d917393a267285a5be18cd6a5cf7809aafc"],"state_sha256":"8182d6cb620ba841a475ca2e555b62c8b27c5985f07da718eed09d3836570a37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3Njk7SBMckTPth9f8dfv/GYY+XTvX3EawQup19BIchvc9mAhB6CghQ08ho909QPFl6d0R2TL1PLdRzhL+o9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:39:24.103288Z","bundle_sha256":"35982d41ecbb343bd48215c8d98eca1c0dc8be5671d4448956e1e090ff98189a"}}