{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TYFD3YD7NL6YTCYZFOGXVFN5UQ","short_pith_number":"pith:TYFD3YD7","canonical_record":{"source":{"id":"1808.09262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-08-28T12:58:35Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"619f73bb0c41b4480bd7129c2bfc1e576193dabb5c32bd67b9aa1abdb28d400f","abstract_canon_sha256":"2384b6d83ac01404ecdd011fdd791a5ade2830e7eef649231a3cd2ae68240c60"},"schema_version":"1.0"},"canonical_sha256":"9e0a3de07f6afd898b192b8d7a95bda407fd1b8815b783e95f2cf8e4b3274bcd","source":{"kind":"arxiv","id":"1808.09262","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09262","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09262v1","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09262","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"TYFD3YD7NL6Y","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TYFD3YD7NL6YTCYZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TYFD3YD7","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TYFD3YD7NL6YTCYZFOGXVFN5UQ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-08-28T12:58:35Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"619f73bb0c41b4480bd7129c2bfc1e576193dabb5c32bd67b9aa1abdb28d400f","abstract_canon_sha256":"2384b6d83ac01404ecdd011fdd791a5ade2830e7eef649231a3cd2ae68240c60"},"schema_version":"1.0"},"canonical_sha256":"9e0a3de07f6afd898b192b8d7a95bda407fd1b8815b783e95f2cf8e4b3274bcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:01.887941Z","signature_b64":"XGK4xTC1VUnhgBy2meDr6cuLrsML2W8vRFMXWWf+6DxU3wKOeqbzqiaBlrPu7OdU4t6/NXlnjxWyJ1QqSRjPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e0a3de07f6afd898b192b8d7a95bda407fd1b8815b783e95f2cf8e4b3274bcd","last_reissued_at":"2026-05-18T00:07:01.887065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:01.887065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09262","source_version":1,"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:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLbVm33JrtlNgKcxzZ22SxQFg/IpCibNa7bai9kdCgP9Kx9ynP/n/8KPrsfxwe9vKiy+nW2PfBOLQElqtrQcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:46:24.740356Z"},"content_sha256":"63eced50bc255faf90522f9aaddaea02213f1cae5e924bd1f866f552e06cb5d8","schema_version":"1.0","event_id":"sha256:63eced50bc255faf90522f9aaddaea02213f1cae5e924bd1f866f552e06cb5d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TYFD3YD7NL6YTCYZFOGXVFN5UQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Sparse Latent Position Model for nonnegative weighted networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Riccardo Rastelli","submitted_at":"2018-08-28T12:58:35Z","abstract_excerpt":"This paper introduces a new methodology to analyse bipartite and unipartite networks with nonnegative edge values. The proposed approach combines and adapts a number of ideas from the literature on latent variable network models. The resulting framework is a new type of latent position model which exhibits great flexibility, and is able to capture important features that are generally exhibited by observed networks, such as sparsity and heavy tailed degree distributions. A crucial advantage of the proposed method is that the number of latent dimensions is automatically deduced from the data in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09262","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":""},"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:07:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JIBlWEWR1N0iCiSh+xmKpSFY8fmB0SA115u3m+GMpRB+08gGLye54I+uG7Qy28qvsQUU2PDxtA+lF85qkjVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:46:24.740717Z"},"content_sha256":"5b184904ba0e2f5ae590f0e29c07571a3f6a2e94966b62c58a36ac2f93800bd1","schema_version":"1.0","event_id":"sha256:5b184904ba0e2f5ae590f0e29c07571a3f6a2e94966b62c58a36ac2f93800bd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYFD3YD7NL6YTCYZFOGXVFN5UQ/bundle.json","state_url":"https://pith.science/pith/TYFD3YD7NL6YTCYZFOGXVFN5UQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYFD3YD7NL6YTCYZFOGXVFN5UQ/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-24T07:46:24Z","links":{"resolver":"https://pith.science/pith/TYFD3YD7NL6YTCYZFOGXVFN5UQ","bundle":"https://pith.science/pith/TYFD3YD7NL6YTCYZFOGXVFN5UQ/bundle.json","state":"https://pith.science/pith/TYFD3YD7NL6YTCYZFOGXVFN5UQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYFD3YD7NL6YTCYZFOGXVFN5UQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TYFD3YD7NL6YTCYZFOGXVFN5UQ","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":"2384b6d83ac01404ecdd011fdd791a5ade2830e7eef649231a3cd2ae68240c60","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-08-28T12:58:35Z","title_canon_sha256":"619f73bb0c41b4480bd7129c2bfc1e576193dabb5c32bd67b9aa1abdb28d400f"},"schema_version":"1.0","source":{"id":"1808.09262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09262","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09262v1","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09262","created_at":"2026-05-18T00:07:01Z"},{"alias_kind":"pith_short_12","alias_value":"TYFD3YD7NL6Y","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TYFD3YD7NL6YTCYZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TYFD3YD7","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:5b184904ba0e2f5ae590f0e29c07571a3f6a2e94966b62c58a36ac2f93800bd1","target":"graph","created_at":"2026-05-18T00:07:01Z","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":"This paper introduces a new methodology to analyse bipartite and unipartite networks with nonnegative edge values. The proposed approach combines and adapts a number of ideas from the literature on latent variable network models. The resulting framework is a new type of latent position model which exhibits great flexibility, and is able to capture important features that are generally exhibited by observed networks, such as sparsity and heavy tailed degree distributions. A crucial advantage of the proposed method is that the number of latent dimensions is automatically deduced from the data in","authors_text":"Riccardo Rastelli","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-08-28T12:58:35Z","title":"The Sparse Latent Position Model for nonnegative weighted networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09262","kind":"arxiv","version":1},"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:63eced50bc255faf90522f9aaddaea02213f1cae5e924bd1f866f552e06cb5d8","target":"record","created_at":"2026-05-18T00:07:01Z","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":"2384b6d83ac01404ecdd011fdd791a5ade2830e7eef649231a3cd2ae68240c60","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-08-28T12:58:35Z","title_canon_sha256":"619f73bb0c41b4480bd7129c2bfc1e576193dabb5c32bd67b9aa1abdb28d400f"},"schema_version":"1.0","source":{"id":"1808.09262","kind":"arxiv","version":1}},"canonical_sha256":"9e0a3de07f6afd898b192b8d7a95bda407fd1b8815b783e95f2cf8e4b3274bcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e0a3de07f6afd898b192b8d7a95bda407fd1b8815b783e95f2cf8e4b3274bcd","first_computed_at":"2026-05-18T00:07:01.887065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:01.887065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XGK4xTC1VUnhgBy2meDr6cuLrsML2W8vRFMXWWf+6DxU3wKOeqbzqiaBlrPu7OdU4t6/NXlnjxWyJ1QqSRjPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:01.887941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63eced50bc255faf90522f9aaddaea02213f1cae5e924bd1f866f552e06cb5d8","sha256:5b184904ba0e2f5ae590f0e29c07571a3f6a2e94966b62c58a36ac2f93800bd1"],"state_sha256":"9b090bc7d975f32fbb8d82db6811c78f0ad38b58e99a56cfc1b11c333d063d76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhxfS3c7a4Hkv5AmuC5xHAZH1h2JpxOwXatLrg9S42Mvuy4ktRiDQPMqARCRx/qnMg+LEV5XpgRHk2R8owWNBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:46:24.742536Z","bundle_sha256":"08e8f56d351a7fed9f93a79797fca16293f1bc6d02013e3499d0e59c208e669e"}}