{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2CJPGKFYRW6MYIBKQTXV5ESI3C","short_pith_number":"pith:2CJPGKFY","schema_version":"1.0","canonical_sha256":"d092f328b88dbccc202a84ef5e9248d888fc35a513f7507ff5cc390e54ec4055","source":{"kind":"arxiv","id":"1603.05629","version":5},"attestation_state":"computed","paper":{"title":"Discriminative Embeddings of Latent Variable Models for Structured Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Dai, Hanjun Dai, Le Song","submitted_at":"2016-03-17T19:29:46Z","abstract_excerpt":"Kernel classifiers and regressors designed for structured data, such as sequences, trees and graphs, have significantly advanced a number of interdisciplinary areas such as computational biology and drug design. Typically, kernels are designed beforehand for a data type which either exploit statistics of the structures or make use of probabilistic generative models, and then a discriminative classifier is learned based on the kernels via convex optimization. However, such an elegant two-stage approach also limited kernel methods from scaling up to millions of data points, and exploiting discri"},"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":"1603.05629","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-17T19:29:46Z","cross_cats_sorted":[],"title_canon_sha256":"2b2c15d80a9fd244d4448b0c21aecc520e7a1b3b89f170ca77a0a662e8ea3a6b","abstract_canon_sha256":"fd6487233b6229a4cb79976867d091acdd586550856461ddb49a990e93aea2bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:32:45.925087Z","signature_b64":"3ItlVaz+CcIMVY/UO+Eg5O9TRDhNnD5Y4rbErEtJgKbcppWi0Bxi5FkxqU7GHhSDVwUs9hF7aMrqjqoQdjQzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d092f328b88dbccc202a84ef5e9248d888fc35a513f7507ff5cc390e54ec4055","last_reissued_at":"2026-07-05T00:32:45.924747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:32:45.924747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discriminative Embeddings of Latent Variable Models for Structured Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Dai, Hanjun Dai, Le Song","submitted_at":"2016-03-17T19:29:46Z","abstract_excerpt":"Kernel classifiers and regressors designed for structured data, such as sequences, trees and graphs, have significantly advanced a number of interdisciplinary areas such as computational biology and drug design. Typically, kernels are designed beforehand for a data type which either exploit statistics of the structures or make use of probabilistic generative models, and then a discriminative classifier is learned based on the kernels via convex optimization. However, such an elegant two-stage approach also limited kernel methods from scaling up to millions of data points, and exploiting discri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05629","kind":"arxiv","version":5},"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/1603.05629/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":"1603.05629","created_at":"2026-07-05T00:32:45.924802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05629v5","created_at":"2026-07-05T00:32:45.924802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05629","created_at":"2026-07-05T00:32:45.924802+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CJPGKFYRW6M","created_at":"2026-07-05T00:32:45.924802+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CJPGKFYRW6MYIBK","created_at":"2026-07-05T00:32:45.924802+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CJPGKFY","created_at":"2026-07-05T00:32:45.924802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02065","citing_title":"Sparse hierarchical representation learning on molecular graphs","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2CJPGKFYRW6MYIBKQTXV5ESI3C","json":"https://pith.science/pith/2CJPGKFYRW6MYIBKQTXV5ESI3C.json","graph_json":"https://pith.science/api/pith-number/2CJPGKFYRW6MYIBKQTXV5ESI3C/graph.json","events_json":"https://pith.science/api/pith-number/2CJPGKFYRW6MYIBKQTXV5ESI3C/events.json","paper":"https://pith.science/paper/2CJPGKFY"},"agent_actions":{"view_html":"https://pith.science/pith/2CJPGKFYRW6MYIBKQTXV5ESI3C","download_json":"https://pith.science/pith/2CJPGKFYRW6MYIBKQTXV5ESI3C.json","view_paper":"https://pith.science/paper/2CJPGKFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05629&json=true","fetch_graph":"https://pith.science/api/pith-number/2CJPGKFYRW6MYIBKQTXV5ESI3C/graph.json","fetch_events":"https://pith.science/api/pith-number/2CJPGKFYRW6MYIBKQTXV5ESI3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CJPGKFYRW6MYIBKQTXV5ESI3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CJPGKFYRW6MYIBKQTXV5ESI3C/action/storage_attestation","attest_author":"https://pith.science/pith/2CJPGKFYRW6MYIBKQTXV5ESI3C/action/author_attestation","sign_citation":"https://pith.science/pith/2CJPGKFYRW6MYIBKQTXV5ESI3C/action/citation_signature","submit_replication":"https://pith.science/pith/2CJPGKFYRW6MYIBKQTXV5ESI3C/action/replication_record"}},"created_at":"2026-07-05T00:32:45.924802+00:00","updated_at":"2026-07-05T00:32:45.924802+00:00"}