{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ZY4JZAEJZI4AJHHCO5IXKHHPYN","short_pith_number":"pith:ZY4JZAEJ","canonical_record":{"source":{"id":"2105.11866","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-25T12:10:54Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"c5b9df07a378c44ce631113b0ea8f9b99de4e8f050a5aaf12956fadc764d70f9","abstract_canon_sha256":"957ce1b551cff816d98706ae3c65d38de62193c29423f8ed839ac0edc10c7f49"},"schema_version":"1.0"},"canonical_sha256":"ce389c8089ca38049ce27751751cefc350f5cf117f6149b99ec876f3afc1a3d1","source":{"kind":"arxiv","id":"2105.11866","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.11866","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"2105.11866v5","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11866","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZY4JZAEJZI4A","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"pith_short_16","alias_value":"ZY4JZAEJZI4AJHHC","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"pith_short_8","alias_value":"ZY4JZAEJ","created_at":"2026-07-05T10:17:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ZY4JZAEJZI4AJHHCO5IXKHHPYN","target":"record","payload":{"canonical_record":{"source":{"id":"2105.11866","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-25T12:10:54Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"c5b9df07a378c44ce631113b0ea8f9b99de4e8f050a5aaf12956fadc764d70f9","abstract_canon_sha256":"957ce1b551cff816d98706ae3c65d38de62193c29423f8ed839ac0edc10c7f49"},"schema_version":"1.0"},"canonical_sha256":"ce389c8089ca38049ce27751751cefc350f5cf117f6149b99ec876f3afc1a3d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:43.889612Z","signature_b64":"0YxHIr7woo9WLpdrQxQElUZYZQox/cqApzk3i8fz6fjTA71P/kn4oOpLbLX2IgmzgLAAEKpsWZfu/klu19+ABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce389c8089ca38049ce27751751cefc350f5cf117f6149b99ec876f3afc1a3d1","last_reissued_at":"2026-07-05T10:17:43.889195Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:43.889195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.11866","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-07-05T10:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ki9qdiBe34QqoKW3SzAMK8WDcThRG4zLcDXcOtnr+RVz5/d7X2/yxm+HjJF1nIFHeT2x+yIYRyqhv6f2ZjlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:37:33.028146Z"},"content_sha256":"4f8ef981ca9b5b3488f8a8903515fb75e335a53bb6ab89fe99940957b27b32d1","schema_version":"1.0","event_id":"sha256:4f8ef981ca9b5b3488f8a8903515fb75e335a53bb6ab89fe99940957b27b32d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ZY4JZAEJZI4AJHHCO5IXKHHPYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphFM: Graph Factorization Machines for Feature Interaction Modeling","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.LG","authors_text":"Liang Wang, Shu Wu, Xiaoyu Zhang, Yunyue Su, Zekun Li, Zeyu Cui","submitted_at":"2021-05-25T12:10:54Z","abstract_excerpt":"Factorization machine (FM) is a prevalent approach to modeling pairwise (second-order) feature interactions when dealing with high-dimensional sparse data. However, on the one hand, FM fails to capture higher-order feature interactions suffering from combinatorial expansion. On the other hand, taking into account interactions between every pair of features may introduce noise and degrade prediction accuracy. To solve the problems, we propose a novel approach, Graph Factorization Machine (GraphFM), by naturally representing features in the graph structure. In particular, we design a mechanism t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11866","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.11866/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnxXeObAE2CNx4Req/SOyEquWG8eUB/FhVdZE8XTT0CAambfcjA2LCKUeSWkEW25apN2SOS4VgMvM22SU2VHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:37:33.029162Z"},"content_sha256":"fbf76c6fd8de21a1482df0a0b6b93963750b541a111c81a4843e6d9ea27ab1f8","schema_version":"1.0","event_id":"sha256:fbf76c6fd8de21a1482df0a0b6b93963750b541a111c81a4843e6d9ea27ab1f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZY4JZAEJZI4AJHHCO5IXKHHPYN/bundle.json","state_url":"https://pith.science/pith/ZY4JZAEJZI4AJHHCO5IXKHHPYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZY4JZAEJZI4AJHHCO5IXKHHPYN/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-08-03T21:37:33Z","links":{"resolver":"https://pith.science/pith/ZY4JZAEJZI4AJHHCO5IXKHHPYN","bundle":"https://pith.science/pith/ZY4JZAEJZI4AJHHCO5IXKHHPYN/bundle.json","state":"https://pith.science/pith/ZY4JZAEJZI4AJHHCO5IXKHHPYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZY4JZAEJZI4AJHHCO5IXKHHPYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ZY4JZAEJZI4AJHHCO5IXKHHPYN","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":"957ce1b551cff816d98706ae3c65d38de62193c29423f8ed839ac0edc10c7f49","cross_cats_sorted":["cs.AI","cs.IR"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-25T12:10:54Z","title_canon_sha256":"c5b9df07a378c44ce631113b0ea8f9b99de4e8f050a5aaf12956fadc764d70f9"},"schema_version":"1.0","source":{"id":"2105.11866","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.11866","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"2105.11866v5","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11866","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZY4JZAEJZI4A","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"pith_short_16","alias_value":"ZY4JZAEJZI4AJHHC","created_at":"2026-07-05T10:17:43Z"},{"alias_kind":"pith_short_8","alias_value":"ZY4JZAEJ","created_at":"2026-07-05T10:17:43Z"}],"graph_snapshots":[{"event_id":"sha256:fbf76c6fd8de21a1482df0a0b6b93963750b541a111c81a4843e6d9ea27ab1f8","target":"graph","created_at":"2026-07-05T10:17:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.11866/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Factorization machine (FM) is a prevalent approach to modeling pairwise (second-order) feature interactions when dealing with high-dimensional sparse data. However, on the one hand, FM fails to capture higher-order feature interactions suffering from combinatorial expansion. On the other hand, taking into account interactions between every pair of features may introduce noise and degrade prediction accuracy. To solve the problems, we propose a novel approach, Graph Factorization Machine (GraphFM), by naturally representing features in the graph structure. In particular, we design a mechanism t","authors_text":"Liang Wang, Shu Wu, Xiaoyu Zhang, Yunyue Su, Zekun Li, Zeyu Cui","cross_cats":["cs.AI","cs.IR"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-25T12:10:54Z","title":"GraphFM: Graph Factorization Machines for Feature Interaction Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11866","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:4f8ef981ca9b5b3488f8a8903515fb75e335a53bb6ab89fe99940957b27b32d1","target":"record","created_at":"2026-07-05T10:17:43Z","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":"957ce1b551cff816d98706ae3c65d38de62193c29423f8ed839ac0edc10c7f49","cross_cats_sorted":["cs.AI","cs.IR"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-25T12:10:54Z","title_canon_sha256":"c5b9df07a378c44ce631113b0ea8f9b99de4e8f050a5aaf12956fadc764d70f9"},"schema_version":"1.0","source":{"id":"2105.11866","kind":"arxiv","version":5}},"canonical_sha256":"ce389c8089ca38049ce27751751cefc350f5cf117f6149b99ec876f3afc1a3d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce389c8089ca38049ce27751751cefc350f5cf117f6149b99ec876f3afc1a3d1","first_computed_at":"2026-07-05T10:17:43.889195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:17:43.889195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0YxHIr7woo9WLpdrQxQElUZYZQox/cqApzk3i8fz6fjTA71P/kn4oOpLbLX2IgmzgLAAEKpsWZfu/klu19+ABA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:17:43.889612Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.11866","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f8ef981ca9b5b3488f8a8903515fb75e335a53bb6ab89fe99940957b27b32d1","sha256:fbf76c6fd8de21a1482df0a0b6b93963750b541a111c81a4843e6d9ea27ab1f8"],"state_sha256":"47cd124f1b86b24881c71748fc0f088a70a2d94b89924472bcff78de2f56ab15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kdNIsp8Ct3JLNrOXFwg6TqRjDQIanzR40dh5gZYsPRsXg9nGwfmNqa1/VYd7RwmczAr4ft78bpRWUHdsG9wCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T21:37:33.035408Z","bundle_sha256":"2b52eebb58a0e5842a028d99e8713ba5c29ad077a641ec9fb93ee498c7adb6f0"}}