{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:X74ZMPS6WIEN7QAQXQJ3NIAQVN","short_pith_number":"pith:X74ZMPS6","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"},"canonical_sha256":"bff9963e5eb208dfc010bc13b6a010ab639eb5e562242235225acfdffce4657b","source":{"kind":"arxiv","id":"1009.4153","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4153","created_at":"2026-05-17T23:51:20Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4153v4","created_at":"2026-05-17T23:51:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4153","created_at":"2026-05-17T23:51:20Z"},{"alias_kind":"pith_short_12","alias_value":"X74ZMPS6WIEN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"X74ZMPS6WIEN7QAQ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"X74ZMPS6","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:X74ZMPS6WIEN7QAQXQJ3NIAQVN","target":"record","payload":{"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"},"canonical_sha256":"bff9963e5eb208dfc010bc13b6a010ab639eb5e562242235225acfdffce4657b","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"},"source_kind":"arxiv","source_id":"1009.4153","source_version":4,"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-17T23:51:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m0S6S762AlFRicL81JWL0UVYuj8XCwwidvXsQ5rt+2kwRfASeRjuhiOHwoVCs2Fe0duzIYTewkvozkfPAgrqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:53:29.131679Z"},"content_sha256":"089a0171b46409c3c1926227d39c9e741b03f6f6f6bdb322fbe49d70470eaad1","schema_version":"1.0","event_id":"sha256:089a0171b46409c3c1926227d39c9e741b03f6f6f6bdb322fbe49d70470eaad1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:X74ZMPS6WIEN7QAQXQJ3NIAQVN","target":"graph","payload":{"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"},"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-17T23:51:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYCV5I4G6cHTzSO6BluM7p4B+NkSCsf4IVjXaLpqRYtXgjalJD+WJmyUlA65V/YjsyJtJZ10L72F2lQnluFyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:53:29.132390Z"},"content_sha256":"be72ba4453ca1106336b9684de3bd1f35da84974118617f314a763474ccc71ae","schema_version":"1.0","event_id":"sha256:be72ba4453ca1106336b9684de3bd1f35da84974118617f314a763474ccc71ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/bundle.json","state_url":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/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-06-07T22:53:29Z","links":{"resolver":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN","bundle":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/bundle.json","state":"https://pith.science/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X74ZMPS6WIEN7QAQXQJ3NIAQVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:X74ZMPS6WIEN7QAQXQJ3NIAQVN","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":"f1f18a92aec3cc4ca591ab9ca1dba390de9c48ab8a737d5446219d75e7eb8636","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-21T17:32:56Z","title_canon_sha256":"fb2af1c8492c487ed273fb61d65ded4b70d30a3554af003b01bf7754937c9011"},"schema_version":"1.0","source":{"id":"1009.4153","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4153","created_at":"2026-05-17T23:51:20Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4153v4","created_at":"2026-05-17T23:51:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4153","created_at":"2026-05-17T23:51:20Z"},{"alias_kind":"pith_short_12","alias_value":"X74ZMPS6WIEN","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"X74ZMPS6WIEN7QAQ","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"X74ZMPS6","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:be72ba4453ca1106336b9684de3bd1f35da84974118617f314a763474ccc71ae","target":"graph","created_at":"2026-05-17T23:51:20Z","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":"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","authors_text":"Ali Makhdoumi, Azarakhsh Malekian, Saeed Alaei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-21T17:32:56Z","title":"Maximizing Sequence-Submodular Functions and its Application to Online Advertising"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4153","kind":"arxiv","version":4},"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:089a0171b46409c3c1926227d39c9e741b03f6f6f6bdb322fbe49d70470eaad1","target":"record","created_at":"2026-05-17T23:51:20Z","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":"f1f18a92aec3cc4ca591ab9ca1dba390de9c48ab8a737d5446219d75e7eb8636","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-21T17:32:56Z","title_canon_sha256":"fb2af1c8492c487ed273fb61d65ded4b70d30a3554af003b01bf7754937c9011"},"schema_version":"1.0","source":{"id":"1009.4153","kind":"arxiv","version":4}},"canonical_sha256":"bff9963e5eb208dfc010bc13b6a010ab639eb5e562242235225acfdffce4657b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bff9963e5eb208dfc010bc13b6a010ab639eb5e562242235225acfdffce4657b","first_computed_at":"2026-05-17T23:51:20.378720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:20.378720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nafMp1XXqsV+G8JnbhROg7Jg7O8syLMVDMdtc9dwkxRWxOI+2K/dC0kYNyEhrGBnZsyVFVizjRakZ0cTteQYBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:20.379221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4153","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:089a0171b46409c3c1926227d39c9e741b03f6f6f6bdb322fbe49d70470eaad1","sha256:be72ba4453ca1106336b9684de3bd1f35da84974118617f314a763474ccc71ae"],"state_sha256":"dc6e98bf0717729fbaa4c731753ef436d14746b77153488d1914bca5bf92ccbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEapdwLitqQrski5/rM+xu2OBrsPcTvi8UzkU6progYtt2GkMXnjLCrBofVCjz6QX4VoDmZepOH02KJtdmuWDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:53:29.135783Z","bundle_sha256":"d36dbfb37fdc9cb8be4ba8e2ed962d68e0a91659d86e5aae220b221ea57cc04c"}}