{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LBYBERQRNQKN246BKLQ6M75LLT","short_pith_number":"pith:LBYBERQR","canonical_record":{"source":{"id":"2008.13368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-08-31T05:12:54Z","cross_cats_sorted":[],"title_canon_sha256":"2788a486ecc035befe768af0a41f981758946303bdcdf7e35378db75957345a7","abstract_canon_sha256":"729d611bff3bbe60705a35fac29cdfc746a3ad7808a45b1902b718f69494363e"},"schema_version":"1.0"},"canonical_sha256":"58701246116c14dd73c152e1e67fab5ccc4f5efd548a27f88317480f019822c0","source":{"kind":"arxiv","id":"2008.13368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.13368","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"arxiv_version","alias_value":"2008.13368v1","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.13368","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"pith_short_12","alias_value":"LBYBERQRNQKN","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"pith_short_16","alias_value":"LBYBERQRNQKN246B","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"pith_short_8","alias_value":"LBYBERQR","created_at":"2026-07-05T01:31:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LBYBERQRNQKN246BKLQ6M75LLT","target":"record","payload":{"canonical_record":{"source":{"id":"2008.13368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-08-31T05:12:54Z","cross_cats_sorted":[],"title_canon_sha256":"2788a486ecc035befe768af0a41f981758946303bdcdf7e35378db75957345a7","abstract_canon_sha256":"729d611bff3bbe60705a35fac29cdfc746a3ad7808a45b1902b718f69494363e"},"schema_version":"1.0"},"canonical_sha256":"58701246116c14dd73c152e1e67fab5ccc4f5efd548a27f88317480f019822c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:36.755233Z","signature_b64":"zOZfG9m92CeansQlusVnQkh98QVc7k5OUemZDneOD4Fmt4ZeeTsGJUnecewoC2ChPrWuHnofKupTq8e7XeLNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58701246116c14dd73c152e1e67fab5ccc4f5efd548a27f88317480f019822c0","last_reissued_at":"2026-07-05T01:31:36.754901Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:36.754901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.13368","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-05T01:31:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MC1FF65T34SOwnJBBmEzC9z3IU2vALrf78l+GkdWfEkk0QsLtJAbEbocg9Z4/ChvbX+H419Ecz0EeXkfT1LOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:28:46.099970Z"},"content_sha256":"006599e8afffa9f526425546bbdce6c7b4644bd7135ab5486a6d6b1256cd0f06","schema_version":"1.0","event_id":"sha256:006599e8afffa9f526425546bbdce6c7b4644bd7135ab5486a6d6b1256cd0f06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LBYBERQRNQKN246BKLQ6M75LLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PT-Ranking: A Benchmarking Platform for Neural Learning-to-Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hai-Tao Yu","submitted_at":"2020-08-31T05:12:54Z","abstract_excerpt":"Deep neural networks has become the first choice for researchers working on algorithmic aspects of learning-to-rank. Unfortunately, it is not trivial to find the optimal setting of hyper-parameters that achieves the best ranking performance. As a result, it becomes more and more difficult to develop a new model and conduct a fair comparison with prior methods, especially for newcomers. In this work, we propose PT-Ranking, an open-source project based on PyTorch for developing and evaluating learning-to-rank methods using deep neural networks as the basis to construct a scoring function. On one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.13368","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/2008.13368/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-05T01:31:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cu1NLUaISuHJKISFHi0YcrXylKYjUnd0aqrHH6REtOiZxW7L5SOa8sKZvzWtp/OygG0Pn2SNnQdJZ1VvM09eAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:28:46.100599Z"},"content_sha256":"52c1cc925838b6e8a271b831164a9332b5f38ca741bab5f11f096b98faf37173","schema_version":"1.0","event_id":"sha256:52c1cc925838b6e8a271b831164a9332b5f38ca741bab5f11f096b98faf37173"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBYBERQRNQKN246BKLQ6M75LLT/bundle.json","state_url":"https://pith.science/pith/LBYBERQRNQKN246BKLQ6M75LLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBYBERQRNQKN246BKLQ6M75LLT/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-07-07T06:28:46Z","links":{"resolver":"https://pith.science/pith/LBYBERQRNQKN246BKLQ6M75LLT","bundle":"https://pith.science/pith/LBYBERQRNQKN246BKLQ6M75LLT/bundle.json","state":"https://pith.science/pith/LBYBERQRNQKN246BKLQ6M75LLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBYBERQRNQKN246BKLQ6M75LLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LBYBERQRNQKN246BKLQ6M75LLT","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":"729d611bff3bbe60705a35fac29cdfc746a3ad7808a45b1902b718f69494363e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-08-31T05:12:54Z","title_canon_sha256":"2788a486ecc035befe768af0a41f981758946303bdcdf7e35378db75957345a7"},"schema_version":"1.0","source":{"id":"2008.13368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.13368","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"arxiv_version","alias_value":"2008.13368v1","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.13368","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"pith_short_12","alias_value":"LBYBERQRNQKN","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"pith_short_16","alias_value":"LBYBERQRNQKN246B","created_at":"2026-07-05T01:31:36Z"},{"alias_kind":"pith_short_8","alias_value":"LBYBERQR","created_at":"2026-07-05T01:31:36Z"}],"graph_snapshots":[{"event_id":"sha256:52c1cc925838b6e8a271b831164a9332b5f38ca741bab5f11f096b98faf37173","target":"graph","created_at":"2026-07-05T01:31:36Z","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/2008.13368/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep neural networks has become the first choice for researchers working on algorithmic aspects of learning-to-rank. Unfortunately, it is not trivial to find the optimal setting of hyper-parameters that achieves the best ranking performance. As a result, it becomes more and more difficult to develop a new model and conduct a fair comparison with prior methods, especially for newcomers. In this work, we propose PT-Ranking, an open-source project based on PyTorch for developing and evaluating learning-to-rank methods using deep neural networks as the basis to construct a scoring function. On one","authors_text":"Hai-Tao Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-08-31T05:12:54Z","title":"PT-Ranking: A Benchmarking Platform for Neural Learning-to-Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.13368","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:006599e8afffa9f526425546bbdce6c7b4644bd7135ab5486a6d6b1256cd0f06","target":"record","created_at":"2026-07-05T01:31:36Z","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":"729d611bff3bbe60705a35fac29cdfc746a3ad7808a45b1902b718f69494363e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-08-31T05:12:54Z","title_canon_sha256":"2788a486ecc035befe768af0a41f981758946303bdcdf7e35378db75957345a7"},"schema_version":"1.0","source":{"id":"2008.13368","kind":"arxiv","version":1}},"canonical_sha256":"58701246116c14dd73c152e1e67fab5ccc4f5efd548a27f88317480f019822c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58701246116c14dd73c152e1e67fab5ccc4f5efd548a27f88317480f019822c0","first_computed_at":"2026-07-05T01:31:36.754901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:31:36.754901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zOZfG9m92CeansQlusVnQkh98QVc7k5OUemZDneOD4Fmt4ZeeTsGJUnecewoC2ChPrWuHnofKupTq8e7XeLNAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:31:36.755233Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.13368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:006599e8afffa9f526425546bbdce6c7b4644bd7135ab5486a6d6b1256cd0f06","sha256:52c1cc925838b6e8a271b831164a9332b5f38ca741bab5f11f096b98faf37173"],"state_sha256":"a816921e0e8ee820703d3028e5d9e1d9895b831882a23d5aa01d552742aba11b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkX1SsEC9LCCqLW+dpJaBF4YEWWaMK2qoha2uiQPiXKYcqbD2Otp/aoo5nxJERb0Zafhgp09Pw/gdTj4JxWBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:28:46.104472Z","bundle_sha256":"b75315d95c738754c1dd195381794f2ae07495a8e6c5a2005c046b98ab088f99"}}