{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QI2PD4CZTIN4FQV52MWTKJNV7Y","short_pith_number":"pith:QI2PD4CZ","schema_version":"1.0","canonical_sha256":"8234f1f0599a1bc2c2bdd32d3525b5fe1b66f1d43b56e75942d1d9d5d013fa99","source":{"kind":"arxiv","id":"2203.15805","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2203.15805","created_at":"2026-07-05T09:23:41.968884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.15805v1","created_at":"2026-07-05T09:23:41.968884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15805","created_at":"2026-07-05T09:23:41.968884+00:00"},{"alias_kind":"pith_short_12","alias_value":"QI2PD4CZTIN4","created_at":"2026-07-05T09:23:41.968884+00:00"},{"alias_kind":"pith_short_16","alias_value":"QI2PD4CZTIN4FQV5","created_at":"2026-07-05T09:23:41.968884+00:00"},{"alias_kind":"pith_short_8","alias_value":"QI2PD4CZ","created_at":"2026-07-05T09:23:41.968884+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01037","citing_title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y","json":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y.json","graph_json":"https://pith.science/api/pith-number/QI2PD4CZTIN4FQV52MWTKJNV7Y/graph.json","events_json":"https://pith.science/api/pith-number/QI2PD4CZTIN4FQV52MWTKJNV7Y/events.json","paper":"https://pith.science/paper/QI2PD4CZ"},"agent_actions":{"view_html":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y","download_json":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y.json","view_paper":"https://pith.science/paper/QI2PD4CZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.15805&json=true","fetch_graph":"https://pith.science/api/pith-number/QI2PD4CZTIN4FQV52MWTKJNV7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/QI2PD4CZTIN4FQV52MWTKJNV7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/action/storage_attestation","attest_author":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/action/author_attestation","sign_citation":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/action/citation_signature","submit_replication":"https://pith.science/pith/QI2PD4CZTIN4FQV52MWTKJNV7Y/action/replication_record"}},"created_at":"2026-07-05T09:23:41.968884+00:00","updated_at":"2026-07-05T09:23:41.968884+00:00"}