{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TU2W7LTWZBU5J5GB44UPDJM3HW","short_pith_number":"pith:TU2W7LTW","canonical_record":{"source":{"id":"1804.06027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T03:23:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3dea8bebfac42f825e238589de3376bf14ae9e2982fb883413f41d853c5041d4","abstract_canon_sha256":"4ee36c4137ccc102d5886b19d287e83e5eba8e17dd3aa143f6defeb47d10c58a"},"schema_version":"1.0"},"canonical_sha256":"9d356fae76c869d4f4c1e728f1a59b3d93e81b6f8ce681dcd9aac56ea973589c","source":{"kind":"arxiv","id":"1804.06027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06027","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06027v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06027","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"TU2W7LTWZBU5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TU2W7LTWZBU5J5GB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TU2W7LTW","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TU2W7LTWZBU5J5GB44UPDJM3HW","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T03:23:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3dea8bebfac42f825e238589de3376bf14ae9e2982fb883413f41d853c5041d4","abstract_canon_sha256":"4ee36c4137ccc102d5886b19d287e83e5eba8e17dd3aa143f6defeb47d10c58a"},"schema_version":"1.0"},"canonical_sha256":"9d356fae76c869d4f4c1e728f1a59b3d93e81b6f8ce681dcd9aac56ea973589c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.956558Z","signature_b64":"95pQzWz502OEHDOqWc18vp18IDRNT5KJLqOt+xfxrcIexJqhnZ5NI0aDYJaJWAM7PUxaU7aFiwcbEKin4zAECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d356fae76c869d4f4c1e728f1a59b3d93e81b6f8ce681dcd9aac56ea973589c","last_reissued_at":"2026-05-18T00:18:21.955950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.955950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06027","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-18T00:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LL3CHJZYCH/FwNcxQr42fMGs9pZGYTtBAClLQYwI8znGkQeg+Ceyhzk0yxuiuZAk8VlzRI6J5muFwB9ZJNEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:02:25.778785Z"},"content_sha256":"2f25d819a2186f007df4a5389619140390c2b994f281c1805b83e230d5a821a9","schema_version":"1.0","event_id":"sha256:2f25d819a2186f007df4a5389619140390c2b994f281c1805b83e230d5a821a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TU2W7LTWZBU5J5GB44UPDJM3HW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Boosting Framework of Factorization Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jun Zhou, Longfei Li, Peilin Zhao, Xiaolong Li","submitted_at":"2018-04-17T03:23:40Z","abstract_excerpt":"Recently, Factorization Machines (FM) has become more and more popular for recommendation systems, due to its effectiveness in finding informative interactions between features. Usually, the weights for the interactions is learnt as a low rank weight matrix, which is formulated as an inner product of two low rank matrices. This low rank can help improve the generalization ability of Factorization Machines. However, to choose the rank properly, it usually needs to run the algorithm for many times using different ranks, which clearly is inefficient for some large-scale datasets. To alleviate thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06027","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-18T00:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5tJYf7d9zf4DmfD1vyOPalvmWXOAmXkors5Hibc/vK3YJrjMEXmXiB3M928UCMUmk/ML8Q9SPXLHp1Vj7e4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:02:25.779138Z"},"content_sha256":"9f7e9a83ef166ac03b90cddaaae7d4b3c84c5b2df53fc03b854a8aba26c42dea","schema_version":"1.0","event_id":"sha256:9f7e9a83ef166ac03b90cddaaae7d4b3c84c5b2df53fc03b854a8aba26c42dea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TU2W7LTWZBU5J5GB44UPDJM3HW/bundle.json","state_url":"https://pith.science/pith/TU2W7LTWZBU5J5GB44UPDJM3HW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TU2W7LTWZBU5J5GB44UPDJM3HW/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-03T09:02:25Z","links":{"resolver":"https://pith.science/pith/TU2W7LTWZBU5J5GB44UPDJM3HW","bundle":"https://pith.science/pith/TU2W7LTWZBU5J5GB44UPDJM3HW/bundle.json","state":"https://pith.science/pith/TU2W7LTWZBU5J5GB44UPDJM3HW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TU2W7LTWZBU5J5GB44UPDJM3HW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TU2W7LTWZBU5J5GB44UPDJM3HW","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":"4ee36c4137ccc102d5886b19d287e83e5eba8e17dd3aa143f6defeb47d10c58a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T03:23:40Z","title_canon_sha256":"3dea8bebfac42f825e238589de3376bf14ae9e2982fb883413f41d853c5041d4"},"schema_version":"1.0","source":{"id":"1804.06027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06027","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06027v1","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06027","created_at":"2026-05-18T00:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"TU2W7LTWZBU5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TU2W7LTWZBU5J5GB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TU2W7LTW","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:9f7e9a83ef166ac03b90cddaaae7d4b3c84c5b2df53fc03b854a8aba26c42dea","target":"graph","created_at":"2026-05-18T00:18:21Z","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":"Recently, Factorization Machines (FM) has become more and more popular for recommendation systems, due to its effectiveness in finding informative interactions between features. Usually, the weights for the interactions is learnt as a low rank weight matrix, which is formulated as an inner product of two low rank matrices. This low rank can help improve the generalization ability of Factorization Machines. However, to choose the rank properly, it usually needs to run the algorithm for many times using different ranks, which clearly is inefficient for some large-scale datasets. To alleviate thi","authors_text":"Jun Zhou, Longfei Li, Peilin Zhao, Xiaolong Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T03:23:40Z","title":"A Boosting Framework of Factorization Machine"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06027","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:2f25d819a2186f007df4a5389619140390c2b994f281c1805b83e230d5a821a9","target":"record","created_at":"2026-05-18T00:18:21Z","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":"4ee36c4137ccc102d5886b19d287e83e5eba8e17dd3aa143f6defeb47d10c58a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T03:23:40Z","title_canon_sha256":"3dea8bebfac42f825e238589de3376bf14ae9e2982fb883413f41d853c5041d4"},"schema_version":"1.0","source":{"id":"1804.06027","kind":"arxiv","version":1}},"canonical_sha256":"9d356fae76c869d4f4c1e728f1a59b3d93e81b6f8ce681dcd9aac56ea973589c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d356fae76c869d4f4c1e728f1a59b3d93e81b6f8ce681dcd9aac56ea973589c","first_computed_at":"2026-05-18T00:18:21.955950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:21.955950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"95pQzWz502OEHDOqWc18vp18IDRNT5KJLqOt+xfxrcIexJqhnZ5NI0aDYJaJWAM7PUxaU7aFiwcbEKin4zAECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:21.956558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f25d819a2186f007df4a5389619140390c2b994f281c1805b83e230d5a821a9","sha256:9f7e9a83ef166ac03b90cddaaae7d4b3c84c5b2df53fc03b854a8aba26c42dea"],"state_sha256":"4a98726e0f7fbda87d7191f978eab54e4c31c086aeba03d89a0e4809f40168ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V7ypnYvAbVD3klE7jC/YguVd0nQ+8BKlpwAVXUITloMSw2hkDAqNtrwuuYFStPQ3rAL6A50Nx06gWe+O5tUgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:02:25.781073Z","bundle_sha256":"7f1ffbe3e0fad11da4b66c03c2dc662dffc952eeb5345f96557cd8a1e9a7d793"}}