{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NJQ4IRK34VYHWSEAOW4FTOKNGW","short_pith_number":"pith:NJQ4IRK3","schema_version":"1.0","canonical_sha256":"6a61c4455be5707b488075b859b94d35a970cfb4fab1f5adb2554b38f3b938dc","source":{"kind":"arxiv","id":"1701.08744","version":1},"attestation_state":"computed","paper":{"title":"Click Through Rate Prediction for Contextual Advertisment Using Linear Regression","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Muhammad Junaid Effendi, Syed Abbas Ali","submitted_at":"2017-01-30T18:32:59Z","abstract_excerpt":"This research presents an innovative and unique way of solving the advertisement prediction problem which is considered as a learning problem over the past several years. Online advertising is a multi-billion-dollar industry and is growing every year with a rapid pace. The goal of this research is to enhance click through rate of the contextual advertisements using Linear Regression. In order to address this problem, a new technique propose in this paper to predict the CTR which will increase the overall revenue of the system by serving the advertisements more suitable to the viewers with the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.08744","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IR","submitted_at":"2017-01-30T18:32:59Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"293301136945acadfe8bc333054ad2f88a0810022fff2dd1c2a4697fee4b90b8","abstract_canon_sha256":"86eff12ac10f9ba66e807b9ece6f7b6fd5d28930cc6a12c599a6be0d676f22f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:43.678820Z","signature_b64":"QscoefkqmfyHNTEOqaBlWA9K9trs+eHg2p0bpQupZi1pF4l7k70JVY85DX+Jn5cH1+MAI0Fh56YNjfm/5e50DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a61c4455be5707b488075b859b94d35a970cfb4fab1f5adb2554b38f3b938dc","last_reissued_at":"2026-05-18T00:50:43.678170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:43.678170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Click Through Rate Prediction for Contextual Advertisment Using Linear Regression","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Muhammad Junaid Effendi, Syed Abbas Ali","submitted_at":"2017-01-30T18:32:59Z","abstract_excerpt":"This research presents an innovative and unique way of solving the advertisement prediction problem which is considered as a learning problem over the past several years. Online advertising is a multi-billion-dollar industry and is growing every year with a rapid pace. The goal of this research is to enhance click through rate of the contextual advertisements using Linear Regression. In order to address this problem, a new technique propose in this paper to predict the CTR which will increase the overall revenue of the system by serving the advertisements more suitable to the viewers with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08744","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.08744","created_at":"2026-05-18T00:50:43.678256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08744v1","created_at":"2026-05-18T00:50:43.678256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08744","created_at":"2026-05-18T00:50:43.678256+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJQ4IRK34VYH","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJQ4IRK34VYHWSEA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJQ4IRK3","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.01959","citing_title":"An Enhanced Ad Event-Prediction Method Based on Feature Engineering","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJQ4IRK34VYHWSEAOW4FTOKNGW","json":"https://pith.science/pith/NJQ4IRK34VYHWSEAOW4FTOKNGW.json","graph_json":"https://pith.science/api/pith-number/NJQ4IRK34VYHWSEAOW4FTOKNGW/graph.json","events_json":"https://pith.science/api/pith-number/NJQ4IRK34VYHWSEAOW4FTOKNGW/events.json","paper":"https://pith.science/paper/NJQ4IRK3"},"agent_actions":{"view_html":"https://pith.science/pith/NJQ4IRK34VYHWSEAOW4FTOKNGW","download_json":"https://pith.science/pith/NJQ4IRK34VYHWSEAOW4FTOKNGW.json","view_paper":"https://pith.science/paper/NJQ4IRK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08744&json=true","fetch_graph":"https://pith.science/api/pith-number/NJQ4IRK34VYHWSEAOW4FTOKNGW/graph.json","fetch_events":"https://pith.science/api/pith-number/NJQ4IRK34VYHWSEAOW4FTOKNGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJQ4IRK34VYHWSEAOW4FTOKNGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJQ4IRK34VYHWSEAOW4FTOKNGW/action/storage_attestation","attest_author":"https://pith.science/pith/NJQ4IRK34VYHWSEAOW4FTOKNGW/action/author_attestation","sign_citation":"https://pith.science/pith/NJQ4IRK34VYHWSEAOW4FTOKNGW/action/citation_signature","submit_replication":"https://pith.science/pith/NJQ4IRK34VYHWSEAOW4FTOKNGW/action/replication_record"}},"created_at":"2026-05-18T00:50:43.678256+00:00","updated_at":"2026-05-18T00:50:43.678256+00:00"}