{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FIG4LHHR4Q5S65P6OU5UMZITJB","short_pith_number":"pith:FIG4LHHR","canonical_record":{"source":{"id":"1811.02599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T19:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"a019a5b42ef628c8a7fcfabfb1a57ccba59b3a112511032f5d081b4ded1e4558","abstract_canon_sha256":"576c7e790d2c21a896980fe4eba1f191ec7e05fde7b53d5cbb9b1bcbfd7a0199"},"schema_version":"1.0"},"canonical_sha256":"2a0dc59cf1e43b2f75fe753b466513484b16ed7131fa507fd9c5f8f877e1701b","source":{"kind":"arxiv","id":"1811.02599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02599","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02599v1","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02599","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"FIG4LHHR4Q5S","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FIG4LHHR4Q5S65P6","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FIG4LHHR","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FIG4LHHR4Q5S65P6OU5UMZITJB","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T19:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"a019a5b42ef628c8a7fcfabfb1a57ccba59b3a112511032f5d081b4ded1e4558","abstract_canon_sha256":"576c7e790d2c21a896980fe4eba1f191ec7e05fde7b53d5cbb9b1bcbfd7a0199"},"schema_version":"1.0"},"canonical_sha256":"2a0dc59cf1e43b2f75fe753b466513484b16ed7131fa507fd9c5f8f877e1701b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:21.278355Z","signature_b64":"16+9VuGJQ6pCet0MFcj95FLLdLV2a8lg3dtfHTYN/dkznhX4A9P73gTNJan37mH2xQixTA7SjEtSM/gDBb7IAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a0dc59cf1e43b2f75fe753b466513484b16ed7131fa507fd9c5f8f877e1701b","last_reissued_at":"2026-05-18T00:01:21.277726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:21.277726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02599","source_version":1,"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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0o77NG7GWIJoBJqD9vqScezrCqaBpypiu2qR+af6GM19fSKxUSqlT4Zu1GvNZ4StLYzvV+p6Ucf1jkdJj5LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:36:53.530407Z"},"content_sha256":"50782c4f3f95930e323c340b8583d95341242dcd50d7b074271b58d8b0323463","schema_version":"1.0","event_id":"sha256:50782c4f3f95930e323c340b8583d95341242dcd50d7b074271b58d8b0323463"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FIG4LHHR4Q5S65P6OU5UMZITJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Upper Edge Cover: Complexity and Approximability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Sikora, Jerome Monnot, Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei","submitted_at":"2018-11-06T19:13:00Z","abstract_excerpt":"Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such \"flipping\" of the objective function was done for many classical optimization problems. For example, Minimum Vertex Cover becomes Maximum Minimal Vertex Cover, Maximum Independent Set becomes Minimum Maximal Independent Set and so on. In this paper, we propose to study the weighted version of Maximum Minimal Edge Cover called Upper Edge Cover, a problem having ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02599","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"},"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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ajq+VyJzq3wMPRfW7iYdVDrmkkqG9soVP0Ccvhggp6wvc3fD4XTLoDSqBL0/JsRZPBgsJxQctvfI597jL4szAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:36:53.531050Z"},"content_sha256":"57f7f8988481deb7321983d1a4a224e690493df00fb81a0f340d5406a617a5d6","schema_version":"1.0","event_id":"sha256:57f7f8988481deb7321983d1a4a224e690493df00fb81a0f340d5406a617a5d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIG4LHHR4Q5S65P6OU5UMZITJB/bundle.json","state_url":"https://pith.science/pith/FIG4LHHR4Q5S65P6OU5UMZITJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIG4LHHR4Q5S65P6OU5UMZITJB/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-05-31T07:36:53Z","links":{"resolver":"https://pith.science/pith/FIG4LHHR4Q5S65P6OU5UMZITJB","bundle":"https://pith.science/pith/FIG4LHHR4Q5S65P6OU5UMZITJB/bundle.json","state":"https://pith.science/pith/FIG4LHHR4Q5S65P6OU5UMZITJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIG4LHHR4Q5S65P6OU5UMZITJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FIG4LHHR4Q5S65P6OU5UMZITJB","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":"576c7e790d2c21a896980fe4eba1f191ec7e05fde7b53d5cbb9b1bcbfd7a0199","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T19:13:00Z","title_canon_sha256":"a019a5b42ef628c8a7fcfabfb1a57ccba59b3a112511032f5d081b4ded1e4558"},"schema_version":"1.0","source":{"id":"1811.02599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02599","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02599v1","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02599","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"FIG4LHHR4Q5S","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FIG4LHHR4Q5S65P6","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FIG4LHHR","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:57f7f8988481deb7321983d1a4a224e690493df00fb81a0f340d5406a617a5d6","target":"graph","created_at":"2026-05-18T00:01:21Z","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":"Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such \"flipping\" of the objective function was done for many classical optimization problems. For example, Minimum Vertex Cover becomes Maximum Minimal Vertex Cover, Maximum Independent Set becomes Minimum Maximal Independent Set and so on. In this paper, we propose to study the weighted version of Maximum Minimal Edge Cover called Upper Edge Cover, a problem having ap","authors_text":"Florian Sikora, Jerome Monnot, Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T19:13:00Z","title":"Weighted Upper Edge Cover: Complexity and Approximability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02599","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:50782c4f3f95930e323c340b8583d95341242dcd50d7b074271b58d8b0323463","target":"record","created_at":"2026-05-18T00:01:21Z","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":"576c7e790d2c21a896980fe4eba1f191ec7e05fde7b53d5cbb9b1bcbfd7a0199","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T19:13:00Z","title_canon_sha256":"a019a5b42ef628c8a7fcfabfb1a57ccba59b3a112511032f5d081b4ded1e4558"},"schema_version":"1.0","source":{"id":"1811.02599","kind":"arxiv","version":1}},"canonical_sha256":"2a0dc59cf1e43b2f75fe753b466513484b16ed7131fa507fd9c5f8f877e1701b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a0dc59cf1e43b2f75fe753b466513484b16ed7131fa507fd9c5f8f877e1701b","first_computed_at":"2026-05-18T00:01:21.277726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:21.277726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"16+9VuGJQ6pCet0MFcj95FLLdLV2a8lg3dtfHTYN/dkznhX4A9P73gTNJan37mH2xQixTA7SjEtSM/gDBb7IAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:21.278355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50782c4f3f95930e323c340b8583d95341242dcd50d7b074271b58d8b0323463","sha256:57f7f8988481deb7321983d1a4a224e690493df00fb81a0f340d5406a617a5d6"],"state_sha256":"6c7ab78a795e22192baa4711ddd521dccdd956200cdc78a95d42a59bf451664d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4sGHS4lieGyZRV8EQPGMZrFUyM6GcUPBBNK7ynMW16Dkho8ecdW6O1MhxfUw2YFqBQ/vx6WVnkCNvdNu7h4UDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:36:53.535039Z","bundle_sha256":"68d79e869ecbd49f6a382728e57a29cd0ab87ebb58433aa8e1007577286eeb8a"}}