{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7EW3GMOENLM2U4H5QDD57JRRU2","short_pith_number":"pith:7EW3GMOE","canonical_record":{"source":{"id":"1310.2816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T13:47:40Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"title_canon_sha256":"2931035c130aa6bc493bf14b2ade2a6e17eae805647fc73c09ebafa2a7625bb3","abstract_canon_sha256":"0fba096ae1cd4e9f143f1597e0146ab7ac6e973685fb89da491607bfb26027fc"},"schema_version":"1.0"},"canonical_sha256":"f92db331c46ad9aa70fd80c7dfa631a69645c0582f9d18189b22385113ffa2ac","source":{"kind":"arxiv","id":"1310.2816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2816","created_at":"2026-05-18T03:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2816v1","created_at":"2026-05-18T03:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2816","created_at":"2026-05-18T03:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"7EW3GMOENLM2","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7EW3GMOENLM2U4H5","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7EW3GMOE","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7EW3GMOENLM2U4H5QDD57JRRU2","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T13:47:40Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"title_canon_sha256":"2931035c130aa6bc493bf14b2ade2a6e17eae805647fc73c09ebafa2a7625bb3","abstract_canon_sha256":"0fba096ae1cd4e9f143f1597e0146ab7ac6e973685fb89da491607bfb26027fc"},"schema_version":"1.0"},"canonical_sha256":"f92db331c46ad9aa70fd80c7dfa631a69645c0582f9d18189b22385113ffa2ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:46.609166Z","signature_b64":"CZZA9r/Dl0vUc2ILat3lM5KefeF4ZjMvUCv0B4P2T8AAgiTwOLK7mSPby8HW2sHanu7URSBd3wsRO4L7hrr+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f92db331c46ad9aa70fd80c7dfa631a69645c0582f9d18189b22385113ffa2ac","last_reissued_at":"2026-05-18T03:10:46.608475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:46.608475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2816","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-18T03:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QqLadZvfLP8tczoG2NZS6JHCiMtivfvcTlYHSyAvj5dtYhWLQ6kNtT95vNSIrFjExXBX4VsXugciHK+lvQpdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:13:41.776973Z"},"content_sha256":"f7678d1abf69c510b3578fee97d52edee4b604c33f08c35e2ba796b5cfae7d40","schema_version":"1.0","event_id":"sha256:f7678d1abf69c510b3578fee97d52edee4b604c33f08c35e2ba796b5cfae7d40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7EW3GMOENLM2U4H5QDD57JRRU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gibbs Max-margin Topic Models with Data Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"Bo Zhang, Hugh Perkins, Jun Zhu, Ning Chen","submitted_at":"2013-10-10T13:47:40Z","abstract_excerpt":"Max-margin learning is a powerful approach to building classifiers and structured output predictors. Recent work on max-margin supervised topic models has successfully integrated it with Bayesian topic models to discover discriminative latent semantic structures and make accurate predictions for unseen testing data. However, the resulting learning problems are usually hard to solve because of the non-smoothness of the margin loss. Existing approaches to building max-margin supervised topic models rely on an iterative procedure to solve multiple latent SVM subproblems with additional mean-field"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2816","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-18T03:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhceXOYP4chrPRLyF70y5faFLFq5n7ci+NWsydqIO4YJBeEIUD5k0f25SpoF+nyD8K3epxcEtc6QVDbJHcr+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:13:41.777733Z"},"content_sha256":"669878900c5c56bde881f2f84360a788d691a46b1012aca4acab6f91dda5964a","schema_version":"1.0","event_id":"sha256:669878900c5c56bde881f2f84360a788d691a46b1012aca4acab6f91dda5964a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EW3GMOENLM2U4H5QDD57JRRU2/bundle.json","state_url":"https://pith.science/pith/7EW3GMOENLM2U4H5QDD57JRRU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EW3GMOENLM2U4H5QDD57JRRU2/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-31T00:13:41Z","links":{"resolver":"https://pith.science/pith/7EW3GMOENLM2U4H5QDD57JRRU2","bundle":"https://pith.science/pith/7EW3GMOENLM2U4H5QDD57JRRU2/bundle.json","state":"https://pith.science/pith/7EW3GMOENLM2U4H5QDD57JRRU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EW3GMOENLM2U4H5QDD57JRRU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7EW3GMOENLM2U4H5QDD57JRRU2","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":"0fba096ae1cd4e9f143f1597e0146ab7ac6e973685fb89da491607bfb26027fc","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T13:47:40Z","title_canon_sha256":"2931035c130aa6bc493bf14b2ade2a6e17eae805647fc73c09ebafa2a7625bb3"},"schema_version":"1.0","source":{"id":"1310.2816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2816","created_at":"2026-05-18T03:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2816v1","created_at":"2026-05-18T03:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2816","created_at":"2026-05-18T03:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"7EW3GMOENLM2","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7EW3GMOENLM2U4H5","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7EW3GMOE","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:669878900c5c56bde881f2f84360a788d691a46b1012aca4acab6f91dda5964a","target":"graph","created_at":"2026-05-18T03:10:46Z","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":"Max-margin learning is a powerful approach to building classifiers and structured output predictors. Recent work on max-margin supervised topic models has successfully integrated it with Bayesian topic models to discover discriminative latent semantic structures and make accurate predictions for unseen testing data. However, the resulting learning problems are usually hard to solve because of the non-smoothness of the margin loss. Existing approaches to building max-margin supervised topic models rely on an iterative procedure to solve multiple latent SVM subproblems with additional mean-field","authors_text":"Bo Zhang, Hugh Perkins, Jun Zhu, Ning Chen","cross_cats":["cs.LG","stat.CO","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T13:47:40Z","title":"Gibbs Max-margin Topic Models with Data Augmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2816","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:f7678d1abf69c510b3578fee97d52edee4b604c33f08c35e2ba796b5cfae7d40","target":"record","created_at":"2026-05-18T03:10:46Z","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":"0fba096ae1cd4e9f143f1597e0146ab7ac6e973685fb89da491607bfb26027fc","cross_cats_sorted":["cs.LG","stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-10T13:47:40Z","title_canon_sha256":"2931035c130aa6bc493bf14b2ade2a6e17eae805647fc73c09ebafa2a7625bb3"},"schema_version":"1.0","source":{"id":"1310.2816","kind":"arxiv","version":1}},"canonical_sha256":"f92db331c46ad9aa70fd80c7dfa631a69645c0582f9d18189b22385113ffa2ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f92db331c46ad9aa70fd80c7dfa631a69645c0582f9d18189b22385113ffa2ac","first_computed_at":"2026-05-18T03:10:46.608475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:46.608475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CZZA9r/Dl0vUc2ILat3lM5KefeF4ZjMvUCv0B4P2T8AAgiTwOLK7mSPby8HW2sHanu7URSBd3wsRO4L7hrr+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:46.609166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7678d1abf69c510b3578fee97d52edee4b604c33f08c35e2ba796b5cfae7d40","sha256:669878900c5c56bde881f2f84360a788d691a46b1012aca4acab6f91dda5964a"],"state_sha256":"73da2f1e332f77cc0414a32740fcc9cefd26c0f97a40c35b8cb1de193a71a2a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhb2U++AtAqdCJ3XzP+y9lEbxxVpNwxvq0L2QoOjBEyn4/dBSMVERVjvcuUl275eJOQhtSGBKhA3qYYrX0H0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:13:41.781666Z","bundle_sha256":"2f61f98c45ebb7b57744fe2a5632f84d510bd019d8b5d73476b155d9aabba165"}}