{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SKZQZIOZAWWDU3NH5KDYF3UTXN","short_pith_number":"pith:SKZQZIOZ","schema_version":"1.0","canonical_sha256":"92b30ca1d905ac3a6da7ea8782ee93bb654e2eb029d5c095f98bddadbe47596e","source":{"kind":"arxiv","id":"1905.04162","version":1},"attestation_state":"computed","paper":{"title":"Online Multistage Subset Maximization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Alexandre Teiller, Bruno Escoffier, Evripidis Bampis, Kevin Schewior","submitted_at":"2019-05-10T13:28:23Z","abstract_excerpt":"Numerous combinatorial optimization problems (knapsack, maximum-weight matching, etc.) can be expressed as \\emph{subset maximization problems}: One is given a ground set $N=\\{1,\\dots,n\\}$, a collection $\\mathcal{F}\\subseteq 2^N$ of subsets thereof such that $\\emptyset\\in\\mathcal{F}$, and an objective (profit) function $p:\\mathcal{F}\\rightarrow\\mathbb{R}_+$. The task is to choose a set $S\\in\\mathcal{F}$ that maximizes $p(S)$. We consider the \\emph{multistage} version (Eisenstat et al., Gupta et al., both ICALP 2014) of such problems: The profit function $p_t$ (and possibly the set of feasible s"},"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":"1905.04162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-10T13:28:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9b4faed33cef553f3c1fd74767661a436773d27fa51c642e0d157850e49d2b98","abstract_canon_sha256":"8b6d79e94ddfd1c06d0bb4154ccca5b11c58d647bb31a424d81cf020837c374e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:34.335164Z","signature_b64":"ax7aN3gFEDXkSfZyaJzOcp30l1i5tdkQRJ+TOPSTgn8JtZnBfxbnR2WSzBWXKJs3u/XRqNAlyk1lFl19nMImBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b30ca1d905ac3a6da7ea8782ee93bb654e2eb029d5c095f98bddadbe47596e","last_reissued_at":"2026-05-17T23:46:34.334508Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:34.334508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Multistage Subset Maximization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Alexandre Teiller, Bruno Escoffier, Evripidis Bampis, Kevin Schewior","submitted_at":"2019-05-10T13:28:23Z","abstract_excerpt":"Numerous combinatorial optimization problems (knapsack, maximum-weight matching, etc.) can be expressed as \\emph{subset maximization problems}: One is given a ground set $N=\\{1,\\dots,n\\}$, a collection $\\mathcal{F}\\subseteq 2^N$ of subsets thereof such that $\\emptyset\\in\\mathcal{F}$, and an objective (profit) function $p:\\mathcal{F}\\rightarrow\\mathbb{R}_+$. The task is to choose a set $S\\in\\mathcal{F}$ that maximizes $p(S)$. We consider the \\emph{multistage} version (Eisenstat et al., Gupta et al., both ICALP 2014) of such problems: The profit function $p_t$ (and possibly the set of feasible s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04162","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":"1905.04162","created_at":"2026-05-17T23:46:34.334592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04162v1","created_at":"2026-05-17T23:46:34.334592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04162","created_at":"2026-05-17T23:46:34.334592+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKZQZIOZAWWD","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKZQZIOZAWWDU3NH","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKZQZIOZ","created_at":"2026-05-18T12:33:27.125529+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/SKZQZIOZAWWDU3NH5KDYF3UTXN","json":"https://pith.science/pith/SKZQZIOZAWWDU3NH5KDYF3UTXN.json","graph_json":"https://pith.science/api/pith-number/SKZQZIOZAWWDU3NH5KDYF3UTXN/graph.json","events_json":"https://pith.science/api/pith-number/SKZQZIOZAWWDU3NH5KDYF3UTXN/events.json","paper":"https://pith.science/paper/SKZQZIOZ"},"agent_actions":{"view_html":"https://pith.science/pith/SKZQZIOZAWWDU3NH5KDYF3UTXN","download_json":"https://pith.science/pith/SKZQZIOZAWWDU3NH5KDYF3UTXN.json","view_paper":"https://pith.science/paper/SKZQZIOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04162&json=true","fetch_graph":"https://pith.science/api/pith-number/SKZQZIOZAWWDU3NH5KDYF3UTXN/graph.json","fetch_events":"https://pith.science/api/pith-number/SKZQZIOZAWWDU3NH5KDYF3UTXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKZQZIOZAWWDU3NH5KDYF3UTXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKZQZIOZAWWDU3NH5KDYF3UTXN/action/storage_attestation","attest_author":"https://pith.science/pith/SKZQZIOZAWWDU3NH5KDYF3UTXN/action/author_attestation","sign_citation":"https://pith.science/pith/SKZQZIOZAWWDU3NH5KDYF3UTXN/action/citation_signature","submit_replication":"https://pith.science/pith/SKZQZIOZAWWDU3NH5KDYF3UTXN/action/replication_record"}},"created_at":"2026-05-17T23:46:34.334592+00:00","updated_at":"2026-05-17T23:46:34.334592+00:00"}