{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GVH3TGY5OJ2OFN2DHWZSEZMJ73","short_pith_number":"pith:GVH3TGY5","canonical_record":{"source":{"id":"1503.04567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-16T08:27:54Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f96f8b1122956abed83c0b7f46d941b46b369a53c51f539a03e35382b9ffd676","abstract_canon_sha256":"f51e8a3a20303b67dd09292d86231357749bae01e44e754c76e36ef7cd4b504f"},"schema_version":"1.0"},"canonical_sha256":"354fb99b1d7274e2b7433db3226589fec8b8d1f17418576d3291b5d437eb17ca","source":{"kind":"arxiv","id":"1503.04567","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04567","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04567v2","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04567","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"GVH3TGY5OJ2O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVH3TGY5OJ2OFN2D","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVH3TGY5","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GVH3TGY5OJ2OFN2DHWZSEZMJ73","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-16T08:27:54Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f96f8b1122956abed83c0b7f46d941b46b369a53c51f539a03e35382b9ffd676","abstract_canon_sha256":"f51e8a3a20303b67dd09292d86231357749bae01e44e754c76e36ef7cd4b504f"},"schema_version":"1.0"},"canonical_sha256":"354fb99b1d7274e2b7433db3226589fec8b8d1f17418576d3291b5d437eb17ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:03.421874Z","signature_b64":"XcT6oAPshCtqM0g50W5n+uPKkAvAsKG7y/+1ZUAqwp2W5iTXwEJuRvZFjks92ZQoi27kU/LFivaol6pPWkYbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"354fb99b1d7274e2b7433db3226589fec8b8d1f17418576d3291b5d437eb17ca","last_reissued_at":"2026-05-18T02:18:03.421161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:03.421161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04567","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-18T02:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmSmo0J7+mU2WOw1BBsR9vhHYoQFqdDfqqUf6/T415S7KUQonoMId9SZt2bitHqI0IOml/CVP7Ltd89E+5nkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:46:19.238938Z"},"content_sha256":"432831610bd86175e9489b84e2483b90a5118b0cfbcbe48d32f98c20a0e00a06","schema_version":"1.0","event_id":"sha256:432831610bd86175e9489b84e2483b90a5118b0cfbcbe48d32f98c20a0e00a06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GVH3TGY5OJ2OFN2DHWZSEZMJ73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Mixed Membership Community Models in Social Tagging Networks through Tensor Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anima Anandkumar, Hanie Sedghi","submitted_at":"2015-03-16T08:27:54Z","abstract_excerpt":"Community detection in graphs has been extensively studied both in theory and in applications. However, detecting communities in hypergraphs is more challenging. In this paper, we propose a tensor decomposition approach for guaranteed learning of communities in a special class of hypergraphs modeling social tagging systems or folksonomies. A folksonomy is a tripartite 3-uniform hypergraph consisting of (user, tag, resource) hyperedges. We posit a probabilistic mixed membership community model, and prove that the tensor method consistently learns the communities under efficient sample complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04567","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-18T02:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jx/NmRA3F0PCynioTJRzMJPBoXTvIn9I8PO2Xw4diSzUUgv4T9JLfr6mjzw+23o2TajSlGH2feFg1jQoj5dvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:46:19.239514Z"},"content_sha256":"489da98c87ab431409f009ead94a17e551e077719e74316ac9057154ee10cf68","schema_version":"1.0","event_id":"sha256:489da98c87ab431409f009ead94a17e551e077719e74316ac9057154ee10cf68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVH3TGY5OJ2OFN2DHWZSEZMJ73/bundle.json","state_url":"https://pith.science/pith/GVH3TGY5OJ2OFN2DHWZSEZMJ73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVH3TGY5OJ2OFN2DHWZSEZMJ73/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-02T11:46:19Z","links":{"resolver":"https://pith.science/pith/GVH3TGY5OJ2OFN2DHWZSEZMJ73","bundle":"https://pith.science/pith/GVH3TGY5OJ2OFN2DHWZSEZMJ73/bundle.json","state":"https://pith.science/pith/GVH3TGY5OJ2OFN2DHWZSEZMJ73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVH3TGY5OJ2OFN2DHWZSEZMJ73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GVH3TGY5OJ2OFN2DHWZSEZMJ73","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":"f51e8a3a20303b67dd09292d86231357749bae01e44e754c76e36ef7cd4b504f","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-16T08:27:54Z","title_canon_sha256":"f96f8b1122956abed83c0b7f46d941b46b369a53c51f539a03e35382b9ffd676"},"schema_version":"1.0","source":{"id":"1503.04567","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04567","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04567v2","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04567","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"GVH3TGY5OJ2O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GVH3TGY5OJ2OFN2D","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GVH3TGY5","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:489da98c87ab431409f009ead94a17e551e077719e74316ac9057154ee10cf68","target":"graph","created_at":"2026-05-18T02:18:03Z","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":"Community detection in graphs has been extensively studied both in theory and in applications. However, detecting communities in hypergraphs is more challenging. In this paper, we propose a tensor decomposition approach for guaranteed learning of communities in a special class of hypergraphs modeling social tagging systems or folksonomies. A folksonomy is a tripartite 3-uniform hypergraph consisting of (user, tag, resource) hyperedges. We posit a probabilistic mixed membership community model, and prove that the tensor method consistently learns the communities under efficient sample complexit","authors_text":"Anima Anandkumar, Hanie Sedghi","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-16T08:27:54Z","title":"Learning Mixed Membership Community Models in Social Tagging Networks through Tensor Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04567","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:432831610bd86175e9489b84e2483b90a5118b0cfbcbe48d32f98c20a0e00a06","target":"record","created_at":"2026-05-18T02:18:03Z","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":"f51e8a3a20303b67dd09292d86231357749bae01e44e754c76e36ef7cd4b504f","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-16T08:27:54Z","title_canon_sha256":"f96f8b1122956abed83c0b7f46d941b46b369a53c51f539a03e35382b9ffd676"},"schema_version":"1.0","source":{"id":"1503.04567","kind":"arxiv","version":2}},"canonical_sha256":"354fb99b1d7274e2b7433db3226589fec8b8d1f17418576d3291b5d437eb17ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"354fb99b1d7274e2b7433db3226589fec8b8d1f17418576d3291b5d437eb17ca","first_computed_at":"2026-05-18T02:18:03.421161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:03.421161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XcT6oAPshCtqM0g50W5n+uPKkAvAsKG7y/+1ZUAqwp2W5iTXwEJuRvZFjks92ZQoi27kU/LFivaol6pPWkYbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:03.421874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04567","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:432831610bd86175e9489b84e2483b90a5118b0cfbcbe48d32f98c20a0e00a06","sha256:489da98c87ab431409f009ead94a17e551e077719e74316ac9057154ee10cf68"],"state_sha256":"2a40b46bde18042399b7eddf85bdfe7d18136be139f94ec268c15478e542c6b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"igZ/3iwc9aZcY6NBXjKLigE3KgjlbQFt7us3LwxovLVLwJnecm45BLD4kah4mhasiGtvrfIz4epNewiF2StECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:46:19.241936Z","bundle_sha256":"eff53ea545ac5b98433ed1e72b3285ee2235d1a784ebb74607c1ca358836dd71"}}