{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5ODE6AU3LHYW2SJ6WMYEKXRCYM","short_pith_number":"pith:5ODE6AU3","schema_version":"1.0","canonical_sha256":"eb864f029b59f16d493eb330455e22c33011392ce15fcb66b2ef0809d0b718be","source":{"kind":"arxiv","id":"2105.00573","version":1},"attestation_state":"computed","paper":{"title":"Searchable Hidden Intermediates for End-to-End Models of Decomposable Sequence Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.AS"],"primary_cat":"cs.CL","authors_text":"Brian Yan, Florian Metze, Shinji Watanabe, Siddharth Dalmia, Vikas Raunak","submitted_at":"2021-05-02T23:22:49Z","abstract_excerpt":"End-to-end approaches for sequence tasks are becoming increasingly popular. Yet for complex sequence tasks, like speech translation, systems that cascade several models trained on sub-tasks have shown to be superior, suggesting that the compositionality of cascaded systems simplifies learning and enables sophisticated search capabilities. In this work, we present an end-to-end framework that exploits compositionality to learn searchable hidden representations at intermediate stages of a sequence model using decomposed sub-tasks. These hidden intermediates can be improved using beam search to e"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2105.00573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2021-05-02T23:22:49Z","cross_cats_sorted":["eess.AS"],"title_canon_sha256":"1979b3b79adc3e8a8a372df4dd893681d7fac1ac5af6523620f5cd730ece4913","abstract_canon_sha256":"82bec8fb7622a8425b41cbf021798715a37bef08f31f6f4a7dd31366ba610e5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:55.625403Z","signature_b64":"GLfp08sJ1kqpLPl8tr134NLhAWrvuTja/BPXSzrfchGqnQP8glSBPKiZeRppDaZi69m4f970fdMi95CYIKOXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb864f029b59f16d493eb330455e22c33011392ce15fcb66b2ef0809d0b718be","last_reissued_at":"2026-07-05T02:36:55.624913Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:55.624913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searchable Hidden Intermediates for End-to-End Models of Decomposable Sequence Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.AS"],"primary_cat":"cs.CL","authors_text":"Brian Yan, Florian Metze, Shinji Watanabe, Siddharth Dalmia, Vikas Raunak","submitted_at":"2021-05-02T23:22:49Z","abstract_excerpt":"End-to-end approaches for sequence tasks are becoming increasingly popular. Yet for complex sequence tasks, like speech translation, systems that cascade several models trained on sub-tasks have shown to be superior, suggesting that the compositionality of cascaded systems simplifies learning and enables sophisticated search capabilities. In this work, we present an end-to-end framework that exploits compositionality to learn searchable hidden representations at intermediate stages of a sequence model using decomposed sub-tasks. These hidden intermediates can be improved using beam search to e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.00573","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.00573/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.00573","created_at":"2026-07-05T02:36:55.624969+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.00573v1","created_at":"2026-07-05T02:36:55.624969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.00573","created_at":"2026-07-05T02:36:55.624969+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ODE6AU3LHYW","created_at":"2026-07-05T02:36:55.624969+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ODE6AU3LHYW2SJ6","created_at":"2026-07-05T02:36:55.624969+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ODE6AU3","created_at":"2026-07-05T02:36:55.624969+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ODE6AU3LHYW2SJ6WMYEKXRCYM","json":"https://pith.science/pith/5ODE6AU3LHYW2SJ6WMYEKXRCYM.json","graph_json":"https://pith.science/api/pith-number/5ODE6AU3LHYW2SJ6WMYEKXRCYM/graph.json","events_json":"https://pith.science/api/pith-number/5ODE6AU3LHYW2SJ6WMYEKXRCYM/events.json","paper":"https://pith.science/paper/5ODE6AU3"},"agent_actions":{"view_html":"https://pith.science/pith/5ODE6AU3LHYW2SJ6WMYEKXRCYM","download_json":"https://pith.science/pith/5ODE6AU3LHYW2SJ6WMYEKXRCYM.json","view_paper":"https://pith.science/paper/5ODE6AU3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.00573&json=true","fetch_graph":"https://pith.science/api/pith-number/5ODE6AU3LHYW2SJ6WMYEKXRCYM/graph.json","fetch_events":"https://pith.science/api/pith-number/5ODE6AU3LHYW2SJ6WMYEKXRCYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ODE6AU3LHYW2SJ6WMYEKXRCYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ODE6AU3LHYW2SJ6WMYEKXRCYM/action/storage_attestation","attest_author":"https://pith.science/pith/5ODE6AU3LHYW2SJ6WMYEKXRCYM/action/author_attestation","sign_citation":"https://pith.science/pith/5ODE6AU3LHYW2SJ6WMYEKXRCYM/action/citation_signature","submit_replication":"https://pith.science/pith/5ODE6AU3LHYW2SJ6WMYEKXRCYM/action/replication_record"}},"created_at":"2026-07-05T02:36:55.624969+00:00","updated_at":"2026-07-05T02:36:55.624969+00:00"}