{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2WMDNDAHRQUI4SDJVRYUHRFJ2R","short_pith_number":"pith:2WMDNDAH","canonical_record":{"source":{"id":"1705.07704","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T13:11:24Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"a919a72cb6c18e1f83e1a272b147317468302e021dc79059ce8c67312d6fefe2","abstract_canon_sha256":"82b445c74a9eaf0eacf826defa89dd0ef642c90e121e3ea5be9515c4a2052eb0"},"schema_version":"1.0"},"canonical_sha256":"d598368c078c288e4869ac7143c4a9d45cefd49b9f5fc9a168af6a1b1be57e40","source":{"kind":"arxiv","id":"1705.07704","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07704","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07704v3","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07704","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"2WMDNDAHRQUI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WMDNDAHRQUI4SDJ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WMDNDAH","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2WMDNDAHRQUI4SDJVRYUHRFJ2R","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07704","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T13:11:24Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"a919a72cb6c18e1f83e1a272b147317468302e021dc79059ce8c67312d6fefe2","abstract_canon_sha256":"82b445c74a9eaf0eacf826defa89dd0ef642c90e121e3ea5be9515c4a2052eb0"},"schema_version":"1.0"},"canonical_sha256":"d598368c078c288e4869ac7143c4a9d45cefd49b9f5fc9a168af6a1b1be57e40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:56.097878Z","signature_b64":"kl7Cd7aZ4aYdWt2Cw2sO8omlCbCBmVQZKuzZnuoy8s64BqUnXSURwOiEg/0aeLfHAGSIVnU/52usFNOUBtK6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d598368c078c288e4869ac7143c4a9d45cefd49b9f5fc9a168af6a1b1be57e40","last_reissued_at":"2026-05-17T23:52:56.097210Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:56.097210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07704","source_version":3,"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-17T23:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fR//wSt4kUbUWIugEOlZgGNK6VA/Ko1m9fOIOkoiDoKLrRPqY96btb7+BbNagoQ8yng8edcW4jteZ31Re10oCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:15:19.311448Z"},"content_sha256":"0d4a235c687440dfe0c79e8c17b364960a72bc7d68788b1fe26ef331d40d716a","schema_version":"1.0","event_id":"sha256:0d4a235c687440dfe0c79e8c17b364960a72bc7d68788b1fe26ef331d40d716a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2WMDNDAHRQUI4SDJVRYUHRFJ2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Regularized Framework for Sparse and Structured Neural Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"stat.ML","authors_text":"Mathieu Blondel, Vlad Niculae","submitted_at":"2017-05-22T13:11:24Z","abstract_excerpt":"Modern neural networks are often augmented with an attention mechanism, which tells the network where to focus within the input. We propose in this paper a new framework for sparse and structured attention, building upon a smoothed max operator. We show that the gradient of this operator defines a mapping from real values to probabilities, suitable as an attention mechanism. Our framework includes softmax and a slight generalization of the recently-proposed sparsemax as special cases. However, we also show how our framework can incorporate modern structured penalties, resulting in more interpr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07704","kind":"arxiv","version":3},"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-17T23:52:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dD2rlRnfG2CrwdwZvk9fzvp17pbK73yZ6lbTyxEHOpr1L4jL9t0vla2QEdNyxD+vQg87ijKn6DbuoHo0WQyxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:15:19.312119Z"},"content_sha256":"8ea62452cb66ecab640830c74fe9f13da95f27d85bea4c0d22f211a73ef95c0f","schema_version":"1.0","event_id":"sha256:8ea62452cb66ecab640830c74fe9f13da95f27d85bea4c0d22f211a73ef95c0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WMDNDAHRQUI4SDJVRYUHRFJ2R/bundle.json","state_url":"https://pith.science/pith/2WMDNDAHRQUI4SDJVRYUHRFJ2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WMDNDAHRQUI4SDJVRYUHRFJ2R/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-08T00:15:19Z","links":{"resolver":"https://pith.science/pith/2WMDNDAHRQUI4SDJVRYUHRFJ2R","bundle":"https://pith.science/pith/2WMDNDAHRQUI4SDJVRYUHRFJ2R/bundle.json","state":"https://pith.science/pith/2WMDNDAHRQUI4SDJVRYUHRFJ2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WMDNDAHRQUI4SDJVRYUHRFJ2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2WMDNDAHRQUI4SDJVRYUHRFJ2R","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":"82b445c74a9eaf0eacf826defa89dd0ef642c90e121e3ea5be9515c4a2052eb0","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T13:11:24Z","title_canon_sha256":"a919a72cb6c18e1f83e1a272b147317468302e021dc79059ce8c67312d6fefe2"},"schema_version":"1.0","source":{"id":"1705.07704","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07704","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07704v3","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07704","created_at":"2026-05-17T23:52:56Z"},{"alias_kind":"pith_short_12","alias_value":"2WMDNDAHRQUI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2WMDNDAHRQUI4SDJ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2WMDNDAH","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:8ea62452cb66ecab640830c74fe9f13da95f27d85bea4c0d22f211a73ef95c0f","target":"graph","created_at":"2026-05-17T23:52:56Z","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":"Modern neural networks are often augmented with an attention mechanism, which tells the network where to focus within the input. We propose in this paper a new framework for sparse and structured attention, building upon a smoothed max operator. We show that the gradient of this operator defines a mapping from real values to probabilities, suitable as an attention mechanism. Our framework includes softmax and a slight generalization of the recently-proposed sparsemax as special cases. However, we also show how our framework can incorporate modern structured penalties, resulting in more interpr","authors_text":"Mathieu Blondel, Vlad Niculae","cross_cats":["cs.CL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T13:11:24Z","title":"A Regularized Framework for Sparse and Structured Neural Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07704","kind":"arxiv","version":3},"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:0d4a235c687440dfe0c79e8c17b364960a72bc7d68788b1fe26ef331d40d716a","target":"record","created_at":"2026-05-17T23:52:56Z","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":"82b445c74a9eaf0eacf826defa89dd0ef642c90e121e3ea5be9515c4a2052eb0","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T13:11:24Z","title_canon_sha256":"a919a72cb6c18e1f83e1a272b147317468302e021dc79059ce8c67312d6fefe2"},"schema_version":"1.0","source":{"id":"1705.07704","kind":"arxiv","version":3}},"canonical_sha256":"d598368c078c288e4869ac7143c4a9d45cefd49b9f5fc9a168af6a1b1be57e40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d598368c078c288e4869ac7143c4a9d45cefd49b9f5fc9a168af6a1b1be57e40","first_computed_at":"2026-05-17T23:52:56.097210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:56.097210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kl7Cd7aZ4aYdWt2Cw2sO8omlCbCBmVQZKuzZnuoy8s64BqUnXSURwOiEg/0aeLfHAGSIVnU/52usFNOUBtK6Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:56.097878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07704","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d4a235c687440dfe0c79e8c17b364960a72bc7d68788b1fe26ef331d40d716a","sha256:8ea62452cb66ecab640830c74fe9f13da95f27d85bea4c0d22f211a73ef95c0f"],"state_sha256":"39b76a36f90b3fa1948e7584b80a5825d0a5887301aa2b98dc82443213058925"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vTpnLukPDdsB8aMO1yeNrdFoILvvrP7jFtuWnoS5n2Zcv/XWhv0TzuAbUS/jr9br2mv0OYDOVwxkoDprmloBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T00:15:19.316556Z","bundle_sha256":"c75b7130950e213705a7dc68ce815ba7af442cef54f0d8cb2e8e649dcf0221b3"}}