{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EBTSDBVSWQZUWJBZ63FUTTMTXO","short_pith_number":"pith:EBTSDBVS","canonical_record":{"source":{"id":"1605.04245","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-13T16:42:51Z","cross_cats_sorted":[],"title_canon_sha256":"a42781b4b618edb40d749efa1b957a13eaa0eb52dca8f358eb5cbd9f9c82044b","abstract_canon_sha256":"6e41c7704311b2bde6877607c395960ee9c93edb00c942e1b39429d521657532"},"schema_version":"1.0"},"canonical_sha256":"20672186b2b4334b2439f6cb49cd93bb9c523052b453caabe41f513dcddd434a","source":{"kind":"arxiv","id":"1605.04245","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04245","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04245v3","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04245","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"EBTSDBVSWQZU","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EBTSDBVSWQZUWJBZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EBTSDBVS","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EBTSDBVSWQZUWJBZ63FUTTMTXO","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04245","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-13T16:42:51Z","cross_cats_sorted":[],"title_canon_sha256":"a42781b4b618edb40d749efa1b957a13eaa0eb52dca8f358eb5cbd9f9c82044b","abstract_canon_sha256":"6e41c7704311b2bde6877607c395960ee9c93edb00c942e1b39429d521657532"},"schema_version":"1.0"},"canonical_sha256":"20672186b2b4334b2439f6cb49cd93bb9c523052b453caabe41f513dcddd434a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:55.798840Z","signature_b64":"0ARZiyq3m95PwvMFF/9EWna5+K9zIyLC7N/Mqj4hAonuedZt0IPY4a/9P7PTjsm/s0M6DQR536gJ34gyPf9UCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20672186b2b4334b2439f6cb49cd93bb9c523052b453caabe41f513dcddd434a","last_reissued_at":"2026-05-18T01:04:55.798282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:55.798282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04245","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-05-18T01:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWgwtuZmsNwdtXzJe6d6gDUwKA+AkPDSD+2NGKDv8FUIxiMQO0RRth1q0W1Jw+YELJjnYjhTrPiF96X+/BlrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:42:09.196918Z"},"content_sha256":"d3b7adb8847f5093503117372de76f1fa1c453c09577c5ae2946f639df719e98","schema_version":"1.0","event_id":"sha256:d3b7adb8847f5093503117372de76f1fa1c453c09577c5ae2946f639df719e98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EBTSDBVSWQZUWJBZ63FUTTMTXO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost functionals for large (uniform and simply generated) random trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jean-Fran\\c{c}ois Delmas, Jean-St\\'ephane Dhersin, Marion Sciauveau","submitted_at":"2016-05-13T16:42:51Z","abstract_excerpt":"Additive tree functionals allow to represent the cost of many divide-and-conquer algorithms. We give an invariance principle for such tree functionals for the Catalan model (random tree uniformly distributed among the full binary ordered trees with given number of internal nodes) and for simply generated trees (including random tree uniformly distributed among the ordered trees with given number of nodes). In the Catalan model, this relies on the natural embedding of binary trees into the Brownian excursion and then on elementary second moment computations. We recover results first given by Fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04245","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":""},"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:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ng54J1rgWXoDBZiUuxhC7JsJTz4Ytwyu/q31YBI6+6ofbDdoV/HLKIjwHruAKFzhsWIaGCmb+T9oCNjDLQ47AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:42:09.197665Z"},"content_sha256":"e30ab79cc66b09428032f5c4829c1d573ea51d37810fc3467b446dfb42a97f15","schema_version":"1.0","event_id":"sha256:e30ab79cc66b09428032f5c4829c1d573ea51d37810fc3467b446dfb42a97f15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBTSDBVSWQZUWJBZ63FUTTMTXO/bundle.json","state_url":"https://pith.science/pith/EBTSDBVSWQZUWJBZ63FUTTMTXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBTSDBVSWQZUWJBZ63FUTTMTXO/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-31T00:42:09Z","links":{"resolver":"https://pith.science/pith/EBTSDBVSWQZUWJBZ63FUTTMTXO","bundle":"https://pith.science/pith/EBTSDBVSWQZUWJBZ63FUTTMTXO/bundle.json","state":"https://pith.science/pith/EBTSDBVSWQZUWJBZ63FUTTMTXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBTSDBVSWQZUWJBZ63FUTTMTXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EBTSDBVSWQZUWJBZ63FUTTMTXO","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":"6e41c7704311b2bde6877607c395960ee9c93edb00c942e1b39429d521657532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-13T16:42:51Z","title_canon_sha256":"a42781b4b618edb40d749efa1b957a13eaa0eb52dca8f358eb5cbd9f9c82044b"},"schema_version":"1.0","source":{"id":"1605.04245","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04245","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04245v3","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04245","created_at":"2026-05-18T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"EBTSDBVSWQZU","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EBTSDBVSWQZUWJBZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EBTSDBVS","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:e30ab79cc66b09428032f5c4829c1d573ea51d37810fc3467b446dfb42a97f15","target":"graph","created_at":"2026-05-18T01:04: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"},"paper":{"abstract_excerpt":"Additive tree functionals allow to represent the cost of many divide-and-conquer algorithms. We give an invariance principle for such tree functionals for the Catalan model (random tree uniformly distributed among the full binary ordered trees with given number of internal nodes) and for simply generated trees (including random tree uniformly distributed among the ordered trees with given number of nodes). In the Catalan model, this relies on the natural embedding of binary trees into the Brownian excursion and then on elementary second moment computations. We recover results first given by Fi","authors_text":"Jean-Fran\\c{c}ois Delmas, Jean-St\\'ephane Dhersin, Marion Sciauveau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-13T16:42:51Z","title":"Cost functionals for large (uniform and simply generated) random trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04245","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:d3b7adb8847f5093503117372de76f1fa1c453c09577c5ae2946f639df719e98","target":"record","created_at":"2026-05-18T01:04: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":"6e41c7704311b2bde6877607c395960ee9c93edb00c942e1b39429d521657532","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-13T16:42:51Z","title_canon_sha256":"a42781b4b618edb40d749efa1b957a13eaa0eb52dca8f358eb5cbd9f9c82044b"},"schema_version":"1.0","source":{"id":"1605.04245","kind":"arxiv","version":3}},"canonical_sha256":"20672186b2b4334b2439f6cb49cd93bb9c523052b453caabe41f513dcddd434a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20672186b2b4334b2439f6cb49cd93bb9c523052b453caabe41f513dcddd434a","first_computed_at":"2026-05-18T01:04:55.798282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:55.798282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ARZiyq3m95PwvMFF/9EWna5+K9zIyLC7N/Mqj4hAonuedZt0IPY4a/9P7PTjsm/s0M6DQR536gJ34gyPf9UCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:55.798840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04245","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3b7adb8847f5093503117372de76f1fa1c453c09577c5ae2946f639df719e98","sha256:e30ab79cc66b09428032f5c4829c1d573ea51d37810fc3467b446dfb42a97f15"],"state_sha256":"657b94e36d5882e30059a8268edeeaf849cb12336fffb7393c65a828b662cf7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Jf2ygKtdyDrJ3E3xIdaNk7tE6iT30wyf/9z5MgR5164V+HqjqWr5ItABYW4pe2vNLcrp1Gz7JfZu2BDzWrIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:42:09.201089Z","bundle_sha256":"af6300153abc2a99dc6ee6a8bfda3bc8ae73d6a2938c7338047b68420a0bdd11"}}