{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4LSP2LQ4XCU4W6BMIITQY5H2LW","short_pith_number":"pith:4LSP2LQ4","schema_version":"1.0","canonical_sha256":"e2e4fd2e1cb8a9cb782c42270c74fa5d9c17d7a9663a9eab11da50d3d28a2b15","source":{"kind":"arxiv","id":"1412.1463","version":2},"attestation_state":"computed","paper":{"title":"On the String Kernel Pre-Image Problem with Applications in Drug Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.LG","authors_text":"Am\\'elie Rolland, Fran\\c{c}ois Laviolette, Mario Marchand, S\\'ebastien Gigu\\`ere","submitted_at":"2014-12-03T20:33:57Z","abstract_excerpt":"The pre-image problem has to be solved during inference by most structured output predictors. For string kernels, this problem corresponds to finding the string associated to a given input. An algorithm capable of solving or finding good approximations to this problem would have many applications in computational biology and other fields. This work uses a recent result on combinatorial optimization of linear predictors based on string kernels to develop, for the pre-image, a low complexity upper bound valid for many string kernels. This upper bound is used with success in a branch and bound se"},"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":"1412.1463","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-03T20:33:57Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"678ad46b87116f76ae0d8ec6a38c6c24884717fc47c1c33a73886c777b79f1b7","abstract_canon_sha256":"5db8a22d19966e7b7d2d22445013c3c98226c19c56643de0ef6dff622e3bf021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:07.089941Z","signature_b64":"3t9CPsxCQr9vqanpKYgNuFNbyy7cD/GmQKW/7p3dX+f44IRq4mvAZnImk91UT2GnVdm7cFvpFahBdaIore3KDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2e4fd2e1cb8a9cb782c42270c74fa5d9c17d7a9663a9eab11da50d3d28a2b15","last_reissued_at":"2026-05-18T02:32:07.089579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:07.089579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the String Kernel Pre-Image Problem with Applications in Drug Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.LG","authors_text":"Am\\'elie Rolland, Fran\\c{c}ois Laviolette, Mario Marchand, S\\'ebastien Gigu\\`ere","submitted_at":"2014-12-03T20:33:57Z","abstract_excerpt":"The pre-image problem has to be solved during inference by most structured output predictors. For string kernels, this problem corresponds to finding the string associated to a given input. An algorithm capable of solving or finding good approximations to this problem would have many applications in computational biology and other fields. This work uses a recent result on combinatorial optimization of linear predictors based on string kernels to develop, for the pre-image, a low complexity upper bound valid for many string kernels. This upper bound is used with success in a branch and bound se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1463","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.1463","created_at":"2026-05-18T02:32:07.089642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1463v2","created_at":"2026-05-18T02:32:07.089642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1463","created_at":"2026-05-18T02:32:07.089642+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LSP2LQ4XCU4","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LSP2LQ4XCU4W6BM","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LSP2LQ4","created_at":"2026-05-18T12:28:14.216126+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/4LSP2LQ4XCU4W6BMIITQY5H2LW","json":"https://pith.science/pith/4LSP2LQ4XCU4W6BMIITQY5H2LW.json","graph_json":"https://pith.science/api/pith-number/4LSP2LQ4XCU4W6BMIITQY5H2LW/graph.json","events_json":"https://pith.science/api/pith-number/4LSP2LQ4XCU4W6BMIITQY5H2LW/events.json","paper":"https://pith.science/paper/4LSP2LQ4"},"agent_actions":{"view_html":"https://pith.science/pith/4LSP2LQ4XCU4W6BMIITQY5H2LW","download_json":"https://pith.science/pith/4LSP2LQ4XCU4W6BMIITQY5H2LW.json","view_paper":"https://pith.science/paper/4LSP2LQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1463&json=true","fetch_graph":"https://pith.science/api/pith-number/4LSP2LQ4XCU4W6BMIITQY5H2LW/graph.json","fetch_events":"https://pith.science/api/pith-number/4LSP2LQ4XCU4W6BMIITQY5H2LW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LSP2LQ4XCU4W6BMIITQY5H2LW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LSP2LQ4XCU4W6BMIITQY5H2LW/action/storage_attestation","attest_author":"https://pith.science/pith/4LSP2LQ4XCU4W6BMIITQY5H2LW/action/author_attestation","sign_citation":"https://pith.science/pith/4LSP2LQ4XCU4W6BMIITQY5H2LW/action/citation_signature","submit_replication":"https://pith.science/pith/4LSP2LQ4XCU4W6BMIITQY5H2LW/action/replication_record"}},"created_at":"2026-05-18T02:32:07.089642+00:00","updated_at":"2026-05-18T02:32:07.089642+00:00"}