{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AFFHCHEJ2RYPK2J36YU6FXGGVV","short_pith_number":"pith:AFFHCHEJ","canonical_record":{"source":{"id":"2507.09969","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-14T06:35:18Z","cross_cats_sorted":[],"title_canon_sha256":"17215db8e2047f764755c19e53648630dd6af94453983cfe21de6a43988332eb","abstract_canon_sha256":"b899c901a558c4f1690fbeefd8e1503b4e5193a1554c7cc1b83e3e90e504fe20"},"schema_version":"1.0"},"canonical_sha256":"014a711c89d470f5693bf629e2dcc6ad51a28c70b49d8a56f455fcb279f4f7f3","source":{"kind":"arxiv","id":"2507.09969","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09969","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09969v1","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09969","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"pith_short_12","alias_value":"AFFHCHEJ2RYP","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"pith_short_16","alias_value":"AFFHCHEJ2RYPK2J3","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"pith_short_8","alias_value":"AFFHCHEJ","created_at":"2026-07-05T11:36:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AFFHCHEJ2RYPK2J36YU6FXGGVV","target":"record","payload":{"canonical_record":{"source":{"id":"2507.09969","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-14T06:35:18Z","cross_cats_sorted":[],"title_canon_sha256":"17215db8e2047f764755c19e53648630dd6af94453983cfe21de6a43988332eb","abstract_canon_sha256":"b899c901a558c4f1690fbeefd8e1503b4e5193a1554c7cc1b83e3e90e504fe20"},"schema_version":"1.0"},"canonical_sha256":"014a711c89d470f5693bf629e2dcc6ad51a28c70b49d8a56f455fcb279f4f7f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:43.025694Z","signature_b64":"Z8KRA2RpEmvFNTvgqhDR3tx5VDzzMogZh5LvZ6aWW9MlamyMZSXLhlrONfSSR8aF0VSZZ/YpOcM5x1QTLMF4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"014a711c89d470f5693bf629e2dcc6ad51a28c70b49d8a56f455fcb279f4f7f3","last_reissued_at":"2026-07-05T11:36:43.024866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:43.024866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.09969","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:36:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiBodhhfqMJIgV9y3bCeppDac+Hl0QPUrbS71RL3bEdTxMVZ5ZA32XR4gEUU5hA33X7Izcjn0TTziWw6lQMIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:33:17.416266Z"},"content_sha256":"6558da2d68031124497f3424556f0ea1bab02b9566e3d840f311fbb74224ecff","schema_version":"1.0","event_id":"sha256:6558da2d68031124497f3424556f0ea1bab02b9566e3d840f311fbb74224ecff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AFFHCHEJ2RYPK2J36YU6FXGGVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Mingxuan Ju, Soroush Vosoughi, Yanfang Ye, Zhongyu Ouyang","submitted_at":"2025-07-14T06:35:18Z","abstract_excerpt":"Graph knowledge has been proven effective in enhancing item rankings in recommender systems (RecSys), particularly during the retrieval stage. However, its application in the ranking stage, especially when richer contextual information in user-item interactions is available, remains underexplored. A major challenge lies in the substantial computational cost associated with repeatedly retrieving neighborhood information from billions of items stored in distributed systems. This resource-intensive requirement makes it difficult to scale graph-based methods in practical RecSys. To bridge this gap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09969","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/2507.09969/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:36:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hPdCjB3tTofozHbGMZyszt2iqv1qZ6goyIuFJVpAlCT5IB7xW5dsRKoKRB0a7wh60M7BE7qfo3Kp8AYTqwY0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T13:33:17.417185Z"},"content_sha256":"467deb4fc197be6b669062db580946493c2e9b4d65a65289c91efc1a9ae0622a","schema_version":"1.0","event_id":"sha256:467deb4fc197be6b669062db580946493c2e9b4d65a65289c91efc1a9ae0622a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFFHCHEJ2RYPK2J36YU6FXGGVV/bundle.json","state_url":"https://pith.science/pith/AFFHCHEJ2RYPK2J36YU6FXGGVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFFHCHEJ2RYPK2J36YU6FXGGVV/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-08T13:33:17Z","links":{"resolver":"https://pith.science/pith/AFFHCHEJ2RYPK2J36YU6FXGGVV","bundle":"https://pith.science/pith/AFFHCHEJ2RYPK2J36YU6FXGGVV/bundle.json","state":"https://pith.science/pith/AFFHCHEJ2RYPK2J36YU6FXGGVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFFHCHEJ2RYPK2J36YU6FXGGVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AFFHCHEJ2RYPK2J36YU6FXGGVV","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":"b899c901a558c4f1690fbeefd8e1503b4e5193a1554c7cc1b83e3e90e504fe20","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-14T06:35:18Z","title_canon_sha256":"17215db8e2047f764755c19e53648630dd6af94453983cfe21de6a43988332eb"},"schema_version":"1.0","source":{"id":"2507.09969","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09969","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09969v1","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09969","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"pith_short_12","alias_value":"AFFHCHEJ2RYP","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"pith_short_16","alias_value":"AFFHCHEJ2RYPK2J3","created_at":"2026-07-05T11:36:43Z"},{"alias_kind":"pith_short_8","alias_value":"AFFHCHEJ","created_at":"2026-07-05T11:36:43Z"}],"graph_snapshots":[{"event_id":"sha256:467deb4fc197be6b669062db580946493c2e9b4d65a65289c91efc1a9ae0622a","target":"graph","created_at":"2026-07-05T11:36: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/2507.09969/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph knowledge has been proven effective in enhancing item rankings in recommender systems (RecSys), particularly during the retrieval stage. However, its application in the ranking stage, especially when richer contextual information in user-item interactions is available, remains underexplored. A major challenge lies in the substantial computational cost associated with repeatedly retrieving neighborhood information from billions of items stored in distributed systems. This resource-intensive requirement makes it difficult to scale graph-based methods in practical RecSys. To bridge this gap","authors_text":"Mingxuan Ju, Soroush Vosoughi, Yanfang Ye, Zhongyu Ouyang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-14T06:35:18Z","title":"Non-parametric Graph Convolution for Re-ranking in Recommendation Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09969","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:6558da2d68031124497f3424556f0ea1bab02b9566e3d840f311fbb74224ecff","target":"record","created_at":"2026-07-05T11:36: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":"b899c901a558c4f1690fbeefd8e1503b4e5193a1554c7cc1b83e3e90e504fe20","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-07-14T06:35:18Z","title_canon_sha256":"17215db8e2047f764755c19e53648630dd6af94453983cfe21de6a43988332eb"},"schema_version":"1.0","source":{"id":"2507.09969","kind":"arxiv","version":1}},"canonical_sha256":"014a711c89d470f5693bf629e2dcc6ad51a28c70b49d8a56f455fcb279f4f7f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"014a711c89d470f5693bf629e2dcc6ad51a28c70b49d8a56f455fcb279f4f7f3","first_computed_at":"2026-07-05T11:36:43.024866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:43.024866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z8KRA2RpEmvFNTvgqhDR3tx5VDzzMogZh5LvZ6aWW9MlamyMZSXLhlrONfSSR8aF0VSZZ/YpOcM5x1QTLMF4AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:43.025694Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.09969","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6558da2d68031124497f3424556f0ea1bab02b9566e3d840f311fbb74224ecff","sha256:467deb4fc197be6b669062db580946493c2e9b4d65a65289c91efc1a9ae0622a"],"state_sha256":"136274653c9dab7707c37ce39fc809d8208c851a21cc00dd01f66b4714ff2e13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7g9U4x8nnuFnv+a7FIFlTF/L8KrodDup/4ONjzZwew/QHL+UwMVeYz+l3FGyDjRvRfZDdN9k5jJwfiQZZTBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T13:33:17.424105Z","bundle_sha256":"405437effa21a5d4c53e02a7b6b4420aa373926c38be9642f3416501ec79a51f"}}