{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:M75DJOUH3A32ODKFBUAP2UZ2LY","short_pith_number":"pith:M75DJOUH","schema_version":"1.0","canonical_sha256":"67fa34ba87d837a70d450d00fd533a5e086d2359019a8ce2d99b9197e0d8650d","source":{"kind":"arxiv","id":"1004.0977","version":2},"attestation_state":"computed","paper":{"title":"Entropy and Hausdorff Dimension in Random Growing Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anna Rudas, Imre P\\'eter T\\'oth","submitted_at":"2010-04-06T21:38:30Z","abstract_excerpt":"We investigate the limiting behavior of random tree growth in preferential attachment models. The tree stems from a root, and we add vertices to the system one-by-one at random, according to a rule which depends on the degree distribution of the already existing tree. The so-called weight function, in terms of which the rule of attachment is formulated, is such that each vertex in the tree can have at most K children. We define the concept of a certain random measure mu on the leaves of the limiting tree, which captures a global property of the tree growth in a natural way. We prove that the H"},"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":"1004.0977","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-06T21:38:30Z","cross_cats_sorted":[],"title_canon_sha256":"998404c155f41e9d483a7fa0c7c13d81c1e73b9f71bbf513560187544a5d5864","abstract_canon_sha256":"17a02104e6e7a92f1d91b43bbd114c18480b39b9c3e7baebc1788899f2291644"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:07.289928Z","signature_b64":"YSe+2hsDtD1ytxlBNcgOIeo7X2dkKnmu3OTrf9yV3eLX6YyMObz5QqsrUm0xizWxH8yLSLBkTWJx0oyvzs6MBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67fa34ba87d837a70d450d00fd533a5e086d2359019a8ce2d99b9197e0d8650d","last_reissued_at":"2026-05-18T03:53:07.289340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:07.289340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropy and Hausdorff Dimension in Random Growing Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Anna Rudas, Imre P\\'eter T\\'oth","submitted_at":"2010-04-06T21:38:30Z","abstract_excerpt":"We investigate the limiting behavior of random tree growth in preferential attachment models. The tree stems from a root, and we add vertices to the system one-by-one at random, according to a rule which depends on the degree distribution of the already existing tree. The so-called weight function, in terms of which the rule of attachment is formulated, is such that each vertex in the tree can have at most K children. We define the concept of a certain random measure mu on the leaves of the limiting tree, which captures a global property of the tree growth in a natural way. We prove that the H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0977","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1004.0977","created_at":"2026-05-18T03:53:07.289416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.0977v2","created_at":"2026-05-18T03:53:07.289416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0977","created_at":"2026-05-18T03:53:07.289416+00:00"},{"alias_kind":"pith_short_12","alias_value":"M75DJOUH3A32","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"M75DJOUH3A32ODKF","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"M75DJOUH","created_at":"2026-05-18T12:26:10.704358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M75DJOUH3A32ODKFBUAP2UZ2LY","json":"https://pith.science/pith/M75DJOUH3A32ODKFBUAP2UZ2LY.json","graph_json":"https://pith.science/api/pith-number/M75DJOUH3A32ODKFBUAP2UZ2LY/graph.json","events_json":"https://pith.science/api/pith-number/M75DJOUH3A32ODKFBUAP2UZ2LY/events.json","paper":"https://pith.science/paper/M75DJOUH"},"agent_actions":{"view_html":"https://pith.science/pith/M75DJOUH3A32ODKFBUAP2UZ2LY","download_json":"https://pith.science/pith/M75DJOUH3A32ODKFBUAP2UZ2LY.json","view_paper":"https://pith.science/paper/M75DJOUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.0977&json=true","fetch_graph":"https://pith.science/api/pith-number/M75DJOUH3A32ODKFBUAP2UZ2LY/graph.json","fetch_events":"https://pith.science/api/pith-number/M75DJOUH3A32ODKFBUAP2UZ2LY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M75DJOUH3A32ODKFBUAP2UZ2LY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M75DJOUH3A32ODKFBUAP2UZ2LY/action/storage_attestation","attest_author":"https://pith.science/pith/M75DJOUH3A32ODKFBUAP2UZ2LY/action/author_attestation","sign_citation":"https://pith.science/pith/M75DJOUH3A32ODKFBUAP2UZ2LY/action/citation_signature","submit_replication":"https://pith.science/pith/M75DJOUH3A32ODKFBUAP2UZ2LY/action/replication_record"}},"created_at":"2026-05-18T03:53:07.289416+00:00","updated_at":"2026-05-18T03:53:07.289416+00:00"}