{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GPDIU4K7UYKLC7DV72DA5BGIWF","short_pith_number":"pith:GPDIU4K7","canonical_record":{"source":{"id":"1909.06434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-13T20:23:40Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"a65e8224af97888d9f82a6d37fec18b4932266154b2d50c2cf28b9bcafbfb990","abstract_canon_sha256":"f93af39f54f562a3f6cce0add85e0c39fe44da9ec0f823420705066a84527617"},"schema_version":"1.0"},"canonical_sha256":"33c68a715fa614b17c75fe860e84c8b1412e93ca3c337b7493b0d2f0a83a1ae3","source":{"kind":"arxiv","id":"1909.06434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.06434","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"1909.06434v1","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06434","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"GPDIU4K7UYKL","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"GPDIU4K7UYKLC7DV","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"GPDIU4K7","created_at":"2026-07-05T00:04:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GPDIU4K7UYKLC7DV72DA5BGIWF","target":"record","payload":{"canonical_record":{"source":{"id":"1909.06434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-13T20:23:40Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"a65e8224af97888d9f82a6d37fec18b4932266154b2d50c2cf28b9bcafbfb990","abstract_canon_sha256":"f93af39f54f562a3f6cce0add85e0c39fe44da9ec0f823420705066a84527617"},"schema_version":"1.0"},"canonical_sha256":"33c68a715fa614b17c75fe860e84c8b1412e93ca3c337b7493b0d2f0a83a1ae3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:46.031487Z","signature_b64":"N23som1dv3uSAkgVYvagw9qWOqpbc9PczqEout2V3EyMEH8r3MGJyTsg3c77DePXKZErQ94de+DRXHMpiHO+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33c68a715fa614b17c75fe860e84c8b1412e93ca3c337b7493b0d2f0a83a1ae3","last_reissued_at":"2026-07-05T00:04:46.031094Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:46.031094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.06434","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-07-05T00:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKH0C1uE+1oS917flH0rjKvC4YKcOGeiHmpQB2lgrZmBkVMefq1enCd5VnB7aWXSCzQu3HWVpb+kzd3h73oWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:24:23.489392Z"},"content_sha256":"5e779aa63c3e197aea17257b6e780f255b23d4bc442b2ffde2e8f81fb990c6dc","schema_version":"1.0","event_id":"sha256:5e779aa63c3e197aea17257b6e780f255b23d4bc442b2ffde2e8f81fb990c6dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GPDIU4K7UYKLC7DV72DA5BGIWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Scheduling for Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Melvin Johnson, Orhan Firat, S\\'ebastien Jean","submitted_at":"2019-09-13T20:23:40Z","abstract_excerpt":"To train neural machine translation models simultaneously on multiple tasks (languages), it is common to sample each task uniformly or in proportion to dataset sizes. As these methods offer little control over performance trade-offs, we explore different task scheduling approaches. We first consider existing non-adaptive techniques, then move on to adaptive schedules that over-sample tasks with poorer results compared to their respective baseline. As explicit schedules can be inefficient, especially if one task is highly over-sampled, we also consider implicit schedules, learning to scale lear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06434","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/1909.06434/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"},"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-07-05T00:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d0UQo44tToUjbUhEhEPUtSge/lhOQJpZn77D0aMydYX9N4cr/xzJuOLge4+dKClgfHaoi4U4vDLk0FR7IjuvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:24:23.489732Z"},"content_sha256":"1782e4134356baaa333cf17216a6450d669a5ad2eccb5fd75ca0a57d536e0b4c","schema_version":"1.0","event_id":"sha256:1782e4134356baaa333cf17216a6450d669a5ad2eccb5fd75ca0a57d536e0b4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPDIU4K7UYKLC7DV72DA5BGIWF/bundle.json","state_url":"https://pith.science/pith/GPDIU4K7UYKLC7DV72DA5BGIWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPDIU4K7UYKLC7DV72DA5BGIWF/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-08-18T06:24:23Z","links":{"resolver":"https://pith.science/pith/GPDIU4K7UYKLC7DV72DA5BGIWF","bundle":"https://pith.science/pith/GPDIU4K7UYKLC7DV72DA5BGIWF/bundle.json","state":"https://pith.science/pith/GPDIU4K7UYKLC7DV72DA5BGIWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPDIU4K7UYKLC7DV72DA5BGIWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GPDIU4K7UYKLC7DV72DA5BGIWF","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":"f93af39f54f562a3f6cce0add85e0c39fe44da9ec0f823420705066a84527617","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-13T20:23:40Z","title_canon_sha256":"a65e8224af97888d9f82a6d37fec18b4932266154b2d50c2cf28b9bcafbfb990"},"schema_version":"1.0","source":{"id":"1909.06434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.06434","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"1909.06434v1","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06434","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"GPDIU4K7UYKL","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"GPDIU4K7UYKLC7DV","created_at":"2026-07-05T00:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"GPDIU4K7","created_at":"2026-07-05T00:04:46Z"}],"graph_snapshots":[{"event_id":"sha256:1782e4134356baaa333cf17216a6450d669a5ad2eccb5fd75ca0a57d536e0b4c","target":"graph","created_at":"2026-07-05T00:04:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.06434/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To train neural machine translation models simultaneously on multiple tasks (languages), it is common to sample each task uniformly or in proportion to dataset sizes. As these methods offer little control over performance trade-offs, we explore different task scheduling approaches. We first consider existing non-adaptive techniques, then move on to adaptive schedules that over-sample tasks with poorer results compared to their respective baseline. As explicit schedules can be inefficient, especially if one task is highly over-sampled, we also consider implicit schedules, learning to scale lear","authors_text":"Melvin Johnson, Orhan Firat, S\\'ebastien Jean","cross_cats":["cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-13T20:23:40Z","title":"Adaptive Scheduling for Multi-Task Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06434","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:5e779aa63c3e197aea17257b6e780f255b23d4bc442b2ffde2e8f81fb990c6dc","target":"record","created_at":"2026-07-05T00:04:46Z","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":"f93af39f54f562a3f6cce0add85e0c39fe44da9ec0f823420705066a84527617","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-13T20:23:40Z","title_canon_sha256":"a65e8224af97888d9f82a6d37fec18b4932266154b2d50c2cf28b9bcafbfb990"},"schema_version":"1.0","source":{"id":"1909.06434","kind":"arxiv","version":1}},"canonical_sha256":"33c68a715fa614b17c75fe860e84c8b1412e93ca3c337b7493b0d2f0a83a1ae3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33c68a715fa614b17c75fe860e84c8b1412e93ca3c337b7493b0d2f0a83a1ae3","first_computed_at":"2026-07-05T00:04:46.031094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:04:46.031094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N23som1dv3uSAkgVYvagw9qWOqpbc9PczqEout2V3EyMEH8r3MGJyTsg3c77DePXKZErQ94de+DRXHMpiHO+Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:04:46.031487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.06434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e779aa63c3e197aea17257b6e780f255b23d4bc442b2ffde2e8f81fb990c6dc","sha256:1782e4134356baaa333cf17216a6450d669a5ad2eccb5fd75ca0a57d536e0b4c"],"state_sha256":"c166629f04589caf91de781923cabe0f1d49629baee01450d48b90477a52d0f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvww2JrZOosm7/H2ut/fihVAQ8Due6QzwY60HbKNzJhImyGoUoqFqZ5u9yqMFRVrx+h4foJOebOMDXwtWSqECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T06:24:23.493324Z","bundle_sha256":"f8c1faf83d4b119bca1f911a6cc1ee8ff9600e003ff32bd8d101436a601e4fc9"}}