{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:X7CMILPJY5VRVOONYT2TVGUHSM","short_pith_number":"pith:X7CMILPJ","canonical_record":{"source":{"id":"2210.10544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2022-10-19T13:31:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0a7e766504fa9d02194ab9e661937c441dccb72f6e3d622faa9d266f134ba2f3","abstract_canon_sha256":"86d556d17b8693cf6a20c515c2eaa3a9e08bf49d49d3c6fb893abd962e2ab02c"},"schema_version":"1.0"},"canonical_sha256":"bfc4c42de9c76b1ab9cdc4f53a9a87931c7decdebb0913b02d3e8c1a70fdbec7","source":{"kind":"arxiv","id":"2210.10544","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.10544","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"2210.10544v3","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10544","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"X7CMILPJY5VR","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"pith_short_16","alias_value":"X7CMILPJY5VRVOON","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"pith_short_8","alias_value":"X7CMILPJ","created_at":"2026-07-05T07:48:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:X7CMILPJY5VRVOONYT2TVGUHSM","target":"record","payload":{"canonical_record":{"source":{"id":"2210.10544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2022-10-19T13:31:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0a7e766504fa9d02194ab9e661937c441dccb72f6e3d622faa9d266f134ba2f3","abstract_canon_sha256":"86d556d17b8693cf6a20c515c2eaa3a9e08bf49d49d3c6fb893abd962e2ab02c"},"schema_version":"1.0"},"canonical_sha256":"bfc4c42de9c76b1ab9cdc4f53a9a87931c7decdebb0913b02d3e8c1a70fdbec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:48:43.931256Z","signature_b64":"WDlFlcVuwx0nOGDeIUIzSiM1+ss08KySiqOpp19MfZOpw9QlhxG1Kt361yR0XFWxzQeO/2JKcydazR5BaUAjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfc4c42de9c76b1ab9cdc4f53a9a87931c7decdebb0913b02d3e8c1a70fdbec7","last_reissued_at":"2026-07-05T07:48:43.930791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:48:43.930791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.10544","source_version":3,"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-05T07:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOHnGinLvh2RMLGgDCe2rUBIcZpYwLJxp/x3L+lp7JXc1hnzza50z2n6PDM5k0rNFP093kGs9SwfRGOmFZcaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:01:47.403353Z"},"content_sha256":"089b67548ff2f54f85accec95900f5292724782edaf3e710ed9f68d295bc8380","schema_version":"1.0","event_id":"sha256:089b67548ff2f54f85accec95900f5292724782edaf3e710ed9f68d295bc8380"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:X7CMILPJY5VRVOONYT2TVGUHSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subtractive random forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Gabor Lugosi, Luc Devroye, Nicolas Broutin, Roberto Imbuzeiro Oliveira","submitted_at":"2022-10-19T13:31:51Z","abstract_excerpt":"Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer $i\\le 0$ is the root of a tree. Vertices labeled by positive integers $n \\ge 1$ are attached sequentially such that the parent of vertex $n$ is $n-Z_n$, where the $Z_n$ are i.i.d.\\ random variables taking values in $\\mathbb N$. We study several characteristics of the resulting random forest. In particular, we establish bounds for the expected tree sizes, the number of trees in the forest, the number of leaves, the maximum degree, and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10544","kind":"arxiv","version":3},"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/2210.10544/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-05T07:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iYwsb4QwEzFAw0ArJ5aS1aipBHh/r8UQUxdl5mrqxHArfkLSJMp+xAvRGPUtjEB+FiC16KukCrb+Ee1z8HqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:01:47.403720Z"},"content_sha256":"f95e09ecf6daa093e6ccb1e6b3cc14fad8cda2a6bddbe9a557d89edf5956fa8c","schema_version":"1.0","event_id":"sha256:f95e09ecf6daa093e6ccb1e6b3cc14fad8cda2a6bddbe9a557d89edf5956fa8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7CMILPJY5VRVOONYT2TVGUHSM/bundle.json","state_url":"https://pith.science/pith/X7CMILPJY5VRVOONYT2TVGUHSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7CMILPJY5VRVOONYT2TVGUHSM/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-09T05:01:47Z","links":{"resolver":"https://pith.science/pith/X7CMILPJY5VRVOONYT2TVGUHSM","bundle":"https://pith.science/pith/X7CMILPJY5VRVOONYT2TVGUHSM/bundle.json","state":"https://pith.science/pith/X7CMILPJY5VRVOONYT2TVGUHSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7CMILPJY5VRVOONYT2TVGUHSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:X7CMILPJY5VRVOONYT2TVGUHSM","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":"86d556d17b8693cf6a20c515c2eaa3a9e08bf49d49d3c6fb893abd962e2ab02c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2022-10-19T13:31:51Z","title_canon_sha256":"0a7e766504fa9d02194ab9e661937c441dccb72f6e3d622faa9d266f134ba2f3"},"schema_version":"1.0","source":{"id":"2210.10544","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.10544","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"2210.10544v3","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10544","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"X7CMILPJY5VR","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"pith_short_16","alias_value":"X7CMILPJY5VRVOON","created_at":"2026-07-05T07:48:43Z"},{"alias_kind":"pith_short_8","alias_value":"X7CMILPJ","created_at":"2026-07-05T07:48:43Z"}],"graph_snapshots":[{"event_id":"sha256:f95e09ecf6daa093e6ccb1e6b3cc14fad8cda2a6bddbe9a557d89edf5956fa8c","target":"graph","created_at":"2026-07-05T07:48:43Z","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/2210.10544/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer $i\\le 0$ is the root of a tree. Vertices labeled by positive integers $n \\ge 1$ are attached sequentially such that the parent of vertex $n$ is $n-Z_n$, where the $Z_n$ are i.i.d.\\ random variables taking values in $\\mathbb N$. We study several characteristics of the resulting random forest. In particular, we establish bounds for the expected tree sizes, the number of trees in the forest, the number of leaves, the maximum degree, and the","authors_text":"Gabor Lugosi, Luc Devroye, Nicolas Broutin, Roberto Imbuzeiro Oliveira","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2022-10-19T13:31:51Z","title":"Subtractive random forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10544","kind":"arxiv","version":3},"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:089b67548ff2f54f85accec95900f5292724782edaf3e710ed9f68d295bc8380","target":"record","created_at":"2026-07-05T07:48:43Z","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":"86d556d17b8693cf6a20c515c2eaa3a9e08bf49d49d3c6fb893abd962e2ab02c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2022-10-19T13:31:51Z","title_canon_sha256":"0a7e766504fa9d02194ab9e661937c441dccb72f6e3d622faa9d266f134ba2f3"},"schema_version":"1.0","source":{"id":"2210.10544","kind":"arxiv","version":3}},"canonical_sha256":"bfc4c42de9c76b1ab9cdc4f53a9a87931c7decdebb0913b02d3e8c1a70fdbec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfc4c42de9c76b1ab9cdc4f53a9a87931c7decdebb0913b02d3e8c1a70fdbec7","first_computed_at":"2026-07-05T07:48:43.930791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:48:43.930791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WDlFlcVuwx0nOGDeIUIzSiM1+ss08KySiqOpp19MfZOpw9QlhxG1Kt361yR0XFWxzQeO/2JKcydazR5BaUAjCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:48:43.931256Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.10544","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:089b67548ff2f54f85accec95900f5292724782edaf3e710ed9f68d295bc8380","sha256:f95e09ecf6daa093e6ccb1e6b3cc14fad8cda2a6bddbe9a557d89edf5956fa8c"],"state_sha256":"f51ffcdedd9102c69a0107990d631c5702b707d6146f013088550533d12710d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NTjHDPgPzeE8FKBpuB82OxWAkoImS6AHwpQXKeoNvFiiIejmsL+tUQDfEda9xrGEkkmoiPSFLTypUid1mdJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T05:01:47.405858Z","bundle_sha256":"6d2a32d44b4a9f4a72ff0acdfc6b7b98f9c62c00f55e00efba4702082ce49303"}}