{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:X457Y5PQDUPBGIFDQLWA3U7YFB","short_pith_number":"pith:X457Y5PQ","canonical_record":{"source":{"id":"2505.21774","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-05-27T21:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"68f4cf648e6e3c7ef87991eefbef14c317cac7ed1197e2c12285c255413b141c","abstract_canon_sha256":"1e6332536a4870ee9c6c7a19abdb0efcb5196f4d86766bfb6c8ce025cfd75a87"},"schema_version":"1.0"},"canonical_sha256":"bf3bfc75f01d1e1320a382ec0dd3f82856d8c1e95092559518b40f21d2e35ba5","source":{"kind":"arxiv","id":"2505.21774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21774","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21774v1","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21774","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"X457Y5PQDUPB","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_16","alias_value":"X457Y5PQDUPBGIFD","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_8","alias_value":"X457Y5PQ","created_at":"2026-07-05T11:11:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:X457Y5PQDUPBGIFDQLWA3U7YFB","target":"record","payload":{"canonical_record":{"source":{"id":"2505.21774","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-05-27T21:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"68f4cf648e6e3c7ef87991eefbef14c317cac7ed1197e2c12285c255413b141c","abstract_canon_sha256":"1e6332536a4870ee9c6c7a19abdb0efcb5196f4d86766bfb6c8ce025cfd75a87"},"schema_version":"1.0"},"canonical_sha256":"bf3bfc75f01d1e1320a382ec0dd3f82856d8c1e95092559518b40f21d2e35ba5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:03.316650Z","signature_b64":"TkC+bQwYQbSUsAFl98Q1sCpXCV+Mk/eTvaxawe2TeLR+F0MBCUlgV1kdAFGMKtdHPuAg9Esq1hDmPcigSu6ACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf3bfc75f01d1e1320a382ec0dd3f82856d8c1e95092559518b40f21d2e35ba5","last_reissued_at":"2026-07-05T11:11:03.316130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:03.316130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.21774","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:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYIjSAuh/x51zJzxzSLeRfG3HRSJOaJ8yRv8lIfWwxfD2b4vqf+F/QUBeSL+llEQPcve7bksS/wKcsIhlAutAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:34:18.529404Z"},"content_sha256":"96d4572677a3fb7592e01aecd099a727d65448e95e6d724d6bc3444c6699d970","schema_version":"1.0","event_id":"sha256:96d4572677a3fb7592e01aecd099a727d65448e95e6d724d6bc3444c6699d970"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:X457Y5PQDUPBGIFDQLWA3U7YFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The friendship paradox for trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Azadeh Parvaneh, Frank den Hollander, Nelly Litvak, Rajat Subhra Hazra","submitted_at":"2025-05-27T21:18:18Z","abstract_excerpt":"We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively. For an arbitrary finite tree, we show that the number of positive vertices is at least as large as the number of negative vertices, a property we refer to as significance, and derive a lower bound in terms of the branching points in the tree. For an infinite Galton-Watson tree, we compute the densities of the positive and the negative vertices and show that either may dominate the other, depending on the offspring "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21774","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/2505.21774/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:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcPiH2YovOG/BvB407sGjF5/6t2wdzVK3dPQvIrlr5JtR0yZKKa0HG3aYGnuEQdWzO2QkyOIvDuh5fPS5S+MAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:34:18.529958Z"},"content_sha256":"6b8135332d63719bbc878f35b8132f09dcd265f49a24c9814454856e1b01823a","schema_version":"1.0","event_id":"sha256:6b8135332d63719bbc878f35b8132f09dcd265f49a24c9814454856e1b01823a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X457Y5PQDUPBGIFDQLWA3U7YFB/bundle.json","state_url":"https://pith.science/pith/X457Y5PQDUPBGIFDQLWA3U7YFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X457Y5PQDUPBGIFDQLWA3U7YFB/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-08-08T08:34:18Z","links":{"resolver":"https://pith.science/pith/X457Y5PQDUPBGIFDQLWA3U7YFB","bundle":"https://pith.science/pith/X457Y5PQDUPBGIFDQLWA3U7YFB/bundle.json","state":"https://pith.science/pith/X457Y5PQDUPBGIFDQLWA3U7YFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X457Y5PQDUPBGIFDQLWA3U7YFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:X457Y5PQDUPBGIFDQLWA3U7YFB","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":"1e6332536a4870ee9c6c7a19abdb0efcb5196f4d86766bfb6c8ce025cfd75a87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-05-27T21:18:18Z","title_canon_sha256":"68f4cf648e6e3c7ef87991eefbef14c317cac7ed1197e2c12285c255413b141c"},"schema_version":"1.0","source":{"id":"2505.21774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21774","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21774v1","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21774","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"X457Y5PQDUPB","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_16","alias_value":"X457Y5PQDUPBGIFD","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_8","alias_value":"X457Y5PQ","created_at":"2026-07-05T11:11:03Z"}],"graph_snapshots":[{"event_id":"sha256:6b8135332d63719bbc878f35b8132f09dcd265f49a24c9814454856e1b01823a","target":"graph","created_at":"2026-07-05T11:11:03Z","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/2505.21774/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively. For an arbitrary finite tree, we show that the number of positive vertices is at least as large as the number of negative vertices, a property we refer to as significance, and derive a lower bound in terms of the branching points in the tree. For an infinite Galton-Watson tree, we compute the densities of the positive and the negative vertices and show that either may dominate the other, depending on the offspring ","authors_text":"Azadeh Parvaneh, Frank den Hollander, Nelly Litvak, Rajat Subhra Hazra","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-05-27T21:18:18Z","title":"The friendship paradox for trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21774","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:96d4572677a3fb7592e01aecd099a727d65448e95e6d724d6bc3444c6699d970","target":"record","created_at":"2026-07-05T11:11:03Z","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":"1e6332536a4870ee9c6c7a19abdb0efcb5196f4d86766bfb6c8ce025cfd75a87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-05-27T21:18:18Z","title_canon_sha256":"68f4cf648e6e3c7ef87991eefbef14c317cac7ed1197e2c12285c255413b141c"},"schema_version":"1.0","source":{"id":"2505.21774","kind":"arxiv","version":1}},"canonical_sha256":"bf3bfc75f01d1e1320a382ec0dd3f82856d8c1e95092559518b40f21d2e35ba5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf3bfc75f01d1e1320a382ec0dd3f82856d8c1e95092559518b40f21d2e35ba5","first_computed_at":"2026-07-05T11:11:03.316130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:03.316130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TkC+bQwYQbSUsAFl98Q1sCpXCV+Mk/eTvaxawe2TeLR+F0MBCUlgV1kdAFGMKtdHPuAg9Esq1hDmPcigSu6ACQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:03.316650Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.21774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96d4572677a3fb7592e01aecd099a727d65448e95e6d724d6bc3444c6699d970","sha256:6b8135332d63719bbc878f35b8132f09dcd265f49a24c9814454856e1b01823a"],"state_sha256":"81c4cedb381b0f7d7437ba4ade21ad614a7cc434926265daf3451f05089c9079"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ja3Uv6c84hWmxD8tPWvJ6FbgqTxNascfDRKqcH/5Y0KNheT6jb/qlE6J1dXIamr0z2Ys4Y1krzqy4DmXTZVODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T08:34:18.533887Z","bundle_sha256":"2a6c2272858f9b1455abd9d2ea2ad60177e3c01e1028c278f27819ed5c3e591f"}}