{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SFEIQNEAT7EGH5AOQVSUEDWGLT","short_pith_number":"pith:SFEIQNEA","canonical_record":{"source":{"id":"1809.00653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-03T16:52:19Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"f6aa6f6549c9068b06e572fe0d8faa8e1e086006f7a78bd2c5e9315b43543e1b","abstract_canon_sha256":"3509c595d733b83177a9528099ddef67630fa9d46f2be9bd22ccad78ed801d84"},"schema_version":"1.0"},"canonical_sha256":"91488834809fc863f40e8565420ec65cefe7e83d3c32792f88865b78417efe7e","source":{"kind":"arxiv","id":"1809.00653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00653","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00653v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00653","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"SFEIQNEAT7EG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SFEIQNEAT7EGH5AO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SFEIQNEA","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SFEIQNEAT7EGH5AOQVSUEDWGLT","target":"record","payload":{"canonical_record":{"source":{"id":"1809.00653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-03T16:52:19Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"f6aa6f6549c9068b06e572fe0d8faa8e1e086006f7a78bd2c5e9315b43543e1b","abstract_canon_sha256":"3509c595d733b83177a9528099ddef67630fa9d46f2be9bd22ccad78ed801d84"},"schema_version":"1.0"},"canonical_sha256":"91488834809fc863f40e8565420ec65cefe7e83d3c32792f88865b78417efe7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:32.863080Z","signature_b64":"zZ3LuT1LBpvuGNRdk7JehaQrelIYsZpbYPDxfc+fO02D/Xy8ScuKUjppWJPLAELmX6GX6iRdtEMXQnBS26dKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91488834809fc863f40e8565420ec65cefe7e83d3c32792f88865b78417efe7e","last_reissued_at":"2026-05-18T00:06:32.862371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:32.862371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.00653","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-18T00:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fOoC55xk1Yc4s5A3k6ze6wQUNdAGP6t3qD/0Kaihy7El3aRSSEgN5+HWK57xgu0wxOPZM4lN4Mgl9Y8hgqD1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:17:37.157696Z"},"content_sha256":"55967e0d7096108b97f7a0fa1c86321327969322743a76a61243796c12830da3","schema_version":"1.0","event_id":"sha256:55967e0d7096108b97f7a0fa1c86321327969322743a76a61243796c12830da3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SFEIQNEAT7EGH5AOQVSUEDWGLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Dynamic Computation Graphs via Sparse Latent Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Andr\\'e F. T. Martins, Claire Cardie, Vlad Niculae","submitted_at":"2018-09-03T16:52:19Z","abstract_excerpt":"Deep NLP models benefit from underlying structures in the data---e.g., parse trees---typically extracted using off-the-shelf parsers. Recent attempts to jointly learn the latent structure encounter a tradeoff: either make factorization assumptions that limit expressiveness, or sacrifice end-to-end differentiability. Using the recently proposed SparseMAP inference, which retrieves a sparse distribution over latent structures, we propose a novel approach for end-to-end learning of latent structure predictors jointly with a downstream predictor. To the best of our knowledge, our method is the fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00653","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-18T00:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23LerL19UMio9YEt6ehRRVhtW06fq+EnD4wrd/4PayUPF67LwOASay6U/ZVYJkZiR8wl2+nj+IGjh7/a3rnDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:17:37.158354Z"},"content_sha256":"61654ab698190481ee95743406e923009771c91661b7740f6594464cbc2f5013","schema_version":"1.0","event_id":"sha256:61654ab698190481ee95743406e923009771c91661b7740f6594464cbc2f5013"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFEIQNEAT7EGH5AOQVSUEDWGLT/bundle.json","state_url":"https://pith.science/pith/SFEIQNEAT7EGH5AOQVSUEDWGLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFEIQNEAT7EGH5AOQVSUEDWGLT/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-08T05:17:37Z","links":{"resolver":"https://pith.science/pith/SFEIQNEAT7EGH5AOQVSUEDWGLT","bundle":"https://pith.science/pith/SFEIQNEAT7EGH5AOQVSUEDWGLT/bundle.json","state":"https://pith.science/pith/SFEIQNEAT7EGH5AOQVSUEDWGLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFEIQNEAT7EGH5AOQVSUEDWGLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SFEIQNEAT7EGH5AOQVSUEDWGLT","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":"3509c595d733b83177a9528099ddef67630fa9d46f2be9bd22ccad78ed801d84","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-03T16:52:19Z","title_canon_sha256":"f6aa6f6549c9068b06e572fe0d8faa8e1e086006f7a78bd2c5e9315b43543e1b"},"schema_version":"1.0","source":{"id":"1809.00653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00653","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00653v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00653","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"SFEIQNEAT7EG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SFEIQNEAT7EGH5AO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SFEIQNEA","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:61654ab698190481ee95743406e923009771c91661b7740f6594464cbc2f5013","target":"graph","created_at":"2026-05-18T00:06:32Z","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":"Deep NLP models benefit from underlying structures in the data---e.g., parse trees---typically extracted using off-the-shelf parsers. Recent attempts to jointly learn the latent structure encounter a tradeoff: either make factorization assumptions that limit expressiveness, or sacrifice end-to-end differentiability. Using the recently proposed SparseMAP inference, which retrieves a sparse distribution over latent structures, we propose a novel approach for end-to-end learning of latent structure predictors jointly with a downstream predictor. To the best of our knowledge, our method is the fir","authors_text":"Andr\\'e F. T. Martins, Claire Cardie, Vlad Niculae","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-03T16:52:19Z","title":"Towards Dynamic Computation Graphs via Sparse Latent Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00653","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:55967e0d7096108b97f7a0fa1c86321327969322743a76a61243796c12830da3","target":"record","created_at":"2026-05-18T00:06:32Z","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":"3509c595d733b83177a9528099ddef67630fa9d46f2be9bd22ccad78ed801d84","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-03T16:52:19Z","title_canon_sha256":"f6aa6f6549c9068b06e572fe0d8faa8e1e086006f7a78bd2c5e9315b43543e1b"},"schema_version":"1.0","source":{"id":"1809.00653","kind":"arxiv","version":1}},"canonical_sha256":"91488834809fc863f40e8565420ec65cefe7e83d3c32792f88865b78417efe7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91488834809fc863f40e8565420ec65cefe7e83d3c32792f88865b78417efe7e","first_computed_at":"2026-05-18T00:06:32.862371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:32.862371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zZ3LuT1LBpvuGNRdk7JehaQrelIYsZpbYPDxfc+fO02D/Xy8ScuKUjppWJPLAELmX6GX6iRdtEMXQnBS26dKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:32.863080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55967e0d7096108b97f7a0fa1c86321327969322743a76a61243796c12830da3","sha256:61654ab698190481ee95743406e923009771c91661b7740f6594464cbc2f5013"],"state_sha256":"07ff80b1565f7e59e6b6b073ac4b6c7fe77a6898f028675008a0c77e81dbab85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axl0w770pvP0P9SMaIzvVOFMpdQcKZed7xZgT8Xz6SFcYSg0AnoaKqkAr3gCOWhfa5kkH6zR+KLA0raoTPqJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:17:37.161977Z","bundle_sha256":"f5273cffc46db694c2f29dc30b9aeb3e3bd9feaef44131e73696aa7e2e4a82ba"}}