{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:X74ZMPS6WIEN7QAQXQJ3NIAQVN","short_pith_number":"pith:X74ZMPS6","schema_version":"1.0","canonical_sha256":"bff9963e5eb208dfc010bc13b6a010ab639eb5e562242235225acfdffce4657b","source":{"kind":"arxiv","id":"1009.4153","version":4},"attestation_state":"computed","paper":{"title":"Maximizing Sequence-Submodular Functions and its Application to Online Advertising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ali Makhdoumi, Azarakhsh Malekian, Saeed Alaei","submitted_at":"2010-09-21T17:32:56Z","abstract_excerpt":"Motivated by applications in online advertising, we consider a class of maximization problems where the objective is a function of the sequence of actions as well as the running duration of each action. For these problems, we introduce the concepts of \\emph{sequence-submodularity} and \\emph{sequence-monotonicity} which extend the notions of submodularity and monotonicity from functions defined over sets to functions defined over sequences. We establish that if the objective function is sequence-submodular and sequence-non-decreasing, then there exists a greedy algorithm that achieves $1-1/e$ o"},"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":"1009.4153","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-21T17:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"fb2af1c8492c487ed273fb61d65ded4b70d30a3554af003b01bf7754937c9011","abstract_canon_sha256":"f1f18a92aec3cc4ca591ab9ca1dba390de9c48ab8a737d5446219d75e7eb8636"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:20.379221Z","signature_b64":"nafMp1XXqsV+G8JnbhROg7Jg7O8syLMVDMdtc9dwkxRWxOI+2K/dC0kYNyEhrGBnZsyVFVizjRakZ0cTteQYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff9963e5eb208dfc010bc13b6a010ab639eb5e562242235225acfdffce4657b","last_reissued_at":"2026-05-17T23:51:20.378720Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:20.378720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Sequence-Submodular Functions and its Application to Online Advertising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ali Makhdoumi, Azarakhsh Malekian, Saeed Alaei","submitted_at":"2010-09-21T17:32:56Z","abstract_excerpt":"Motivated by applications in online advertising, we consider a class of maximization problems where the objective is a function of the sequence of actions as well as the running duration of each action. For these problems, we introduce the concepts of \\emph{sequence-submodularity} and \\emph{sequence-monotonicity} which extend the notions of submodularity and monotonicity from functions defined over sets to functions defined over sequences. We establish that if the objective function is sequence-submodular and sequence-non-decreasing, then there exists a greedy algorithm that achieves $1-1/e$ o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4153","kind":"arxiv","version":4},"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":"1009.4153","created_at":"2026-05-17T23:51:20.378813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4153v4","created_at":"2026-05-17T23:51:20.378813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4153","created_at":"2026-05-17T23:51:20.378813+00:00"},{"alias_kind":"pith_short_12","alias_value":"X74ZMPS6WIEN","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"X74ZMPS6WIEN7QAQ","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"X74ZMPS6","created_at":"2026-05-18T12:26:17.028572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN","json":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN.json","graph_json":"https://pith.science/api/pith-number/X74ZMPS6WIEN7QAQXQJ3NIAQVN/graph.json","events_json":"https://pith.science/api/pith-number/X74ZMPS6WIEN7QAQXQJ3NIAQVN/events.json","paper":"https://pith.science/paper/X74ZMPS6"},"agent_actions":{"view_html":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN","download_json":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN.json","view_paper":"https://pith.science/paper/X74ZMPS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4153&json=true","fetch_graph":"https://pith.science/api/pith-number/X74ZMPS6WIEN7QAQXQJ3NIAQVN/graph.json","fetch_events":"https://pith.science/api/pith-number/X74ZMPS6WIEN7QAQXQJ3NIAQVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/action/storage_attestation","attest_author":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/action/author_attestation","sign_citation":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/action/citation_signature","submit_replication":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/action/replication_record"}},"created_at":"2026-05-17T23:51:20.378813+00:00","updated_at":"2026-05-17T23:51:20.378813+00:00"}