{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:INFOYNA5NZJCVQH5M4S4CAZL7A","short_pith_number":"pith:INFOYNA5","canonical_record":{"source":{"id":"1810.11975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T06:46:37Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"f51bdb1129c8095b749d7639d65ea07ef7540380503ab697c076043781c67b34","abstract_canon_sha256":"d77513c3a8910973facbd2c51492697b366160587b1ae0687f41276f9c846705"},"schema_version":"1.0"},"canonical_sha256":"434aec341d6e522ac0fd6725c1032bf83012a9e04e9ab79fa34004e86ff014d8","source":{"kind":"arxiv","id":"1810.11975","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11975","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11975v2","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11975","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"INFOYNA5NZJC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"INFOYNA5NZJCVQH5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"INFOYNA5","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:INFOYNA5NZJCVQH5M4S4CAZL7A","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T06:46:37Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"f51bdb1129c8095b749d7639d65ea07ef7540380503ab697c076043781c67b34","abstract_canon_sha256":"d77513c3a8910973facbd2c51492697b366160587b1ae0687f41276f9c846705"},"schema_version":"1.0"},"canonical_sha256":"434aec341d6e522ac0fd6725c1032bf83012a9e04e9ab79fa34004e86ff014d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:52.709301Z","signature_b64":"85JcDzv5HjIV7nOB2Q/rSNxemuQUGRjHbgrUuCYurxTehBCA6Asr3WTov4g/664C1zSXa04wrSZtgL3qLYGvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"434aec341d6e522ac0fd6725c1032bf83012a9e04e9ab79fa34004e86ff014d8","last_reissued_at":"2026-05-18T00:01:52.708880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:52.708880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11975","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-18T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2TFfE70wfpAfotCPmhivndHRF6PvOzCI2tRzv+8REJKYi2xnAsSfLikpuw1xnXW4qMB/45Xb1Fuur1f1gFFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:43:13.680576Z"},"content_sha256":"0064b13307d5c29465d787a7ff86083099e717c34ab6f54786f3e948993a09de","schema_version":"1.0","event_id":"sha256:0064b13307d5c29465d787a7ff86083099e717c34ab6f54786f3e948993a09de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:INFOYNA5NZJCVQH5M4S4CAZL7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Controllable Sparse Alternatives to Softmax","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anirban Laha, Harish G. Ramaswamy, Karthik Sankaranarayanan, Mitesh M. Khapra, Priyanka Agrawal, Saneem A. Chemmengath","submitted_at":"2018-10-29T06:46:37Z","abstract_excerpt":"Converting an n-dimensional vector to a probability distribution over n objects is a commonly used component in many machine learning tasks like multiclass classification, multilabel classification, attention mechanisms etc. For this, several probability mapping functions have been proposed and employed in literature such as softmax, sum-normalization, spherical softmax, and sparsemax, but there is very little understanding in terms how they relate with each other. Further, none of the above formulations offer an explicit control over the degree of sparsity. To address this, we develop a unifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11975","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-18T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEfyssqfaRgkphWTKHbCAWWvQbaNpUULxOfeIeVyqjo3+8BmD0jCqLL7oqJ12oJEXzGMxS2i0GWIX0APNqC0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:43:13.680918Z"},"content_sha256":"ea500875bb1899acf6518b99b0bf281833997f8935c55cccba749ab418de01c2","schema_version":"1.0","event_id":"sha256:ea500875bb1899acf6518b99b0bf281833997f8935c55cccba749ab418de01c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INFOYNA5NZJCVQH5M4S4CAZL7A/bundle.json","state_url":"https://pith.science/pith/INFOYNA5NZJCVQH5M4S4CAZL7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INFOYNA5NZJCVQH5M4S4CAZL7A/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-09T00:43:13Z","links":{"resolver":"https://pith.science/pith/INFOYNA5NZJCVQH5M4S4CAZL7A","bundle":"https://pith.science/pith/INFOYNA5NZJCVQH5M4S4CAZL7A/bundle.json","state":"https://pith.science/pith/INFOYNA5NZJCVQH5M4S4CAZL7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INFOYNA5NZJCVQH5M4S4CAZL7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:INFOYNA5NZJCVQH5M4S4CAZL7A","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":"d77513c3a8910973facbd2c51492697b366160587b1ae0687f41276f9c846705","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T06:46:37Z","title_canon_sha256":"f51bdb1129c8095b749d7639d65ea07ef7540380503ab697c076043781c67b34"},"schema_version":"1.0","source":{"id":"1810.11975","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11975","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11975v2","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11975","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"INFOYNA5NZJC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"INFOYNA5NZJCVQH5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"INFOYNA5","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:ea500875bb1899acf6518b99b0bf281833997f8935c55cccba749ab418de01c2","target":"graph","created_at":"2026-05-18T00:01:52Z","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":"Converting an n-dimensional vector to a probability distribution over n objects is a commonly used component in many machine learning tasks like multiclass classification, multilabel classification, attention mechanisms etc. For this, several probability mapping functions have been proposed and employed in literature such as softmax, sum-normalization, spherical softmax, and sparsemax, but there is very little understanding in terms how they relate with each other. Further, none of the above formulations offer an explicit control over the degree of sparsity. To address this, we develop a unifi","authors_text":"Anirban Laha, Harish G. Ramaswamy, Karthik Sankaranarayanan, Mitesh M. Khapra, Priyanka Agrawal, Saneem A. Chemmengath","cross_cats":["cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T06:46:37Z","title":"On Controllable Sparse Alternatives to Softmax"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11975","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:0064b13307d5c29465d787a7ff86083099e717c34ab6f54786f3e948993a09de","target":"record","created_at":"2026-05-18T00:01:52Z","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":"d77513c3a8910973facbd2c51492697b366160587b1ae0687f41276f9c846705","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T06:46:37Z","title_canon_sha256":"f51bdb1129c8095b749d7639d65ea07ef7540380503ab697c076043781c67b34"},"schema_version":"1.0","source":{"id":"1810.11975","kind":"arxiv","version":2}},"canonical_sha256":"434aec341d6e522ac0fd6725c1032bf83012a9e04e9ab79fa34004e86ff014d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"434aec341d6e522ac0fd6725c1032bf83012a9e04e9ab79fa34004e86ff014d8","first_computed_at":"2026-05-18T00:01:52.708880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:52.708880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"85JcDzv5HjIV7nOB2Q/rSNxemuQUGRjHbgrUuCYurxTehBCA6Asr3WTov4g/664C1zSXa04wrSZtgL3qLYGvCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:52.709301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11975","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0064b13307d5c29465d787a7ff86083099e717c34ab6f54786f3e948993a09de","sha256:ea500875bb1899acf6518b99b0bf281833997f8935c55cccba749ab418de01c2"],"state_sha256":"033452166e7ea285dc26370a9af5bcf888a11de1fa395d604cdd952dc51353fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/iG45S7AYnQW8gknYXTfmCoykB++Lnp0gDzbBgsLhJvKHuezvQ1uW2DEPc+s61ibSm5CAsdvTV4CHua9bgIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:43:13.682959Z","bundle_sha256":"c86a98b4042420d401dc14d2a53d2d5f72c6c11419d0e28626d27d3a19d858a4"}}