{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WRV6SVXQ5PCAMLVTSFY6WQ6HCA","short_pith_number":"pith:WRV6SVXQ","canonical_record":{"source":{"id":"2412.17245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-12-23T03:37:58Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"d1d628739749931b5678b90e1a66aa496cb558a45e630b192ddb6ae31d6796ed","abstract_canon_sha256":"b0dd255604c8c110d8345f653179a313d4511aa3a5443e96376297bfdd47a689"},"schema_version":"1.0"},"canonical_sha256":"b46be956f0ebc4062eb39171eb43c7102481262e11726c256860b21dffe9b638","source":{"kind":"arxiv","id":"2412.17245","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17245","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17245v2","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17245","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"WRV6SVXQ5PCA","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"pith_short_16","alias_value":"WRV6SVXQ5PCAMLVT","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"pith_short_8","alias_value":"WRV6SVXQ","created_at":"2026-07-05T10:11:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WRV6SVXQ5PCAMLVTSFY6WQ6HCA","target":"record","payload":{"canonical_record":{"source":{"id":"2412.17245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-12-23T03:37:58Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"d1d628739749931b5678b90e1a66aa496cb558a45e630b192ddb6ae31d6796ed","abstract_canon_sha256":"b0dd255604c8c110d8345f653179a313d4511aa3a5443e96376297bfdd47a689"},"schema_version":"1.0"},"canonical_sha256":"b46be956f0ebc4062eb39171eb43c7102481262e11726c256860b21dffe9b638","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:30.786634Z","signature_b64":"th1ZN7MhzLUdzMgAtmV9jHQVq64tA8zfn74KLTZSaABEiPC/g2BLcyg4VcifhzyhcZurXrMnUrnN0uk2MJZ1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b46be956f0ebc4062eb39171eb43c7102481262e11726c256860b21dffe9b638","last_reissued_at":"2026-07-05T10:11:30.785632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:30.785632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.17245","source_version":2,"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:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7oo/XdNB37XbCAczaCYKzw3c1JmT/2JPUKwWCEFDrgTHnrNfQTxAvIvxO8aaP8Jo/hjcRv9ROe0nguD0G+jDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T00:00:25.961121Z"},"content_sha256":"c660f925203bd785c288f6313b0f91a90a244e11429b87bba8e310a3f8331780","schema_version":"1.0","event_id":"sha256:c660f925203bd785c288f6313b0f91a90a244e11429b87bba8e310a3f8331780"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WRV6SVXQ5PCAMLVTSFY6WQ6HCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.IR","authors_text":"Ali Jadbabaie, Clark Mingxuan Ju, Donald Loveland, Leonardo Neves, Neil Shah, Runjin Chen, Tong Zhao, Xin Chen, Xinyi Wu, Yozen Liu","submitted_at":"2024-12-23T03:37:58Z","abstract_excerpt":"Deep recommender systems rely heavily on large embedding tables to handle high-cardinality categorical features such as user/item identifiers, and face significant memory constraints at scale. To tackle this challenge, hashing techniques are often employed to map multiple entities to the same embedding and thus reduce the size of the embedding tables. Concurrently, graph-based collaborative signals have emerged as powerful tools in recommender systems, yet their potential for optimizing embedding table reduction remains unexplored. This paper introduces GraphHash, the first graph-based approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17245","kind":"arxiv","version":2},"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/2412.17245/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:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1X6wgOFfYdilG/+gTJjZ9OgJ2e3HeUSRw/Q1e3YXqFOHGmI4jjUNcPCgZryzeZQyJnKuugyqh/jnNVZt1DqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T00:00:25.962031Z"},"content_sha256":"8bc89cfdf921738eaf7be9b23b251a423a48961b2f0b2923adeb453ab8b1ce29","schema_version":"1.0","event_id":"sha256:8bc89cfdf921738eaf7be9b23b251a423a48961b2f0b2923adeb453ab8b1ce29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRV6SVXQ5PCAMLVTSFY6WQ6HCA/bundle.json","state_url":"https://pith.science/pith/WRV6SVXQ5PCAMLVTSFY6WQ6HCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRV6SVXQ5PCAMLVTSFY6WQ6HCA/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-17T00:00:25Z","links":{"resolver":"https://pith.science/pith/WRV6SVXQ5PCAMLVTSFY6WQ6HCA","bundle":"https://pith.science/pith/WRV6SVXQ5PCAMLVTSFY6WQ6HCA/bundle.json","state":"https://pith.science/pith/WRV6SVXQ5PCAMLVTSFY6WQ6HCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRV6SVXQ5PCAMLVTSFY6WQ6HCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WRV6SVXQ5PCAMLVTSFY6WQ6HCA","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":"b0dd255604c8c110d8345f653179a313d4511aa3a5443e96376297bfdd47a689","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-12-23T03:37:58Z","title_canon_sha256":"d1d628739749931b5678b90e1a66aa496cb558a45e630b192ddb6ae31d6796ed"},"schema_version":"1.0","source":{"id":"2412.17245","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.17245","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"2412.17245v2","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17245","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"WRV6SVXQ5PCA","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"pith_short_16","alias_value":"WRV6SVXQ5PCAMLVT","created_at":"2026-07-05T10:11:30Z"},{"alias_kind":"pith_short_8","alias_value":"WRV6SVXQ","created_at":"2026-07-05T10:11:30Z"}],"graph_snapshots":[{"event_id":"sha256:8bc89cfdf921738eaf7be9b23b251a423a48961b2f0b2923adeb453ab8b1ce29","target":"graph","created_at":"2026-07-05T10:11:30Z","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/2412.17245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep recommender systems rely heavily on large embedding tables to handle high-cardinality categorical features such as user/item identifiers, and face significant memory constraints at scale. To tackle this challenge, hashing techniques are often employed to map multiple entities to the same embedding and thus reduce the size of the embedding tables. Concurrently, graph-based collaborative signals have emerged as powerful tools in recommender systems, yet their potential for optimizing embedding table reduction remains unexplored. This paper introduces GraphHash, the first graph-based approac","authors_text":"Ali Jadbabaie, Clark Mingxuan Ju, Donald Loveland, Leonardo Neves, Neil Shah, Runjin Chen, Tong Zhao, Xin Chen, Xinyi Wu, Yozen Liu","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-12-23T03:37:58Z","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17245","kind":"arxiv","version":2},"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:c660f925203bd785c288f6313b0f91a90a244e11429b87bba8e310a3f8331780","target":"record","created_at":"2026-07-05T10:11:30Z","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":"b0dd255604c8c110d8345f653179a313d4511aa3a5443e96376297bfdd47a689","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-12-23T03:37:58Z","title_canon_sha256":"d1d628739749931b5678b90e1a66aa496cb558a45e630b192ddb6ae31d6796ed"},"schema_version":"1.0","source":{"id":"2412.17245","kind":"arxiv","version":2}},"canonical_sha256":"b46be956f0ebc4062eb39171eb43c7102481262e11726c256860b21dffe9b638","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b46be956f0ebc4062eb39171eb43c7102481262e11726c256860b21dffe9b638","first_computed_at":"2026-07-05T10:11:30.785632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:11:30.785632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"th1ZN7MhzLUdzMgAtmV9jHQVq64tA8zfn74KLTZSaABEiPC/g2BLcyg4VcifhzyhcZurXrMnUrnN0uk2MJZ1Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:11:30.786634Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.17245","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c660f925203bd785c288f6313b0f91a90a244e11429b87bba8e310a3f8331780","sha256:8bc89cfdf921738eaf7be9b23b251a423a48961b2f0b2923adeb453ab8b1ce29"],"state_sha256":"4dd33d671aba8384d8f002d5f5cb6e45f8ea7d6a685381f4bc4bbaed46de1047"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oc37lTVAy1toLqSOoV3QrF5YPL8G/aAcxTOG49W2nWZG6qvx4lEhzz6vX4Zzs0TScRzLoHy5O1IkaThK6lKCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T00:00:25.967134Z","bundle_sha256":"f80c115a0503d7086f1ee6185a0db1a9db3f283d1b4db85544907077a2bc0481"}}