{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DO6QNNXVP7BCZ6LJP6FSYQYWDO","short_pith_number":"pith:DO6QNNXV","canonical_record":{"source":{"id":"1507.01073","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-04T05:54:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68ace293e7b363df396b33cdc7f4de2bd081ec73e1344c09eddbf81cefde1b52","abstract_canon_sha256":"50c333acd0c6726f01165737f285d67e0de4da3df7fd83764310bee7a88ad10a"},"schema_version":"1.0"},"canonical_sha256":"1bbd06b6f57fc22cf9697f8b2c43161ba034d83adae9f164f6cbdc55f8556dd7","source":{"kind":"arxiv","id":"1507.01073","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01073","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01073v5","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01073","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"DO6QNNXVP7BC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DO6QNNXVP7BCZ6LJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DO6QNNXV","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DO6QNNXVP7BCZ6LJP6FSYQYWDO","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01073","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-04T05:54:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68ace293e7b363df396b33cdc7f4de2bd081ec73e1344c09eddbf81cefde1b52","abstract_canon_sha256":"50c333acd0c6726f01165737f285d67e0de4da3df7fd83764310bee7a88ad10a"},"schema_version":"1.0"},"canonical_sha256":"1bbd06b6f57fc22cf9697f8b2c43161ba034d83adae9f164f6cbdc55f8556dd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:32.254406Z","signature_b64":"OG9uM/9KIznb7swAsYCeZDidG5N7HrN3JOSvh5r8CdOjtERBJ9S+6WOY/WeGdPu8xvBsdwS0exOZ9o6gG3H4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bbd06b6f57fc22cf9697f8b2c43161ba034d83adae9f164f6cbdc55f8556dd7","last_reissued_at":"2026-05-18T01:09:32.253915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:32.253915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01073","source_version":5,"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-18T01:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7L66eCIMdhJ168WKNqCD3mGpd1bq1pGvHazeiCV8lSwLAk7/v+RBEiAMDgT9HMyM7nKgv8EX2tvMFsnZuG6DCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:59:52.742709Z"},"content_sha256":"8641407a18251d9496d2352f17b2b542c5004de45faa00ac9830db276c576a16","schema_version":"1.0","event_id":"sha256:8641407a18251d9496d2352f17b2b542c5004de45faa00ac9830db276c576a16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DO6QNNXVP7BCZ6LJP6FSYQYWDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Factorization Machine for Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Amit Goyal, Hiroshi Mamitsuka, Jianhui Chen, Kishan Wimalawarne, Makoto Yamada, Samuel Kaski, Suleiman A Khan, Wenzhao Lian, Yi Chang","submitted_at":"2015-07-04T05:54:29Z","abstract_excerpt":"We propose the convex factorization machine (CFM), which is a convex variant of the widely used Factorization Machines (FMs). Specifically, we employ a linear+quadratic model and regularize the linear term with the $\\ell_2$-regularizer and the quadratic term with the trace norm regularizer. Then, we formulate the CFM optimization as a semidefinite programming problem and propose an efficient optimization procedure with Hazan's algorithm. A key advantage of CFM over existing FMs is that it can find a globally optimal solution, while FMs may get a poor locally optimal solution since the objectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01073","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":""},"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-18T01:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVkpOUGIQd3fBLTX+6t+EZTPr1X7OyPzAtgBn0543V05kZ/aILu3oEf8kvzFi9HuLz/54gzochlW0vkjCWlgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:59:52.743335Z"},"content_sha256":"e22f7e48145c303633450b3990fbad05b878245ba3a5da6f73f7700c947f2034","schema_version":"1.0","event_id":"sha256:e22f7e48145c303633450b3990fbad05b878245ba3a5da6f73f7700c947f2034"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/bundle.json","state_url":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/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-05-22T11:59:52Z","links":{"resolver":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO","bundle":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/bundle.json","state":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DO6QNNXVP7BCZ6LJP6FSYQYWDO","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":"50c333acd0c6726f01165737f285d67e0de4da3df7fd83764310bee7a88ad10a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-04T05:54:29Z","title_canon_sha256":"68ace293e7b363df396b33cdc7f4de2bd081ec73e1344c09eddbf81cefde1b52"},"schema_version":"1.0","source":{"id":"1507.01073","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01073","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01073v5","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01073","created_at":"2026-05-18T01:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"DO6QNNXVP7BC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DO6QNNXVP7BCZ6LJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DO6QNNXV","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:e22f7e48145c303633450b3990fbad05b878245ba3a5da6f73f7700c947f2034","target":"graph","created_at":"2026-05-18T01:09:32Z","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 propose the convex factorization machine (CFM), which is a convex variant of the widely used Factorization Machines (FMs). Specifically, we employ a linear+quadratic model and regularize the linear term with the $\\ell_2$-regularizer and the quadratic term with the trace norm regularizer. Then, we formulate the CFM optimization as a semidefinite programming problem and propose an efficient optimization procedure with Hazan's algorithm. A key advantage of CFM over existing FMs is that it can find a globally optimal solution, while FMs may get a poor locally optimal solution since the objectiv","authors_text":"Amit Goyal, Hiroshi Mamitsuka, Jianhui Chen, Kishan Wimalawarne, Makoto Yamada, Samuel Kaski, Suleiman A Khan, Wenzhao Lian, Yi Chang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-04T05:54:29Z","title":"Convex Factorization Machine for Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01073","kind":"arxiv","version":5},"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:8641407a18251d9496d2352f17b2b542c5004de45faa00ac9830db276c576a16","target":"record","created_at":"2026-05-18T01:09:32Z","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":"50c333acd0c6726f01165737f285d67e0de4da3df7fd83764310bee7a88ad10a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-04T05:54:29Z","title_canon_sha256":"68ace293e7b363df396b33cdc7f4de2bd081ec73e1344c09eddbf81cefde1b52"},"schema_version":"1.0","source":{"id":"1507.01073","kind":"arxiv","version":5}},"canonical_sha256":"1bbd06b6f57fc22cf9697f8b2c43161ba034d83adae9f164f6cbdc55f8556dd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bbd06b6f57fc22cf9697f8b2c43161ba034d83adae9f164f6cbdc55f8556dd7","first_computed_at":"2026-05-18T01:09:32.253915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:32.253915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OG9uM/9KIznb7swAsYCeZDidG5N7HrN3JOSvh5r8CdOjtERBJ9S+6WOY/WeGdPu8xvBsdwS0exOZ9o6gG3H4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:32.254406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01073","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8641407a18251d9496d2352f17b2b542c5004de45faa00ac9830db276c576a16","sha256:e22f7e48145c303633450b3990fbad05b878245ba3a5da6f73f7700c947f2034"],"state_sha256":"0e88b3d2f375dc2475da5ac04618909248a6ab857df3f89b9e0ff29646091cbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERh5R65BzFJKMALyERRVikAFCNokN8mENwDYPGAeJU9DJW+jyln0Ch20MHUvlBjurN5pE/BC9L+xMGuHVANBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T11:59:52.746684Z","bundle_sha256":"1607c6f9f77a9e7c23b87a169668820a781ba39f0634ebf1da386e0ffda8cc9b"}}