{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LMEP36JV7DQBR4E2PPMXH5RZHR","short_pith_number":"pith:LMEP36JV","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"},"canonical_sha256":"5b08fdf935f8e018f09a7bd973f6393c7949e1e5ea8b87ddceb3267c8dd79d77","source":{"kind":"arxiv","id":"1403.5177","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5177","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5177v1","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5177","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"LMEP36JV7DQB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LMEP36JV7DQBR4E2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LMEP36JV","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LMEP36JV7DQBR4E2PPMXH5RZHR","target":"record","payload":{"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"},"canonical_sha256":"5b08fdf935f8e018f09a7bd973f6393c7949e1e5ea8b87ddceb3267c8dd79d77","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"},"source_kind":"arxiv","source_id":"1403.5177","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-18T02:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOz69tiBY+huS0LYYVwsrbWNjLFoDW9FcNnYjJx3/HzsSyyoY6U63EBrBS/UxgqySLBF1AC9bh+4wxMrK5cCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:25:09.595077Z"},"content_sha256":"a41b665fcb4d621a9f1bf15e0c8ed3a267928a03def4488c5669b9508c6f97e9","schema_version":"1.0","event_id":"sha256:a41b665fcb4d621a9f1bf15e0c8ed3a267928a03def4488c5669b9508c6f97e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LMEP36JV7DQBR4E2PPMXH5RZHR","target":"graph","payload":{"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"},"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-18T02:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bHkyoD7IsSW01/Dqj9iDVkT4aSJvGe9p81tOENrLHUnk+ZPVooTaiNEUd97uw1opNyhOHXPD5TCXlXJ1g8SDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:25:09.595436Z"},"content_sha256":"d40607b4805789bdd373a0e5d35bdf4179b4fd4488215498e8fe38bdba8257ca","schema_version":"1.0","event_id":"sha256:d40607b4805789bdd373a0e5d35bdf4179b4fd4488215498e8fe38bdba8257ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/bundle.json","state_url":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/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-27T09:25:09Z","links":{"resolver":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR","bundle":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/bundle.json","state":"https://pith.science/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMEP36JV7DQBR4E2PPMXH5RZHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LMEP36JV7DQBR4E2PPMXH5RZHR","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":"3c973172baaa560e190c2fafe637ab98b0a154ae300926121b1aa634d01108b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-20T15:44:56Z","title_canon_sha256":"1f45d2333aa838f0f550bb9e89d5b22c8fb92219d5afee97ffc61ef01539ca95"},"schema_version":"1.0","source":{"id":"1403.5177","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5177","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5177v1","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5177","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"LMEP36JV7DQB","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LMEP36JV7DQBR4E2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LMEP36JV","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:d40607b4805789bdd373a0e5d35bdf4179b4fd4488215498e8fe38bdba8257ca","target":"graph","created_at":"2026-05-18T02:55:58Z","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":"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","authors_text":"Hiroshi Mamitsuka, Ichigaku Takigawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-20T15:44:56Z","title":"Sparse Learning over Infinite Subgraph Features"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5177","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:a41b665fcb4d621a9f1bf15e0c8ed3a267928a03def4488c5669b9508c6f97e9","target":"record","created_at":"2026-05-18T02:55:58Z","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":"3c973172baaa560e190c2fafe637ab98b0a154ae300926121b1aa634d01108b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-03-20T15:44:56Z","title_canon_sha256":"1f45d2333aa838f0f550bb9e89d5b22c8fb92219d5afee97ffc61ef01539ca95"},"schema_version":"1.0","source":{"id":"1403.5177","kind":"arxiv","version":1}},"canonical_sha256":"5b08fdf935f8e018f09a7bd973f6393c7949e1e5ea8b87ddceb3267c8dd79d77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b08fdf935f8e018f09a7bd973f6393c7949e1e5ea8b87ddceb3267c8dd79d77","first_computed_at":"2026-05-18T02:55:58.051586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:58.051586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Bh+Q9EuELZBZhbVbF3TNJHTxx1iIzlchxOfzex66rHERmxkJzAOe6yvJDu2cWr4vtmv6iHu+8tcqnPM3my0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:58.052094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5177","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a41b665fcb4d621a9f1bf15e0c8ed3a267928a03def4488c5669b9508c6f97e9","sha256:d40607b4805789bdd373a0e5d35bdf4179b4fd4488215498e8fe38bdba8257ca"],"state_sha256":"626ee4694c5cfd02e33a97407fb35e1d94bec603d50ba0752c84136edd272a7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHNFLq/OiDendBUTAfxSHxC1YE3DSV5GiPTvYIQdyk458aXMzBEph0LDNKCkT42iAI3R2D4uAITWKD8DjJeNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:25:09.597436Z","bundle_sha256":"20eef5784132ee94a3da59369fe73539a251cf7392e75bc38c6ab8fa1e7a970f"}}