{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5TJ42EUL3EPBJAQZRBHFHNZHHJ","short_pith_number":"pith:5TJ42EUL","canonical_record":{"source":{"id":"2607.24417","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-07-27T13:30:32Z","cross_cats_sorted":[],"title_canon_sha256":"b005420360fe7255237802ee81751974365dcd66d5fef5d754296263accf589d","abstract_canon_sha256":"8fc42623c39e79502b624d4779e5970f57183e55e307be04ab48d6617433e106"},"schema_version":"1.0"},"canonical_sha256":"ecd3cd128bd91e148219884e53b7273a7d09f0d28273771b19dba69dd3212c3d","source":{"kind":"arxiv","id":"2607.24417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24417","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24417v1","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24417","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"5TJ42EUL3EPB","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"5TJ42EUL3EPBJAQZ","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"5TJ42EUL","created_at":"2026-07-28T02:24:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5TJ42EUL3EPBJAQZRBHFHNZHHJ","target":"record","payload":{"canonical_record":{"source":{"id":"2607.24417","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-07-27T13:30:32Z","cross_cats_sorted":[],"title_canon_sha256":"b005420360fe7255237802ee81751974365dcd66d5fef5d754296263accf589d","abstract_canon_sha256":"8fc42623c39e79502b624d4779e5970f57183e55e307be04ab48d6617433e106"},"schema_version":"1.0"},"canonical_sha256":"ecd3cd128bd91e148219884e53b7273a7d09f0d28273771b19dba69dd3212c3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:24:02.317487Z","signature_b64":"DxsRZvTUHk6WsTD53jaFhj9LCFNIfdCmV0We0MUimVf9sWtYC/X625qDNS6rmBg142+AT3Eu0wfjlAB6Gov7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecd3cd128bd91e148219884e53b7273a7d09f0d28273771b19dba69dd3212c3d","last_reissued_at":"2026-07-28T02:24:02.316559Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:24:02.316559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.24417","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-28T02:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfX1MP3jw+isNOU3ZLFL4AmKXNgcvWdlvlNeUxgmrj6qr3kFsIDj6E5nB93YEvWZYam/m0/wfytVcTUG/gEgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:38:13.551610Z"},"content_sha256":"7d00c9fcf0a78b04714df7ca7835ac85899745a253c6388220193e1ece036116","schema_version":"1.0","event_id":"sha256:7d00c9fcf0a78b04714df7ca7835ac85899745a253c6388220193e1ece036116"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5TJ42EUL3EPBJAQZRBHFHNZHHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CORE: A Unified Cascaded Ordinal Relevance Estimation Framework for E-commerce Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Guojun Liu, Qingsong Hua, Wei Lin, Xi Wang, Yunfei Li, Zhi Jin","submitted_at":"2026-07-27T13:30:32Z","abstract_excerpt":"Ranking relevance is a fundamental task in e-commerce search, directly affecting ranking quality and consumer experience. Although inherently an ordinal classification problem, it is commonly formulated as conventional multi-class classification, which overlooks the natural order among relevance levels and assigns equal penalties to adjacent and distant misclassifications. This mismatch leads to suboptimal learning objectives for practical relevance evaluation. To address this issue, we propose a unified cascaded binary classification framework applicable to both large language model inference"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24417","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.24417/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-28T02:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIWAvH9DU00v2IncEz8zE7iuy4IMVEXyPlsPEyE9mYvP75d2ekOJvJzZcjG7sxLaO3vAw8bmgFR1Fm4Tk3AUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:38:13.552117Z"},"content_sha256":"59d847bcd6861414000bdfa3126e7dc3e816ea3cc942e8f11f800a379feb05d3","schema_version":"1.0","event_id":"sha256:59d847bcd6861414000bdfa3126e7dc3e816ea3cc942e8f11f800a379feb05d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TJ42EUL3EPBJAQZRBHFHNZHHJ/bundle.json","state_url":"https://pith.science/pith/5TJ42EUL3EPBJAQZRBHFHNZHHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TJ42EUL3EPBJAQZRBHFHNZHHJ/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-19T09:38:13Z","links":{"resolver":"https://pith.science/pith/5TJ42EUL3EPBJAQZRBHFHNZHHJ","bundle":"https://pith.science/pith/5TJ42EUL3EPBJAQZRBHFHNZHHJ/bundle.json","state":"https://pith.science/pith/5TJ42EUL3EPBJAQZRBHFHNZHHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TJ42EUL3EPBJAQZRBHFHNZHHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5TJ42EUL3EPBJAQZRBHFHNZHHJ","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":"8fc42623c39e79502b624d4779e5970f57183e55e307be04ab48d6617433e106","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-07-27T13:30:32Z","title_canon_sha256":"b005420360fe7255237802ee81751974365dcd66d5fef5d754296263accf589d"},"schema_version":"1.0","source":{"id":"2607.24417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24417","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24417v1","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24417","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"5TJ42EUL3EPB","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"pith_short_16","alias_value":"5TJ42EUL3EPBJAQZ","created_at":"2026-07-28T02:24:02Z"},{"alias_kind":"pith_short_8","alias_value":"5TJ42EUL","created_at":"2026-07-28T02:24:02Z"}],"graph_snapshots":[{"event_id":"sha256:59d847bcd6861414000bdfa3126e7dc3e816ea3cc942e8f11f800a379feb05d3","target":"graph","created_at":"2026-07-28T02:24:02Z","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.24417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ranking relevance is a fundamental task in e-commerce search, directly affecting ranking quality and consumer experience. Although inherently an ordinal classification problem, it is commonly formulated as conventional multi-class classification, which overlooks the natural order among relevance levels and assigns equal penalties to adjacent and distant misclassifications. This mismatch leads to suboptimal learning objectives for practical relevance evaluation. To address this issue, we propose a unified cascaded binary classification framework applicable to both large language model inference","authors_text":"Guojun Liu, Qingsong Hua, Wei Lin, Xi Wang, Yunfei Li, Zhi Jin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-07-27T13:30:32Z","title":"CORE: A Unified Cascaded Ordinal Relevance Estimation Framework for E-commerce Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24417","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:7d00c9fcf0a78b04714df7ca7835ac85899745a253c6388220193e1ece036116","target":"record","created_at":"2026-07-28T02:24:02Z","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":"8fc42623c39e79502b624d4779e5970f57183e55e307be04ab48d6617433e106","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-07-27T13:30:32Z","title_canon_sha256":"b005420360fe7255237802ee81751974365dcd66d5fef5d754296263accf589d"},"schema_version":"1.0","source":{"id":"2607.24417","kind":"arxiv","version":1}},"canonical_sha256":"ecd3cd128bd91e148219884e53b7273a7d09f0d28273771b19dba69dd3212c3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecd3cd128bd91e148219884e53b7273a7d09f0d28273771b19dba69dd3212c3d","first_computed_at":"2026-07-28T02:24:02.316559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T02:24:02.316559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DxsRZvTUHk6WsTD53jaFhj9LCFNIfdCmV0We0MUimVf9sWtYC/X625qDNS6rmBg142+AT3Eu0wfjlAB6Gov7AA==","signature_status":"signed_v1","signed_at":"2026-07-28T02:24:02.317487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.24417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d00c9fcf0a78b04714df7ca7835ac85899745a253c6388220193e1ece036116","sha256:59d847bcd6861414000bdfa3126e7dc3e816ea3cc942e8f11f800a379feb05d3"],"state_sha256":"65e02d6d07aad71b125e62a596fb189d1242e897d5c9afbee8841ec53a6b9ca7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROs3JfdJBBlrwKrEqs2Q+Em3KOUEURX3S4QWrIQpGnfsJYUR3tR0Fthk12i6C8l9IUi0D72BGIeedLsG3mRrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T09:38:13.557443Z","bundle_sha256":"b245625f1197a15bbcf01ebfd18a57f2d07ae6e6a526bfafe5e001ca5a661b39"}}