{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PU5BL5YD6PHN6GO57GZAP6KXBO","short_pith_number":"pith:PU5BL5YD","canonical_record":{"source":{"id":"1702.06106","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T18:47:25Z","cross_cats_sorted":[],"title_canon_sha256":"b5d38abb7841236088d5e881a21671132044f464f0ad0631ff0ac2a3a8e3bb25","abstract_canon_sha256":"136b4da7249343e6fca046f8e65fdf2bf078bde8e10c0622005a56b47f12dd11"},"schema_version":"1.0"},"canonical_sha256":"7d3a15f703f3cedf19ddf9b207f9570b8bacbb701c6521e8c6260faea2e453af","source":{"kind":"arxiv","id":"1702.06106","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06106","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06106v3","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06106","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"PU5BL5YD6PHN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PU5BL5YD6PHN6GO5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PU5BL5YD","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PU5BL5YD6PHN6GO57GZAP6KXBO","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06106","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T18:47:25Z","cross_cats_sorted":[],"title_canon_sha256":"b5d38abb7841236088d5e881a21671132044f464f0ad0631ff0ac2a3a8e3bb25","abstract_canon_sha256":"136b4da7249343e6fca046f8e65fdf2bf078bde8e10c0622005a56b47f12dd11"},"schema_version":"1.0"},"canonical_sha256":"7d3a15f703f3cedf19ddf9b207f9570b8bacbb701c6521e8c6260faea2e453af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:25.717598Z","signature_b64":"ymMg8zkZryIu7HqbrCYjHYkhoEYW8Qm3So6Dl3CazMXCcT8jPNWg6FA8+bZURwOc4it3KldF2IILF2Bu9h84BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d3a15f703f3cedf19ddf9b207f9570b8bacbb701c6521e8c6260faea2e453af","last_reissued_at":"2026-05-18T00:28:25.716895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:25.716895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06106","source_version":3,"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-05-18T00:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFhZIsZLVBlGlVdfdnVwxVflhvM7nKoaHyu4PhbzPT+K2xS6xCoX99NVOiM50OabpOzDvAQrmbPNnEkwKrltAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:32:39.212053Z"},"content_sha256":"da4041b7ac49f5fcdc4a367b05d3de6ff942471d2796b5dcbce1791b52aaf541","schema_version":"1.0","event_id":"sha256:da4041b7ac49f5fcdc4a367b05d3de6ff942471d2796b5dcbce1791b52aaf541"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PU5BL5YD6PHN6GO57GZAP6KXBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Attention-Based Deep Net for Learning to Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Baiyang Wang, Diego Klabjan","submitted_at":"2017-02-20T18:47:25Z","abstract_excerpt":"In information retrieval, learning to rank constructs a machine-based ranking model which given a query, sorts the search results by their degree of relevance or importance to the query. Neural networks have been successfully applied to this problem, and in this paper, we propose an attention-based deep neural network which better incorporates different embeddings of the queries and search results with an attention-based mechanism. This model also applies a decoder mechanism to learn the ranks of the search results in a listwise fashion. The embeddings are trained with convolutional neural net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06106","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELzqGT+PYgvcRPnlELdoDeAfMzgsvlTsFogbvfEXsMiSwV0V3le05OSSzNWdDvcno1T4odLY03pYUn0kY1oVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:32:39.212422Z"},"content_sha256":"3332962b2af9e24787ac626a1dbd04cf3bab915ca9ed2c096790577cd5b89d34","schema_version":"1.0","event_id":"sha256:3332962b2af9e24787ac626a1dbd04cf3bab915ca9ed2c096790577cd5b89d34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PU5BL5YD6PHN6GO57GZAP6KXBO/bundle.json","state_url":"https://pith.science/pith/PU5BL5YD6PHN6GO57GZAP6KXBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PU5BL5YD6PHN6GO57GZAP6KXBO/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-05-28T15:32:39Z","links":{"resolver":"https://pith.science/pith/PU5BL5YD6PHN6GO57GZAP6KXBO","bundle":"https://pith.science/pith/PU5BL5YD6PHN6GO57GZAP6KXBO/bundle.json","state":"https://pith.science/pith/PU5BL5YD6PHN6GO57GZAP6KXBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PU5BL5YD6PHN6GO57GZAP6KXBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PU5BL5YD6PHN6GO57GZAP6KXBO","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":"136b4da7249343e6fca046f8e65fdf2bf078bde8e10c0622005a56b47f12dd11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T18:47:25Z","title_canon_sha256":"b5d38abb7841236088d5e881a21671132044f464f0ad0631ff0ac2a3a8e3bb25"},"schema_version":"1.0","source":{"id":"1702.06106","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06106","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06106v3","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06106","created_at":"2026-05-18T00:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"PU5BL5YD6PHN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PU5BL5YD6PHN6GO5","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PU5BL5YD","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:3332962b2af9e24787ac626a1dbd04cf3bab915ca9ed2c096790577cd5b89d34","target":"graph","created_at":"2026-05-18T00:28:25Z","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"},"paper":{"abstract_excerpt":"In information retrieval, learning to rank constructs a machine-based ranking model which given a query, sorts the search results by their degree of relevance or importance to the query. Neural networks have been successfully applied to this problem, and in this paper, we propose an attention-based deep neural network which better incorporates different embeddings of the queries and search results with an attention-based mechanism. This model also applies a decoder mechanism to learn the ranks of the search results in a listwise fashion. The embeddings are trained with convolutional neural net","authors_text":"Baiyang Wang, Diego Klabjan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T18:47:25Z","title":"An Attention-Based Deep Net for Learning to Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06106","kind":"arxiv","version":3},"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:da4041b7ac49f5fcdc4a367b05d3de6ff942471d2796b5dcbce1791b52aaf541","target":"record","created_at":"2026-05-18T00:28:25Z","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":"136b4da7249343e6fca046f8e65fdf2bf078bde8e10c0622005a56b47f12dd11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-20T18:47:25Z","title_canon_sha256":"b5d38abb7841236088d5e881a21671132044f464f0ad0631ff0ac2a3a8e3bb25"},"schema_version":"1.0","source":{"id":"1702.06106","kind":"arxiv","version":3}},"canonical_sha256":"7d3a15f703f3cedf19ddf9b207f9570b8bacbb701c6521e8c6260faea2e453af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d3a15f703f3cedf19ddf9b207f9570b8bacbb701c6521e8c6260faea2e453af","first_computed_at":"2026-05-18T00:28:25.716895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:25.716895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ymMg8zkZryIu7HqbrCYjHYkhoEYW8Qm3So6Dl3CazMXCcT8jPNWg6FA8+bZURwOc4it3KldF2IILF2Bu9h84BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:25.717598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06106","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da4041b7ac49f5fcdc4a367b05d3de6ff942471d2796b5dcbce1791b52aaf541","sha256:3332962b2af9e24787ac626a1dbd04cf3bab915ca9ed2c096790577cd5b89d34"],"state_sha256":"fce528eeb0a1222d34499fa4fff4fc35904d3cf8c54cca868876707f3e83f092"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXiM2frgFfUhJrw6cQko241ZUT3YynNOUUxAMClgUoUfeLKBAX8JNuuCkgHfZ01VIGPrT0X5bVeR/QzJN4PcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:32:39.214696Z","bundle_sha256":"510a3e07474db14376282eb47ced311ea23fa9798a5dbe393ea5d527d29a85de"}}