{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3HL5WVWMHH3MF2SZJOFZVP7NM5","short_pith_number":"pith:3HL5WVWM","canonical_record":{"source":{"id":"2507.03271","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-07-04T03:04:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d5c5ff8ca7da49106771148b176d16d53f1712b889f380250c78dfa609bf44d6","abstract_canon_sha256":"01d72dbf85befd3b06f797223f49e8cf6eee7709af78bdccf24f760efe98da12"},"schema_version":"1.0"},"canonical_sha256":"d9d7db56cc39f6c2ea594b8b9abfed677b0fc51b4be6c940bdf66429b5e3333e","source":{"kind":"arxiv","id":"2507.03271","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.03271","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.03271v1","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03271","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"3HL5WVWMHH3M","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"pith_short_16","alias_value":"3HL5WVWMHH3MF2SZ","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"pith_short_8","alias_value":"3HL5WVWM","created_at":"2026-07-05T11:31:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3HL5WVWMHH3MF2SZJOFZVP7NM5","target":"record","payload":{"canonical_record":{"source":{"id":"2507.03271","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-07-04T03:04:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d5c5ff8ca7da49106771148b176d16d53f1712b889f380250c78dfa609bf44d6","abstract_canon_sha256":"01d72dbf85befd3b06f797223f49e8cf6eee7709af78bdccf24f760efe98da12"},"schema_version":"1.0"},"canonical_sha256":"d9d7db56cc39f6c2ea594b8b9abfed677b0fc51b4be6c940bdf66429b5e3333e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:55.851149Z","signature_b64":"YFpiRVxLB6yPHqH+5o05q0gsrph4sFYU/XxkDXNaCoJ/uGIlgl+wjKkk//9aecsBo3sYbWczB/oEooVOjTLLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9d7db56cc39f6c2ea594b8b9abfed677b0fc51b4be6c940bdf66429b5e3333e","last_reissued_at":"2026-07-05T11:31:55.850644Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:55.850644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.03271","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-07-05T11:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kz2IISFtyPRQ3Qcgh3HHO9EQc7nYkjsqbc9pUtG9MNhfJ15lwa87uYk6OGNenKE04J4deMm0TQUZSA58O2ttDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:24:41.748798Z"},"content_sha256":"cbfaaa3598f62aaa9080dc1441aeea585f79e9ebaaeaaf3c84111a222bf08d2d","schema_version":"1.0","event_id":"sha256:cbfaaa3598f62aaa9080dc1441aeea585f79e9ebaaeaaf3c84111a222bf08d2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3HL5WVWMHH3MF2SZJOFZVP7NM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LILI clustering algorithm: Limit Inferior Leaf Interval Integrated into Causal Forest for Causal Interference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chuanhou Gao, Di Fan, Yiran Dong","submitted_at":"2025-07-04T03:04:00Z","abstract_excerpt":"Causal forest methods are powerful tools in causal inference. Similar to traditional random forest in machine learning, causal forest independently considers each causal tree. However, this independence consideration increases the likelihood that classification errors in one tree are repeated in others, potentially leading to significant bias in causal e ect estimation. In this paper, we propose a novel approach that establishes connections between causal trees through the Limit Inferior Leaf Interval (LILI) clustering algorithm. LILIs are constructed based on the leaves of all causal trees, e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03271","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.03271/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-05T11:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1Idvm9KMYTsL+UZbLO/dZzh0aIiwvXXFguWRz5WAfV7vjEXLyDwo0uhkd9C8GNkxhltw0EhC0+Y6zYmcfqdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:24:41.749176Z"},"content_sha256":"ca078aaf1a3b10af407305e976943cbad6bd0290301d79505c1461611de16c73","schema_version":"1.0","event_id":"sha256:ca078aaf1a3b10af407305e976943cbad6bd0290301d79505c1461611de16c73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HL5WVWMHH3MF2SZJOFZVP7NM5/bundle.json","state_url":"https://pith.science/pith/3HL5WVWMHH3MF2SZJOFZVP7NM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HL5WVWMHH3MF2SZJOFZVP7NM5/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-07-06T20:24:41Z","links":{"resolver":"https://pith.science/pith/3HL5WVWMHH3MF2SZJOFZVP7NM5","bundle":"https://pith.science/pith/3HL5WVWMHH3MF2SZJOFZVP7NM5/bundle.json","state":"https://pith.science/pith/3HL5WVWMHH3MF2SZJOFZVP7NM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HL5WVWMHH3MF2SZJOFZVP7NM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3HL5WVWMHH3MF2SZJOFZVP7NM5","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":"01d72dbf85befd3b06f797223f49e8cf6eee7709af78bdccf24f760efe98da12","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-07-04T03:04:00Z","title_canon_sha256":"d5c5ff8ca7da49106771148b176d16d53f1712b889f380250c78dfa609bf44d6"},"schema_version":"1.0","source":{"id":"2507.03271","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.03271","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.03271v1","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03271","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"3HL5WVWMHH3M","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"pith_short_16","alias_value":"3HL5WVWMHH3MF2SZ","created_at":"2026-07-05T11:31:55Z"},{"alias_kind":"pith_short_8","alias_value":"3HL5WVWM","created_at":"2026-07-05T11:31:55Z"}],"graph_snapshots":[{"event_id":"sha256:ca078aaf1a3b10af407305e976943cbad6bd0290301d79505c1461611de16c73","target":"graph","created_at":"2026-07-05T11:31:55Z","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/2507.03271/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Causal forest methods are powerful tools in causal inference. Similar to traditional random forest in machine learning, causal forest independently considers each causal tree. However, this independence consideration increases the likelihood that classification errors in one tree are repeated in others, potentially leading to significant bias in causal e ect estimation. In this paper, we propose a novel approach that establishes connections between causal trees through the Limit Inferior Leaf Interval (LILI) clustering algorithm. LILIs are constructed based on the leaves of all causal trees, e","authors_text":"Chuanhou Gao, Di Fan, Yiran Dong","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-07-04T03:04:00Z","title":"LILI clustering algorithm: Limit Inferior Leaf Interval Integrated into Causal Forest for Causal Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03271","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:cbfaaa3598f62aaa9080dc1441aeea585f79e9ebaaeaaf3c84111a222bf08d2d","target":"record","created_at":"2026-07-05T11:31:55Z","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":"01d72dbf85befd3b06f797223f49e8cf6eee7709af78bdccf24f760efe98da12","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-07-04T03:04:00Z","title_canon_sha256":"d5c5ff8ca7da49106771148b176d16d53f1712b889f380250c78dfa609bf44d6"},"schema_version":"1.0","source":{"id":"2507.03271","kind":"arxiv","version":1}},"canonical_sha256":"d9d7db56cc39f6c2ea594b8b9abfed677b0fc51b4be6c940bdf66429b5e3333e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9d7db56cc39f6c2ea594b8b9abfed677b0fc51b4be6c940bdf66429b5e3333e","first_computed_at":"2026-07-05T11:31:55.850644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:31:55.850644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YFpiRVxLB6yPHqH+5o05q0gsrph4sFYU/XxkDXNaCoJ/uGIlgl+wjKkk//9aecsBo3sYbWczB/oEooVOjTLLAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:31:55.851149Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.03271","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbfaaa3598f62aaa9080dc1441aeea585f79e9ebaaeaaf3c84111a222bf08d2d","sha256:ca078aaf1a3b10af407305e976943cbad6bd0290301d79505c1461611de16c73"],"state_sha256":"50cb2fdf760c78bb22983a91e31f09f5f40c9bba35aa9044e3357d757af13af9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkbSv9A8fhMdt3UtZzoanFxXEK2TzMzeObGyx1lnwror7D/WjnVWwJwQy34Pdd5SHFYKgpohDXdvD/DgyIs8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:24:41.751388Z","bundle_sha256":"e4db24473aee677691593a453c4a514ef1cd6dbcddd0ff50e89eb46d913fd6ba"}}