{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OD3YES3I7PR2OFBX327LPY7EQ3","short_pith_number":"pith:OD3YES3I","canonical_record":{"source":{"id":"2506.02750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-06-03T11:11:43Z","cross_cats_sorted":[],"title_canon_sha256":"28f9e75ad68b7ca5de11ef3ed62ab96829362aea037aad0b5fe37dd2ffa95b3c","abstract_canon_sha256":"c4673c58e8a6382a582f5a0f971081da961b6fa9f33b2c10e2caf8099aef68a4"},"schema_version":"1.0"},"canonical_sha256":"70f7824b68fbe3a71437debeb7e3e486d5e0e7fcd8ce9da5593aa4c9c8d25c25","source":{"kind":"arxiv","id":"2506.02750","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02750","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02750v1","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02750","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"OD3YES3I7PR2","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"pith_short_16","alias_value":"OD3YES3I7PR2OFBX","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"pith_short_8","alias_value":"OD3YES3I","created_at":"2026-07-05T11:15:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OD3YES3I7PR2OFBX327LPY7EQ3","target":"record","payload":{"canonical_record":{"source":{"id":"2506.02750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-06-03T11:11:43Z","cross_cats_sorted":[],"title_canon_sha256":"28f9e75ad68b7ca5de11ef3ed62ab96829362aea037aad0b5fe37dd2ffa95b3c","abstract_canon_sha256":"c4673c58e8a6382a582f5a0f971081da961b6fa9f33b2c10e2caf8099aef68a4"},"schema_version":"1.0"},"canonical_sha256":"70f7824b68fbe3a71437debeb7e3e486d5e0e7fcd8ce9da5593aa4c9c8d25c25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:08.055108Z","signature_b64":"IdJT/DFND7wn/cbmfGu7mFvFakPkrxsV6HnhF4Z5QJuSoY11H5LjNnC9OvUAPO7LRtYBDdnNIE4r8wyEM/XHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70f7824b68fbe3a71437debeb7e3e486d5e0e7fcd8ce9da5593aa4c9c8d25c25","last_reissued_at":"2026-07-05T11:15:08.054609Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:08.054609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.02750","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-07-05T11:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2cciGLIczqDmoV4n1UTQpxGzv2UjeaI/Tsi+0FHs3M3sTLSJgYDbRTl/T0ntCLLwEyWSOrTEmf7vvlcbcNeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:52:18.121279Z"},"content_sha256":"0fc0520a1d2681ab41540897552747faf5a6958c49b356add0cc32cb50d5a944","schema_version":"1.0","event_id":"sha256:0fc0520a1d2681ab41540897552747faf5a6958c49b356add0cc32cb50d5a944"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OD3YES3I7PR2OFBX327LPY7EQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Binarized Representations with Pseudo-positive Sample Enhancement for Efficient Graph Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chen Ma, Irwin King, Xinni Zhang, Yankai Chen, Yue Que","submitted_at":"2025-06-03T11:11:43Z","abstract_excerpt":"Learning vectorized embeddings is fundamental to many recommender systems for user-item matching. To enable efficient online inference, representation binarization, which embeds latent features into compact binary sequences, has recently shown significant promise in optimizing both memory usage and computational overhead. However, existing approaches primarily focus on numerical quantization, neglecting the associated information loss, which often results in noticeable performance degradation. To address these issues, we study the problem of graph representation binarization for efficient coll"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02750","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.02750/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-05T11:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zrnohJ8Ogw31lbsNaQ6aoVzjrW0oT7h5OGDx1MpGe3K4rH7awE8JmZRDI0g6pedCnoThorULo6HRtxChx/LBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T17:52:18.122083Z"},"content_sha256":"7f14dda80f3d585a08f8d2a5e7dc008a89f35fdc71854645192b066a57fbb7bd","schema_version":"1.0","event_id":"sha256:7f14dda80f3d585a08f8d2a5e7dc008a89f35fdc71854645192b066a57fbb7bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OD3YES3I7PR2OFBX327LPY7EQ3/bundle.json","state_url":"https://pith.science/pith/OD3YES3I7PR2OFBX327LPY7EQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OD3YES3I7PR2OFBX327LPY7EQ3/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-07T17:52:18Z","links":{"resolver":"https://pith.science/pith/OD3YES3I7PR2OFBX327LPY7EQ3","bundle":"https://pith.science/pith/OD3YES3I7PR2OFBX327LPY7EQ3/bundle.json","state":"https://pith.science/pith/OD3YES3I7PR2OFBX327LPY7EQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OD3YES3I7PR2OFBX327LPY7EQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OD3YES3I7PR2OFBX327LPY7EQ3","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":"c4673c58e8a6382a582f5a0f971081da961b6fa9f33b2c10e2caf8099aef68a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-06-03T11:11:43Z","title_canon_sha256":"28f9e75ad68b7ca5de11ef3ed62ab96829362aea037aad0b5fe37dd2ffa95b3c"},"schema_version":"1.0","source":{"id":"2506.02750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02750","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02750v1","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02750","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"OD3YES3I7PR2","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"pith_short_16","alias_value":"OD3YES3I7PR2OFBX","created_at":"2026-07-05T11:15:08Z"},{"alias_kind":"pith_short_8","alias_value":"OD3YES3I","created_at":"2026-07-05T11:15:08Z"}],"graph_snapshots":[{"event_id":"sha256:7f14dda80f3d585a08f8d2a5e7dc008a89f35fdc71854645192b066a57fbb7bd","target":"graph","created_at":"2026-07-05T11:15:08Z","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/2506.02750/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning vectorized embeddings is fundamental to many recommender systems for user-item matching. To enable efficient online inference, representation binarization, which embeds latent features into compact binary sequences, has recently shown significant promise in optimizing both memory usage and computational overhead. However, existing approaches primarily focus on numerical quantization, neglecting the associated information loss, which often results in noticeable performance degradation. To address these issues, we study the problem of graph representation binarization for efficient coll","authors_text":"Chen Ma, Irwin King, Xinni Zhang, Yankai Chen, Yue Que","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-06-03T11:11:43Z","title":"Learning Binarized Representations with Pseudo-positive Sample Enhancement for Efficient Graph Collaborative Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02750","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:0fc0520a1d2681ab41540897552747faf5a6958c49b356add0cc32cb50d5a944","target":"record","created_at":"2026-07-05T11:15:08Z","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":"c4673c58e8a6382a582f5a0f971081da961b6fa9f33b2c10e2caf8099aef68a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-06-03T11:11:43Z","title_canon_sha256":"28f9e75ad68b7ca5de11ef3ed62ab96829362aea037aad0b5fe37dd2ffa95b3c"},"schema_version":"1.0","source":{"id":"2506.02750","kind":"arxiv","version":1}},"canonical_sha256":"70f7824b68fbe3a71437debeb7e3e486d5e0e7fcd8ce9da5593aa4c9c8d25c25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70f7824b68fbe3a71437debeb7e3e486d5e0e7fcd8ce9da5593aa4c9c8d25c25","first_computed_at":"2026-07-05T11:15:08.054609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:08.054609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IdJT/DFND7wn/cbmfGu7mFvFakPkrxsV6HnhF4Z5QJuSoY11H5LjNnC9OvUAPO7LRtYBDdnNIE4r8wyEM/XHBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:08.055108Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.02750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fc0520a1d2681ab41540897552747faf5a6958c49b356add0cc32cb50d5a944","sha256:7f14dda80f3d585a08f8d2a5e7dc008a89f35fdc71854645192b066a57fbb7bd"],"state_sha256":"6cf6bead018cd39aee3736b766bfaa06834200f39fba045317f869325ab9a915"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZzrOrKTt3N8+mthtHqhxod7lbxFQN0J/YDHrRYumqpKRDchk8wpKvmonBsx9Ibz1BUkiBCIIH+oxthYOcneBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T17:52:18.128552Z","bundle_sha256":"e88c1521fafdbe88d88f38917bb398404db185c672bfa8ea72a85200723f434d"}}