{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SMXKV6AYB5FAJ4BXXVA7SOAEUE","short_pith_number":"pith:SMXKV6AY","canonical_record":{"source":{"id":"1802.03676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-11T01:36:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"912430c594170a6d2a01d282a84aaef062860ba99b7c1a66f0aab7fffbd9803f","abstract_canon_sha256":"2ac0e80921cf16cf71cf631dec8f99478c5f6d07f978cd8566c9e97782ed29e7"},"schema_version":"1.0"},"canonical_sha256":"932eaaf8180f4a04f037bd41f93804a100aa55b045c322eacf3aac13d6ede1fb","source":{"kind":"arxiv","id":"1802.03676","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03676","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03676v2","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03676","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"pith_short_12","alias_value":"SMXKV6AYB5FA","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SMXKV6AYB5FAJ4BX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SMXKV6AY","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SMXKV6AYB5FAJ4BXXVA7SOAEUE","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03676","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-11T01:36:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"912430c594170a6d2a01d282a84aaef062860ba99b7c1a66f0aab7fffbd9803f","abstract_canon_sha256":"2ac0e80921cf16cf71cf631dec8f99478c5f6d07f978cd8566c9e97782ed29e7"},"schema_version":"1.0"},"canonical_sha256":"932eaaf8180f4a04f037bd41f93804a100aa55b045c322eacf3aac13d6ede1fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:54.455768Z","signature_b64":"qExHx4ALERM97wJr4hQdi7ye4Yr9s/pqL7wkRN0wsK/HJldSES/s0L/vjeDKNAA3to4WZ80PTIC1oEE1HOIhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"932eaaf8180f4a04f037bd41f93804a100aa55b045c322eacf3aac13d6ede1fb","last_reissued_at":"2026-05-18T00:22:54.455355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:54.455355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03676","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:22:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"moKptwuZguHnNE7wNwU2LUrxpISxVk6csH9KJc1xP5Djoi0dSqcmaCZ4f5HnAGqYKbF/nZQ7clzSpspTo0YdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T06:10:28.416367Z"},"content_sha256":"2a12d629b192f2acfda57eda41fcce16aff0320584c3e1978a803f81188eb4e1","schema_version":"1.0","event_id":"sha256:2a12d629b192f2acfda57eda41fcce16aff0320584c3e1978a803f81188eb4e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SMXKV6AYB5FAJ4BXXVA7SOAEUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentiable Dynamic Programming for Structured Prediction and Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Arthur Mensch, Mathieu Blondel","submitted_at":"2018-02-11T01:36:06Z","abstract_excerpt":"Dynamic programming (DP) solves a variety of structured combinatorial problems by iteratively breaking them down into smaller subproblems. In spite of their versatility, DP algorithms are usually non-differentiable, which hampers their use as a layer in neural networks trained by backpropagation. To address this issue, we propose to smooth the max operator in the dynamic programming recursion, using a strongly convex regularizer. This allows to relax both the optimal value and solution of the original combinatorial problem, and turns a broad class of DP algorithms into differentiable operators"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03676","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:22:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G23vdPW0GfuTgG4xhB9ZT+xguW2n1IhUXwfHK3LEebIYC2Kb849elWrjLtgacFqUh2ofXrLQ86YHTfrlYWZfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T06:10:28.416707Z"},"content_sha256":"488b90117f0283d6bd1d702d32d9fcdb779253cb9ed895e79342973d07c192bf","schema_version":"1.0","event_id":"sha256:488b90117f0283d6bd1d702d32d9fcdb779253cb9ed895e79342973d07c192bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMXKV6AYB5FAJ4BXXVA7SOAEUE/bundle.json","state_url":"https://pith.science/pith/SMXKV6AYB5FAJ4BXXVA7SOAEUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMXKV6AYB5FAJ4BXXVA7SOAEUE/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-30T06:10:28Z","links":{"resolver":"https://pith.science/pith/SMXKV6AYB5FAJ4BXXVA7SOAEUE","bundle":"https://pith.science/pith/SMXKV6AYB5FAJ4BXXVA7SOAEUE/bundle.json","state":"https://pith.science/pith/SMXKV6AYB5FAJ4BXXVA7SOAEUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMXKV6AYB5FAJ4BXXVA7SOAEUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SMXKV6AYB5FAJ4BXXVA7SOAEUE","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":"2ac0e80921cf16cf71cf631dec8f99478c5f6d07f978cd8566c9e97782ed29e7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-11T01:36:06Z","title_canon_sha256":"912430c594170a6d2a01d282a84aaef062860ba99b7c1a66f0aab7fffbd9803f"},"schema_version":"1.0","source":{"id":"1802.03676","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03676","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03676v2","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03676","created_at":"2026-05-18T00:22:54Z"},{"alias_kind":"pith_short_12","alias_value":"SMXKV6AYB5FA","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SMXKV6AYB5FAJ4BX","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SMXKV6AY","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:488b90117f0283d6bd1d702d32d9fcdb779253cb9ed895e79342973d07c192bf","target":"graph","created_at":"2026-05-18T00:22:54Z","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":"Dynamic programming (DP) solves a variety of structured combinatorial problems by iteratively breaking them down into smaller subproblems. In spite of their versatility, DP algorithms are usually non-differentiable, which hampers their use as a layer in neural networks trained by backpropagation. To address this issue, we propose to smooth the max operator in the dynamic programming recursion, using a strongly convex regularizer. This allows to relax both the optimal value and solution of the original combinatorial problem, and turns a broad class of DP algorithms into differentiable operators","authors_text":"Arthur Mensch, Mathieu Blondel","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-11T01:36:06Z","title":"Differentiable Dynamic Programming for Structured Prediction and Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03676","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:2a12d629b192f2acfda57eda41fcce16aff0320584c3e1978a803f81188eb4e1","target":"record","created_at":"2026-05-18T00:22:54Z","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":"2ac0e80921cf16cf71cf631dec8f99478c5f6d07f978cd8566c9e97782ed29e7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-11T01:36:06Z","title_canon_sha256":"912430c594170a6d2a01d282a84aaef062860ba99b7c1a66f0aab7fffbd9803f"},"schema_version":"1.0","source":{"id":"1802.03676","kind":"arxiv","version":2}},"canonical_sha256":"932eaaf8180f4a04f037bd41f93804a100aa55b045c322eacf3aac13d6ede1fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"932eaaf8180f4a04f037bd41f93804a100aa55b045c322eacf3aac13d6ede1fb","first_computed_at":"2026-05-18T00:22:54.455355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:54.455355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qExHx4ALERM97wJr4hQdi7ye4Yr9s/pqL7wkRN0wsK/HJldSES/s0L/vjeDKNAA3to4WZ80PTIC1oEE1HOIhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:54.455768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03676","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a12d629b192f2acfda57eda41fcce16aff0320584c3e1978a803f81188eb4e1","sha256:488b90117f0283d6bd1d702d32d9fcdb779253cb9ed895e79342973d07c192bf"],"state_sha256":"1d9ffcff66e210cf0f3406c8679941b7d4b42652965cec71164bdb73fdc173de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZUIpVEbtr9a/n7MLGJ0CBZxQdYPdS6LKTgLtTaHifI0HO4Inf8rjKhAq4JSpXq94puNy2MfTFPeoP8Kozn6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T06:10:28.418728Z","bundle_sha256":"e837e6482593c6c7f0555b03a770db55d4c648abe2443dce98c0be0247882f4e"}}