{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RNK7L2E6UGAWR6O6X6YIEGE5WO","short_pith_number":"pith:RNK7L2E6","canonical_record":{"source":{"id":"1705.04970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-14T14:35:54Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"6c607828cb26dae41a623402fa9a307c6bec092414fcde3ae2a751d88ec539e1","abstract_canon_sha256":"5fa955ffcd1913ee294ca1807f223d33b31e07bbab0dba413fc8efedee163c4b"},"schema_version":"1.0"},"canonical_sha256":"8b55f5e89ea18168f9debfb082189db3983311281ddb606a4a0553ea8276832c","source":{"kind":"arxiv","id":"1705.04970","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04970","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04970v2","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04970","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"RNK7L2E6UGAW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RNK7L2E6UGAWR6O6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RNK7L2E6","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RNK7L2E6UGAWR6O6X6YIEGE5WO","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-14T14:35:54Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"6c607828cb26dae41a623402fa9a307c6bec092414fcde3ae2a751d88ec539e1","abstract_canon_sha256":"5fa955ffcd1913ee294ca1807f223d33b31e07bbab0dba413fc8efedee163c4b"},"schema_version":"1.0"},"canonical_sha256":"8b55f5e89ea18168f9debfb082189db3983311281ddb606a4a0553ea8276832c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:37.041277Z","signature_b64":"LeblJ+iQmglblXZLtU5eGs0PUu9sVaGdsldFA88PVynCXFOEFf3FBB+ZHXjw86IJ8hXUCI8Nm/Bu/RGqZX1/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b55f5e89ea18168f9debfb082189db3983311281ddb606a4a0553ea8276832c","last_reissued_at":"2026-05-18T00:26:37.040488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:37.040488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04970","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:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNA/m29eBZn5H/gEqAuvTkMuiXUS82RP+tRA1MT9tI/RzmTHB40D3lVWB1gvhkLeMR8MolgYPATdfrB5y1vbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:15:22.164345Z"},"content_sha256":"6c666b2f1f00f880d098ce63e686579831072f436adcb90cab3b430ff1eb012b","schema_version":"1.0","event_id":"sha256:6c666b2f1f00f880d098ce63e686579831072f436adcb90cab3b430ff1eb012b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RNK7L2E6UGAWR6O6X6YIEGE5WO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaxation heuristics for the set multicover problem with generalized upper bound constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.DS","authors_text":"Masanao Arakawa, Mutsunori Yagiura, Shunji Umetani","submitted_at":"2017-05-14T14:35:54Z","abstract_excerpt":"We consider an extension of the set covering problem (SCP) introducing (i)~multicover and (ii)~generalized upper bound (GUB)~constraints. For the conventional SCP, the pricing method has been introduced to reduce the size of instances, and several efficient heuristic algorithms based on such reduction techniques have been developed to solve large-scale instances. However, GUB constraints often make the pricing method less effective, because they often prevent solutions from containing highly evaluated variables together. To overcome this problem, we develop heuristic algorithms to reduce the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04970","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:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8eztYWCAeLxiCaMnNGaKdCLTt8rCbsHXGauud08khJbNQykI54Jek8xJrtzA+tJsifbGMzmxoeWHAEbUTQRKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:15:22.164695Z"},"content_sha256":"19cd09d5acd72324fa376330f5cdbc57e1f04e98866c0ebe9931df8b7bcd18ae","schema_version":"1.0","event_id":"sha256:19cd09d5acd72324fa376330f5cdbc57e1f04e98866c0ebe9931df8b7bcd18ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNK7L2E6UGAWR6O6X6YIEGE5WO/bundle.json","state_url":"https://pith.science/pith/RNK7L2E6UGAWR6O6X6YIEGE5WO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNK7L2E6UGAWR6O6X6YIEGE5WO/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-08T23:15:22Z","links":{"resolver":"https://pith.science/pith/RNK7L2E6UGAWR6O6X6YIEGE5WO","bundle":"https://pith.science/pith/RNK7L2E6UGAWR6O6X6YIEGE5WO/bundle.json","state":"https://pith.science/pith/RNK7L2E6UGAWR6O6X6YIEGE5WO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNK7L2E6UGAWR6O6X6YIEGE5WO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RNK7L2E6UGAWR6O6X6YIEGE5WO","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":"5fa955ffcd1913ee294ca1807f223d33b31e07bbab0dba413fc8efedee163c4b","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-14T14:35:54Z","title_canon_sha256":"6c607828cb26dae41a623402fa9a307c6bec092414fcde3ae2a751d88ec539e1"},"schema_version":"1.0","source":{"id":"1705.04970","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04970","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04970v2","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04970","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"RNK7L2E6UGAW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RNK7L2E6UGAWR6O6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RNK7L2E6","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:19cd09d5acd72324fa376330f5cdbc57e1f04e98866c0ebe9931df8b7bcd18ae","target":"graph","created_at":"2026-05-18T00:26:37Z","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":"We consider an extension of the set covering problem (SCP) introducing (i)~multicover and (ii)~generalized upper bound (GUB)~constraints. For the conventional SCP, the pricing method has been introduced to reduce the size of instances, and several efficient heuristic algorithms based on such reduction techniques have been developed to solve large-scale instances. However, GUB constraints often make the pricing method less effective, because they often prevent solutions from containing highly evaluated variables together. To overcome this problem, we develop heuristic algorithms to reduce the s","authors_text":"Masanao Arakawa, Mutsunori Yagiura, Shunji Umetani","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-14T14:35:54Z","title":"Relaxation heuristics for the set multicover problem with generalized upper bound constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04970","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:6c666b2f1f00f880d098ce63e686579831072f436adcb90cab3b430ff1eb012b","target":"record","created_at":"2026-05-18T00:26:37Z","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":"5fa955ffcd1913ee294ca1807f223d33b31e07bbab0dba413fc8efedee163c4b","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-14T14:35:54Z","title_canon_sha256":"6c607828cb26dae41a623402fa9a307c6bec092414fcde3ae2a751d88ec539e1"},"schema_version":"1.0","source":{"id":"1705.04970","kind":"arxiv","version":2}},"canonical_sha256":"8b55f5e89ea18168f9debfb082189db3983311281ddb606a4a0553ea8276832c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b55f5e89ea18168f9debfb082189db3983311281ddb606a4a0553ea8276832c","first_computed_at":"2026-05-18T00:26:37.040488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:37.040488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LeblJ+iQmglblXZLtU5eGs0PUu9sVaGdsldFA88PVynCXFOEFf3FBB+ZHXjw86IJ8hXUCI8Nm/Bu/RGqZX1/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:37.041277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04970","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c666b2f1f00f880d098ce63e686579831072f436adcb90cab3b430ff1eb012b","sha256:19cd09d5acd72324fa376330f5cdbc57e1f04e98866c0ebe9931df8b7bcd18ae"],"state_sha256":"0f59fda323dfea2424f1ab70ea4643c19d88ff709ec422d552964ced0d824d4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEl6qLVcsK5AhYXZpAM9ZMhKFCPirsmHhrcz6RFujyV7KCPTWJ8oXkJGg8BoSD3HzflcGZl0Ehv7TYImr+FRBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:15:22.166584Z","bundle_sha256":"0304df1a9707c964f4b2f959abcd9223280ea1d9ac799fc8f322bb577c7c1cf3"}}