{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EY7EKCJFT7W3IBUBTFAIQHCPRK","short_pith_number":"pith:EY7EKCJF","canonical_record":{"source":{"id":"1701.01417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-05T18:36:26Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"994caa2df1eaa1093733d58707557ca650a8e626c7ae56b001b7a05d268cfe55","abstract_canon_sha256":"1ec54ccf4dd03d6ee50fc4890e0a9a4d2fd44b485a74078c49734332dbcc9de2"},"schema_version":"1.0"},"canonical_sha256":"263e4509259fedb406819940881c4f8a972a345f9f383a2eca5366cb88f5b352","source":{"kind":"arxiv","id":"1701.01417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01417","created_at":"2026-05-18T00:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01417v1","created_at":"2026-05-18T00:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01417","created_at":"2026-05-18T00:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"EY7EKCJFT7W3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EY7EKCJFT7W3IBUB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EY7EKCJF","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EY7EKCJFT7W3IBUBTFAIQHCPRK","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-05T18:36:26Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"994caa2df1eaa1093733d58707557ca650a8e626c7ae56b001b7a05d268cfe55","abstract_canon_sha256":"1ec54ccf4dd03d6ee50fc4890e0a9a4d2fd44b485a74078c49734332dbcc9de2"},"schema_version":"1.0"},"canonical_sha256":"263e4509259fedb406819940881c4f8a972a345f9f383a2eca5366cb88f5b352","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:19.724922Z","signature_b64":"/I/t9dtvGED32BYqcveEZ6Cm4hj0SE+xDMY6TJpGCewNsaW3L4BD+m73PVKZvuFZX8laxh4axNozhTI9r7tmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"263e4509259fedb406819940881c4f8a972a345f9f383a2eca5366cb88f5b352","last_reissued_at":"2026-05-18T00:53:19.724493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:19.724493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01417","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-05-18T00:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03sHjBLVoDQCYMJrcZHG2alEXckXbQXj3eNd5JRpD6Cik2FDSgkmNYuQDHglN9QbVGSEYMwtNQB/LjzgL7UsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T03:11:12.297719Z"},"content_sha256":"5a16948819d876fd48f21f129690a69b48ac6f04d367db48bebfa8d4a6ff8a35","schema_version":"1.0","event_id":"sha256:5a16948819d876fd48f21f129690a69b48ac6f04d367db48bebfa8d4a6ff8a35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EY7EKCJFT7W3IBUBTFAIQHCPRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploration of Proximity Heuristics in Length Normalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Pranav Agrawal","submitted_at":"2017-01-05T18:36:26Z","abstract_excerpt":"Ranking functions used in information retrieval are primarily used in the search engines and they are often adopted for various language processing applications. However, features used in the construction of ranking functions should be analyzed before applying it on a data set. This paper gives guidelines on construction of generalized ranking functions with application-dependent features. The paper prescribes a specific case of a generalized function for recommendation system using feature engineering guidelines on the given data set. The behavior of both generalized and specific functions ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01417","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":""},"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:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ub3TFQQcMzWCBvKi0lfJaX097V782VtNb4aHktHubGjcV4SnVGB4fbL0YtW5yz+9Un8Y/Hfy7Uq0tQecOyVPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T03:11:12.298067Z"},"content_sha256":"a66364aac38636f7bcf84fec5f354aa7a5fb9dc761f803f94002fc4da31850ed","schema_version":"1.0","event_id":"sha256:a66364aac38636f7bcf84fec5f354aa7a5fb9dc761f803f94002fc4da31850ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EY7EKCJFT7W3IBUBTFAIQHCPRK/bundle.json","state_url":"https://pith.science/pith/EY7EKCJFT7W3IBUBTFAIQHCPRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EY7EKCJFT7W3IBUBTFAIQHCPRK/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-03T03:11:12Z","links":{"resolver":"https://pith.science/pith/EY7EKCJFT7W3IBUBTFAIQHCPRK","bundle":"https://pith.science/pith/EY7EKCJFT7W3IBUBTFAIQHCPRK/bundle.json","state":"https://pith.science/pith/EY7EKCJFT7W3IBUBTFAIQHCPRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EY7EKCJFT7W3IBUBTFAIQHCPRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EY7EKCJFT7W3IBUBTFAIQHCPRK","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":"1ec54ccf4dd03d6ee50fc4890e0a9a4d2fd44b485a74078c49734332dbcc9de2","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-05T18:36:26Z","title_canon_sha256":"994caa2df1eaa1093733d58707557ca650a8e626c7ae56b001b7a05d268cfe55"},"schema_version":"1.0","source":{"id":"1701.01417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01417","created_at":"2026-05-18T00:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01417v1","created_at":"2026-05-18T00:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01417","created_at":"2026-05-18T00:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"EY7EKCJFT7W3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EY7EKCJFT7W3IBUB","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EY7EKCJF","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:a66364aac38636f7bcf84fec5f354aa7a5fb9dc761f803f94002fc4da31850ed","target":"graph","created_at":"2026-05-18T00:53:19Z","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":"Ranking functions used in information retrieval are primarily used in the search engines and they are often adopted for various language processing applications. However, features used in the construction of ranking functions should be analyzed before applying it on a data set. This paper gives guidelines on construction of generalized ranking functions with application-dependent features. The paper prescribes a specific case of a generalized function for recommendation system using feature engineering guidelines on the given data set. The behavior of both generalized and specific functions ar","authors_text":"Pranav Agrawal","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-05T18:36:26Z","title":"Exploration of Proximity Heuristics in Length Normalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01417","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:5a16948819d876fd48f21f129690a69b48ac6f04d367db48bebfa8d4a6ff8a35","target":"record","created_at":"2026-05-18T00:53:19Z","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":"1ec54ccf4dd03d6ee50fc4890e0a9a4d2fd44b485a74078c49734332dbcc9de2","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-05T18:36:26Z","title_canon_sha256":"994caa2df1eaa1093733d58707557ca650a8e626c7ae56b001b7a05d268cfe55"},"schema_version":"1.0","source":{"id":"1701.01417","kind":"arxiv","version":1}},"canonical_sha256":"263e4509259fedb406819940881c4f8a972a345f9f383a2eca5366cb88f5b352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"263e4509259fedb406819940881c4f8a972a345f9f383a2eca5366cb88f5b352","first_computed_at":"2026-05-18T00:53:19.724493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:19.724493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/I/t9dtvGED32BYqcveEZ6Cm4hj0SE+xDMY6TJpGCewNsaW3L4BD+m73PVKZvuFZX8laxh4axNozhTI9r7tmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:19.724922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a16948819d876fd48f21f129690a69b48ac6f04d367db48bebfa8d4a6ff8a35","sha256:a66364aac38636f7bcf84fec5f354aa7a5fb9dc761f803f94002fc4da31850ed"],"state_sha256":"625db4f213ee3de455245bf7da19cdb8e77938f228f3fc6faa757b78aefa9dc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhSyKys4e5UPLVNjCH7O4+bqe+BKhquCRf+ITvQkRfMZv9w9Vvqj0BiVaBbVVIMRRksMLhvZcCvUzgPNli2BBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T03:11:12.300062Z","bundle_sha256":"6e040c32c8c76a1d2185f30c189db5e048f0c37ae2527a96e353ac9de7448643"}}