{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BYAPBDN3FPWDWHOZAJIWWC4MMO","short_pith_number":"pith:BYAPBDN3","canonical_record":{"source":{"id":"1707.00165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-01T15:03:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7cde5233cc230a50cbcc7cdd2382951a345443e5d967df0ec752fff2c6de18c0","abstract_canon_sha256":"011abe90d8d252849134d1d3d0ddcbcfdf3c92d234f9bbf3c7ddaa6899618755"},"schema_version":"1.0"},"canonical_sha256":"0e00f08dbb2bec3b1dd902516b0b8c639a0b3b1da416318a73ea27612d213da9","source":{"kind":"arxiv","id":"1707.00165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00165","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00165v1","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00165","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"BYAPBDN3FPWD","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BYAPBDN3FPWDWHOZ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BYAPBDN3","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BYAPBDN3FPWDWHOZAJIWWC4MMO","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-01T15:03:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7cde5233cc230a50cbcc7cdd2382951a345443e5d967df0ec752fff2c6de18c0","abstract_canon_sha256":"011abe90d8d252849134d1d3d0ddcbcfdf3c92d234f9bbf3c7ddaa6899618755"},"schema_version":"1.0"},"canonical_sha256":"0e00f08dbb2bec3b1dd902516b0b8c639a0b3b1da416318a73ea27612d213da9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:04.263279Z","signature_b64":"3PaLMBJa7+FNjM3Jy87w+CXJPABIIT7/OYE/bZtGofgTggxinPZShwqvUNdW0CG68okEKVI+3iTvgy2RusUzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e00f08dbb2bec3b1dd902516b0b8c639a0b3b1da416318a73ea27612d213da9","last_reissued_at":"2026-05-18T00:41:04.262693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:04.262693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00165","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-18T00:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ST4lGTEGTzZpDVsTXsGzJ25OmT6uG6MysL3CFdHGmnYQKI8/nvkIfyw29iYkqL79pB4x4pcBDWkoWHLdgIXYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:05:59.321729Z"},"content_sha256":"4001e8a560973dc867b7bf2bbac2ab29a8a28127f16dd482014bc36782d248b6","schema_version":"1.0","event_id":"sha256:4001e8a560973dc867b7bf2bbac2ab29a8a28127f16dd482014bc36782d248b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BYAPBDN3FPWDWHOZAJIWWC4MMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On weighted depths in random binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.PR","authors_text":"Anis Amri, Henning Sulzbach, Rafik Aguech","submitted_at":"2017-07-01T15:03:22Z","abstract_excerpt":"Following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133-141], the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We analyze weighted depths of nodes with given labels, the last inserted node, nodes ordered as visited by the depth first search process, the weighted path length and the weighted Wiener index in a random binary search tree. We establish three regimes of nodes depending on whether the second order behaviour of their weighted depths follows from fluctuations of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00165","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-18T00:41:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZWeLe7jrhKbBdFhZdBIznUkAGx8xsdt5rXAi2SjF4wBC545uTExP+Th4wWkhNjC7moAgFcKhONKHoNf6OYuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:05:59.322412Z"},"content_sha256":"c57b77b1ac98d294f279e4b09500fd80512419358aa228b62e2f6645d8fb7c51","schema_version":"1.0","event_id":"sha256:c57b77b1ac98d294f279e4b09500fd80512419358aa228b62e2f6645d8fb7c51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYAPBDN3FPWDWHOZAJIWWC4MMO/bundle.json","state_url":"https://pith.science/pith/BYAPBDN3FPWDWHOZAJIWWC4MMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYAPBDN3FPWDWHOZAJIWWC4MMO/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-27T13:05:59Z","links":{"resolver":"https://pith.science/pith/BYAPBDN3FPWDWHOZAJIWWC4MMO","bundle":"https://pith.science/pith/BYAPBDN3FPWDWHOZAJIWWC4MMO/bundle.json","state":"https://pith.science/pith/BYAPBDN3FPWDWHOZAJIWWC4MMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYAPBDN3FPWDWHOZAJIWWC4MMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BYAPBDN3FPWDWHOZAJIWWC4MMO","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":"011abe90d8d252849134d1d3d0ddcbcfdf3c92d234f9bbf3c7ddaa6899618755","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-01T15:03:22Z","title_canon_sha256":"7cde5233cc230a50cbcc7cdd2382951a345443e5d967df0ec752fff2c6de18c0"},"schema_version":"1.0","source":{"id":"1707.00165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00165","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00165v1","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00165","created_at":"2026-05-18T00:41:04Z"},{"alias_kind":"pith_short_12","alias_value":"BYAPBDN3FPWD","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BYAPBDN3FPWDWHOZ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BYAPBDN3","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:c57b77b1ac98d294f279e4b09500fd80512419358aa228b62e2f6645d8fb7c51","target":"graph","created_at":"2026-05-18T00:41:04Z","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":"Following the model introduced by Aguech, Lasmar and Mahmoud [Probab. Engrg. Inform. Sci. 21 (2007) 133-141], the weighted depth of a node in a labelled rooted tree is the sum of all labels on the path connecting the node to the root. We analyze weighted depths of nodes with given labels, the last inserted node, nodes ordered as visited by the depth first search process, the weighted path length and the weighted Wiener index in a random binary search tree. We establish three regimes of nodes depending on whether the second order behaviour of their weighted depths follows from fluctuations of t","authors_text":"Anis Amri, Henning Sulzbach, Rafik Aguech","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-01T15:03:22Z","title":"On weighted depths in random binary search trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00165","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:4001e8a560973dc867b7bf2bbac2ab29a8a28127f16dd482014bc36782d248b6","target":"record","created_at":"2026-05-18T00:41:04Z","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":"011abe90d8d252849134d1d3d0ddcbcfdf3c92d234f9bbf3c7ddaa6899618755","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-07-01T15:03:22Z","title_canon_sha256":"7cde5233cc230a50cbcc7cdd2382951a345443e5d967df0ec752fff2c6de18c0"},"schema_version":"1.0","source":{"id":"1707.00165","kind":"arxiv","version":1}},"canonical_sha256":"0e00f08dbb2bec3b1dd902516b0b8c639a0b3b1da416318a73ea27612d213da9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e00f08dbb2bec3b1dd902516b0b8c639a0b3b1da416318a73ea27612d213da9","first_computed_at":"2026-05-18T00:41:04.262693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:04.262693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3PaLMBJa7+FNjM3Jy87w+CXJPABIIT7/OYE/bZtGofgTggxinPZShwqvUNdW0CG68okEKVI+3iTvgy2RusUzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:04.263279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4001e8a560973dc867b7bf2bbac2ab29a8a28127f16dd482014bc36782d248b6","sha256:c57b77b1ac98d294f279e4b09500fd80512419358aa228b62e2f6645d8fb7c51"],"state_sha256":"e570035ad8dfd291a1700f5a1fd2e199c767d91d98b60fd740022f92d2554baf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JxTFWoKSKhbcBJKI6rfroy2qb/sW56CkUibJ/2N6U7+XWBko6lSpjcNtb5cdDMBH0vj26emVfIpfCmu/HIagDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:05:59.327695Z","bundle_sha256":"ff9e5c96ea1efa5261c9aea2d678d8b388bf593e937d67d9e24833f93c2ad63c"}}