{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BEZRMEUTR2UADNEAF6PKNZLAPJ","short_pith_number":"pith:BEZRMEUT","canonical_record":{"source":{"id":"1602.04601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-15T09:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"f8130117c9755fb0a47806bdc2f400587435e86a56dcd1ffc15bfc40829f4b31","abstract_canon_sha256":"1faa0dfb182cb46dc7579c024cffaf042c993b94ccb419318f2155aac9ad3d8d"},"schema_version":"1.0"},"canonical_sha256":"09331612938ea801b4802f9ea6e5607a5285a9a0c1f42db0d792f9f8f4399cb8","source":{"kind":"arxiv","id":"1602.04601","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04601","created_at":"2026-05-18T01:19:20Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04601v2","created_at":"2026-05-18T01:19:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04601","created_at":"2026-05-18T01:19:20Z"},{"alias_kind":"pith_short_12","alias_value":"BEZRMEUTR2UA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BEZRMEUTR2UADNEA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BEZRMEUT","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BEZRMEUTR2UADNEAF6PKNZLAPJ","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-15T09:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"f8130117c9755fb0a47806bdc2f400587435e86a56dcd1ffc15bfc40829f4b31","abstract_canon_sha256":"1faa0dfb182cb46dc7579c024cffaf042c993b94ccb419318f2155aac9ad3d8d"},"schema_version":"1.0"},"canonical_sha256":"09331612938ea801b4802f9ea6e5607a5285a9a0c1f42db0d792f9f8f4399cb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:20.107222Z","signature_b64":"yOQdEYKmjlhqKn+Pa5pxTud5N3aQAEaj3yEErrrmLn2UhFQfGz0qX6i/Ph8JrGEd8YFUVWN7hQAYZe82pTFnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09331612938ea801b4802f9ea6e5607a5285a9a0c1f42db0d792f9f8f4399cb8","last_reissued_at":"2026-05-18T01:19:20.106650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:20.106650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04601","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-05-18T01:19:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F8/21euFBxpUa04Gze+SbCzwFO09LRF00l+9bQFWbTBbRtmZjbwJtnqv3rbRMI1Pkg8ii5X1DsQnX0YnqC96BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:06:41.689895Z"},"content_sha256":"52e609972d3416a120c1d5064ca459439265f67fd3ab528eaeb3b8d746330dfb","schema_version":"1.0","event_id":"sha256:52e609972d3416a120c1d5064ca459439265f67fd3ab528eaeb3b8d746330dfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BEZRMEUTR2UADNEAF6PKNZLAPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selective Inference Approach for Statistically Sound Predictive Pattern Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ichiro Takeuchi, Kazuya Nakagawa, Koji Tsuda, Mahito Sugiyama, Shinya Suzumura","submitted_at":"2016-02-15T09:52:00Z","abstract_excerpt":"Discovering statistically significant patterns from databases is an important challenging problem. The main obstacle of this problem is in the difficulty of taking into account the selection bias, i.e., the bias arising from the fact that patterns are selected from extremely large number of candidates in databases. In this paper, we introduce a new approach for predictive pattern mining problems that can address the selection bias issue. Our approach is built on a recently popularized statistical inference framework called selective inference. In selective inference, statistical inferences (su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04601","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":""},"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-18T01:19:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQvpKpqsuubeDmOQ6wTZ0tqYp6Zv15XvPHilxLtruln8ozPLvRBuwb3y4IrYb0ibGEbshBvzd+LFIrN+NylCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:06:41.690590Z"},"content_sha256":"fd5514759491fac3f7f29dc95262d419040258e4a29e92d36830eece91a37756","schema_version":"1.0","event_id":"sha256:fd5514759491fac3f7f29dc95262d419040258e4a29e92d36830eece91a37756"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEZRMEUTR2UADNEAF6PKNZLAPJ/bundle.json","state_url":"https://pith.science/pith/BEZRMEUTR2UADNEAF6PKNZLAPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEZRMEUTR2UADNEAF6PKNZLAPJ/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-05-25T15:06:41Z","links":{"resolver":"https://pith.science/pith/BEZRMEUTR2UADNEAF6PKNZLAPJ","bundle":"https://pith.science/pith/BEZRMEUTR2UADNEAF6PKNZLAPJ/bundle.json","state":"https://pith.science/pith/BEZRMEUTR2UADNEAF6PKNZLAPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEZRMEUTR2UADNEAF6PKNZLAPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BEZRMEUTR2UADNEAF6PKNZLAPJ","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":"1faa0dfb182cb46dc7579c024cffaf042c993b94ccb419318f2155aac9ad3d8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-15T09:52:00Z","title_canon_sha256":"f8130117c9755fb0a47806bdc2f400587435e86a56dcd1ffc15bfc40829f4b31"},"schema_version":"1.0","source":{"id":"1602.04601","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04601","created_at":"2026-05-18T01:19:20Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04601v2","created_at":"2026-05-18T01:19:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04601","created_at":"2026-05-18T01:19:20Z"},{"alias_kind":"pith_short_12","alias_value":"BEZRMEUTR2UA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BEZRMEUTR2UADNEA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BEZRMEUT","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:fd5514759491fac3f7f29dc95262d419040258e4a29e92d36830eece91a37756","target":"graph","created_at":"2026-05-18T01:19:20Z","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":"Discovering statistically significant patterns from databases is an important challenging problem. The main obstacle of this problem is in the difficulty of taking into account the selection bias, i.e., the bias arising from the fact that patterns are selected from extremely large number of candidates in databases. In this paper, we introduce a new approach for predictive pattern mining problems that can address the selection bias issue. Our approach is built on a recently popularized statistical inference framework called selective inference. In selective inference, statistical inferences (su","authors_text":"Ichiro Takeuchi, Kazuya Nakagawa, Koji Tsuda, Mahito Sugiyama, Shinya Suzumura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-15T09:52:00Z","title":"Selective Inference Approach for Statistically Sound Predictive Pattern Mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04601","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:52e609972d3416a120c1d5064ca459439265f67fd3ab528eaeb3b8d746330dfb","target":"record","created_at":"2026-05-18T01:19:20Z","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":"1faa0dfb182cb46dc7579c024cffaf042c993b94ccb419318f2155aac9ad3d8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-15T09:52:00Z","title_canon_sha256":"f8130117c9755fb0a47806bdc2f400587435e86a56dcd1ffc15bfc40829f4b31"},"schema_version":"1.0","source":{"id":"1602.04601","kind":"arxiv","version":2}},"canonical_sha256":"09331612938ea801b4802f9ea6e5607a5285a9a0c1f42db0d792f9f8f4399cb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09331612938ea801b4802f9ea6e5607a5285a9a0c1f42db0d792f9f8f4399cb8","first_computed_at":"2026-05-18T01:19:20.106650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:20.106650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yOQdEYKmjlhqKn+Pa5pxTud5N3aQAEaj3yEErrrmLn2UhFQfGz0qX6i/Ph8JrGEd8YFUVWN7hQAYZe82pTFnDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:20.107222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04601","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52e609972d3416a120c1d5064ca459439265f67fd3ab528eaeb3b8d746330dfb","sha256:fd5514759491fac3f7f29dc95262d419040258e4a29e92d36830eece91a37756"],"state_sha256":"675e3320da53c47eb5f24e2dcdefb1d9b95c453a2a2420bceca11ccc3b6b05f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bQ1HtfMMCOq7+eOZLTpbYpZLnUneh+3f7ugbiTxnLXncZsdLV4DphMKvP4B+5cl5iU4XmZftTllRFGE2X5kBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:06:41.693963Z","bundle_sha256":"b184fdc5fb63be29b274094e4c00aafc76d8800bcec985038831de9be3c8782c"}}