{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7VSIBRNOF742Y65SMPEQJWKUTT","short_pith_number":"pith:7VSIBRNO","canonical_record":{"source":{"id":"1704.03256","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T12:02:56Z","cross_cats_sorted":[],"title_canon_sha256":"4992626183dc03ec07b3bc64336679c3a3fba466855bd7773cf461380c7a5ee2","abstract_canon_sha256":"6a92dd6d229a6adb9a5fa5ee8f12d063ea3422a9a154ca3a28c7dce487b2a371"},"schema_version":"1.0"},"canonical_sha256":"fd6480c5ae2ff9ac7bb263c904d9549cc0bdf57d130934dcafc88089d1dc50f4","source":{"kind":"arxiv","id":"1704.03256","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03256","created_at":"2026-05-18T00:06:42Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03256v4","created_at":"2026-05-18T00:06:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03256","created_at":"2026-05-18T00:06:42Z"},{"alias_kind":"pith_short_12","alias_value":"7VSIBRNOF742","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7VSIBRNOF742Y65S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7VSIBRNO","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7VSIBRNOF742Y65SMPEQJWKUTT","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03256","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T12:02:56Z","cross_cats_sorted":[],"title_canon_sha256":"4992626183dc03ec07b3bc64336679c3a3fba466855bd7773cf461380c7a5ee2","abstract_canon_sha256":"6a92dd6d229a6adb9a5fa5ee8f12d063ea3422a9a154ca3a28c7dce487b2a371"},"schema_version":"1.0"},"canonical_sha256":"fd6480c5ae2ff9ac7bb263c904d9549cc0bdf57d130934dcafc88089d1dc50f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:42.018025Z","signature_b64":"4p95/37yWHJ9IPEnPFE5hGf/UpN3ov0qgZuNVaWWFQqgTieQcmvPm7cxn3eWdYSO28lf/znSt6ajpOjrrwqqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd6480c5ae2ff9ac7bb263c904d9549cc0bdf57d130934dcafc88089d1dc50f4","last_reissued_at":"2026-05-18T00:06:42.017442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:42.017442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03256","source_version":4,"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:06:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHjeDfnCM09VlXW4ia+DjxuYs8nrIRzX29BRCBNSzgq752ZHETnWVdCzZNJNil+kUcIbaa6EUOD7MS+vNBqSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:56:53.931339Z"},"content_sha256":"477142ce5591a9b0da8e07f30e8a23742ac8221d129b949741cf484dcfa1f7f6","schema_version":"1.0","event_id":"sha256:477142ce5591a9b0da8e07f30e8a23742ac8221d129b949741cf484dcfa1f7f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7VSIBRNOF742Y65SMPEQJWKUTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multi-type Preferential Attachment Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sebastian Rosengren","submitted_at":"2017-04-11T12:02:56Z","abstract_excerpt":"A multi-type preferential attachment tree is introduced, and studied using general multi-type branching processes. For the $p$-type case we derive a framework for studying the tree where a type $i$ vertex generates new type $j$ vertices with rate $w_{ij}(n_1,n_2,\\ldots, n_p)$ where $n_k$ is the number of type $k$ vertices previously generated by the type $i$ vertex, and $w_{ij}$ is a non-negative function from $\\mathbb{N}^p$ to $\\mathbb{R}$. The framework is then used to derive results for trees with more specific attachment rates.\n  In the case with linear preferential attachment---where type"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03256","kind":"arxiv","version":4},"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:06:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6n+ru04b5sBvH9pvL+uthhNhtDRa1hla0JiHom+EE3W4G+LaxBi8Y/UjMOifoKkco/P+6SZ60DYdiNZIGTryAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:56:53.931689Z"},"content_sha256":"c87933f1c47f5baf8f37285bc771b759de9fc53696eef9fbb2dd0dee0aa5fed2","schema_version":"1.0","event_id":"sha256:c87933f1c47f5baf8f37285bc771b759de9fc53696eef9fbb2dd0dee0aa5fed2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VSIBRNOF742Y65SMPEQJWKUTT/bundle.json","state_url":"https://pith.science/pith/7VSIBRNOF742Y65SMPEQJWKUTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VSIBRNOF742Y65SMPEQJWKUTT/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-26T10:56:53Z","links":{"resolver":"https://pith.science/pith/7VSIBRNOF742Y65SMPEQJWKUTT","bundle":"https://pith.science/pith/7VSIBRNOF742Y65SMPEQJWKUTT/bundle.json","state":"https://pith.science/pith/7VSIBRNOF742Y65SMPEQJWKUTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VSIBRNOF742Y65SMPEQJWKUTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7VSIBRNOF742Y65SMPEQJWKUTT","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":"6a92dd6d229a6adb9a5fa5ee8f12d063ea3422a9a154ca3a28c7dce487b2a371","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T12:02:56Z","title_canon_sha256":"4992626183dc03ec07b3bc64336679c3a3fba466855bd7773cf461380c7a5ee2"},"schema_version":"1.0","source":{"id":"1704.03256","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03256","created_at":"2026-05-18T00:06:42Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03256v4","created_at":"2026-05-18T00:06:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03256","created_at":"2026-05-18T00:06:42Z"},{"alias_kind":"pith_short_12","alias_value":"7VSIBRNOF742","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7VSIBRNOF742Y65S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7VSIBRNO","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:c87933f1c47f5baf8f37285bc771b759de9fc53696eef9fbb2dd0dee0aa5fed2","target":"graph","created_at":"2026-05-18T00:06:42Z","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":"A multi-type preferential attachment tree is introduced, and studied using general multi-type branching processes. For the $p$-type case we derive a framework for studying the tree where a type $i$ vertex generates new type $j$ vertices with rate $w_{ij}(n_1,n_2,\\ldots, n_p)$ where $n_k$ is the number of type $k$ vertices previously generated by the type $i$ vertex, and $w_{ij}$ is a non-negative function from $\\mathbb{N}^p$ to $\\mathbb{R}$. The framework is then used to derive results for trees with more specific attachment rates.\n  In the case with linear preferential attachment---where type","authors_text":"Sebastian Rosengren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T12:02:56Z","title":"A Multi-type Preferential Attachment Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03256","kind":"arxiv","version":4},"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:477142ce5591a9b0da8e07f30e8a23742ac8221d129b949741cf484dcfa1f7f6","target":"record","created_at":"2026-05-18T00:06:42Z","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":"6a92dd6d229a6adb9a5fa5ee8f12d063ea3422a9a154ca3a28c7dce487b2a371","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T12:02:56Z","title_canon_sha256":"4992626183dc03ec07b3bc64336679c3a3fba466855bd7773cf461380c7a5ee2"},"schema_version":"1.0","source":{"id":"1704.03256","kind":"arxiv","version":4}},"canonical_sha256":"fd6480c5ae2ff9ac7bb263c904d9549cc0bdf57d130934dcafc88089d1dc50f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd6480c5ae2ff9ac7bb263c904d9549cc0bdf57d130934dcafc88089d1dc50f4","first_computed_at":"2026-05-18T00:06:42.017442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:42.017442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4p95/37yWHJ9IPEnPFE5hGf/UpN3ov0qgZuNVaWWFQqgTieQcmvPm7cxn3eWdYSO28lf/znSt6ajpOjrrwqqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:42.018025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03256","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:477142ce5591a9b0da8e07f30e8a23742ac8221d129b949741cf484dcfa1f7f6","sha256:c87933f1c47f5baf8f37285bc771b759de9fc53696eef9fbb2dd0dee0aa5fed2"],"state_sha256":"78f4e39d4e63ce237632240cc02ca291c70c30e102e2d1b854b56c9494b78f38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDRSi4zU//GvLCNdmz9q2puUPZhP4RaUSzvBk/hdbrvItPpyOX4DWAsZFQP1Jb1oKjLZ0SLZ5vizU0wa3AbQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:56:53.933739Z","bundle_sha256":"35e505acee5866fc94f736a46cf0320fda6a75c9450ca7245069300a4d16b996"}}