{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SKZQZIOZAWWDU3NH5KDYF3UTXN","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":"8b6d79e94ddfd1c06d0bb4154ccca5b11c58d647bb31a424d81cf020837c374e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-10T13:28:23Z","title_canon_sha256":"9b4faed33cef553f3c1fd74767661a436773d27fa51c642e0d157850e49d2b98"},"schema_version":"1.0","source":{"id":"1905.04162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04162","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04162v1","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04162","created_at":"2026-05-17T23:46:34Z"},{"alias_kind":"pith_short_12","alias_value":"SKZQZIOZAWWD","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SKZQZIOZAWWDU3NH","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SKZQZIOZ","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:54f1f5f8996e652079c21bd719cdedee96a1b9210a9833d4472dce18fc2dcb88","target":"graph","created_at":"2026-05-17T23:46:34Z","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":"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","authors_text":"Alexandre Teiller, Bruno Escoffier, Evripidis Bampis, Kevin Schewior","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-10T13:28:23Z","title":"Online Multistage Subset Maximization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04162","kind":"arxiv","version":1},"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:39006fbb703b0c3007bdf826a164652e4edb1d319665912a94f87fe228633746","target":"record","created_at":"2026-05-17T23:46:34Z","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":"8b6d79e94ddfd1c06d0bb4154ccca5b11c58d647bb31a424d81cf020837c374e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-10T13:28:23Z","title_canon_sha256":"9b4faed33cef553f3c1fd74767661a436773d27fa51c642e0d157850e49d2b98"},"schema_version":"1.0","source":{"id":"1905.04162","kind":"arxiv","version":1}},"canonical_sha256":"92b30ca1d905ac3a6da7ea8782ee93bb654e2eb029d5c095f98bddadbe47596e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b30ca1d905ac3a6da7ea8782ee93bb654e2eb029d5c095f98bddadbe47596e","first_computed_at":"2026-05-17T23:46:34.334508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:34.334508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ax7aN3gFEDXkSfZyaJzOcp30l1i5tdkQRJ+TOPSTgn8JtZnBfxbnR2WSzBWXKJs3u/XRqNAlyk1lFl19nMImBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:34.335164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39006fbb703b0c3007bdf826a164652e4edb1d319665912a94f87fe228633746","sha256:54f1f5f8996e652079c21bd719cdedee96a1b9210a9833d4472dce18fc2dcb88"],"state_sha256":"e0b9bfafbeb7ecc06ee9fb2bec2f09cbc099eb08a72181864b7539a0b7c6b219"}