{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S2RHSRPTE2RB3727ZRH6XXF5Y6","short_pith_number":"pith:S2RHSRPT","canonical_record":{"source":{"id":"1706.07867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-23T21:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"0fe58999a2b1a2a6735a0ac0be77f2b5ef2817ca3ebb4e672854c60ecd899752","abstract_canon_sha256":"9cb486732465ef98576bb6d47537f08b905c09e8db4d6c6088da4d2f70e10bac"},"schema_version":"1.0"},"canonical_sha256":"96a27945f326a21dff5fcc4febdcbdc7834d3e50b4d6fa135a8fb83de97d5ba3","source":{"kind":"arxiv","id":"1706.07867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07867","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07867v1","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07867","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"S2RHSRPTE2RB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S2RHSRPTE2RB3727","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S2RHSRPT","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S2RHSRPTE2RB3727ZRH6XXF5Y6","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-23T21:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"0fe58999a2b1a2a6735a0ac0be77f2b5ef2817ca3ebb4e672854c60ecd899752","abstract_canon_sha256":"9cb486732465ef98576bb6d47537f08b905c09e8db4d6c6088da4d2f70e10bac"},"schema_version":"1.0"},"canonical_sha256":"96a27945f326a21dff5fcc4febdcbdc7834d3e50b4d6fa135a8fb83de97d5ba3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:47.341129Z","signature_b64":"36bjaRmmtkWbtVSKLUX3kmKRzZPe4Lcq9Q77iN+L8L+qJr0oerb8iOqDp8ZpgPlA/XGL5TABdlrVXKcQYAyUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96a27945f326a21dff5fcc4febdcbdc7834d3e50b4d6fa135a8fb83de97d5ba3","last_reissued_at":"2026-05-18T00:41:47.340518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:47.340518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07867","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:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yVFn/oIDT4tmK51EhsZvzYG4huqTWyFgS6kSACMQ9KzIqUuiMNG7ld05TYXbJ6DLz73KhEH8hHnevSgfXg4ECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:43:22.147670Z"},"content_sha256":"84b2f5b7a04b89a36b464365c2242a0c6cfc6b0ea2fcf9ed5c40bf2e1729ddd5","schema_version":"1.0","event_id":"sha256:84b2f5b7a04b89a36b464365c2242a0c6cfc6b0ea2fcf9ed5c40bf2e1729ddd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S2RHSRPTE2RB3727ZRH6XXF5Y6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Preserving Intermediate Objectives: One Simple Trick to Improve Learning for Hierarchical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abhilasha Ravichander, Chirag Nagpal, Louis-Philippe Morency, Rajat Kulshreshtha, Shruti Rijhwani, Tadas Baltru\\v{s}aitis","submitted_at":"2017-06-23T21:16:18Z","abstract_excerpt":"Hierarchical models are utilized in a wide variety of problems which are characterized by task hierarchies, where predictions on smaller subtasks are useful for trying to predict a final task. Typically, neural networks are first trained for the subtasks, and the predictions of these networks are subsequently used as additional features when training a model and doing inference for a final task. In this work, we focus on improving learning for such hierarchical models and demonstrate our method on the task of speaker trait prediction. Speaker trait prediction aims to computationally identify w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07867","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:41:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKTCkpONwcGCQmJfLrSIMW5ju+lrn29qck0vaZ6NrIDoK8buupu/3zD/shU9QlsdXAtd47y8UaAKTh/NTfw2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:43:22.148048Z"},"content_sha256":"2617fea3d4ed44363be0628f675cd06f6e42efc6574b3319d899e65ba6d1b339","schema_version":"1.0","event_id":"sha256:2617fea3d4ed44363be0628f675cd06f6e42efc6574b3319d899e65ba6d1b339"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2RHSRPTE2RB3727ZRH6XXF5Y6/bundle.json","state_url":"https://pith.science/pith/S2RHSRPTE2RB3727ZRH6XXF5Y6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2RHSRPTE2RB3727ZRH6XXF5Y6/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-05-27T12:43:22Z","links":{"resolver":"https://pith.science/pith/S2RHSRPTE2RB3727ZRH6XXF5Y6","bundle":"https://pith.science/pith/S2RHSRPTE2RB3727ZRH6XXF5Y6/bundle.json","state":"https://pith.science/pith/S2RHSRPTE2RB3727ZRH6XXF5Y6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2RHSRPTE2RB3727ZRH6XXF5Y6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S2RHSRPTE2RB3727ZRH6XXF5Y6","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":"9cb486732465ef98576bb6d47537f08b905c09e8db4d6c6088da4d2f70e10bac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-23T21:16:18Z","title_canon_sha256":"0fe58999a2b1a2a6735a0ac0be77f2b5ef2817ca3ebb4e672854c60ecd899752"},"schema_version":"1.0","source":{"id":"1706.07867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07867","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07867v1","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07867","created_at":"2026-05-18T00:41:47Z"},{"alias_kind":"pith_short_12","alias_value":"S2RHSRPTE2RB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S2RHSRPTE2RB3727","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S2RHSRPT","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:2617fea3d4ed44363be0628f675cd06f6e42efc6574b3319d899e65ba6d1b339","target":"graph","created_at":"2026-05-18T00:41:47Z","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":"Hierarchical models are utilized in a wide variety of problems which are characterized by task hierarchies, where predictions on smaller subtasks are useful for trying to predict a final task. Typically, neural networks are first trained for the subtasks, and the predictions of these networks are subsequently used as additional features when training a model and doing inference for a final task. In this work, we focus on improving learning for such hierarchical models and demonstrate our method on the task of speaker trait prediction. Speaker trait prediction aims to computationally identify w","authors_text":"Abhilasha Ravichander, Chirag Nagpal, Louis-Philippe Morency, Rajat Kulshreshtha, Shruti Rijhwani, Tadas Baltru\\v{s}aitis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-23T21:16:18Z","title":"Preserving Intermediate Objectives: One Simple Trick to Improve Learning for Hierarchical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07867","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:84b2f5b7a04b89a36b464365c2242a0c6cfc6b0ea2fcf9ed5c40bf2e1729ddd5","target":"record","created_at":"2026-05-18T00:41:47Z","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":"9cb486732465ef98576bb6d47537f08b905c09e8db4d6c6088da4d2f70e10bac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-23T21:16:18Z","title_canon_sha256":"0fe58999a2b1a2a6735a0ac0be77f2b5ef2817ca3ebb4e672854c60ecd899752"},"schema_version":"1.0","source":{"id":"1706.07867","kind":"arxiv","version":1}},"canonical_sha256":"96a27945f326a21dff5fcc4febdcbdc7834d3e50b4d6fa135a8fb83de97d5ba3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96a27945f326a21dff5fcc4febdcbdc7834d3e50b4d6fa135a8fb83de97d5ba3","first_computed_at":"2026-05-18T00:41:47.340518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:47.340518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"36bjaRmmtkWbtVSKLUX3kmKRzZPe4Lcq9Q77iN+L8L+qJr0oerb8iOqDp8ZpgPlA/XGL5TABdlrVXKcQYAyUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:47.341129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84b2f5b7a04b89a36b464365c2242a0c6cfc6b0ea2fcf9ed5c40bf2e1729ddd5","sha256:2617fea3d4ed44363be0628f675cd06f6e42efc6574b3319d899e65ba6d1b339"],"state_sha256":"e15ea64359a5350f1f16ec1f0b58faa0c8bff5878bd4383a4a0d6dfcee21327e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkssvnYENtJfbHBNuKZYDdI6/dgNs4+9491Vbb3gSoh9aAksyOUQeb2nxbum34Vs1CkYnINSaQX6VXpiqI5XDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:43:22.150394Z","bundle_sha256":"14d6e787b5f74b919d04f8f23b6181634486b9f0ab8f679e41c83d9c90274d04"}}