{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HUP5DNQ37IQSVRWXRU2EO55NWF","short_pith_number":"pith:HUP5DNQ3","canonical_record":{"source":{"id":"1612.01265","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-05T07:57:16Z","cross_cats_sorted":[],"title_canon_sha256":"e1f0014c824824f78240dab1824714c8f023f28ef9a48f9ab02a86cb88624318","abstract_canon_sha256":"b88cf72bdc31f5cc4569a67440bc18c4323810b8ac6c1f2034173e50ff3f4a81"},"schema_version":"1.0"},"canonical_sha256":"3d1fd1b61bfa212ac6d78d344777adb16b5499f433a43276adcd0eb098772d4a","source":{"kind":"arxiv","id":"1612.01265","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01265","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01265v5","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01265","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"pith_short_12","alias_value":"HUP5DNQ37IQS","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HUP5DNQ37IQSVRWX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HUP5DNQ3","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HUP5DNQ37IQSVRWXRU2EO55NWF","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01265","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-05T07:57:16Z","cross_cats_sorted":[],"title_canon_sha256":"e1f0014c824824f78240dab1824714c8f023f28ef9a48f9ab02a86cb88624318","abstract_canon_sha256":"b88cf72bdc31f5cc4569a67440bc18c4323810b8ac6c1f2034173e50ff3f4a81"},"schema_version":"1.0"},"canonical_sha256":"3d1fd1b61bfa212ac6d78d344777adb16b5499f433a43276adcd0eb098772d4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:12.196102Z","signature_b64":"ZKfcqACoWLSb4VTTGlbFi2Xx24Qti2bMgwb9KEUYPVK5346dADYtK4I4RW9eJoF9ttZJrEz/xeFSNY48XTj9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d1fd1b61bfa212ac6d78d344777adb16b5499f433a43276adcd0eb098772d4a","last_reissued_at":"2026-05-17T23:49:12.195442Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:12.195442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01265","source_version":5,"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-17T23:49:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBeo3Gzd/xA+xW/QYJYryJkYMubrDKF12J0b7pg3EQYLYmJytGBU9bcaxIYoI6sjISyBAp7udRMa0oPwCaGXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:21:32.132773Z"},"content_sha256":"a5922fb7f6cc1bd74070c5a0d75342468eebe54dd3d3ee9cda5355fcbed1ffdb","schema_version":"1.0","event_id":"sha256:a5922fb7f6cc1bd74070c5a0d75342468eebe54dd3d3ee9cda5355fcbed1ffdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HUP5DNQ37IQSVRWXRU2EO55NWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Branching trees I: Concatenation and infinite divisibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andreas Greven, Patrick Gloede, Thomas Rippl","submitted_at":"2016-12-05T07:57:16Z","abstract_excerpt":"The goal of this work is to decompose random populations with a genealogy in subfamilies of a given degree of kinship and to obtain a notion of infinitely divisible genealogies. We model the genealogical structure of a population by (equivalence classes of) ultrametric measure spaces (um-spaces) as elements of the Polish space U which we recall. In order to then analyze the family structure in this coding we introduce an algebraic structure on um-spaces (a consistent collection of semigroups). This allows us to obtain a path of collections of subfamilies of fixed kinship h (described as ultram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01265","kind":"arxiv","version":5},"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-17T23:49:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6imAb2eT8fr9KbjC/fNt/SvJ4O2bWMHjC96ql4XoXo8bC4PG70zBKHk3R47sHdFcYGC4jYwgN9HIc+vNCNKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:21:32.133118Z"},"content_sha256":"5e0177bf7f8bb1e1615ca64433f8feb259508b4fcedc9f4669bf4c040feadeaa","schema_version":"1.0","event_id":"sha256:5e0177bf7f8bb1e1615ca64433f8feb259508b4fcedc9f4669bf4c040feadeaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUP5DNQ37IQSVRWXRU2EO55NWF/bundle.json","state_url":"https://pith.science/pith/HUP5DNQ37IQSVRWXRU2EO55NWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUP5DNQ37IQSVRWXRU2EO55NWF/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-05-30T20:21:32Z","links":{"resolver":"https://pith.science/pith/HUP5DNQ37IQSVRWXRU2EO55NWF","bundle":"https://pith.science/pith/HUP5DNQ37IQSVRWXRU2EO55NWF/bundle.json","state":"https://pith.science/pith/HUP5DNQ37IQSVRWXRU2EO55NWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUP5DNQ37IQSVRWXRU2EO55NWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HUP5DNQ37IQSVRWXRU2EO55NWF","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":"b88cf72bdc31f5cc4569a67440bc18c4323810b8ac6c1f2034173e50ff3f4a81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-05T07:57:16Z","title_canon_sha256":"e1f0014c824824f78240dab1824714c8f023f28ef9a48f9ab02a86cb88624318"},"schema_version":"1.0","source":{"id":"1612.01265","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01265","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01265v5","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01265","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"pith_short_12","alias_value":"HUP5DNQ37IQS","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HUP5DNQ37IQSVRWX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HUP5DNQ3","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:5e0177bf7f8bb1e1615ca64433f8feb259508b4fcedc9f4669bf4c040feadeaa","target":"graph","created_at":"2026-05-17T23:49:12Z","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 goal of this work is to decompose random populations with a genealogy in subfamilies of a given degree of kinship and to obtain a notion of infinitely divisible genealogies. We model the genealogical structure of a population by (equivalence classes of) ultrametric measure spaces (um-spaces) as elements of the Polish space U which we recall. In order to then analyze the family structure in this coding we introduce an algebraic structure on um-spaces (a consistent collection of semigroups). This allows us to obtain a path of collections of subfamilies of fixed kinship h (described as ultram","authors_text":"Andreas Greven, Patrick Gloede, Thomas Rippl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-05T07:57:16Z","title":"Branching trees I: Concatenation and infinite divisibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01265","kind":"arxiv","version":5},"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:a5922fb7f6cc1bd74070c5a0d75342468eebe54dd3d3ee9cda5355fcbed1ffdb","target":"record","created_at":"2026-05-17T23:49:12Z","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":"b88cf72bdc31f5cc4569a67440bc18c4323810b8ac6c1f2034173e50ff3f4a81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-05T07:57:16Z","title_canon_sha256":"e1f0014c824824f78240dab1824714c8f023f28ef9a48f9ab02a86cb88624318"},"schema_version":"1.0","source":{"id":"1612.01265","kind":"arxiv","version":5}},"canonical_sha256":"3d1fd1b61bfa212ac6d78d344777adb16b5499f433a43276adcd0eb098772d4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d1fd1b61bfa212ac6d78d344777adb16b5499f433a43276adcd0eb098772d4a","first_computed_at":"2026-05-17T23:49:12.195442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:12.195442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKfcqACoWLSb4VTTGlbFi2Xx24Qti2bMgwb9KEUYPVK5346dADYtK4I4RW9eJoF9ttZJrEz/xeFSNY48XTj9BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:12.196102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01265","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5922fb7f6cc1bd74070c5a0d75342468eebe54dd3d3ee9cda5355fcbed1ffdb","sha256:5e0177bf7f8bb1e1615ca64433f8feb259508b4fcedc9f4669bf4c040feadeaa"],"state_sha256":"83e13764627daffbf731e3f99aa6b16255df0ee010dea7a874b84b6d7fd03d09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZ7jq4Po27+zvwX/Lb0thhpMB4HSC2uvdGozgileoZDSiYXym884gzvwa/O0NmhjHwow65oZIhRmZXXy+tlaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:21:32.135099Z","bundle_sha256":"7e3bb5840c93428f4216f1e2bd6b18b4aa066a00f23ff2610f8dff6108fcdda4"}}