{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GTIOOHKJ3UCFP3JZPQL2CNIOHU","short_pith_number":"pith:GTIOOHKJ","canonical_record":{"source":{"id":"2304.10711","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-04-21T02:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"6e789f086945897cf99622394493830f519fc7981066a9304a1e3873cec62bea","abstract_canon_sha256":"54adcbff23b69e1ad50bd23d28cbfd1189032734988a65399c75856ae7e0328e"},"schema_version":"1.0"},"canonical_sha256":"34d0e71d49dd0457ed397c17a1350e3d080928b4d68c579a0d7c1e3095c95d3a","source":{"kind":"arxiv","id":"2304.10711","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.10711","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"arxiv_version","alias_value":"2304.10711v3","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.10711","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"pith_short_12","alias_value":"GTIOOHKJ3UCF","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"pith_short_16","alias_value":"GTIOOHKJ3UCFP3JZ","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"pith_short_8","alias_value":"GTIOOHKJ","created_at":"2026-07-05T06:49:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GTIOOHKJ3UCFP3JZPQL2CNIOHU","target":"record","payload":{"canonical_record":{"source":{"id":"2304.10711","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-04-21T02:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"6e789f086945897cf99622394493830f519fc7981066a9304a1e3873cec62bea","abstract_canon_sha256":"54adcbff23b69e1ad50bd23d28cbfd1189032734988a65399c75856ae7e0328e"},"schema_version":"1.0"},"canonical_sha256":"34d0e71d49dd0457ed397c17a1350e3d080928b4d68c579a0d7c1e3095c95d3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:49:42.352779Z","signature_b64":"y8EonZk1qW6O37qwQeBlyc0bJz+b8EV2VGRhA4Zq2dFNOR6GYrxoJD1iT4e4zpZizo2zx2cykunWdL2pMuEIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d0e71d49dd0457ed397c17a1350e3d080928b4d68c579a0d7c1e3095c95d3a","last_reissued_at":"2026-07-05T06:49:42.352337Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:49:42.352337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.10711","source_version":3,"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-05T06:49:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKmjB9ra3ILGzTusOtph7PMqTmZW5/iNsto6EpjbQuMEAkQZu2CvrIj4eiD1vAAxVB/XUcE0OqKYqlLA+/NuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:59:16.422547Z"},"content_sha256":"0287fb456e34387e6d1d9fd9564018fb169c37b4c1e2e419f7bbc50bfe81b3e2","schema_version":"1.0","event_id":"sha256:0287fb456e34387e6d1d9fd9564018fb169c37b4c1e2e419f7bbc50bfe81b3e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GTIOOHKJ3UCFP3JZPQL2CNIOHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"EulerNet: Adaptive Feature Interaction Learning via Euler's Formula for CTR Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ji-Rong Wen, Ting Bai, Wayne Xin Zhao, Zhao Cao, Zhen Tian","submitted_at":"2023-04-21T02:48:29Z","abstract_excerpt":"Learning effective high-order feature interactions is very crucial in the CTR prediction task. However, it is very time-consuming to calculate high-order feature interactions with massive features in online e-commerce platforms. Most existing methods manually design a maximal order and further filter out the useless interactions from them. Although they reduce the high computational costs caused by the exponential growth of high-order feature combinations, they still suffer from the degradation of model capability due to the suboptimal learning of the restricted feature orders. The solution to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.10711","kind":"arxiv","version":3},"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/2304.10711/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-05T06:49:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DdiN47A7fhsNB9c3g28N40Hac6PMw4FD4ATohm2qLS7f6JE7U5ofORj+vUG6Er4xO2Y4WsQM0k0U52/gTiMcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:59:16.423546Z"},"content_sha256":"99ad005101a94daedc779f508375bbf658860a04b2e20f4a085506b5488d2a46","schema_version":"1.0","event_id":"sha256:99ad005101a94daedc779f508375bbf658860a04b2e20f4a085506b5488d2a46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/bundle.json","state_url":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/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-13T08:59:16Z","links":{"resolver":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU","bundle":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/bundle.json","state":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GTIOOHKJ3UCFP3JZPQL2CNIOHU","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":"54adcbff23b69e1ad50bd23d28cbfd1189032734988a65399c75856ae7e0328e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-04-21T02:48:29Z","title_canon_sha256":"6e789f086945897cf99622394493830f519fc7981066a9304a1e3873cec62bea"},"schema_version":"1.0","source":{"id":"2304.10711","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.10711","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"arxiv_version","alias_value":"2304.10711v3","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.10711","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"pith_short_12","alias_value":"GTIOOHKJ3UCF","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"pith_short_16","alias_value":"GTIOOHKJ3UCFP3JZ","created_at":"2026-07-05T06:49:42Z"},{"alias_kind":"pith_short_8","alias_value":"GTIOOHKJ","created_at":"2026-07-05T06:49:42Z"}],"graph_snapshots":[{"event_id":"sha256:99ad005101a94daedc779f508375bbf658860a04b2e20f4a085506b5488d2a46","target":"graph","created_at":"2026-07-05T06:49:42Z","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/2304.10711/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning effective high-order feature interactions is very crucial in the CTR prediction task. However, it is very time-consuming to calculate high-order feature interactions with massive features in online e-commerce platforms. Most existing methods manually design a maximal order and further filter out the useless interactions from them. Although they reduce the high computational costs caused by the exponential growth of high-order feature combinations, they still suffer from the degradation of model capability due to the suboptimal learning of the restricted feature orders. The solution to","authors_text":"Ji-Rong Wen, Ting Bai, Wayne Xin Zhao, Zhao Cao, Zhen Tian","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-04-21T02:48:29Z","title":"EulerNet: Adaptive Feature Interaction Learning via Euler's Formula for CTR Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.10711","kind":"arxiv","version":3},"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:0287fb456e34387e6d1d9fd9564018fb169c37b4c1e2e419f7bbc50bfe81b3e2","target":"record","created_at":"2026-07-05T06:49:42Z","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":"54adcbff23b69e1ad50bd23d28cbfd1189032734988a65399c75856ae7e0328e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-04-21T02:48:29Z","title_canon_sha256":"6e789f086945897cf99622394493830f519fc7981066a9304a1e3873cec62bea"},"schema_version":"1.0","source":{"id":"2304.10711","kind":"arxiv","version":3}},"canonical_sha256":"34d0e71d49dd0457ed397c17a1350e3d080928b4d68c579a0d7c1e3095c95d3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34d0e71d49dd0457ed397c17a1350e3d080928b4d68c579a0d7c1e3095c95d3a","first_computed_at":"2026-07-05T06:49:42.352337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:49:42.352337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y8EonZk1qW6O37qwQeBlyc0bJz+b8EV2VGRhA4Zq2dFNOR6GYrxoJD1iT4e4zpZizo2zx2cykunWdL2pMuEIAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:49:42.352779Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.10711","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0287fb456e34387e6d1d9fd9564018fb169c37b4c1e2e419f7bbc50bfe81b3e2","sha256:99ad005101a94daedc779f508375bbf658860a04b2e20f4a085506b5488d2a46"],"state_sha256":"51d37c104e25a9e73cb9b8d14a9f1b14b2ff816e5864dd2241b0ef05b6b6a56d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOwYaM8WkTjGIOZJrtApy69MVSlL2c4cVQ4zlmMdEjfl5ebhNe41oTiixfVdR3r/Dbri02N/UQiQf3pjZpsvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:59:16.435194Z","bundle_sha256":"a032971f096ad5b5d3c9cae5457046b831fb7488df46394c877a36465d3b69ea"}}