{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QJ3JNLLJ4LO3CASO3QXSMV4UBV","short_pith_number":"pith:QJ3JNLLJ","canonical_record":{"source":{"id":"1501.04804","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-20T13:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"0ea7636c2953c509d21a3b3d451b92a58c0509a64bd184c0df4e2dc9314493c8","abstract_canon_sha256":"14a08a1f905461b813b1059ffdbb988020270ced43560f20797bf3e05b87c485"},"schema_version":"1.0"},"canonical_sha256":"827696ad69e2ddb1024edc2f2657940d7c5450e1f4d3122ed3973f21d70896c2","source":{"kind":"arxiv","id":"1501.04804","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04804","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04804v3","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04804","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"QJ3JNLLJ4LO3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QJ3JNLLJ4LO3CASO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QJ3JNLLJ","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QJ3JNLLJ4LO3CASO3QXSMV4UBV","target":"record","payload":{"canonical_record":{"source":{"id":"1501.04804","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-20T13:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"0ea7636c2953c509d21a3b3d451b92a58c0509a64bd184c0df4e2dc9314493c8","abstract_canon_sha256":"14a08a1f905461b813b1059ffdbb988020270ced43560f20797bf3e05b87c485"},"schema_version":"1.0"},"canonical_sha256":"827696ad69e2ddb1024edc2f2657940d7c5450e1f4d3122ed3973f21d70896c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.295826Z","signature_b64":"cu31WqWnjV+SY4x8eSYtoD51ecwX+e7RvBR7SlD5NDKmnKS1Aj8ifdMR4FQ5QPfKOoOVPg/ZoKBXcCZsfFB4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"827696ad69e2ddb1024edc2f2657940d7c5450e1f4d3122ed3973f21d70896c2","last_reissued_at":"2026-05-18T00:54:58.295423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.295423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.04804","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-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HpXTLJLPT0SIyiBF1fDTEIAjZc64rCJvJVAikZrQBxarBj4UP1MoxPOom/bRV9GOVCf1Ax1X5yiVByNmAHLkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:18:31.891717Z"},"content_sha256":"ea8d2f012cd961bbd7844724c353bfa00779cdeed5c5c23fcb863e56a9079772","schema_version":"1.0","event_id":"sha256:ea8d2f012cd961bbd7844724c353bfa00779cdeed5c5c23fcb863e56a9079772"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QJ3JNLLJ4LO3CASO3QXSMV4UBV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinearity of the number of semi-infinite branches for geometric random trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Coupier","submitted_at":"2015-01-20T13:39:11Z","abstract_excerpt":"The present paper addresses the following question: for a geometric random tree in $\\R^{2}$, how many semi-infinite branches cross the circle $\\CC_{r}$ centered at the origin and with a large radius $r$? We develop a method ensuring that the expectation of the number $\\chi_{r}$ of these semi-infinite branches is $o(r)$. The result follows from the fact that, far from the origin, the distribution of the tree is close to that of an appropriate directed forest which lacks bi-infinite paths. In order to illustrate its robustness, the method is applied to three different models: the Radial Poisson "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04804","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-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qf9+jOX71A+GdF5GsG5UrVhQIXRMUk/sIy7QGDWfO3NQzAviMmklBmN4uUPDeyuuhCTvCUBj2I5kZMWphbduCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:18:31.892062Z"},"content_sha256":"dc5fcaa7b3404ef5e483bcc2ac842092f31b7cb2dbc524b39193c8b3ef81e1a6","schema_version":"1.0","event_id":"sha256:dc5fcaa7b3404ef5e483bcc2ac842092f31b7cb2dbc524b39193c8b3ef81e1a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJ3JNLLJ4LO3CASO3QXSMV4UBV/bundle.json","state_url":"https://pith.science/pith/QJ3JNLLJ4LO3CASO3QXSMV4UBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJ3JNLLJ4LO3CASO3QXSMV4UBV/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-06-01T16:18:31Z","links":{"resolver":"https://pith.science/pith/QJ3JNLLJ4LO3CASO3QXSMV4UBV","bundle":"https://pith.science/pith/QJ3JNLLJ4LO3CASO3QXSMV4UBV/bundle.json","state":"https://pith.science/pith/QJ3JNLLJ4LO3CASO3QXSMV4UBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJ3JNLLJ4LO3CASO3QXSMV4UBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QJ3JNLLJ4LO3CASO3QXSMV4UBV","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":"14a08a1f905461b813b1059ffdbb988020270ced43560f20797bf3e05b87c485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-20T13:39:11Z","title_canon_sha256":"0ea7636c2953c509d21a3b3d451b92a58c0509a64bd184c0df4e2dc9314493c8"},"schema_version":"1.0","source":{"id":"1501.04804","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.04804","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1501.04804v3","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04804","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"QJ3JNLLJ4LO3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QJ3JNLLJ4LO3CASO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QJ3JNLLJ","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:dc5fcaa7b3404ef5e483bcc2ac842092f31b7cb2dbc524b39193c8b3ef81e1a6","target":"graph","created_at":"2026-05-18T00:54:58Z","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":"The present paper addresses the following question: for a geometric random tree in $\\R^{2}$, how many semi-infinite branches cross the circle $\\CC_{r}$ centered at the origin and with a large radius $r$? We develop a method ensuring that the expectation of the number $\\chi_{r}$ of these semi-infinite branches is $o(r)$. The result follows from the fact that, far from the origin, the distribution of the tree is close to that of an appropriate directed forest which lacks bi-infinite paths. In order to illustrate its robustness, the method is applied to three different models: the Radial Poisson ","authors_text":"David Coupier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-20T13:39:11Z","title":"Sublinearity of the number of semi-infinite branches for geometric random trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04804","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:ea8d2f012cd961bbd7844724c353bfa00779cdeed5c5c23fcb863e56a9079772","target":"record","created_at":"2026-05-18T00:54:58Z","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":"14a08a1f905461b813b1059ffdbb988020270ced43560f20797bf3e05b87c485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-20T13:39:11Z","title_canon_sha256":"0ea7636c2953c509d21a3b3d451b92a58c0509a64bd184c0df4e2dc9314493c8"},"schema_version":"1.0","source":{"id":"1501.04804","kind":"arxiv","version":3}},"canonical_sha256":"827696ad69e2ddb1024edc2f2657940d7c5450e1f4d3122ed3973f21d70896c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"827696ad69e2ddb1024edc2f2657940d7c5450e1f4d3122ed3973f21d70896c2","first_computed_at":"2026-05-18T00:54:58.295423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.295423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cu31WqWnjV+SY4x8eSYtoD51ecwX+e7RvBR7SlD5NDKmnKS1Aj8ifdMR4FQ5QPfKOoOVPg/ZoKBXcCZsfFB4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.295826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.04804","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea8d2f012cd961bbd7844724c353bfa00779cdeed5c5c23fcb863e56a9079772","sha256:dc5fcaa7b3404ef5e483bcc2ac842092f31b7cb2dbc524b39193c8b3ef81e1a6"],"state_sha256":"8ba0a8188b454303c055a259b7606ff96890056f04073b123b9a2649c445446d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qfB+t7di+4jpSyP6ygCO3vvNxbW+VhIiiKkimfLL+DgqiQlox0Ls+spprRr8b0djfApUgFSCwvs4Vg8riDwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:18:31.894040Z","bundle_sha256":"1fcc7c79dbb46a2537fd75ae2db7e76887fc1aad0f18aff4233383d343d205fc"}}