{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SYSVWUAZEH3ARNAA7CQAXDVSC3","short_pith_number":"pith:SYSVWUAZ","canonical_record":{"source":{"id":"2607.19987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-22T10:20:40Z","cross_cats_sorted":[],"title_canon_sha256":"1b8125c0e9a4269c72428d46f4d094b97c144f594bebe35f762c4a0869a030b4","abstract_canon_sha256":"8faf4ed04205ab4c7d8b7fbdedd2d690999302ef2cbdfe6f81041f5c021b3151"},"schema_version":"1.0"},"canonical_sha256":"96255b501921f608b400f8a00b8eb216e696430ac2aae44e900af2b87e13f9e9","source":{"kind":"arxiv","id":"2607.19987","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19987","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19987v1","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19987","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"SYSVWUAZEH3A","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"pith_short_16","alias_value":"SYSVWUAZEH3ARNAA","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"pith_short_8","alias_value":"SYSVWUAZ","created_at":"2026-07-23T01:24:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SYSVWUAZEH3ARNAA7CQAXDVSC3","target":"record","payload":{"canonical_record":{"source":{"id":"2607.19987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-22T10:20:40Z","cross_cats_sorted":[],"title_canon_sha256":"1b8125c0e9a4269c72428d46f4d094b97c144f594bebe35f762c4a0869a030b4","abstract_canon_sha256":"8faf4ed04205ab4c7d8b7fbdedd2d690999302ef2cbdfe6f81041f5c021b3151"},"schema_version":"1.0"},"canonical_sha256":"96255b501921f608b400f8a00b8eb216e696430ac2aae44e900af2b87e13f9e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:54.021898Z","signature_b64":"Emh8wR+vnvGdbRjEYv4voD3clLPBovKvWLSnoaR0yNQ2AXGU+Y1h63EYls6tJ5/5aIU//X/2yuVyPxUVJgmHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96255b501921f608b400f8a00b8eb216e696430ac2aae44e900af2b87e13f9e9","last_reissued_at":"2026-07-23T01:24:54.020367Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:54.020367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.19987","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-23T01:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mKDXYq9DBHQdCipKBam8aV0+njLiz0FEvJcuTH3A9wNqgeq9DYESvaXSSouOXLNp6uAR3kjMlx+BSXO2dmZOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T08:09:43.542382Z"},"content_sha256":"b66257d02390fba634688b3418f8b2674b30c90aff8563ffd666516dd55b0e77","schema_version":"1.0","event_id":"sha256:b66257d02390fba634688b3418f8b2674b30c90aff8563ffd666516dd55b0e77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SYSVWUAZEH3ARNAA7CQAXDVSC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UniRank: Benchmarking Ranking Models for Unified Sequential Modeling and Feature Interaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Honghao Li, Kangyi Lin, Xianquan Wang, Yiwen Zhang, Yi Zhang, Zibin Zhang","submitted_at":"2026-07-22T10:20:40Z","abstract_excerpt":"Ranking is a core stage in online advertising and recommender systems. Modern ranking models increasingly unify sequential modeling and feature interaction, yet many advances rely on proprietary data, closed implementations, and large-scale industrial infrastructure. This setting limits reproducible comparison and hinders academic study of scaling laws, long-sequence modeling, and multi-task ranking. To address these limitations, this paper proposes UniRank, an open benchmark for ranking models that unify sequential modeling and feature interaction. UniRank uses chronological pointwise autoreg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19987","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/2607.19987/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-23T01:24:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LZ9XgH2qFioTFP9sJkbBEqfcuhVWEiOpq6c2Qk0J5o3QbnUs9UykB/pMXPPXaSiidWt3HPVX65jLZkhGaiWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T08:09:43.543011Z"},"content_sha256":"2539626780a96a7f5e056aae1954d671bed7c520797a2416e7189990db8e028d","schema_version":"1.0","event_id":"sha256:2539626780a96a7f5e056aae1954d671bed7c520797a2416e7189990db8e028d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:SYSVWUAZEH3ARNAA7CQAXDVSC3","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-030-01261-8_1) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Yuxin Wu and Kaiming He. 2018. Group Normalization. InProceedings of the European Conference on Computer Vision. Springer, Cham, 3–19. doi:10.1007/978- 3-030-01261-8_1","arxiv_id":"2607.19987","detector":"doi_compliance","evidence":{"ref_index":75,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-","reconstructed_doi":"10.1007/978-3-030-01261-8_1"},"severity":"advisory","ref_index":75,"audited_at":"2026-08-01T11:10:09.753312Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-030-01261-8_1","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"31e5e1f1194db69b42b97748457357ed9125561a62f8c3850d70219e5c7c5a9d","paper_version":2,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15701,"payload_sha256":"36e243c4e11121c6f1835931af5d6e74c3f37dc4e097faea10a75132f21a1e33","signature_b64":"hkhZVf+eJRbKa+PyFH5kcdl7bJxR5oIXV03fqUdVF2fOgztah5KI05JvhWHGVFY5GSMgeEAX8BgQW8SogikiAQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T11:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EfXnHQJEjx6EkqBTZl3gjSFWaE7Vp3zqPfIBpW9dTEUFYQQt7wZ4xcujwVQV3e5pIEu9esnP29c85du3SyC1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T08:09:43.547246Z"},"content_sha256":"24234230037a38b95d5e932015f2b5efbb7446d4a67b2df8247b3e50ed8732c7","schema_version":"1.0","event_id":"sha256:24234230037a38b95d5e932015f2b5efbb7446d4a67b2df8247b3e50ed8732c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYSVWUAZEH3ARNAA7CQAXDVSC3/bundle.json","state_url":"https://pith.science/pith/SYSVWUAZEH3ARNAA7CQAXDVSC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYSVWUAZEH3ARNAA7CQAXDVSC3/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-03T08:09:43Z","links":{"resolver":"https://pith.science/pith/SYSVWUAZEH3ARNAA7CQAXDVSC3","bundle":"https://pith.science/pith/SYSVWUAZEH3ARNAA7CQAXDVSC3/bundle.json","state":"https://pith.science/pith/SYSVWUAZEH3ARNAA7CQAXDVSC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYSVWUAZEH3ARNAA7CQAXDVSC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SYSVWUAZEH3ARNAA7CQAXDVSC3","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8faf4ed04205ab4c7d8b7fbdedd2d690999302ef2cbdfe6f81041f5c021b3151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-22T10:20:40Z","title_canon_sha256":"1b8125c0e9a4269c72428d46f4d094b97c144f594bebe35f762c4a0869a030b4"},"schema_version":"1.0","source":{"id":"2607.19987","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19987","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19987v1","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19987","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"pith_short_12","alias_value":"SYSVWUAZEH3A","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"pith_short_16","alias_value":"SYSVWUAZEH3ARNAA","created_at":"2026-07-23T01:24:54Z"},{"alias_kind":"pith_short_8","alias_value":"SYSVWUAZ","created_at":"2026-07-23T01:24:54Z"}],"graph_snapshots":[{"event_id":"sha256:2539626780a96a7f5e056aae1954d671bed7c520797a2416e7189990db8e028d","target":"graph","created_at":"2026-07-23T01:24:54Z","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/2607.19987/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ranking is a core stage in online advertising and recommender systems. Modern ranking models increasingly unify sequential modeling and feature interaction, yet many advances rely on proprietary data, closed implementations, and large-scale industrial infrastructure. This setting limits reproducible comparison and hinders academic study of scaling laws, long-sequence modeling, and multi-task ranking. To address these limitations, this paper proposes UniRank, an open benchmark for ranking models that unify sequential modeling and feature interaction. UniRank uses chronological pointwise autoreg","authors_text":"Honghao Li, Kangyi Lin, Xianquan Wang, Yiwen Zhang, Yi Zhang, Zibin Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-22T10:20:40Z","title":"UniRank: Benchmarking Ranking Models for Unified Sequential Modeling and Feature Interaction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19987","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:b66257d02390fba634688b3418f8b2674b30c90aff8563ffd666516dd55b0e77","target":"record","created_at":"2026-07-23T01:24:54Z","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":"8faf4ed04205ab4c7d8b7fbdedd2d690999302ef2cbdfe6f81041f5c021b3151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-22T10:20:40Z","title_canon_sha256":"1b8125c0e9a4269c72428d46f4d094b97c144f594bebe35f762c4a0869a030b4"},"schema_version":"1.0","source":{"id":"2607.19987","kind":"arxiv","version":1}},"canonical_sha256":"96255b501921f608b400f8a00b8eb216e696430ac2aae44e900af2b87e13f9e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96255b501921f608b400f8a00b8eb216e696430ac2aae44e900af2b87e13f9e9","first_computed_at":"2026-07-23T01:24:54.020367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T01:24:54.020367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Emh8wR+vnvGdbRjEYv4voD3clLPBovKvWLSnoaR0yNQ2AXGU+Y1h63EYls6tJ5/5aIU//X/2yuVyPxUVJgmHDQ==","signature_status":"signed_v1","signed_at":"2026-07-23T01:24:54.021898Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.19987","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b66257d02390fba634688b3418f8b2674b30c90aff8563ffd666516dd55b0e77","sha256:2539626780a96a7f5e056aae1954d671bed7c520797a2416e7189990db8e028d","sha256:24234230037a38b95d5e932015f2b5efbb7446d4a67b2df8247b3e50ed8732c7"],"state_sha256":"07cc0c24f92dae40c3380e647c41e28f7ec2912211da615388449648b5bb1eae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8bso/X2J4hIUcDgPkTMdRJk0v88jfcBqjop829Ln00DJTPS/rcdW453WKNcu//S07KGOtKsVcrL2XEWy2FXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T08:09:43.549666Z","bundle_sha256":"767f2d4969f070bdd0e4aa64f311b4f49aa119a22910a6e1bf3002f438a34799"}}