{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LOLNYW2N5ZKPIE2CJFSTSC2QEE","short_pith_number":"pith:LOLNYW2N","schema_version":"1.0","canonical_sha256":"5b96dc5b4dee54f413424965390b5021300dae621284a8f1a35fe6bd36e1c03b","source":{"kind":"arxiv","id":"1010.1437","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.1437","created_at":"2026-05-18T04:39:41.117277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1437v1","created_at":"2026-05-18T04:39:41.117277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1437","created_at":"2026-05-18T04:39:41.117277+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOLNYW2N5ZKP","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOLNYW2N5ZKPIE2C","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOLNYW2N","created_at":"2026-05-18T12:26:10.704358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE","json":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE.json","graph_json":"https://pith.science/api/pith-number/LOLNYW2N5ZKPIE2CJFSTSC2QEE/graph.json","events_json":"https://pith.science/api/pith-number/LOLNYW2N5ZKPIE2CJFSTSC2QEE/events.json","paper":"https://pith.science/paper/LOLNYW2N"},"agent_actions":{"view_html":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE","download_json":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE.json","view_paper":"https://pith.science/paper/LOLNYW2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1437&json=true","fetch_graph":"https://pith.science/api/pith-number/LOLNYW2N5ZKPIE2CJFSTSC2QEE/graph.json","fetch_events":"https://pith.science/api/pith-number/LOLNYW2N5ZKPIE2CJFSTSC2QEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/action/storage_attestation","attest_author":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/action/author_attestation","sign_citation":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/action/citation_signature","submit_replication":"https://pith.science/pith/LOLNYW2N5ZKPIE2CJFSTSC2QEE/action/replication_record"}},"created_at":"2026-05-18T04:39:41.117277+00:00","updated_at":"2026-05-18T04:39:41.117277+00:00"}