{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MBFXNI4WVZSPJ53332IM7B7GUX","short_pith_number":"pith:MBFXNI4W","canonical_record":{"source":{"id":"2004.03991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-08T13:31:53Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"c5e22ce380e3380f3d8c8e04443cb7ce0e2c0cf91811f48659f552e8ee68b704","abstract_canon_sha256":"7a6dd5b3efa0f3c558209d02ccc26a0aa2692834071e5a5fae3778497d72a13a"},"schema_version":"1.0"},"canonical_sha256":"604b76a396ae64f4f77bde90cf87e6a5db3b27e52a030f6241ca56353ed92918","source":{"kind":"arxiv","id":"2004.03991","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.03991","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"arxiv_version","alias_value":"2004.03991v2","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.03991","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"pith_short_12","alias_value":"MBFXNI4WVZSP","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"pith_short_16","alias_value":"MBFXNI4WVZSPJ533","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"pith_short_8","alias_value":"MBFXNI4W","created_at":"2026-07-05T01:19:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MBFXNI4WVZSPJ53332IM7B7GUX","target":"record","payload":{"canonical_record":{"source":{"id":"2004.03991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-08T13:31:53Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"c5e22ce380e3380f3d8c8e04443cb7ce0e2c0cf91811f48659f552e8ee68b704","abstract_canon_sha256":"7a6dd5b3efa0f3c558209d02ccc26a0aa2692834071e5a5fae3778497d72a13a"},"schema_version":"1.0"},"canonical_sha256":"604b76a396ae64f4f77bde90cf87e6a5db3b27e52a030f6241ca56353ed92918","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:39.358196Z","signature_b64":"G87r+BLcXsFevOVVqX52QFkTUEqgqUjUU4OAWMr3WVFLfLvAQ6iFDrjQVqfeWEuaPzd/Z8J7w6TWDi4Ngw4jBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"604b76a396ae64f4f77bde90cf87e6a5db3b27e52a030f6241ca56353ed92918","last_reissued_at":"2026-07-05T01:19:39.357749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:39.357749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.03991","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-07-05T01:19:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZFEbTpFwevlmSKC6tmAxouIvxJCGruR2Mmn/SC5WZGRhMynC+yk3PyCFCdiC4pYbe7kf24XXYVyUS8NIsg2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T18:32:53.512217Z"},"content_sha256":"0d70642741d30d3a247bb3894d6e3f930041fd6e66c8f5686731bf250b3f77b3","schema_version":"1.0","event_id":"sha256:0d70642741d30d3a247bb3894d6e3f930041fd6e66c8f5686731bf250b3f77b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MBFXNI4WVZSPJ53332IM7B7GUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Discrete Structured Representations by Adversarially Maximizing Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Karl Stratos, Sam Wiseman","submitted_at":"2020-04-08T13:31:53Z","abstract_excerpt":"We propose learning discrete structured representations from unlabeled data by maximizing the mutual information between a structured latent variable and a target variable. Calculating mutual information is intractable in this setting. Our key technical contribution is an adversarial objective that can be used to tractably estimate mutual information assuming only the feasibility of cross entropy calculation. We develop a concrete realization of this general formulation with Markov distributions over binary encodings. We report critical and unexpected findings on practical aspects of the objec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.03991","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.03991/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:19:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FqB5Ic5tUh7o1zGvHxRAF9UGng/VS3GsRpv2EcIxU3po0gr/BZz0gKAmwe3O11EVhs/ul9evRm2EuwjZUVxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T18:32:53.512609Z"},"content_sha256":"5eb71d95793c97485b6563fd27e0eb60d030178589e20543b8132386fdca67c2","schema_version":"1.0","event_id":"sha256:5eb71d95793c97485b6563fd27e0eb60d030178589e20543b8132386fdca67c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBFXNI4WVZSPJ53332IM7B7GUX/bundle.json","state_url":"https://pith.science/pith/MBFXNI4WVZSPJ53332IM7B7GUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBFXNI4WVZSPJ53332IM7B7GUX/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-07-12T18:32:53Z","links":{"resolver":"https://pith.science/pith/MBFXNI4WVZSPJ53332IM7B7GUX","bundle":"https://pith.science/pith/MBFXNI4WVZSPJ53332IM7B7GUX/bundle.json","state":"https://pith.science/pith/MBFXNI4WVZSPJ53332IM7B7GUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBFXNI4WVZSPJ53332IM7B7GUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MBFXNI4WVZSPJ53332IM7B7GUX","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":"7a6dd5b3efa0f3c558209d02ccc26a0aa2692834071e5a5fae3778497d72a13a","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-08T13:31:53Z","title_canon_sha256":"c5e22ce380e3380f3d8c8e04443cb7ce0e2c0cf91811f48659f552e8ee68b704"},"schema_version":"1.0","source":{"id":"2004.03991","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.03991","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"arxiv_version","alias_value":"2004.03991v2","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.03991","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"pith_short_12","alias_value":"MBFXNI4WVZSP","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"pith_short_16","alias_value":"MBFXNI4WVZSPJ533","created_at":"2026-07-05T01:19:39Z"},{"alias_kind":"pith_short_8","alias_value":"MBFXNI4W","created_at":"2026-07-05T01:19:39Z"}],"graph_snapshots":[{"event_id":"sha256:5eb71d95793c97485b6563fd27e0eb60d030178589e20543b8132386fdca67c2","target":"graph","created_at":"2026-07-05T01:19:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.03991/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose learning discrete structured representations from unlabeled data by maximizing the mutual information between a structured latent variable and a target variable. Calculating mutual information is intractable in this setting. Our key technical contribution is an adversarial objective that can be used to tractably estimate mutual information assuming only the feasibility of cross entropy calculation. We develop a concrete realization of this general formulation with Markov distributions over binary encodings. We report critical and unexpected findings on practical aspects of the objec","authors_text":"Karl Stratos, Sam Wiseman","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-08T13:31:53Z","title":"Learning Discrete Structured Representations by Adversarially Maximizing Mutual Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.03991","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:0d70642741d30d3a247bb3894d6e3f930041fd6e66c8f5686731bf250b3f77b3","target":"record","created_at":"2026-07-05T01:19:39Z","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":"7a6dd5b3efa0f3c558209d02ccc26a0aa2692834071e5a5fae3778497d72a13a","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-04-08T13:31:53Z","title_canon_sha256":"c5e22ce380e3380f3d8c8e04443cb7ce0e2c0cf91811f48659f552e8ee68b704"},"schema_version":"1.0","source":{"id":"2004.03991","kind":"arxiv","version":2}},"canonical_sha256":"604b76a396ae64f4f77bde90cf87e6a5db3b27e52a030f6241ca56353ed92918","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"604b76a396ae64f4f77bde90cf87e6a5db3b27e52a030f6241ca56353ed92918","first_computed_at":"2026-07-05T01:19:39.357749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:19:39.357749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G87r+BLcXsFevOVVqX52QFkTUEqgqUjUU4OAWMr3WVFLfLvAQ6iFDrjQVqfeWEuaPzd/Z8J7w6TWDi4Ngw4jBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:19:39.358196Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.03991","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d70642741d30d3a247bb3894d6e3f930041fd6e66c8f5686731bf250b3f77b3","sha256:5eb71d95793c97485b6563fd27e0eb60d030178589e20543b8132386fdca67c2"],"state_sha256":"d13cb42a9dd07a3e06e1b30f9c2bd0cd6607b7a802f4fc8cd0bcdb8c2277a757"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BARBfPZ2am5BvP+1RGVIacoxQRX9WmRlULptilf/yKnGGqggTO4TEY91fqeyXexT4gWKTN/i19uW1kC6+5bKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T18:32:53.514783Z","bundle_sha256":"891cd4ac6225615d10b6462ccaaecc9ddf151b719287f8b0c650da9e40d5804f"}}