{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XXKFHIIQTHOX67KXREXZIDJNS6","short_pith_number":"pith:XXKFHIIQ","canonical_record":{"source":{"id":"1607.08810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-29T13:54:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2968d28cc886ffb822a6620d45e31438b6e417b9ab148097ad8e9309a3ad6d5a","abstract_canon_sha256":"8e7be1bbcf1a59a87265b1569ec483fcd1013b80630970b5678de56f54689598"},"schema_version":"1.0"},"canonical_sha256":"bdd453a11099dd7f7d57892f940d2d97b6c842db2db939b177c06f3c0be8e780","source":{"kind":"arxiv","id":"1607.08810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08810","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08810v1","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08810","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"XXKFHIIQTHOX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XXKFHIIQTHOX67KX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XXKFHIIQ","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XXKFHIIQTHOX67KXREXZIDJNS6","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-29T13:54:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2968d28cc886ffb822a6620d45e31438b6e417b9ab148097ad8e9309a3ad6d5a","abstract_canon_sha256":"8e7be1bbcf1a59a87265b1569ec483fcd1013b80630970b5678de56f54689598"},"schema_version":"1.0"},"canonical_sha256":"bdd453a11099dd7f7d57892f940d2d97b6c842db2db939b177c06f3c0be8e780","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:15.845087Z","signature_b64":"v23iVRY7fCY22F9Ij/oZO/OK+LKXq2YYT/j0CjGteNQDjUtYIAMl94pdIhKSmdzVkPlSBKDow8dYS9NA4c7ODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdd453a11099dd7f7d57892f940d2d97b6c842db2db939b177c06f3c0be8e780","last_reissued_at":"2026-05-18T01:10:15.844560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:15.844560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08810","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-18T01:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syCp6DyC6gObf6JmSdImrOtT8yHJDxw1hj/2omiMdMh+zccGbyi1rnhAe3rw6o8By4HAIZjjeQ6IiBx2mcD0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:37:30.809673Z"},"content_sha256":"34ed213c798d4be96e0d4391856216d50aa4fafea0f6d0fad17b0f827d0cd3d2","schema_version":"1.0","event_id":"sha256:34ed213c798d4be96e0d4391856216d50aa4fafea0f6d0fad17b0f827d0cd3d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XXKFHIIQTHOX67KXREXZIDJNS6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Akinori Fujino, Masakazu Ishihata, Mathieu Blondel, Naonori Ueda","submitted_at":"2016-07-29T13:54:51Z","abstract_excerpt":"Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks. In this paper, we revisit both models from a unified perspective. Based on this new view, we study the properties of both models and propose new efficient training algorithms. Key to our approach is to cast parameter learning as a low-rank symmetric tensor estimation problem, which we solve by multi-convex optimization. We demonstrate our approach on regression and recommender system tasks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08810","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-18T01:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LB4/7f+PGKRVKX2pmW3ZyMFu32I4WbZH2+iI+sXW/kJu54RFT+llJE+1zXwfw86avP2JIbcDWH+mLiZJ9n1rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:37:30.810073Z"},"content_sha256":"f7fde1bfde4a243eba61a990892ff6b7c6e1a69df46607c3b3440cae5b3e0a16","schema_version":"1.0","event_id":"sha256:f7fde1bfde4a243eba61a990892ff6b7c6e1a69df46607c3b3440cae5b3e0a16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6/bundle.json","state_url":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXKFHIIQTHOX67KXREXZIDJNS6/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-26T21:37:30Z","links":{"resolver":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6","bundle":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6/bundle.json","state":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXKFHIIQTHOX67KXREXZIDJNS6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XXKFHIIQTHOX67KXREXZIDJNS6","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":"8e7be1bbcf1a59a87265b1569ec483fcd1013b80630970b5678de56f54689598","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-29T13:54:51Z","title_canon_sha256":"2968d28cc886ffb822a6620d45e31438b6e417b9ab148097ad8e9309a3ad6d5a"},"schema_version":"1.0","source":{"id":"1607.08810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08810","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08810v1","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08810","created_at":"2026-05-18T01:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"XXKFHIIQTHOX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XXKFHIIQTHOX67KX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XXKFHIIQ","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:f7fde1bfde4a243eba61a990892ff6b7c6e1a69df46607c3b3440cae5b3e0a16","target":"graph","created_at":"2026-05-18T01:10:15Z","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":"Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks. In this paper, we revisit both models from a unified perspective. Based on this new view, we study the properties of both models and propose new efficient training algorithms. Key to our approach is to cast parameter learning as a low-rank symmetric tensor estimation problem, which we solve by multi-convex optimization. We demonstrate our approach on regression and recommender system tasks.","authors_text":"Akinori Fujino, Masakazu Ishihata, Mathieu Blondel, Naonori Ueda","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-29T13:54:51Z","title":"Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08810","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:34ed213c798d4be96e0d4391856216d50aa4fafea0f6d0fad17b0f827d0cd3d2","target":"record","created_at":"2026-05-18T01:10:15Z","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":"8e7be1bbcf1a59a87265b1569ec483fcd1013b80630970b5678de56f54689598","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-29T13:54:51Z","title_canon_sha256":"2968d28cc886ffb822a6620d45e31438b6e417b9ab148097ad8e9309a3ad6d5a"},"schema_version":"1.0","source":{"id":"1607.08810","kind":"arxiv","version":1}},"canonical_sha256":"bdd453a11099dd7f7d57892f940d2d97b6c842db2db939b177c06f3c0be8e780","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdd453a11099dd7f7d57892f940d2d97b6c842db2db939b177c06f3c0be8e780","first_computed_at":"2026-05-18T01:10:15.844560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:15.844560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v23iVRY7fCY22F9Ij/oZO/OK+LKXq2YYT/j0CjGteNQDjUtYIAMl94pdIhKSmdzVkPlSBKDow8dYS9NA4c7ODA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:15.845087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34ed213c798d4be96e0d4391856216d50aa4fafea0f6d0fad17b0f827d0cd3d2","sha256:f7fde1bfde4a243eba61a990892ff6b7c6e1a69df46607c3b3440cae5b3e0a16"],"state_sha256":"76ce05564d19ed68fe6257c4724a337ec086401cd5f52d89ca401bda4890f8d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYB/bN4JHDfVL+WMZJxdZlYbGowYIUjYc1M5lY9oI1WH5OgGQIV4TNDNiDLUWivRVBpKx761Cxc53JXi99rdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:37:30.812941Z","bundle_sha256":"94e5f2b1d846bf8969f912cb2a942471688fac3e4871bae76f61a5ca0e845b25"}}