{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F5FUBQSPHLFY7YM3BTL6UQIJHI","short_pith_number":"pith:F5FUBQSP","canonical_record":{"source":{"id":"1709.02850","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-08T20:11:50Z","cross_cats_sorted":["cs.CC","cs.GT"],"title_canon_sha256":"4b8af68ebca6e5fe0bc4a7cfba07e8a067d718a0f65a11854a056ca058b47ac1","abstract_canon_sha256":"b81c998f3efdca91d68345dc877dcd43505487a9a664cbd3d4ba87d8d7d5aa0a"},"schema_version":"1.0"},"canonical_sha256":"2f4b40c24f3acb8fe19b0cd7ea41093a16080e796d0864fec94449cda6a2a4bf","source":{"kind":"arxiv","id":"1709.02850","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02850","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02850v2","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02850","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"F5FUBQSPHLFY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F5FUBQSPHLFY7YM3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F5FUBQSP","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F5FUBQSPHLFY7YM3BTL6UQIJHI","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02850","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-08T20:11:50Z","cross_cats_sorted":["cs.CC","cs.GT"],"title_canon_sha256":"4b8af68ebca6e5fe0bc4a7cfba07e8a067d718a0f65a11854a056ca058b47ac1","abstract_canon_sha256":"b81c998f3efdca91d68345dc877dcd43505487a9a664cbd3d4ba87d8d7d5aa0a"},"schema_version":"1.0"},"canonical_sha256":"2f4b40c24f3acb8fe19b0cd7ea41093a16080e796d0864fec94449cda6a2a4bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:00.159161Z","signature_b64":"rB76M8hrf56i9boSEOs0SAj0saki+RMgp46kvCPi5Fk+IFlegxnbMfHby67HqkZljMeyb66YrlAimm3QZs8NAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f4b40c24f3acb8fe19b0cd7ea41093a16080e796d0864fec94449cda6a2a4bf","last_reissued_at":"2026-05-18T00:30:00.158616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:00.158616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02850","source_version":2,"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-18T00:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUq9LdkqF63lHJv30wRfYCFX8jh6mg0rYiysmPy50VeS2A4uJSD3kuHHbuuXY7/xPqR9vVF2jQa7xLClVay+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:37:29.228636Z"},"content_sha256":"0aee2f2cd01d433d4d924807be303738f5ebe42b05c59840330bf7122e5cf9f6","schema_version":"1.0","event_id":"sha256:0aee2f2cd01d433d4d924807be303738f5ebe42b05c59840330bf7122e5cf9f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F5FUBQSPHLFY7YM3BTL6UQIJHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.DS","authors_text":"Nimrod Talmon, Piotr Faliszewski, Piotr Skowron, Robert Bredereck, Rolf Niedermeier","submitted_at":"2017-09-08T20:11:50Z","abstract_excerpt":"A classic result of Lenstra [Math.~Oper.~Res.~1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameter being the number of variables. We extend this result by incorporating non-decreasing piecewise linear convex or concave functions to our (mixed) integer programs. This general technique allows us to establish parameterized complexity of a number of classic computational problems. In particular, we prove that Weighted Set Multicover is in FPT when parameterized by the number of elements to cover, and that there exists an FPT-time approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02850","kind":"arxiv","version":2},"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-18T00:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55IZ/d0LjKSVMtv4QKa8A0uC0b/imRL+7tv99WgQjGmQVBH83oJCC3stXi7RxjVgXJqV6YPNwhBtHae+P3K0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:37:29.228989Z"},"content_sha256":"47593651a5834a96103a226cac390a83ad9dd4886854b9e1cd496ca1f228cfbd","schema_version":"1.0","event_id":"sha256:47593651a5834a96103a226cac390a83ad9dd4886854b9e1cd496ca1f228cfbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5FUBQSPHLFY7YM3BTL6UQIJHI/bundle.json","state_url":"https://pith.science/pith/F5FUBQSPHLFY7YM3BTL6UQIJHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5FUBQSPHLFY7YM3BTL6UQIJHI/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-02T04:37:29Z","links":{"resolver":"https://pith.science/pith/F5FUBQSPHLFY7YM3BTL6UQIJHI","bundle":"https://pith.science/pith/F5FUBQSPHLFY7YM3BTL6UQIJHI/bundle.json","state":"https://pith.science/pith/F5FUBQSPHLFY7YM3BTL6UQIJHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5FUBQSPHLFY7YM3BTL6UQIJHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F5FUBQSPHLFY7YM3BTL6UQIJHI","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":"b81c998f3efdca91d68345dc877dcd43505487a9a664cbd3d4ba87d8d7d5aa0a","cross_cats_sorted":["cs.CC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-08T20:11:50Z","title_canon_sha256":"4b8af68ebca6e5fe0bc4a7cfba07e8a067d718a0f65a11854a056ca058b47ac1"},"schema_version":"1.0","source":{"id":"1709.02850","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02850","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02850v2","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02850","created_at":"2026-05-18T00:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"F5FUBQSPHLFY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F5FUBQSPHLFY7YM3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F5FUBQSP","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:47593651a5834a96103a226cac390a83ad9dd4886854b9e1cd496ca1f228cfbd","target":"graph","created_at":"2026-05-18T00:30:00Z","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":"A classic result of Lenstra [Math.~Oper.~Res.~1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameter being the number of variables. We extend this result by incorporating non-decreasing piecewise linear convex or concave functions to our (mixed) integer programs. This general technique allows us to establish parameterized complexity of a number of classic computational problems. In particular, we prove that Weighted Set Multicover is in FPT when parameterized by the number of elements to cover, and that there exists an FPT-time approxi","authors_text":"Nimrod Talmon, Piotr Faliszewski, Piotr Skowron, Robert Bredereck, Rolf Niedermeier","cross_cats":["cs.CC","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-08T20:11:50Z","title":"Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02850","kind":"arxiv","version":2},"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:0aee2f2cd01d433d4d924807be303738f5ebe42b05c59840330bf7122e5cf9f6","target":"record","created_at":"2026-05-18T00:30:00Z","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":"b81c998f3efdca91d68345dc877dcd43505487a9a664cbd3d4ba87d8d7d5aa0a","cross_cats_sorted":["cs.CC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-08T20:11:50Z","title_canon_sha256":"4b8af68ebca6e5fe0bc4a7cfba07e8a067d718a0f65a11854a056ca058b47ac1"},"schema_version":"1.0","source":{"id":"1709.02850","kind":"arxiv","version":2}},"canonical_sha256":"2f4b40c24f3acb8fe19b0cd7ea41093a16080e796d0864fec94449cda6a2a4bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f4b40c24f3acb8fe19b0cd7ea41093a16080e796d0864fec94449cda6a2a4bf","first_computed_at":"2026-05-18T00:30:00.158616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:00.158616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rB76M8hrf56i9boSEOs0SAj0saki+RMgp46kvCPi5Fk+IFlegxnbMfHby67HqkZljMeyb66YrlAimm3QZs8NAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:00.159161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02850","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0aee2f2cd01d433d4d924807be303738f5ebe42b05c59840330bf7122e5cf9f6","sha256:47593651a5834a96103a226cac390a83ad9dd4886854b9e1cd496ca1f228cfbd"],"state_sha256":"408fed3de9507f6299675b9595227077e4510128eae27037c7455bc0bc799808"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BAzk3rFnRJXjHg0NWhf6ZPt/WKQut5txOaMcXfIdNkFqLH99w4YCUOZkaSnnfetNrOrilA4BwS4e4+TW20R0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:37:29.230978Z","bundle_sha256":"397e4c4d61bfce99b1329d36453ddbac475b2ff35815d06cf5e4ac784baf533d"}}