{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:QI2PD4CZTIN4FQV52MWTKJNV7Y","short_pith_number":"pith:QI2PD4CZ","canonical_record":{"source":{"id":"2203.15805","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-03-28T21:34:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4ebfb8b0bf9c628d9e91026e83bcbc69f5ef7181ff3c63204c603ccf5515535f","abstract_canon_sha256":"8ba21b48c7ef445f3fe7727aa1236ba3ba475b2767d223c94448050faed1e0a5"},"schema_version":"1.0"},"canonical_sha256":"8234f1f0599a1bc2c2bdd32d3525b5fe1b66f1d43b56e75942d1d9d5d013fa99","source":{"kind":"arxiv","id":"2203.15805","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.15805","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"arxiv_version","alias_value":"2203.15805v1","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15805","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"pith_short_12","alias_value":"QI2PD4CZTIN4","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"pith_short_16","alias_value":"QI2PD4CZTIN4FQV5","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"pith_short_8","alias_value":"QI2PD4CZ","created_at":"2026-07-05T09:23:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:QI2PD4CZTIN4FQV52MWTKJNV7Y","target":"record","payload":{"canonical_record":{"source":{"id":"2203.15805","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-03-28T21:34:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4ebfb8b0bf9c628d9e91026e83bcbc69f5ef7181ff3c63204c603ccf5515535f","abstract_canon_sha256":"8ba21b48c7ef445f3fe7727aa1236ba3ba475b2767d223c94448050faed1e0a5"},"schema_version":"1.0"},"canonical_sha256":"8234f1f0599a1bc2c2bdd32d3525b5fe1b66f1d43b56e75942d1d9d5d013fa99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:41.969304Z","signature_b64":"2Jhi6GD3OWxRiFkRs+Jbhu9g+0lAkGEOmOsannm4waLNWSlwrNgSfmJTxAo4gowimznOHWQQGPXRzBZrk7JmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8234f1f0599a1bc2c2bdd32d3525b5fe1b66f1d43b56e75942d1d9d5d013fa99","last_reissued_at":"2026-07-05T09:23:41.968823Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:41.968823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.15805","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-07-05T09:23:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZ10ygAC9Fu+M5A6OWWO6IBvvUwFh4UC7dqBXls47fxLni5jKNHdKCk4X4IlkdRU8Aw4ZkWJHh2p/Dl1vj3nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:55:33.762331Z"},"content_sha256":"17715e8eebbd5f167e68237b43f588f83b1fd7439531476354bfa1584ad667da","schema_version":"1.0","event_id":"sha256:17715e8eebbd5f167e68237b43f588f83b1fd7439531476354bfa1584ad667da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:QI2PD4CZTIN4FQV52MWTKJNV7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Alexander Noe, Andrew V. Goldberg, Mauricio G.C. Resende, Nikos Parotsidis, Quico Spaen, Yuanyuan Dong","submitted_at":"2022-03-28T21:34:16Z","abstract_excerpt":"Motivated by a real-world vehicle routing application, we consider the maximum-weight independent set problem: Given a node-weighted graph, find a set of independent (mutually nonadjacent) nodes whose node-weight sum is maximum. Some of the graphs airsing in this application are large, having hundreds of thousands of nodes and hundreds of millions of edges. To solve instances of this size, we develop a new local search algorithm, which is a metaheuristic in the greedy randomized adaptive search (GRASP) framework. This algorithm, which we call METAMIS, uses a wider range of simple local search "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15805","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.15805/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:23:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2DbgPt96cROnGN9qETl4YiVFfCLtc/MPyh+GbES6tAi0T2ZESBjWmyLBwpt3VVsxnFX7pYI51YCUhX3Xg1WBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:55:33.763296Z"},"content_sha256":"278cbad1ec3ce70a6c13cb32fa635d4770060cd13c6d8bacbdf00aee0e86d54f","schema_version":"1.0","event_id":"sha256:278cbad1ec3ce70a6c13cb32fa635d4770060cd13c6d8bacbdf00aee0e86d54f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/bundle.json","state_url":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/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-08-14T08:55:33Z","links":{"resolver":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y","bundle":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/bundle.json","state":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:QI2PD4CZTIN4FQV52MWTKJNV7Y","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":"8ba21b48c7ef445f3fe7727aa1236ba3ba475b2767d223c94448050faed1e0a5","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-03-28T21:34:16Z","title_canon_sha256":"4ebfb8b0bf9c628d9e91026e83bcbc69f5ef7181ff3c63204c603ccf5515535f"},"schema_version":"1.0","source":{"id":"2203.15805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.15805","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"arxiv_version","alias_value":"2203.15805v1","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15805","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"pith_short_12","alias_value":"QI2PD4CZTIN4","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"pith_short_16","alias_value":"QI2PD4CZTIN4FQV5","created_at":"2026-07-05T09:23:41Z"},{"alias_kind":"pith_short_8","alias_value":"QI2PD4CZ","created_at":"2026-07-05T09:23:41Z"}],"graph_snapshots":[{"event_id":"sha256:278cbad1ec3ce70a6c13cb32fa635d4770060cd13c6d8bacbdf00aee0e86d54f","target":"graph","created_at":"2026-07-05T09:23:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.15805/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by a real-world vehicle routing application, we consider the maximum-weight independent set problem: Given a node-weighted graph, find a set of independent (mutually nonadjacent) nodes whose node-weight sum is maximum. Some of the graphs airsing in this application are large, having hundreds of thousands of nodes and hundreds of millions of edges. To solve instances of this size, we develop a new local search algorithm, which is a metaheuristic in the greedy randomized adaptive search (GRASP) framework. This algorithm, which we call METAMIS, uses a wider range of simple local search ","authors_text":"Alexander Noe, Andrew V. Goldberg, Mauricio G.C. Resende, Nikos Parotsidis, Quico Spaen, Yuanyuan Dong","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-03-28T21:34:16Z","title":"A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15805","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:17715e8eebbd5f167e68237b43f588f83b1fd7439531476354bfa1584ad667da","target":"record","created_at":"2026-07-05T09:23:41Z","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":"8ba21b48c7ef445f3fe7727aa1236ba3ba475b2767d223c94448050faed1e0a5","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-03-28T21:34:16Z","title_canon_sha256":"4ebfb8b0bf9c628d9e91026e83bcbc69f5ef7181ff3c63204c603ccf5515535f"},"schema_version":"1.0","source":{"id":"2203.15805","kind":"arxiv","version":1}},"canonical_sha256":"8234f1f0599a1bc2c2bdd32d3525b5fe1b66f1d43b56e75942d1d9d5d013fa99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8234f1f0599a1bc2c2bdd32d3525b5fe1b66f1d43b56e75942d1d9d5d013fa99","first_computed_at":"2026-07-05T09:23:41.968823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:23:41.968823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Jhi6GD3OWxRiFkRs+Jbhu9g+0lAkGEOmOsannm4waLNWSlwrNgSfmJTxAo4gowimznOHWQQGPXRzBZrk7JmBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:23:41.969304Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.15805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17715e8eebbd5f167e68237b43f588f83b1fd7439531476354bfa1584ad667da","sha256:278cbad1ec3ce70a6c13cb32fa635d4770060cd13c6d8bacbdf00aee0e86d54f"],"state_sha256":"4c71c401f11d8151f3de5c15065ddf8073a1a60bbc0bb130a876478c82332a51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qjc3IalPFRssZDN+0bmqiUbC6U43GZNem6vEvyXaFRY1CB8b1G853C+R+xLOnr50DkJpv5hGU4utzeLfQa0BDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:55:33.771690Z","bundle_sha256":"22d2678fe072652105669a8707965da693feee78da6b5ca90b99921fbc9834e6"}}