{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LOLNYW2N5ZKPIE2CJFSTSC2QEE","short_pith_number":"pith:LOLNYW2N","canonical_record":{"source":{"id":"1010.1437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-10-07T14:16:38Z","cross_cats_sorted":["cs.AI","cs.SI","stat.AP","stat.ME"],"title_canon_sha256":"6adaf2eaa7141fd9ed041146d56562f0237873a4df9b54e89ce0b41a8bf1c724","abstract_canon_sha256":"36bd835d3f2d357d242a599d1b685ea03cccca86ab70cf8a1d85f22952597867"},"schema_version":"1.0"},"canonical_sha256":"5b96dc5b4dee54f413424965390b5021300dae621284a8f1a35fe6bd36e1c03b","source":{"kind":"arxiv","id":"1010.1437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1437","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1437v1","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1437","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"LOLNYW2N5ZKP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LOLNYW2N5ZKPIE2C","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LOLNYW2N","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LOLNYW2N5ZKPIE2CJFSTSC2QEE","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-10-07T14:16:38Z","cross_cats_sorted":["cs.AI","cs.SI","stat.AP","stat.ME"],"title_canon_sha256":"6adaf2eaa7141fd9ed041146d56562f0237873a4df9b54e89ce0b41a8bf1c724","abstract_canon_sha256":"36bd835d3f2d357d242a599d1b685ea03cccca86ab70cf8a1d85f22952597867"},"schema_version":"1.0"},"canonical_sha256":"5b96dc5b4dee54f413424965390b5021300dae621284a8f1a35fe6bd36e1c03b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:41.117721Z","signature_b64":"Q8ctFHRy87y7fhN6MKBvSg075IMHH1VY7CJWhGNL7LMUoJMJjXkXyYQbRyIfJOxx82XzPnf9tcPf1bA0DGd8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b96dc5b4dee54f413424965390b5021300dae621284a8f1a35fe6bd36e1c03b","last_reissued_at":"2026-05-18T04:39:41.117202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:41.117202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1437","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-18T04:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXsmQrpZwGN+ta8JSZPiAKDHZcr0SfvlNyUxwtqpXKwQI/PVqwdNga+zKBc9b5hr+zOSQYnUQdIoATnrt5ZeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:01:52.850651Z"},"content_sha256":"bf36d9d7c1aaed53223aa62724c8ffd714cdf2e4c498def35ccdc8a3171d1d2b","schema_version":"1.0","event_id":"sha256:bf36d9d7c1aaed53223aa62724c8ffd714cdf2e4c498def35ccdc8a3171d1d2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LOLNYW2N5ZKPIE2CJFSTSC2QEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixed-Membership Stochastic Block-Models for Transactional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI","stat.AP","stat.ME"],"primary_cat":"stat.ML","authors_text":"Hugh Chipman, Mahdi Shafiei","submitted_at":"2010-10-07T14:16:38Z","abstract_excerpt":"Transactional network data can be thought of as a list of one-to-many communications(e.g., email) between nodes in a social network. Most social network models convert this type of data into binary relations between pairs of nodes. We develop a latent mixed membership model capable of modeling richer forms of transactional network data, including relations between more than two nodes. The model can cluster nodes and predict transactions. The block-model nature of the model implies that groups can be characterized in very general ways. This flexible notion of group structure enables discovery o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1437","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-18T04:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmyfWw5vfVcNn5S7pP75nNkOXaVWuo79607uz9d80ICCgCiYed4NFYpvhP9cjVUOD1EQon/gJhS5Knq6jy4qAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:01:52.851375Z"},"content_sha256":"a096a31900f30ff7fe2c4b779583f87545ba2a1cd5b10c5b00336cf10e9e8be2","schema_version":"1.0","event_id":"sha256:a096a31900f30ff7fe2c4b779583f87545ba2a1cd5b10c5b00336cf10e9e8be2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/bundle.json","state_url":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/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-09T12:01:52Z","links":{"resolver":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE","bundle":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/bundle.json","state":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LOLNYW2N5ZKPIE2CJFSTSC2QEE","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":"36bd835d3f2d357d242a599d1b685ea03cccca86ab70cf8a1d85f22952597867","cross_cats_sorted":["cs.AI","cs.SI","stat.AP","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-10-07T14:16:38Z","title_canon_sha256":"6adaf2eaa7141fd9ed041146d56562f0237873a4df9b54e89ce0b41a8bf1c724"},"schema_version":"1.0","source":{"id":"1010.1437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1437","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1437v1","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1437","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"LOLNYW2N5ZKP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LOLNYW2N5ZKPIE2C","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LOLNYW2N","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:a096a31900f30ff7fe2c4b779583f87545ba2a1cd5b10c5b00336cf10e9e8be2","target":"graph","created_at":"2026-05-18T04:39:41Z","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":"Transactional network data can be thought of as a list of one-to-many communications(e.g., email) between nodes in a social network. Most social network models convert this type of data into binary relations between pairs of nodes. We develop a latent mixed membership model capable of modeling richer forms of transactional network data, including relations between more than two nodes. The model can cluster nodes and predict transactions. The block-model nature of the model implies that groups can be characterized in very general ways. This flexible notion of group structure enables discovery o","authors_text":"Hugh Chipman, Mahdi Shafiei","cross_cats":["cs.AI","cs.SI","stat.AP","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-10-07T14:16:38Z","title":"Mixed-Membership Stochastic Block-Models for Transactional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1437","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:bf36d9d7c1aaed53223aa62724c8ffd714cdf2e4c498def35ccdc8a3171d1d2b","target":"record","created_at":"2026-05-18T04:39:41Z","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":"36bd835d3f2d357d242a599d1b685ea03cccca86ab70cf8a1d85f22952597867","cross_cats_sorted":["cs.AI","cs.SI","stat.AP","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-10-07T14:16:38Z","title_canon_sha256":"6adaf2eaa7141fd9ed041146d56562f0237873a4df9b54e89ce0b41a8bf1c724"},"schema_version":"1.0","source":{"id":"1010.1437","kind":"arxiv","version":1}},"canonical_sha256":"5b96dc5b4dee54f413424965390b5021300dae621284a8f1a35fe6bd36e1c03b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b96dc5b4dee54f413424965390b5021300dae621284a8f1a35fe6bd36e1c03b","first_computed_at":"2026-05-18T04:39:41.117202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:41.117202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q8ctFHRy87y7fhN6MKBvSg075IMHH1VY7CJWhGNL7LMUoJMJjXkXyYQbRyIfJOxx82XzPnf9tcPf1bA0DGd8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:41.117721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf36d9d7c1aaed53223aa62724c8ffd714cdf2e4c498def35ccdc8a3171d1d2b","sha256:a096a31900f30ff7fe2c4b779583f87545ba2a1cd5b10c5b00336cf10e9e8be2"],"state_sha256":"ac63823e219794b1f1d0b1d602ca2db0c537ea73a2487e90eeea5b35aae0ca0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psEd2eF0pdobSLtHwNAaAWEuRWpmau6YCz/C3L8h3vFDtumkG5mCSffLeFzpwBUCcCNMuEMVDkhG7r0u5BL6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:01:52.855472Z","bundle_sha256":"6f2f384d8928c0ca717dd9e7e4f7223ea9aebd587e6b62b72296492ca3562071"}}