{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SCJUMDAIZVI35YEAG4GLJJ2BWJ","short_pith_number":"pith:SCJUMDAI","schema_version":"1.0","canonical_sha256":"9093460c08cd51bee080370cb4a741b2536494b4f8a0352377e46d93654cc9b5","source":{"kind":"arxiv","id":"1907.04400","version":1},"attestation_state":"computed","paper":{"title":"The Ad Types Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christopher A. Wilkens, Juli\\'an Mestre, Okke Schrijvers, Riccardo Colini-Baldeschi","submitted_at":"2019-07-09T20:34:46Z","abstract_excerpt":"The Ad Types Problem (without gap rules) is a special case of the assignment problem in which there are $k$ types of nodes on one side (the ads), and an ordered set of nodes on the other side (the slots). The edge weight of an ad $i$ of type $\\theta$ to slot $j$ is $v_i\\cdot \\alpha^{\\theta}_j$ where $v_i$ is an advertiser-specific value and each ad type $\\theta$ has a discount curve $\\alpha^{(\\theta)}_{1} \\ge \\alpha^{(\\theta)}_{2} \\ge ... \\ge 0$ over the slots that is common for ads of type $\\theta$. We present two contributions for this problem: 1) we give an algorithm that finds the maximum "},"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":"1907.04400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-07-09T20:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"6da6949243dcfc6d938ba7e7f198786e34e78d44b9a995df3f7d43cfdb113f9b","abstract_canon_sha256":"a87284efa27b6426d416d9dfbd6493712d3f6676164892e78c98d6cf9f5a99a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:01.857912Z","signature_b64":"erAJL855xk6ZK9NwHTWS2oJBJ9/IhfhlU9cZoeDbhFUTJMzIpLtSO2sEiC6Z5UrQVuc39ib1mExiyogg2OyIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9093460c08cd51bee080370cb4a741b2536494b4f8a0352377e46d93654cc9b5","last_reissued_at":"2026-05-17T23:41:01.857393Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:01.857393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Ad Types Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christopher A. Wilkens, Juli\\'an Mestre, Okke Schrijvers, Riccardo Colini-Baldeschi","submitted_at":"2019-07-09T20:34:46Z","abstract_excerpt":"The Ad Types Problem (without gap rules) is a special case of the assignment problem in which there are $k$ types of nodes on one side (the ads), and an ordered set of nodes on the other side (the slots). The edge weight of an ad $i$ of type $\\theta$ to slot $j$ is $v_i\\cdot \\alpha^{\\theta}_j$ where $v_i$ is an advertiser-specific value and each ad type $\\theta$ has a discount curve $\\alpha^{(\\theta)}_{1} \\ge \\alpha^{(\\theta)}_{2} \\ge ... \\ge 0$ over the slots that is common for ads of type $\\theta$. We present two contributions for this problem: 1) we give an algorithm that finds the maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04400","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":"1907.04400","created_at":"2026-05-17T23:41:01.857477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04400v1","created_at":"2026-05-17T23:41:01.857477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04400","created_at":"2026-05-17T23:41:01.857477+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCJUMDAIZVI3","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCJUMDAIZVI35YEA","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCJUMDAI","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07721","citing_title":"Envy, Regret, and Social Welfare Loss","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SCJUMDAIZVI35YEAG4GLJJ2BWJ","json":"https://pith.science/pith/SCJUMDAIZVI35YEAG4GLJJ2BWJ.json","graph_json":"https://pith.science/api/pith-number/SCJUMDAIZVI35YEAG4GLJJ2BWJ/graph.json","events_json":"https://pith.science/api/pith-number/SCJUMDAIZVI35YEAG4GLJJ2BWJ/events.json","paper":"https://pith.science/paper/SCJUMDAI"},"agent_actions":{"view_html":"https://pith.science/pith/SCJUMDAIZVI35YEAG4GLJJ2BWJ","download_json":"https://pith.science/pith/SCJUMDAIZVI35YEAG4GLJJ2BWJ.json","view_paper":"https://pith.science/paper/SCJUMDAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04400&json=true","fetch_graph":"https://pith.science/api/pith-number/SCJUMDAIZVI35YEAG4GLJJ2BWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SCJUMDAIZVI35YEAG4GLJJ2BWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCJUMDAIZVI35YEAG4GLJJ2BWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCJUMDAIZVI35YEAG4GLJJ2BWJ/action/storage_attestation","attest_author":"https://pith.science/pith/SCJUMDAIZVI35YEAG4GLJJ2BWJ/action/author_attestation","sign_citation":"https://pith.science/pith/SCJUMDAIZVI35YEAG4GLJJ2BWJ/action/citation_signature","submit_replication":"https://pith.science/pith/SCJUMDAIZVI35YEAG4GLJJ2BWJ/action/replication_record"}},"created_at":"2026-05-17T23:41:01.857477+00:00","updated_at":"2026-05-17T23:41:01.857477+00:00"}