{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LMEP36JV7DQBR4E2PPMXH5RZHR","short_pith_number":"pith:LMEP36JV","schema_version":"1.0","canonical_sha256":"5b08fdf935f8e018f09a7bd973f6393c7949e1e5ea8b87ddceb3267c8dd79d77","source":{"kind":"arxiv","id":"1403.5177","version":1},"attestation_state":"computed","paper":{"title":"Sparse Learning over Infinite Subgraph Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Hiroshi Mamitsuka, Ichigaku Takigawa","submitted_at":"2014-03-20T15:44:56Z","abstract_excerpt":"We present a supervised-learning algorithm from graph data (a set of graphs) for arbitrary twice-differentiable loss functions and sparse linear models over all possible subgraph features. To date, it has been shown that under all possible subgraph features, several types of sparse learning, such as Adaboost, LPBoost, LARS/LASSO, and sparse PLS regression, can be performed. Particularly emphasis is placed on simultaneous learning of relevant features from an infinite set of candidates. We first generalize techniques used in all these preceding studies to derive an unifying bounding technique f"},"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":"1403.5177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-20T15:44:56Z","cross_cats_sorted":[],"title_canon_sha256":"1f45d2333aa838f0f550bb9e89d5b22c8fb92219d5afee97ffc61ef01539ca95","abstract_canon_sha256":"3c973172baaa560e190c2fafe637ab98b0a154ae300926121b1aa634d01108b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:58.052094Z","signature_b64":"1Bh+Q9EuELZBZhbVbF3TNJHTxx1iIzlchxOfzex66rHERmxkJzAOe6yvJDu2cWr4vtmv6iHu+8tcqnPM3my0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b08fdf935f8e018f09a7bd973f6393c7949e1e5ea8b87ddceb3267c8dd79d77","last_reissued_at":"2026-05-18T02:55:58.051586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:58.051586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Learning over Infinite Subgraph Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Hiroshi Mamitsuka, Ichigaku Takigawa","submitted_at":"2014-03-20T15:44:56Z","abstract_excerpt":"We present a supervised-learning algorithm from graph data (a set of graphs) for arbitrary twice-differentiable loss functions and sparse linear models over all possible subgraph features. To date, it has been shown that under all possible subgraph features, several types of sparse learning, such as Adaboost, LPBoost, LARS/LASSO, and sparse PLS regression, can be performed. Particularly emphasis is placed on simultaneous learning of relevant features from an infinite set of candidates. We first generalize techniques used in all these preceding studies to derive an unifying bounding technique f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5177","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.5177","created_at":"2026-05-18T02:55:58.051653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5177v1","created_at":"2026-05-18T02:55:58.051653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5177","created_at":"2026-05-18T02:55:58.051653+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMEP36JV7DQB","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMEP36JV7DQBR4E2","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMEP36JV","created_at":"2026-05-18T12:28:38.356838+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/LMEP36JV7DQBR4E2PPMXH5RZHR","json":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR.json","graph_json":"https://pith.science/api/pith-number/LMEP36JV7DQBR4E2PPMXH5RZHR/graph.json","events_json":"https://pith.science/api/pith-number/LMEP36JV7DQBR4E2PPMXH5RZHR/events.json","paper":"https://pith.science/paper/LMEP36JV"},"agent_actions":{"view_html":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR","download_json":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR.json","view_paper":"https://pith.science/paper/LMEP36JV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5177&json=true","fetch_graph":"https://pith.science/api/pith-number/LMEP36JV7DQBR4E2PPMXH5RZHR/graph.json","fetch_events":"https://pith.science/api/pith-number/LMEP36JV7DQBR4E2PPMXH5RZHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/action/storage_attestation","attest_author":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/action/author_attestation","sign_citation":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/action/citation_signature","submit_replication":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/action/replication_record"}},"created_at":"2026-05-18T02:55:58.051653+00:00","updated_at":"2026-05-18T02:55:58.051653+00:00"}