{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CTLJ5ELLA2SOGA3BWIZFXAJ7AA","short_pith_number":"pith:CTLJ5ELL","canonical_record":{"source":{"id":"1705.02562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-07T04:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"d7da8587fa9df66db8b47d26270390dc82e0073a6ac0914204dc64ece208d123","abstract_canon_sha256":"f1bb645b43799affa11e3b2278a803b524824acb896f43b80de43b04e3d1dd15"},"schema_version":"1.0"},"canonical_sha256":"14d69e916b06a4e30361b2325b813f000a5a659450da4b1479f995d77201fcf7","source":{"kind":"arxiv","id":"1705.02562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02562","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02562v1","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02562","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"CTLJ5ELLA2SO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CTLJ5ELLA2SOGA3B","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CTLJ5ELL","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CTLJ5ELLA2SOGA3BWIZFXAJ7AA","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-07T04:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"d7da8587fa9df66db8b47d26270390dc82e0073a6ac0914204dc64ece208d123","abstract_canon_sha256":"f1bb645b43799affa11e3b2278a803b524824acb896f43b80de43b04e3d1dd15"},"schema_version":"1.0"},"canonical_sha256":"14d69e916b06a4e30361b2325b813f000a5a659450da4b1479f995d77201fcf7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:56.198720Z","signature_b64":"7YuztW5hokSrGLg+QU911up9lG3pON80AEjOUJhUU8mA5YDv8dBANLyOtDyqxUKbuNT2fPjO5YEkqyXoWPbYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14d69e916b06a4e30361b2325b813f000a5a659450da4b1479f995d77201fcf7","last_reissued_at":"2026-05-18T00:44:56.198015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:56.198015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02562","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:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2NZxaltNfpdd/sxhYTiA+CLFlDRIN88NlGfUA5TS5NFlXrFvZ8626xp2XCFeduQ3maQiVsr6YzwvbBBPsAx7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:08:50.782236Z"},"content_sha256":"4626d9da1dcd08d23c5510e7b880423744291c9d9215113bcf5fbb28a278ac37","schema_version":"1.0","event_id":"sha256:4626d9da1dcd08d23c5510e7b880423744291c9d9215113bcf5fbb28a278ac37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CTLJ5ELLA2SOGA3BWIZFXAJ7AA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Discriminative Relational Features for Sequence Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ajay Nagesh, Ganesh Ramakrishnan, Naveen Nair","submitted_at":"2017-05-07T04:37:53Z","abstract_excerpt":"Discovering relational structure between input features in sequence labeling models has shown to improve their accuracy in several problem settings. However, the search space of relational features is exponential in the number of basic input features. Consequently, approaches that learn relational features, tend to follow a greedy search strategy. In this paper, we study the possibility of optimally learning and applying discriminative relational features for sequence labeling. For learning features derived from inputs at a particular sequence position, we propose a Hierarchical Kernels-based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02562","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:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1B+0inElsJYqkrBIxNhiUbpEmR3s926xRbdCfcAGgBaLgYH3D8NP+yi9lChy6YB+PcRFN0q7c9jXOaYKEs3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:08:50.782601Z"},"content_sha256":"b6906ae10c005e91f51bb631e9a6a537e9b6c14f0a14ea0da60c8d9705047168","schema_version":"1.0","event_id":"sha256:b6906ae10c005e91f51bb631e9a6a537e9b6c14f0a14ea0da60c8d9705047168"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTLJ5ELLA2SOGA3BWIZFXAJ7AA/bundle.json","state_url":"https://pith.science/pith/CTLJ5ELLA2SOGA3BWIZFXAJ7AA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTLJ5ELLA2SOGA3BWIZFXAJ7AA/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-24T09:08:50Z","links":{"resolver":"https://pith.science/pith/CTLJ5ELLA2SOGA3BWIZFXAJ7AA","bundle":"https://pith.science/pith/CTLJ5ELLA2SOGA3BWIZFXAJ7AA/bundle.json","state":"https://pith.science/pith/CTLJ5ELLA2SOGA3BWIZFXAJ7AA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTLJ5ELLA2SOGA3BWIZFXAJ7AA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CTLJ5ELLA2SOGA3BWIZFXAJ7AA","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":"f1bb645b43799affa11e3b2278a803b524824acb896f43b80de43b04e3d1dd15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-07T04:37:53Z","title_canon_sha256":"d7da8587fa9df66db8b47d26270390dc82e0073a6ac0914204dc64ece208d123"},"schema_version":"1.0","source":{"id":"1705.02562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02562","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02562v1","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02562","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"CTLJ5ELLA2SO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CTLJ5ELLA2SOGA3B","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CTLJ5ELL","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:b6906ae10c005e91f51bb631e9a6a537e9b6c14f0a14ea0da60c8d9705047168","target":"graph","created_at":"2026-05-18T00:44:56Z","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":"Discovering relational structure between input features in sequence labeling models has shown to improve their accuracy in several problem settings. However, the search space of relational features is exponential in the number of basic input features. Consequently, approaches that learn relational features, tend to follow a greedy search strategy. In this paper, we study the possibility of optimally learning and applying discriminative relational features for sequence labeling. For learning features derived from inputs at a particular sequence position, we propose a Hierarchical Kernels-based ","authors_text":"Ajay Nagesh, Ganesh Ramakrishnan, Naveen Nair","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-07T04:37:53Z","title":"Learning Discriminative Relational Features for Sequence Labeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02562","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:4626d9da1dcd08d23c5510e7b880423744291c9d9215113bcf5fbb28a278ac37","target":"record","created_at":"2026-05-18T00:44:56Z","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":"f1bb645b43799affa11e3b2278a803b524824acb896f43b80de43b04e3d1dd15","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-07T04:37:53Z","title_canon_sha256":"d7da8587fa9df66db8b47d26270390dc82e0073a6ac0914204dc64ece208d123"},"schema_version":"1.0","source":{"id":"1705.02562","kind":"arxiv","version":1}},"canonical_sha256":"14d69e916b06a4e30361b2325b813f000a5a659450da4b1479f995d77201fcf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14d69e916b06a4e30361b2325b813f000a5a659450da4b1479f995d77201fcf7","first_computed_at":"2026-05-18T00:44:56.198015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:56.198015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7YuztW5hokSrGLg+QU911up9lG3pON80AEjOUJhUU8mA5YDv8dBANLyOtDyqxUKbuNT2fPjO5YEkqyXoWPbYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:56.198720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4626d9da1dcd08d23c5510e7b880423744291c9d9215113bcf5fbb28a278ac37","sha256:b6906ae10c005e91f51bb631e9a6a537e9b6c14f0a14ea0da60c8d9705047168"],"state_sha256":"951c4d9570e4329af1090a9b999ecbd9fd4da654a957c95e9c67ff5acfc2e915"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KwreBoE9JH1kM9hv2VDh4BVx366oXt2oSHACMok3ilK8kys2YZEXZmDDr8p7/O+iXZQMfjI6CPrSZIaNvYQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:08:50.784587Z","bundle_sha256":"5b895a5ed3f1d6ff466da1aa9cd2a3dce6539b3b64296e30f0495aaf85780a55"}}