{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:E5XL62L2YD3JCYB4ZRJ6X4OAXZ","short_pith_number":"pith:E5XL62L2","schema_version":"1.0","canonical_sha256":"276ebf697ac0f691603ccc53ebf1c0be404be2d9b95589b499b2cfab1719b783","source":{"kind":"arxiv","id":"2501.13044","version":1},"attestation_state":"computed","paper":{"title":"Uniform temporal trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Caelan Atamanchuk, Gabor Lugosi, Luc Devroye","submitted_at":"2025-01-22T17:51:26Z","abstract_excerpt":"Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \\emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a rooted complete infinite $n$-ary tree and keeping only those vertices for which the path from the root to the vertex has decreasing edge labels.\n  The $p$-percolated uniform temporal tree, denoted by $\\mathcal{T}_{n,p}$, is obtained similarly, with the additional constraint that the edge labels on each path are all below $p$. We study several properties of these "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.13044","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2025-01-22T17:51:26Z","cross_cats_sorted":[],"title_canon_sha256":"12c4f78ce9259a7c65c8e0e62405df5f2e25ce3e86d0904d8ebbfda45eae662e","abstract_canon_sha256":"8e77b680f4308d241c63fec5c766d050ec4a8daff65430840742fc7d8d0f39a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:02.026031Z","signature_b64":"uOz+c6tmTKS/w0AtlW0Yu4s+1a/XlEsuZBmOg5r8ifeQLmnbSMJzb4tayuInCvvXf9XZHaZvudbN8gozu5e9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276ebf697ac0f691603ccc53ebf1c0be404be2d9b95589b499b2cfab1719b783","last_reissued_at":"2026-07-05T10:04:02.025561Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:02.025561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform temporal trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Caelan Atamanchuk, Gabor Lugosi, Luc Devroye","submitted_at":"2025-01-22T17:51:26Z","abstract_excerpt":"Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \\emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a rooted complete infinite $n$-ary tree and keeping only those vertices for which the path from the root to the vertex has decreasing edge labels.\n  The $p$-percolated uniform temporal tree, denoted by $\\mathcal{T}_{n,p}$, is obtained similarly, with the additional constraint that the edge labels on each path are all below $p$. We study several properties of these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13044","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/2501.13044/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.13044","created_at":"2026-07-05T10:04:02.025617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.13044v1","created_at":"2026-07-05T10:04:02.025617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13044","created_at":"2026-07-05T10:04:02.025617+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5XL62L2YD3J","created_at":"2026-07-05T10:04:02.025617+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5XL62L2YD3JCYB4","created_at":"2026-07-05T10:04:02.025617+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5XL62L2","created_at":"2026-07-05T10:04:02.025617+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E5XL62L2YD3JCYB4ZRJ6X4OAXZ","json":"https://pith.science/pith/E5XL62L2YD3JCYB4ZRJ6X4OAXZ.json","graph_json":"https://pith.science/api/pith-number/E5XL62L2YD3JCYB4ZRJ6X4OAXZ/graph.json","events_json":"https://pith.science/api/pith-number/E5XL62L2YD3JCYB4ZRJ6X4OAXZ/events.json","paper":"https://pith.science/paper/E5XL62L2"},"agent_actions":{"view_html":"https://pith.science/pith/E5XL62L2YD3JCYB4ZRJ6X4OAXZ","download_json":"https://pith.science/pith/E5XL62L2YD3JCYB4ZRJ6X4OAXZ.json","view_paper":"https://pith.science/paper/E5XL62L2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.13044&json=true","fetch_graph":"https://pith.science/api/pith-number/E5XL62L2YD3JCYB4ZRJ6X4OAXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/E5XL62L2YD3JCYB4ZRJ6X4OAXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5XL62L2YD3JCYB4ZRJ6X4OAXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5XL62L2YD3JCYB4ZRJ6X4OAXZ/action/storage_attestation","attest_author":"https://pith.science/pith/E5XL62L2YD3JCYB4ZRJ6X4OAXZ/action/author_attestation","sign_citation":"https://pith.science/pith/E5XL62L2YD3JCYB4ZRJ6X4OAXZ/action/citation_signature","submit_replication":"https://pith.science/pith/E5XL62L2YD3JCYB4ZRJ6X4OAXZ/action/replication_record"}},"created_at":"2026-07-05T10:04:02.025617+00:00","updated_at":"2026-07-05T10:04:02.025617+00:00"}