{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YW54GGMELAYOFG7C7QY2DCRY7I","short_pith_number":"pith:YW54GGME","canonical_record":{"source":{"id":"1311.1033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-05T12:39:04Z","cross_cats_sorted":[],"title_canon_sha256":"7575f83b6259652022d33ae37a144d4626f8e8c0392670d0534a25f2ccbbd875","abstract_canon_sha256":"7c6bc82581e4726555cedc7030e79c42778bcc98378eded1807108900869818f"},"schema_version":"1.0"},"canonical_sha256":"c5bbc319845830e29be2fc31a18a38fa17e212e9fecf75085916b85ab9270fff","source":{"kind":"arxiv","id":"1311.1033","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1033","created_at":"2026-05-18T03:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1033v2","created_at":"2026-05-18T03:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1033","created_at":"2026-05-18T03:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"YW54GGMELAYO","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YW54GGMELAYOFG7C","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YW54GGME","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YW54GGMELAYOFG7C7QY2DCRY7I","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-05T12:39:04Z","cross_cats_sorted":[],"title_canon_sha256":"7575f83b6259652022d33ae37a144d4626f8e8c0392670d0534a25f2ccbbd875","abstract_canon_sha256":"7c6bc82581e4726555cedc7030e79c42778bcc98378eded1807108900869818f"},"schema_version":"1.0"},"canonical_sha256":"c5bbc319845830e29be2fc31a18a38fa17e212e9fecf75085916b85ab9270fff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:34.013825Z","signature_b64":"HcF4CCxaCV4AXjuVCKpLdXvPAidoVvsVOZwHqIGBSddfQ2CVlPIH1as+ACnpcc282LkJo7vlbc0GZHWUmKKvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5bbc319845830e29be2fc31a18a38fa17e212e9fecf75085916b85ab9270fff","last_reissued_at":"2026-05-18T03:06:34.013330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:34.013330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1033","source_version":2,"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-18T03:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Xjh83mH4YpLCxxuQy8GPcd7csE91jM5BjJCqqHL/wxELFk11na0W5FCYyf7BoCJKNKcq+23wOPx8h+l6F4gAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:47:23.584349Z"},"content_sha256":"7a219d040cc804dedb5d28da150aafec40a7d087b6b1d5076689c88da58d58e9","schema_version":"1.0","event_id":"sha256:7a219d040cc804dedb5d28da150aafec40a7d087b6b1d5076689c88da58d58e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YW54GGMELAYOFG7C7QY2DCRY7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonparametric Bayesian models of hierarchical structure in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Mikkel N. Schmidt, Morten M{\\o}rup, Tue Herlau","submitted_at":"2013-11-05T12:39:04Z","abstract_excerpt":"Analyzing and understanding the structure of complex relational data is important in many applications including analysis of the connectivity in the human brain. Such networks can have prominent patterns on different scales, calling for a hierarchically structured model. We propose two non-parametric Bayesian hierarchical network models based on Gibbs fragmentation tree priors, and demonstrate their ability to capture nested patterns in simulated networks. On real networks we demonstrate detection of hierarchical structure and show predictive performance on par with the state of the art. We en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1033","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"},"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-18T03:06:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqddTFT7WgOuw0n6BU3b5fQKFHk/YNyNupis8kOPUr/+htO3YLxeJgqj5yy61jhc/og0ld4ppxaClOjr7HjrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T02:47:23.585071Z"},"content_sha256":"0aa0e5fcc077d5a0f8c8af75000895a9046320c328b4e887f95124a5724497b4","schema_version":"1.0","event_id":"sha256:0aa0e5fcc077d5a0f8c8af75000895a9046320c328b4e887f95124a5724497b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YW54GGMELAYOFG7C7QY2DCRY7I/bundle.json","state_url":"https://pith.science/pith/YW54GGMELAYOFG7C7QY2DCRY7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YW54GGMELAYOFG7C7QY2DCRY7I/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-25T02:47:23Z","links":{"resolver":"https://pith.science/pith/YW54GGMELAYOFG7C7QY2DCRY7I","bundle":"https://pith.science/pith/YW54GGMELAYOFG7C7QY2DCRY7I/bundle.json","state":"https://pith.science/pith/YW54GGMELAYOFG7C7QY2DCRY7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YW54GGMELAYOFG7C7QY2DCRY7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YW54GGMELAYOFG7C7QY2DCRY7I","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":"7c6bc82581e4726555cedc7030e79c42778bcc98378eded1807108900869818f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-05T12:39:04Z","title_canon_sha256":"7575f83b6259652022d33ae37a144d4626f8e8c0392670d0534a25f2ccbbd875"},"schema_version":"1.0","source":{"id":"1311.1033","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1033","created_at":"2026-05-18T03:06:34Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1033v2","created_at":"2026-05-18T03:06:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1033","created_at":"2026-05-18T03:06:34Z"},{"alias_kind":"pith_short_12","alias_value":"YW54GGMELAYO","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YW54GGMELAYOFG7C","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YW54GGME","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:0aa0e5fcc077d5a0f8c8af75000895a9046320c328b4e887f95124a5724497b4","target":"graph","created_at":"2026-05-18T03:06:34Z","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":"Analyzing and understanding the structure of complex relational data is important in many applications including analysis of the connectivity in the human brain. Such networks can have prominent patterns on different scales, calling for a hierarchically structured model. We propose two non-parametric Bayesian hierarchical network models based on Gibbs fragmentation tree priors, and demonstrate their ability to capture nested patterns in simulated networks. On real networks we demonstrate detection of hierarchical structure and show predictive performance on par with the state of the art. We en","authors_text":"Mikkel N. Schmidt, Morten M{\\o}rup, Tue Herlau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-05T12:39:04Z","title":"Nonparametric Bayesian models of hierarchical structure in complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1033","kind":"arxiv","version":2},"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:7a219d040cc804dedb5d28da150aafec40a7d087b6b1d5076689c88da58d58e9","target":"record","created_at":"2026-05-18T03:06:34Z","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":"7c6bc82581e4726555cedc7030e79c42778bcc98378eded1807108900869818f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-05T12:39:04Z","title_canon_sha256":"7575f83b6259652022d33ae37a144d4626f8e8c0392670d0534a25f2ccbbd875"},"schema_version":"1.0","source":{"id":"1311.1033","kind":"arxiv","version":2}},"canonical_sha256":"c5bbc319845830e29be2fc31a18a38fa17e212e9fecf75085916b85ab9270fff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5bbc319845830e29be2fc31a18a38fa17e212e9fecf75085916b85ab9270fff","first_computed_at":"2026-05-18T03:06:34.013330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:34.013330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HcF4CCxaCV4AXjuVCKpLdXvPAidoVvsVOZwHqIGBSddfQ2CVlPIH1as+ACnpcc282LkJo7vlbc0GZHWUmKKvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:34.013825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1033","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a219d040cc804dedb5d28da150aafec40a7d087b6b1d5076689c88da58d58e9","sha256:0aa0e5fcc077d5a0f8c8af75000895a9046320c328b4e887f95124a5724497b4"],"state_sha256":"b0046adac97f4b40f199db512fab2e7059d5ba7ae1ede66192f03983e3f28ecd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3sNwWXPYhIMP6gUGbdYLrNypPECWCUS0SmWNLP/vBK7bY6wtZMui+WuD/ZVbJfQdI1KjhYRn5trI8cL/b9oCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T02:47:23.589009Z","bundle_sha256":"31fefef9bdfccd0a99bd6f554ae9752cea7ade64220d2de2413e4ae0c41cacc5"}}